Emmanuela Orsini

Cited by

	All	Since 2016
Citations	957	800
h-index	17	15
i10-index	26	22

280

140

210

2007200820092010201120122013201420152016201720182019202020219 6 17 20 5 22 8 17 41 53 140 145 189 268 4

Co-authors

Peter SchollAarhus UniversityVerified email at cs.au.dk
Nigel SmartKU LeuvenVerified email at kuleuven.be
Marcel KellerCSIRO Data61Verified email at data61.csiro.au
Massimiliano SalaProfessor of Mathematics, University of TrentoVerified email at unitn.it
Dragos RotaruCape PrivacyVerified email at capeprivacy.com
Martin R. AlbrechtRoyal Holloway, University of LondonVerified email at rhul.ac.uk
Abdelrahaman AlyPost-doctoral Researcher at ESAT/COSIC, KULeuvenVerified email at esat.kuleuven.be
Tim WoodKU Leuven, University of BristolVerified email at kuleuven.be
Kenny PatersonProfessor of Computer Science, ETH ZurichVerified email at inf.ethz.ch
Eduardo Soria-VazquezAarhus UniversityVerified email at cs.au.dk
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
Joop van de PolUnaffiliatedVerified email at my.bristol.ac.uk
Delpech de Saint Guilhem, CyprienPhD Student, University of Bristol; Research Assistant, COSIC, KU LeuvenVerified email at kuleuven.be
Carmit HazayBar-Ilan University, IsraelVerified email at biu.ac.il
Michele OrrùUC BerkeleyVerified email at berkeley.edu
Carsten BaumAssistant Professor, Aarhus UniversityVerified email at cs.au.dk
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

Emmanuela Orsini

KU Leuven

Verified email at kuleuven.be - Homepage

Cryptography Coding Theory


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	196	2016
Actively secure OT extension with optimal overhead M Keller, E Orsini, P Scholl Annual Cryptology Conference, 724-741, 2015	126	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	59	2005
Dishonest majority multi-party computation for binary circuits E Larraia, E Orsini, NP Smart Annual Cryptology Conference, 495-512, 2014	48	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	46	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
Newhope-algorithm specifications and supporting documentation E Alkim, R Avanzi, J Bos, L Ducas, A de la Piedra, T Pöppelmann, ... Second Round NIST PQC Project Submission Document, 2019	36*	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, ... IACR Cryptol. ePrint Arch. 2015, 472, 2015	35	2015
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
Newhope T Poppelmann, E Alkim, R Avanzi, J Bos, L Ducas, A de la Piedra, ... NIST, Tech. Rep, 2017	33	2017
Improved decoding of affine-variety codes C Marcolla, E Orsini, M Sala Journal of Pure and Applied Algebra 216 (7), 1533-1565, 2012	31	2012
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	30	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	20*	2009
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	18	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	17	2017
Lima NP Smart, MR Albrecht, Y Lindell, E Orsini, V Osheter, K Paterson, G Peer Technical report, National Institute of Standards and Technology, 2017	17*	2017
Efficient secure multiparty computation with identifiable abort C Baum, E Orsini, P Scholl Theory of Cryptography Conference, 461-490, 2016	16	2016
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
Bootstrapping BGV ciphertexts with a wider choice of p and q E Orsini, J van de Pol, NP Smart IET Information Security 10 (6), 348-357, 2016	14	2016

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

Upload PDF

Follow this author

Cited by

Co-authors