| 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 | 178 | 2016 |
| Actively secure OT extension with optimal overhead M Keller, E Orsini, P Scholl Annual Cryptology Conference, 724-741, 2015 | 119 | 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 | 58 | 2005 |
| Dishonest majority multi-party computation for binary circuits E Larraia, E Orsini, NP Smart Annual Cryptology Conference, 495-512, 2014 | 47 | 2014 |
| 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 | 42 | 2017 |
| General Error Locator Polynomials for Binary Cyclic Codes With and E Orsini, M Sala IEEE transactions on information theory 53 (3), 1095-1107, 2007 | 38 | 2007 |
| 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 | 34 | 2015 |
| 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, ... IACR Cryptol. ePrint Arch. 2015, 472, 2015 | 34 | 2015 |
| Improved decoding of affine-variety codes C Marcolla, E Orsini, M Sala Journal of Pure and Applied Algebra 216 (7), 1533-1565, 2012 | 32 | 2012 |
| 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 | 29* | 2019 |
| NewHope T Poppelmann, E Alkim, R Avanzi, J Bos, L Ducas, A de la Piedra, ... NIST, Tech. Rep, 2017 | 29 | 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 | 29 | 2013 |
| SCALE and MAMBA documentation (2018) A Aly, M Keller, E Orsini, D Rotaru, P Scholl, NP Smart, T Wood | 28* | 2018 |
| Decoding cyclic codes: the Cooper philosophy T Mora, E Orsini Gröbner Bases, Coding, and Cryptography, 69-91, 2009 | 19* | 2009 |
| Lima NP Smart, MR Albrecht, Y Lindell, E Orsini, V Osheter, K Paterson, G Peer Technical Report. National Institute of Standards and Technology, 2017 | 18* | 2017 |
| Tightly secure ring-LWE based key encapsulation with short ciphertexts MR Albrecht, E Orsini, KG Paterson, G Peer, NP Smart European Symposium on Research in Computer Security, 29-46, 2017 | 17 | 2017 |
| 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 | 15 | 2017 |
| TinyKeys: A new approach to efficient multi-party computation C Hazay, E Orsini, P Scholl, E Soria-Vazquez Annual International Cryptology Conference, 3-33, 2018 | 14 | 2018 |
| Computing the distance distribution of systematic nonlinear codes E Guerrini, E Orsini, M Sala Journal of Algebra and Its Applications 9 (02), 241-256, 2010 | 13 | 2010 |
| Efficient secure multiparty computation with identifiable abort C Baum, E Orsini, P Scholl Theory of Cryptography Conference, 461-490, 2016 | 12 | 2016 |
Peter SchollAarhus UniversityVerified email at cs.au.dk
