EMMANUELA ORSINI

I am an Assistant Professor in the new Computing Sciences Department of Bocconi University, Milano, Italy. Prior to that, I had a permanent position as a Research Expert in the Computer Security and Industrial Cryptography (COSIC) group at KU Leuven, Belgium, and a Senior Research Associate at the University of Bristol, UK.

I obtained my PhD in Mathematics and Statistics for the Computational Sciences from the University of Milano and my degree in Mathematics from the University of Pisa.

My research interests lie in the broad range of cryptography, applied mathematics and information theory.

My research is mainly focused on theoretical and practical aspects of secure computation, particularly multiparty computation and homomorphic encryption, efficient zero-knowledge schemes, cryptographic protocols, post-quantum cryptography, coding theory and computational algebra.

Hazay C.; Orsini E.; Scholl P.; Soria-Vazquez E.
TinyKeys: A New Approach to Efficient Multi-Party Computation
JOURNAL OF CRYPTOLOGY, 2022

Ciampi M.; Orsini E.; Siniscalchi L.
Four-Round Black-Box Non-malleable Schemes from One-Way Permutations
20th Theory of Cryptography Conference,, 2022

Baum C.; Jadoul R.; Orsini E.; Scholl P.; Smart N. P.
Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs
CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

Baum C.; De Saint Guilhem C. D.; Kales D.; Orsini E.; Scholl P.; Zaverucha G.
Banquet: Short and Fast Signatures from AES
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2021

Burra S. S.; Larraia E.; Nielsen J. B.; Nordholt P. S.; Orlandi C.; Orsini E.; Scholl P.; Smart N. P.
High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer
JOURNAL OF CRYPTOLOGY, 2021

Ben-Efraim A.; Cong K.; Omri E.; Orsini E.; Smart N. P.; Soria-Vazquez E.
Large Scale, Actively Secure Computation from LPN and Free-XOR Garbled Circuits
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2021

Delpech De Saint Guilhem C.; Orsini E.; Tanguy T.
Limbo: Efficient Zero-knowledge MPCitH-based Arguments
Proceedings of the ACM Conference on Computer and Communications Security, 2021

Baum C.; Orsini E.; Scholl P.; Soria-Vazquez E.
Efficient constant-round mpc with identifiable abort and public verifiability
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2020

Hazay C.; Orsini E.; Scholl P.; Soria-Vazquez E.
Concretely efficient large-scale MPC with active security (or, tinykeys for TinyOT)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2018

Hazay C.; Orsini E.; Scholl P.; Soria-Vazquez E.
TinyKeys: A new approach to efficient multi-party computation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2018

Keller M.; Orsini E.; Scholl P.
MASCOT: Faster malicious arithmetic secure computation with oblivious transfer
Proceedings of the ACM Conference on Computer and Communications Security, 2016