| 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 | 374 | 2016 |
| Actively secure OT extension with optimal overhead M Keller, E Orsini, P Scholl Advances in Cryptology--CRYPTO 2015: 35th Annual Cryptology Conference …, 2015 | 180 | 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 | 87 | 2017 |
| Correcting errors and erasures via the syndrome variety E Orsini, M Sala Journal of Pure and Applied Algebra 200 (1-2), 191-226, 2005 | 64 | 2005 |
| 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 | 63 | 2014 |
| 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 | 57 | 2015 |
| SCALE and MAMBA documentation (2018) A Aly, M Keller, E Orsini, D Rotaru, P Scholl, NP Smart, T Wood | 55* | 2018 |
| 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 | 47* | 2015 |
| 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 | 45 | 2019 |
| NewHope T Poppelmann, E Alkim, R Avanzi, J Bos, L Ducas, A de la Piedra, ... NIST, Tech. Rep, 2017 | 44 | 2017 |
| Between a Rock and a Hard Place: Interpolating between MPC and FHE A Choudhury, J Loftus, E Orsini, A Patra, NP Smart Advances in Cryptology-ASIACRYPT 2013: 19th International Conference on the …, 2013 | 42 | 2013 |
| General Error Locator Polynomials for Binary Cyclic Codes With and E Orsini, M Sala IEEE transactions on information theory 53 (3), 1095-1107, 2007 | 42 | 2007 |
| Overdrive2k: efficient secure MPC over from somewhat homomorphic encryption E Orsini, NP Smart, F Vercauteren Topics in Cryptology–CT-RSA 2020: The Cryptographers’ Track at the RSA …, 2020 | 41 | 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 Applied Cryptography and Network Security: 15th International Conference …, 2017 | 38 | 2017 |
| BBQ: Using AES in picnic signatures CD de Saint Guilhem, L De Meyer, E Orsini, NP Smart Selected Areas in Cryptography–SAC 2019: 26th International Conference …, 2020 | 37 | 2020 |
| 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 | 36 | 2019 |
| Efficient secure multiparty computation with identifiable abort C Baum, E Orsini, P Scholl Theory of Cryptography: 14th International Conference, TCC 2016-B, Beijing …, 2016 | 32 | 2016 |
| TinyKeys: A new approach to efficient multi-party computation C Hazay, E Orsini, P Scholl, E Soria-Vazquez Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018 | 31 | 2018 |
| Banquet: short and fast signatures from AES C Baum, CD de Saint Guilhem, D Kales, E Orsini, P Scholl, G Zaverucha Public-Key Cryptography–PKC 2021: 24th IACR International Conference on …, 2021 | 30 | 2021 |
| Lima NP Smart, MR Albrecht, Y Lindell, E Orsini, V Osheter, K Paterson, G Peer Technical report, National Institute of Standards and Technology, 2017 | 30* | 2017 |
Peter SchollAarhus UniversityVerified email at cs.au.dk
