Portrait of Emmanuela Orsini

Emmanuela Orsini

As of February 2023, I am Tenure-Track Assistant Professor in the Department of Computing Sciences at Bocconi University . Before that, I was a Research Expert in the Computer Security and Industrial Cryptography (COSIC) research group at KU Leuven, Belgium, and a Senior Research Associate in the Cryptography group at the University of Bristol, UK. I received my PhD in Mathematics and Statistics from the University of Milano, and my master's degree in Mathematics from the University of Pisa.

My research interests include theoretical and practical aspects of secure computation, practical zero-knowledge constructions, fully homomorphic encryption, post-quantum cryptography, algebraic coding theory and computational algebra.

Contact

  • Email: emmanuela[dot]orsini[at]unibocconi.it
  • Address: Room 2-C2-03, Via G. Röntgen n. 1, Dept of Computing Sciences, Bocconi University, Milano
  • Tel: +390258365621

Professional Activities

Conference and Workshop Organization

Editorial Service

Editorial board member: Mathematical Cryptology , Communications in Cryptology

Program Committees

I have served (or will serve) on the following program committees for conferences and workshops:

  • 2026: EUROCRYPT, SCN
  • 2024: CRYPTO
  • 2023: EUROCRYPT, CFAIL, TPMPC, ASIACRYPT
  • 2022: TCC, CANS
  • 2021: ACM CCS, ZKProof Workshop (4th), ASIACRYPT, WAHC (affiliated with ACM CCS), INDOCRYPT
  • 2020: TCC, SCN, PKC, WAHC (affiliated with ACM CCS)
  • 2019: WAHC (affiliated with ACM CCS), IMACC
  • 2018: SCN
  • 2016: CANS
  • 2015: MobiWis

Research Activities

NIST Post-Quantum Standardization

  • First Round Submission
    Nigel P. Smart, Martin R. Albrecht, Yehuda Lindell, Emmanuela Orsini, Valery Osheter, Kenny Paterson, Guy Peer
    LIMA: A PQC Encryption Scheme. Website
  • Additional Round Two Contributor
    Erdem Alkim et al. NewHope: Post-quantum key encapsulation. Website
  • Additional Call for PQ Digital Signatures
    C. Baum, L. Braun, C. de Saint Guilhem, M. Klooß, C. Majenz, S. Mukherjee, E. Orsini, S. Ramacher, C. Rechberger, L. Roy, P. Scholl
    FAEST Signature Algorithm. Website

Publications

