Professional activities

Leuven COED Days

• COED meetings

Editorial

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:
- EUROCRYPT 2023, CFAIL 2023, TPMPC 2023, ASIACRYPT 2023
- TCC 2022, CANS 2022
- ACM CCS 2021 , 4thZKProof Workshop , ASIACRYPT 2021 , WAHC 2021 (affiliated with ACM CCS), INDOCRYPT 2021
- TCC 2020 , SCN 2020 , PKC 2020 , WAHC 2020 (affiliated with ACM CCS)
- WAHC 2019 (affiliated with ACM CCS), IMACC 2019
- SCN 2018
- CANS 2016
- MobiWis2015

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 here Google Scholar and here DBLP

1. Lennart Braun, Cyprien Delpech de Saint Guilhem, Robin Jadoul, Emmanuela Orsini, Nigel P. Smart and Titouan Tanguy
   ZK-for-Z2K: MPC-in-the-Head Zero-Knowledge Proofs for Z_{2^k}, IMACC 2023.
   

2. Mariana Gama, Emad Heydari Beni, Emmanuela Orsini, Nigel P. Smart, and Oliver Zajonc
   MPC With Delayed Parties Over Star-Like Networks , ASIACRYPT 2023.
   Preprint version (link).

3. Carsten Baum, Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Klooß, Emmanuela Orsini, Lawrence Roy, and Peter Scholl
   Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures From VOLE-in-the-Head , CRYPTO 2023.
   Preprint version (link).

4. Michele Ciampi, Emmanuela Orsini, Luisa Siniscalchi,
   Four-Round Black-Box Non-Malleable Schemes from One-Way Permutations , TCC 2022.
   Preprint version ePrint Report 2022/1543.

5. Carsten Baum, Robin Jadoul, Emmanuela Orsini, Peter Scholl, Nigel P. Smart,
   Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs, ACM CCS 2022
   Preprint version ePrint Report 2022/082.

6. Ilaria Chillotti, Emmanuela Orsini, Peter Scholl, Nigel Smart and Barry Van Leeuwen
   Scooby: Improved Multi-Party Homomorphic Secret Sharing Based on FHE, SCN 2022 .

7. 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 available as ePrint Report 2022/313.

8. C. Hazay, E. Orsini, P. Scholl, E. Soria-Vazquez
   TinyKeys: A New Approach to Efficient Multi-Party Computation , Journal of Cryptology (2022) , 35:13 p 1-66.

9. 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 available as ePrint Report 2015/472 .

10. Cyprien Delpech de Saint Saint Guilhem, Emmanuela Orsini, Titouan Tanguy
    Limbo: Efficient Zero-knowledge MPCitH-based Arguments, ACM CCS 2021.
    (eprint).

11. Jan-Pieter D'Anvers, Emmanuela Orsini, Frederik Vercauteren
    Error Term Checking: Towards Chosen Ciphertext Security without Re-encryption, APKC 2021 .
    (eprint).

12. Carsten Baum, Cyprien Delpech de Saint Guilhem, Daniel Kales, Emmanuela Orsini, Peter Scholl, Greg Zaverucha
    Banquet: Short and Fast Signatures from AES, PKC 2021 , 266-297.
    (eprint).

13. 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 available as eprint Report 2021/120

14. 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, 26-50.
    Full version available as eprint Report 2021/195

15. Emmanuela Orsini
    Efficient, Actively Secure MPC with a Dishonest Majority: a Survey. WAIFI 2020
    

16. 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 available as eprint Report 2018/648

17. Carsten Baum, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
    Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability, CRYPTO 2020
    Full version available as eprint Report 2020/767

18. Emmanuela Orsini, Nigel P. Smart, Frederik Vercauteren
    Overdrive2k: Efficient Secure MPC over Z_2k from Somewhat Homomorphic Encryption, CT-RSA 2020 .
    Full version available as eprint Report 2019/153

19. Abdelrahaman Aly, Emmanuela Orsini, Dragos Rotaru, Nigel Smart, Tim Wood
    Zaphod: Efficiently Combing LSSS and Garbled Circuits in SCALE , WAHC@CCS 2019.

20. Cyprien Delpech de Saint Guilhem, Lauren De Meyer, Emmanuela Orsini, Nigel P. Smart
    BBQ: Using AES in Picnic Signatures , SAC 2019.
    Full version available as eprint Report 2019/781

21. 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 available as eprint Report 2018/843

22. Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
    Efficient MPC from Syndrome Decoding (or: Honey, I Shrunk the Keys) , CRYPTO 2018 .
    Full version available as eprint Report 2018/208

23. 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 available as eprint Report 2017/354.

24. Marcel Keller, Emmanuela Orsini, Dragos Rotaru, Peter Scholl, Eduardo Soria- Vazquez and Srinivas Vivek.
    Faster Secure Multi-Party Computation of AES and DES Using Lookup Tables . ACNS 2017.
    Full version availaible as eprint Report 2017/378.

25. Fabrizio Caruso, Emmanuela Orsini, Massimiliano Sala, Claudia Tinnirello
    On the shape of the general error locator polynomial for cyclic codes.
    In IEEE Transactions on Information Theory, 63(6): 3641-3657, 2017.
    Full version available as Arxiv 1502.02927.

26. 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 availaible as eprint Report 2016/933.

