| 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 | 505 | 2016 |
| Actively secure OT extension with optimal overhead M Keller, E Orsini, P Scholl Annual Cryptology Conference, 724-741, 2015 | 211 | 2015 |
| 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 | 118 | 2017 |
| NewHope algorithm specifications and supporting documentation E Alkim, R Avanzi, J Bos, L Ducas, A de la Piedra, T Pöppelmann, ... NIST PQC Round 2 (4), 11, 2019 | 79 | 2019 |
| SCALE and MAMBA documentation (2018) A Aly, M Keller, E Orsini, D Rotaru, P Scholl, NP Smart, T Wood | 73* | 2018 |
| Dishonest majority multi-party computation for binary circuits E Larraia, E Orsini, NP Smart Advances in Cryptology–CRYPTO 2014: 34th Annual Cryptology Conference, Santa …, 2014 | 73 | 2014 |
| 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 | 72 | 2015 |
| Correcting errors and erasures via the syndrome variety E Orsini, M Sala Journal of pure and applied algebra 200 (1-2), 191-226, 2005 | 65 | 2005 |
| Limbo: efficient zero-knowledge MPCitH-based arguments C Delpech de Saint Guilhem, E Orsini, T Tanguy Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications …, 2021 | 64 | 2021 |
| Banquet: short and fast signatures from AES C Baum, CD de Saint Guilhem, D Kales, E Orsini, P Scholl, G Zaverucha IACR International Conference on Public-Key Cryptography, 266-297, 2021 | 59 | 2021 |
| BBQ: using AES in picnic signatures CD de Saint Guilhem, L De Meyer, E Orsini, NP Smart International Conference on Selected Areas in Cryptography, 669-692, 2019 | 56 | 2019 |
| Zaphod: Efficiently combining LSSS and garbled circuits in SCALE A Aly, E Orsini, D Rotaru, NP Smart, T Wood Proceedings of the 7th ACM Workshop on Encrypted Computing & Applied …, 2019 | 55 | 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 | 55* | 2015 |
| Overdrive2k: efficient secure MPC over from somewhat homomorphic encryption E Orsini, NP Smart, F Vercauteren Cryptographers’ Track at the RSA Conference, 254-283, 2020 | 52 | 2020 |
| Faster secure multi-party computation of AES and DES using lookup tables M Keller, E Orsini, D Rotaru, P Scholl, E Soria-Vazquez, S Vivek International Conference on Applied Cryptography and Network Security, 229-249, 2017 | 52 | 2017 |
| NewHope T Poppelmann, E Alkim, R Avanzi, J Bos, L Ducas, A de la Piedra, ... NIST, Tech. Rep, 2017 | 51 | 2017 |
| Between a Rock and a Hard Place: Interpolating between MPC and FHE A Choudhury, J Loftus, E Orsini, A Patra, NP Smart International conference on the theory and application of cryptology and …, 2013 | 48 | 2013 |
| TinyKeys: A new approach to efficient multi-party computation C Hazay, E Orsini, P Scholl, E Soria-Vazquez Journal of Cryptology 35 (2), 13, 2022 | 47 | 2022 |
| Efficient secure multiparty computation with identifiable abort C Baum, E Orsini, P Scholl Theory of Cryptography: 14th International Conference, TCC 2016-B, Beijing …, 2016 | 43 | 2016 |
| Efficient constant-round MPC with identifiable abort and public verifiability C Baum, E Orsini, P Scholl, E Soria-Vazquez Annual International Cryptology Conference, 562-592, 2020 | 42 | 2020 |
Peter SchollAarhus UniversityVerified email at cs.au.dk
