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
Computer Security–ESORICS 2013: 18th European Symposium on Research in …, 2013
532 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
363 2016 Actively secure OT extension with optimal overhead M Keller, E Orsini, P Scholl
Advances in Cryptology--CRYPTO 2015: 35th Annual Cryptology Conference …, 2015
176 2015 SPD: efficient MPC mod for dishonest majority R Cramer, I Damgård, D Escudero, P Scholl, C Xing
Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018
155 2018 Efficient, oblivious data structures for MPC M Keller, P Scholl
Advances in Cryptology–ASIACRYPT 2014: 20th International Conference on the …, 2014
138 2014 Efficient pseudorandom correlation generators: Silent OT extension and more E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl, P Scholl
Advances in Cryptology–CRYPTO 2019: 39th Annual International Cryptology …, 2019
135 2019 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
117 2019 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
107 2019 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
100 2013 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
91 2020 Improved primitives for MPC over mixed arithmetic-binary circuits D Escudero, S Ghosh, M Keller, R Rachuri, P Scholl
Advances in Cryptology–CRYPTO 2020: 40th Annual International Cryptology …, 2020
90 2020 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
90 2016 Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection M Orrù, E Orsini, P Scholl
Topics in Cryptology–CT-RSA 2017: The Cryptographers’ Track at the RSA …, 2017
84 2017 A unified approach to MPC with preprocessing using OT TK Frederiksen, M Keller, E Orsini, P Scholl
Advances in Cryptology--ASIACRYPT 2015: 21st International Conference on the …, 2015
59 2015 C Baum, AJ Malozemoff, MB Rosen, P Scholl
Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology …, 2021
57 2021 Efficient pseudorandom correlation generators from ring-LPN E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl, P Scholl
Advances in Cryptology–CRYPTO 2020: 40th Annual International Cryptology …, 2020
53 2020 Improved key generation for Gentry’s fully homomorphic encryption scheme P Scholl, NP Smart
Cryptography and Coding: 13th IMA International Conference, IMACC 2011 …, 2011
51 2011 Homomorphic secret sharing from lattices without FHE E Boyle, L Kohl, P Scholl
Advances in Cryptology–EUROCRYPT 2019: 38th Annual International Conference …, 2019
50 2019 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
46 * 2015 SCALE-MAMBA v1. 14: Documentation A Aly, K Cong, D Cozzo, M Keller, E Orsini, D Rotaru, O Scherer, P Scholl, ...
Accessed: May, 2021
38 * 2021 
Emmanuela OrsiniBocconi UniversityBestätigte E-Mail-Adresse bei kuleuven.be
