Emmanuela Orsini

Cited by

	All	Since 2017
Citations	1311	1095
h-index	21	19
i10-index	30	26

300

150

225

20072008200920102011201220132014201520162017201820192020202120229 6 17 19 5 22 8 16 40 56 134 145 182 255 285 94

Public access

View all

29 articles

1 article

available

not available

Based on funding mandates

Co-authors

Peter SchollAarhus UniversityVerified email at cs.au.dk
Nigel SmartKU LeuvenVerified email at kuleuven.be
Marcel KellerCSIRO's Data61Verified email at data61.csiro.au
Massimiliano SalaProfessor of Mathematics, University of TrentoVerified email at unitn.it
Delpech de Saint Guilhem, CyprienPost-Doctoral Research Assistant, imec-COSIC, KU LeuvenVerified email at kuleuven.be
Dragos RotaruCape PrivacyVerified email at capeprivacy.com
Eduardo Soria-VazquezTechnology Innovation InstituteVerified email at tii.ae
Martin R. AlbrechtRoyal Holloway, University of LondonVerified email at rhul.ac.uk
Abdelrahaman AlyCryptography Research Centre, Technology Innovation Institute (TII)Verified email at tii.ae
Tim WoodKU Leuven, University of BristolVerified email at kuleuven.be
Kenny PatersonProfessor of Computer Science, ETH ZurichVerified email at inf.ethz.ch
Carsten BaumAssistant Professor, Aarhus UniversityVerified email at cs.au.dk
Titouan TanguyPhD Student, KU LeuvenVerified email at kuleuven.be
Arpita PatraAssociate Professor, Dept. of Computer Science & Automation, Indian Institute of ScienceVerified email at iisc.ac.in
Ashish ChoudhuryIIIT BangaloreVerified email at iiitb.ac.in
Carmit HazayBar-Ilan University, IsraelVerified email at biu.ac.il
Claudio OrlandiAssociate Professor, Department of Computer Science, Aarhus University, DenmarkVerified email at cs.au.dk
Jesper Buus NielsenProfessor of Computer Science, Aarhus UniversityVerified email at cs.au.dk
Peter Sebastian NordholtChainalysisVerified email at chainalysis.com
Joop van de PolUnaffiliatedVerified email at my.bristol.ac.uk

Emmanuela Orsini

KU Leuven

Verified email at kuleuven.be - Homepage

Cryptography Coding Theory Mathematics


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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
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
Correcting errors and erasures via the syndrome variety E Orsini, M Sala Journal of Pure and Applied Algebra 200 (1-2), 191-226, 2005	60	2005
Dishonest majority multi-party computation for binary circuits E Larraia, E Orsini, NP Smart Annual Cryptology Conference, 495-512, 2014	54	2014
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	51*	2019
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
SCALE and MAMBA documentation (2018) A Aly, M Keller, E Orsini, D Rotaru, P Scholl, NP Smart, T Wood	44*	2018
NewHope T Poppelmann, E Alkim, R Avanzi, J Bos, L Ducas, A de la Piedra, ... NIST, Tech. Rep, 2017	41	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	41	2007
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
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	38	2013
Overdrive2k: Efficient Secure MPC over from Somewhat Homomorphic Encryption E Orsini, NP Smart, F Vercauteren Cryptographers’ Track at the RSA Conference, 254-283, 2020	31	2020
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
Improved decoding of affine-variety codes C Marcolla, E Orsini, M Sala Journal of Pure and Applied Algebra 216 (7), 1533-1565, 2012	30	2012
BBQ: Using AES in picnic signatures CD Saint Guilhem, LD Meyer, E Orsini, NP Smart International Conference on Selected Areas in Cryptography, 669-692, 2019	29	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	26	2019
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	25	2017
Efficient secure multiparty computation with identifiable abort C Baum, E Orsini, P Scholl Theory of Cryptography Conference, 461-490, 2016	23	2016
Decoding cyclic codes: the Cooper philosophy T Mora, E Orsini Gröbner Bases, Coding, and Cryptography, 69-91, 2009	22*	2009

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow this author

Cited by

Co-authors