Emmanuela Orsini
Emmanuela Orsini
Adresse e-mail validée de kuleuven.be - Page d'accueil
Titre
Citée par
Citée par
Année
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
2472016
Actively secure OT extension with optimal overhead
M Keller, E Orsini, P Scholl
Annual Cryptology Conference, 724-741, 2015
1402015
Correcting errors and erasures via the syndrome variety
E Orsini, M Sala
Journal of Pure and Applied Algebra 200 (1-2), 191-226, 2005
612005
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
562017
Dishonest majority multi-party computation for binary circuits
E Larraia, E Orsini, NP Smart
Annual Cryptology Conference, 495-512, 2014
532014
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
42*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
402015
General Error Locator Polynomials for Binary Cyclic Codes With and
E Orsini, M Sala
IEEE transactions on information theory 53 (3), 1095-1107, 2007
402007
SCALE and MAMBA documentation (2018)
A Aly, M Keller, E Orsini, D Rotaru, P Scholl, NP Smart, T Wood
39*2018
NewHope
T Poppelmann, E Alkim, R Avanzi, J Bos, L Ducas, A de la Piedra, ...
NIST, Tech. Rep, 2017
382017
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
372013
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, ...
Journal of Cryptology 34 (3), 1-87, 2021
352021
Improved decoding of affine-variety codes
C Marcolla, E Orsini, M Sala
Journal of Pure and Applied Algebra 216 (7), 1533-1565, 2012
302012
Lima
NP Smart, MR Albrecht, Y Lindell, E Orsini, V Osheter, K Paterson, G Peer
Technical report, National Institute of Standards and Technology, 2017
26*2017
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
232019
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
232017
Overdrive2k: Efficient Secure MPC over from Somewhat Homomorphic Encryption
E Orsini, NP Smart, F Vercauteren
Cryptographers’ Track at the RSA Conference, 254-283, 2020
212020
Decoding cyclic codes: the Cooper philosophy
T Mora, E Orsini
Gröbner Bases, Coding, and Cryptography, 69-91, 2009
21*2009
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
192019
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
192018
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20