More details about my publications can be found on Google Scholar and DBLP.

  1. Kelong Cong, Emmanuela Orsini, Erik Pohle, Oliver Zajonc
    Row Reduction Techniques for n-Party Garbling, CRYPTO 2025.
  2. Carsten Baum, Ward Beullens, Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Klooß, Shibam Mukherjee, Emmanuela Orsini, Sebastian Ramacher, Christian Rechberger, Lawrence Roy, Peter Scholl
    Shorter, Tighter, FAESTer: Optimizations and Improved (QROM) Analysis for VOLE-in-the-Head Signatures, CRYPTO 2025.
  3. Carsten Baum, Ward Beullens, Shibam Mukherjee, Emmanuela Orsini, Sebastian Ramacher, Christian Rechberger, Lawrence Roy, Peter Scholl
    One Tree to Rule Them All: Optimizing GGM Trees and OWFs for Post-Quantum Signatures, ASIACRYPT 2024.
  4. Vincenzo Botta, Michele Ciampi, Emmanuela Orsini, Luisa Siniscalchi, Ivan Visconti
    Black-Box (and Fast) Non-Malleable Zero Knowledge, CRYPTO 2024.
  5. Emmanuela Orsini, Riccardo Zanotto
    Simple Two-Round OT in the Explicit Isogeny Model, IACR Communications in Cryptology, 1(1), 2024. Preprint: ePrint 2023/269.
  6. Lennart Braun, Cyprien Delpech de Saint Guilhem, Robin Jadoul, Emmanuela Orsini, Nigel P. Smart, Titouan Tanguy
    ZK-for-Z2K: MPC-in-the-Head Zero-Knowledge Proofs for Z2k, IMACC 2023.
  7. Mariana Gama, Emad Heydari Beni, Emmanuela Orsini, Nigel P. Smart, Oliver Zajonc
    MPC With Delayed Parties Over Star-Like Networks, ASIACRYPT 2023. Preprint: ePrint 2023/096.
  8. Carsten Baum, Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Klooß, Emmanuela Orsini, Lawrence Roy, Peter Scholl
    Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures From VOLE-in-the-Head, CRYPTO 2023. Preprint: ePrint 2023/996.
  9. Michele Ciampi, Emmanuela Orsini, Luisa Siniscalchi
    Four-Round Black-Box Non-Malleable Schemes from One-Way Permutations, TCC 2022. Preprint: ePrint 2022/1543.
  10. Carsten Baum, Robin Jadoul, Emmanuela Orsini, Peter Scholl, Nigel P. Smart
    Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs, ACM CCS 2022. Preprint: ePrint 2022/082.
  11. Ilaria Chillotti, Emmanuela Orsini, Peter Scholl, Nigel P. Smart, Barry Van Leeuwen
    Scooby: Improved Multi-Party Homomorphic Secret Sharing Based on FHE, SCN 2022.
  12. Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, Titouan Tanguy, Michiel Verbauwhede
    Efficient Proof of RAM Programs from Any Public-Coin Zero-Knowledge System, SCN 2022. Preprint: ePrint 2022/313.
  13. C. Hazay, E. Orsini, P. Scholl, E. Soria-Vazquez
    TinyKeys: A New Approach to Efficient Multi-Party Computation, Journal of Cryptology (2022), 35:13, pp. 1–66.
  14. S. S. Burra, E. Larraia, J. B. Nielsen, P. S. Nordholt, C. Orlandi, E. Orsini, P. Scholl, N. P. Smart
    High Performance Multi-Party Computation for Binary Circuits Based on Oblivious Transfer, Journal of Cryptology (2021). Full version: ePrint 2015/472.
  15. Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, Titouan Tanguy
    Limbo: Efficient Zero-Knowledge MPCitH-based Arguments, ACM CCS 2021. Preprint: ePrint 2021/215.
  16. Jan-Pieter D'Anvers, Emmanuela Orsini, Frederik Vercauteren
    Error Term Checking: Towards Chosen Ciphertext Security without Re-encryption, APKC 2021. Preprint: ePrint 2021/080.
  17. Carsten Baum, Cyprien Delpech de Saint Guilhem, Daniel Kales, Emmanuela Orsini, Peter Scholl, Greg Zaverucha
    Banquet: Short and Fast Signatures from AES, PKC 2021, pp. 266–297. Preprint: ePrint 2021/068.
  18. Aner Ben-Efraim, Kelong Cong, Eran Omri, Emmanuela Orsini, Nigel P. Smart, Eduardo Soria-Vazquez
    Large Scale, Actively Secure Computation from LPN and Free-XOR Garbled Circuits, EUROCRYPT 2021. Full version: ePrint 2021/120.
  19. Karim Baghery, Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, Nigel P. Smart, Titouan Tanguy
    Compilation of Function Representations for Secure Computing Paradigms, CT-RSA 2021, pp. 26–50. Full version: ePrint 2021/195.
  20. Emmanuela Orsini
    Efficient, Actively Secure MPC with a Dishonest Majority: a Survey, WAIFI 2020.
  21. Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, Christophe Petit, Nigel P. Smart
    Semi-Commutative Masking: A Framework for Isogeny-based Protocols, with an Application to Fully Secure Two-Round Isogeny-based OT, CANS 2020.
    Full version: ePrint 2018/648.
  22. Carsten Baum, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
    Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability, CRYPTO 2020. Full version: ePrint 2019/153.
  23. Emmanuela Orsini, Nigel P. Smart, Frederik Vercauteren
    Overdrive2k: Efficient Secure MPC over Z2k from Somewhat Homomorphic Encryption, CT-RSA 2020. Full version: ePrint 2019/153.
  24. Abdelrahaman Aly, Emmanuela Orsini, Dragos Rotaru, Nigel P. Smart, Tim Wood
    Zaphod: Efficiently Combing LSSS and Garbled Circuits in SCALE, WAHC@CCS 2019.
  25. Cyprien Delpech de Saint Guilhem, Lauren De Meyer, Emmanuela Orsini, Nigel P. Smart
    BBQ: Using AES in Picnic Signatures, SAC 2019. Full version: ePrint 2019/781.
  26. Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
    Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT), ASIACRYPT 2018. Full version: ePrint 2018/843.
  27. Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
    Efficient MPC from Syndrome Decoding (or: Honey, I Shrunk the Keys), CRYPTO 2018. Full version: ePrint 2018/208.
  28. Martin R. Albrecht, Emmanuela Orsini, Kenneth G. Paterson, Guy Peer, Nigel P. Smart
    Tightly Secure Ring-LWE Based Key Encapsulation with Short Ciphertexts, ESORICS 2017. Full version: ePrint 2017/354.
  29. Marcel Keller, Emmanuela Orsini, Dragos Rotaru, Peter Scholl, Eduardo Soria-Vazquez, Srinivas Vivek
    Faster Secure Multi-Party Computation of AES and DES Using Lookup Tables, ACNS 2017. Full version: ePrint 2017/378.
  30. Fabrizio Caruso, Emmanuela Orsini, Massimiliano Sala, Claudia Tinnirello
    On the shape of the general error locator polynomial for cyclic codes, IEEE Transactions on Information Theory, 63(6): 3641–3657, 2017.
    Full version: arXiv:1502.02927.
  31. Michele Orrù, Emmanuela Orsini, Peter Scholl
    Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection, CT-RSA 2017. Full version: ePrint 2016/933.
  32. Emmanuela Orsini, Joop van de Pol, Nigel P. Smart
    Bootstrapping BGV Ciphertexts with a Wider Choice of p and q, IET Information Security (invited), 10(6): 348–357, November 2016.
  33. Marcel Keller, Emmanuela Orsini, Peter Scholl
    MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer, ACM CCS 2016. Full version: ePrint 2016/505.
  34. Carsten Baum, Emmanuela Orsini, Peter Scholl
    Efficiently Secure Multiparty Computation with Identifiable Abort, TCC 2016. Full version: ePrint 2016/187.
  35. Ashish Choudhury, Emmanuela Orsini, Arpita Patra, Nigel P. Smart
    Linear Overhead Robust MPC with Honest Majority Using Preprocessing, SCN 2016. Full version: ePrint 2015/705.
  36. Tore Kasper Frederiksen, Marcel Keller, Emmanuela Orsini, Peter Scholl
    A Unified Approach to MPC with Preprocessing using OT, ASIACRYPT 2015 (1). Full version: ePrint 2015/901.
  37. Marcel Keller, Emmanuela Orsini, Peter Scholl
    Actively Secure OT Extension with Optimal Overhead, CRYPTO 2015 (1). Full version: ePrint 2015/546.
  38. Emmanuela Orsini, Joop van de Pol, Nigel P. Smart
    Bootstrapping BGV Ciphertexts with a Wider Choice of p and q, PKC 2015. Full version: ePrint 2014/408.
  39. Enrique Larraia, Emmanuela Orsini, Nigel P. Smart
    Dishonest Majority Multi-Party Computation for Binary Circuits, CRYPTO 2014. Full version: ePrint 2014/101.
  40. Ashish Choudhury, Jake Loftus, Emmanuela Orsini, Arpita Patra, Nigel P. Smart
    Between a Rock and a Hard Place: Interpolating between MPC and FHE, ASIACRYPT 2013 (2). Full version: ePrint 2013/085.
  41. Chiara Marcolla, Emmanuela Orsini, Massimiliano Sala
    Improved decoding of affine-variety codes, Journal of Pure and Applied Algebra, 216(7): 1533–1565, July 2012. Preprint: arXiv:1102.4186.
  42. Eleonora Guerrini, Emmanuela Orsini, Massimiliano Sala
    Distance for non-linear codes, Journal of Algebra and Its Applications, 9(1): 1–16, 2010. Preprint: arXiv:0909.1626.
  43. Emmanuela Orsini, Carlo Traverso
    The LPC signature, SCC 2010, London, UK, pp. 129–135, June 2010. SCC 2010 program.
  44. Eleonora Guerrini, Emmanuela Orsini, Ilaria Simonetti
    Gröbner bases for distance distribution of systematic codes, in Gröbner, Coding and Cryptography (RISC Book Series, Springer), pp. 367–372, 2009.
  45. Teo Mora, Emmanuela Orsini
    Decoding cyclic codes: the Cooper philosophy, in Gröbner, Coding and Cryptography (RISC Book Series, Springer), pp. 69–91, 2009.
  46. Daniel Augot, Emanuele Betti, Emmanuela Orsini
    Introduction to linear and cyclic codes, in Gröbner, Coding and Cryptography (RISC Book Series, Springer), pp. 47–68, 2009.
  47. Teo Mora, Emmanuela Orsini
    Invited talk: Decoding cyclic codes: the Cooper philosophy, MMICS 2008. (link)
  48. Emmanuela Orsini, Massimiliano Sala
    General error locator polynomial for binary cyclic codes with t ≤ 2 and n < 63, IEEE Transactions on Information Theory, 53, 1095–1107, 2007.
  49. Emmanuela Orsini
    A new decoding algorithm for cyclic codes, MIRIAM Workshop Proceedings (Industry Days 2003–2004), Vol. 2, p. 62–65, June 2005.
  50. Emmanuela Orsini, Massimiliano Sala
    Correcting errors and erasures via the syndrome variety, Journal of Pure and Applied Algebra, 200: 191–226, 1 August 2005.

    51. Extended Abstracts / Presentations (Peer-reviewed)

    • Cecilia Boschini, Emmanuela Orsini, Carlo Traverso
      Between Codes and Lattices: Hybrid lattices and the NTWO cryptosystem.
      Presented at MEGA 2015, Effective Methods in Algebraic Geometry, Italy (June 15–19). MEGA 2015.

    Manuscripts

    1. Emmanuela Orsini, Ludovic Perret, Carlo Traverso
      Lattice Gröbner bases, SVP and Lattice Polly Cracker Signature.
      Preprint: (link).
    2. Cecilia Boschini, Emmanuela Orsini, Carlo Traverso
      Between Codes and Lattices: Hybrid Lattices and the NTWO cryptosystem. (PDF).

    Theses and Technical Reports

    1. Emmanuela Orsini
      On the decoding and distance problems for algebraic codes.
      PhD Thesis (MASSC), Università di Milano, 2008.
    2. Emmanuela Orsini
      Parity-check matrices for Goppa-LDPC codes.
      Master Thesis (MAMI), Università di Milano Bicocca, 2004.
    3. Emmanuela Orsini
      Gröbner bases and specialization.
      Laurea Thesis (Master Degree in Mathematics), Università degli Studi di Pisa.