27. Emmanuela Orsini, Joop van de Pol, Nigel P. Smart
    Bootstrapping BGV Ciphertexts with a Wider Choice of p and q ,
    IET Information Security (invited), Volume 10, Issue 6, p. 348-357, November 2016.

28. Marcel Keller , Emmanuela Orsini, Peter Scholl
    MASCOT: Faster Malicious Arithmetic Secure Computationwith Oblivious Transfer , ACM CCS 2016.
    Full version availaible as eprint Report 2016/505.

29. Carsten Baum, Emmanuela Orsini, Peter Scholl
    Efficiently Secure Multiparty Computation with identifiable abort, TCC 2016.
    Full version available as ePrint Report 2016/187.

30. Ashish Choudhury, Emmanuela Orsini, Arpita Patra, Nigel P. Smart
    Linear Overhead Robust MPC with Honest Majority Using Preprocessing, SCN 2016.
    Full version available as ePrint Report 2015/705 .

31. Tore Kasper Frederiksen, Marcel Keller, Emmanuela Orsini, Peter Scholl
    A Unified Approach to MPC with Preprocessing using OT, ASIACRYPT 2015(1).
    Full version available as ePrint Report 2015/901.

32. Marcel Keller, Emmanuela Orsini, Peter Scholl
    Actively Secure OT Extension with Optimal Overhead , CRYPTO(1) 2015.
    Full version available as ePrint Report 2015/646 .

33. Emmanuela Orsini, Joop van de Pol, Nigel P. Smart
    Bootstrapping BGV Ciphertexts with a Wider Choice of p and q , PKC 2015.
    Full version available as ePrint Report 2014/408.

34. Enrique Larraia, Emmanuela Orsini, Nigel P. Smart
    Dishonest Majority Multi-Party Computation for Binary Circuits , CRYPTO 2014.
    Full version available as ePrint Report 2014/101 .

35. Ashish Choudhury, Jake Loftus, Emmanuela Orsini, Arpita Patra, Nigel P. Smart
    Between a Rock and a Hard Place: Interpolating between MPC and FHE , ASIACRYPT (2) 2013.
    Full version available as ePrint2013/085

36. Chiara Marcolla, Emmanuela Orsini, Massimiliano Sala
    Improved decoding of affine-variety codes ,
    In Journal of Pure and Applied Algebra, Volume 216, Issue 7, Pages 1533-1565, July 2012.
    Preprint available as CoRRabs/1102.4186 .

37. Eleonora Guerrini, Emmanuela Orsini, Massimiliano Sala
    Distance for non-linear codes.
    In Journal of Algebra and Its Applications, Volume 9, No 1, pp. 1-16, 2010.
    Preprint available as CoRRabs/0909.1626.

38. Emmanuela Orsini, Carlo Traverso. The LPC signature.
    Conference on Symbolic Computation and Cryptography (SCC 2010), London, UK, pp. 129-135, June 2010. SCC10.

39. 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, Heidelberg),pp. 367-372, 2009.

40. Teo Mora, Emmanuela Orsini
    Decoding cyclic codes: the Cooper philosophy.
    In Gröbner, Coding and Cryptography , (RISC Book Series, Springer, Heidelberg), pp. 69-91, 2009.

41. Daniel Augot, Emanuele Betti, Emmanuela Orsini
    Introduction to linear and cyclic codes.
    In Gröbner, Coding and Cryptography, (RISC Book Series, Springer, Heidelberg), pp. 47-68,2009.

42. Teo Mora, Emmanuela Orsini
    Invited talk : Decoding cyclic codes: the Cooper philosophy . MMICS 2008. (link) .

43. Emmanuela Orsini, Massimiliano Sala
    General error locator polynomial for binary cyclic codes with t <= 2 and n < 63.
    In IEEE Transactions on Information Theory, 53, 2007, 1095-1107.

44. Emmanuela Orsini
    A new decoding algorithm for cyclic codes.
    Proceeding of MIRIAM Workshop, Industry Days 2003-2004, Vol. 2, p.62-65, June 2005.

45. Emmanuela Orsini, Massimiliano Sala
    Correcting errors and erasures via the syndrome variety.
    In Journal of Pure and Applied Algebra, Vol. 200, p. 191-226, 1 August 2005.




Extended abstrats/Presentations (Peer-reviewed)

46. 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.
    Link MEGA 2015.

Manuscripts

1. Emmanuela Orsini, Riccardo Zanotto
   Simple Two-Round OT in the Explicit Isogeny Model,
   Preprint available as (link).

2. Emmanuela Orsini, Ludovic Perret, Carlo Traverso
   Lattice Gröbner bases, SVP and Lattice Polly Cracker Signature,
   Preprint available as (link).

3. Cecilia Boschini, Emmanuela Orsini, Carlo Traverso
   Between Codes and Lattices: Hybrid Lattices and the NTWO cryptosystem (link .pdf).

Thesis and technical reports

1. Emmanuela Orsini
   On the decoding and distance problems for algebraic codes,
   PhD Thesis in Mathematics and Statistics for the Computational Sciences (MASSC), Universita' di Milano, 2008.

2. Emmanuela Orsini
   Parity-check matrices for Goppa-LDPC codes,
   Tesi Master MAMI (Master in Applied Mathematics and Applications), Universita' di Milano Bicocca, 2004.

3. Emmanuela Orsini
   Gröbner bases and specialization,
   Tesi di Laurea in Matematica (Master Degree in Mathematics), Universita' degli Studi di Pisa.