Emmanuela Orsini

From January 2018 I will be a researcher in the Computer Security and Industrial Cryptography (COSIC) research group at KU Leuven . Currently, I am a Senior Research Associate in the Cryptography group at the University of Bristol , UK.

My research interests include theoretical and practical aspects of secure computation, fully homomorphic encryption, lattice-based cryptography, algebraic coding theory and computational algebra.

Contact Details

emmanuela(dot)orsini(at)bristol.ac.uk Department of Computer Science
University of Bristol
Merchant Venturers Building,
Woodland Road
BS8 1UB, United Kingdom

Download Resume










Program Committees: SCN 2018, CANS 2016, MobiWis2015

Publications



  1. 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.
  2. 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: 229-249. Full version availaible as eprint Report 2017/378.
  3. 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 available as Arxiv 1502.02927.
  4. Michele Orrù, Emmanuela Orsini, Peter Scholl
    Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection , CT-RSA 2017: 381-396. Full version availaible as eprint Report 2016/933.
  5. 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
  6. Marcel Keller , Emmanuela Orsini, Peter Scholl
    MASCOT: Faster Malicious Arithmetic Secure Computationwith Oblivious Transfer, ACM CCS 2016: 830-842. Full version availaible as eprint Report 2016/505.
  7. Carsten Baum, Emmanuela Orsini, Peter Scholl
    Efficiently Secure Multiparty Computation with identifiable abort, TCC (B1) 2016: 461-490. Full version available as ePrint Report 2016/187.
  8. 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.
    Full version available as ePrint Report 2015/472.
  9. Ashish Choudhury, Emmanuela Orsini, Arpita Patra, Nigel P. Smart
    Linear Overhead Robust MPC with Honest Majority Using Preprocessing, SCN 2016, 147-168.
    Full version available as ePrint Report 2015/705 .
  10. Tore Kasper Frederiksen, Marcel Keller, Emmanuela Orsini, Peter Scholl
    A Unified Approach to MPC with Preprocessing using OT, ASIACRYPT 2015(1): 711-735.
    Full version available as ePrint Report 2015/901.
  11. Marcel Keller, Emmanuela Orsini, Peter Scholl
    Actively Secure OT Extension with Optimal Overhead , CRYPTO(1) 2015: 724-741.
    Full version available as ePrint Report 2015/646.
  12. Cecilia Boschini, Emmanuela Orsini, Carlo Traverso
    Between Codes and Lattices: Hybrid lattices and the NTWO cryptosystem, MEGA 2015, Effective Methods in Algebraic Geometry, Italy June 15-19. Link MEGA 2015.
  13. Emmanuela Orsini, Joop van de Pol, Nigel P. Smart
    Bootstrapping BGV Ciphertexts with a Wider Choice of p and q , PKC 2015: 673-698.
    Full version available as ePrint Report 2014/408.
  14. 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.
  15. 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: 221-240.
    Full version available as ePrint2013/085
  16. Chiara Marcolla, Emmanuela Orsini, Massimiliano Sala
    Improved decoding of affine-variety codes , Journal of Pure and Applied Algebra, Volume 216, Issue 7, Pages 1533-1565, July 2012. Preprint available as CoRRabs/1102.4186.
  17. Eleonora Guerrini, Emmanuela Orsini, Massimiliano Sala
    Distance for non-linear codes , Journal of Algebra and Its Applications, Volume 9, No 1, pp. 1-16, 2010. Preprint available as CoRRabs/0909.1626.
  18. Emmanuela Orsini, Carlo Traverso
    The LPC signature Second International Conference on Symbolic Computation and Cryptography (SCC 2010), London, UK, pp. 129-135, June 2010. SCC10.
  19. Eleonora Guerrini, Emmanuela Orsini, Ilaria Simonetti
    Gröbner bases for distance distribution of systematic codes , Gröbner, Coding and Cryptography, (RISC Book Series, Springer, Heidelberg),pp. 367-372, 2009.
  20. Teo Mora, Emmanuela Orsini
    Decoding cyclic codes: the Cooper philosophy, Gröbner, Coding and Cryptography, (RISC Book Series, Springer, Heidelberg), pp. 69-91, 2009.
  21. Daniel Augot, Emanuele Betti, Emmanuela Orsini
    Introduction to linear and cyclic codes , Gröbner, Coding and Cryptography, (RISC Book Series, Springer, Heidelberg), pp. 47-68,2009.
  22. Teo Mora, Emmanuela Orsini, Invited talk : Decoding cyclic codes: the Cooper philosophy Lecture Notes in Computer Science (Springer Berlin / Heidelberg), MMICS 2008, 126-127. (link) .
  23. Emmanuela Orsini, Massimiliano Sala
    General error locator polynomial for binary cyclic codes with t <= 2 and n < 63, IEEE Transactions on Information Theory, 53, 2007, 1095-1107.
  24. Emmanuela Orsini, A new decoding algorithm for cyclic codes, Proceeding of MIRIAM Workshop, Industry Days 2003-2004, Vol. 2, p.62-65, June 2005.
  25. Emmanuela Orsini, Massimiliano Sala
    Correcting errors and erasures via the syndrome variety , Journal of Pure and Applied Algebra, Vol. 200, p. 191-226, 1 August 2005.

    26. Preprint and work in progress

  26. E. Orsini, L. Perret, C. Traverso, Lattice Gröbner bases, SVP and Lattice Polly Cracker Signature, Preprint available as (link).
  27. C. Boschini, E. Orsini, C. Traverso, Between Codes and Lattices: Hybrid Lattices and the NTWO cryptosystem (link .pdf).

    28. Thesis and technical reports

  28. E. 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.
  29. E. Orsini: Parity-check matrices for Goppa-LDPC codes,
    Tesi Master MAMI, Universita' di Milano Bicocca, Novembre 2004.
  30. E. Orsini: Gröbner bases and specialization, Tesi di Laurea in Matematica, Universita' degli Studi di Pisa, 2002.
Teaching

2016/2017, 2015/2016, 2014/2015
Coding and Information Theory
Dept. Computer Science, University of Bristol.

This is part of COMS20002 "CoCoNuT, Complexity, Coding and Number Theory ".

2008/2009, 2009/2010, 2010/2011
Geometry and Linear Algebra (Teaching Assistant)
Dept. Mechanical Engineering, University of Pisa.

Worksheet with solutions: Applicazioni lineari , Determinanti , EsponenzialiSuperficiCurve , Proiettivita


2009/2010, 2010-2011
Algebra (Teaching Assistant), Dept. Maths, University of Pisa.


2007/2008
On the structure of the syndrome variety, (Invited Lecture)
S3CM School in Algebraic Coding Theory, 2008.

This lecture was part of the Fitzpatrick-Martinez's Course. Slides Here. For more details see here.


2006/2007, 2007/2008
Error Correcting Codes, Dept. Maths, University of Pisa (Link).

Learning materials: Here


2005/2006
Coding Theory and Cryptography (Teaching Assistant)