Teaching

2023/2024 – 2025/2026

  • Computer Science – Module 1 (Introduction to Computer Science and Programming)
    MAI, BAI, Bocconi University, Milan, Italy
  • Information Theory
    MAI, BAI, Bocconi University, Milan, Italy
  • Cryptography and Security
    MAI, Bocconi University, Milan, Italy

2021/2022

  • Post-quantum cryptography (Main Lecturer)
    Department of Mathematics, University of Pisa, Italy

2018/2019

  • Public key cryptography (Lecturer)
    ESA/ESTEC, Noordwijk, The Netherlands

2017/2018

  • Advanced cryptography (Teaching Assistant)
    ESAT, KU Leuven, Belgium

2014/2015 – 2016/2017

  • Coding and Information Theory (Lecturer)
    Department of Computer Science, University of Bristol, UK
    Part of COMS20002: “CoCoNuT, Complexity, Coding and Number Theory”.

2008/2009 – 2010/2011

2009/2010 – 2010/2011

  • Algebra (Teaching Assistant)
    Department of Mathematics, University of Pisa, Italy

2007/2008

  • On the structure of the syndrome variety (Invited Lecture)
    S3CM School in Algebraic Coding Theory, 2008
    Part of Fitzpatrick–Martinez’s course. Slides: here. More details: here.

2006/2007 – 2007/2008

  • Error Correcting Codes (Lecturer)
    Department of Mathematics, University of Pisa, Italy (link).
    Learning materials: here.

2005/2006

  • Coding Theory and Cryptography (Teaching Assistant)