| Practical covertly secure MPC for dishonest majority–or: breaking the SPDZ limits I Damgård, M Keller, E Larraia, V Pastro, P Scholl, NP Smart European Symposium on Research in Computer Security, 1-18, 2013 | 454 | 2013 |
| MASCOT: faster malicious arithmetic secure computation with oblivious transfer M Keller, E Orsini, P Scholl Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications …, 2016 | 291 | 2016 |
| Actively secure OT extension with optimal overhead M Keller, E Orsini, P Scholl Annual Cryptology Conference, 724-741, 2015 | 151 | 2015 |
| Efficient, oblivious data structures for MPC M Keller, P Scholl International Conference on the Theory and Application of Cryptology and …, 2014 | 124 | 2014 |
| SPD: Efficient MPC mod for Dishonest Majority R Cramer, I Damgård, D Escudero, P Scholl, C Xing Annual International Cryptology Conference, 769-798, 2018 | 111 | 2018 |
| An architecture for practical actively secure MPC with dishonest majority M Keller, P Scholl, NP Smart Proceedings of the 2013 ACM SIGSAC conference on Computer & communications …, 2013 | 95 | 2013 |
| Efficient pseudorandom correlation generators: Silent OT extension and more E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl, P Scholl Annual International Cryptology Conference, 489-518, 2019 | 86 | 2019 |
| Low cost constant round MPC combining BMR and oblivious transfer C Hazay, P Scholl, E Soria-Vazquez Journal of Cryptology 33 (4), 1732-1786, 2020 | 78 | 2020 |
| Efficient two-round OT extension and silent non-interactive secure computation E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl, P Rindal, P Scholl Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications …, 2019 | 77 | 2019 |
| MPC-friendly symmetric key primitives L Grassi, C Rechberger, D Rotaru, P Scholl, NP Smart Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications …, 2016 | 76 | 2016 |
| New primitives for actively-secure MPC over rings with applications to private machine learning I Damgård, D Escudero, T Frederiksen, M Keller, P Scholl, N Volgushev 2019 IEEE Symposium on Security and Privacy (SP), 1102-1120, 2019 | 74 | 2019 |
| Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection M Orrù, E Orsini, P Scholl Cryptographers’ Track at the RSA Conference, 381-396, 2017 | 67 | 2017 |
| Improved primitives for MPC over mixed arithmetic-binary circuits D Escudero, S Ghosh, M Keller, R Rachuri, P Scholl Annual International Cryptology Conference, 823-852, 2020 | 46 | 2020 |
| A unified approach to MPC with preprocessing using OT TK Frederiksen, M Keller, E Orsini, P Scholl International Conference on the Theory and Application of Cryptology and …, 2015 | 46 | 2015 |
| Improved key generation for Gentry’s fully homomorphic encryption scheme P Scholl, NP Smart IMA International Conference on Cryptography and Coding, 10-22, 2011 | 46 | 2011 |
| High performance multi-party computation for binary circuits based on oblivious transfer SS Burra, E Larraia, JB Nielsen, PS Nordholt, C Orlandi, E Orsini, P Scholl, ... Cryptology ePrint Archive, 2015 | 39 | 2015 |
| Homomorphic secret sharing from lattices without FHE E Boyle, L Kohl, P Scholl Annual International Conference on the Theory and Applications of …, 2019 | 38 | 2019 |
| Scale–mamba v1. 12: Documentation A Aly, K Cong, D Cozzo, M Keller, E Orsini, D Rotaru, O Scherer, P Scholl, ... Accessed: May, 2021 | 29* | 2021 |
| : Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions C Baum, AJ Malozemoff, MB Rosen, P Scholl Annual International Cryptology Conference, 92-122, 2021 | 28 | 2021 |
| Efficient pseudorandom correlation generators from ring-LPN E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl, P Scholl Annual International Cryptology Conference, 387-416, 2020 | 26 | 2020 |
Emmanuela OrsiniKU LeuvenVerified email at kuleuven.be
