Emmanuela Orsini

According to our database, Emmanuela Orsini authored at least 52 papers between 2007 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Row Reduction Techniques for n-Party Garbling.

Kelong Cong, Emmanuela Orsini, Erik Pohle, Oliver Zajonc

Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Shorter, Tighter, FAESTer: Optimizations and Improved (QROM) Analysis for VOLE-in-the-Head Signatures.

Carsten Baum, Ward Beullens, Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Klooß, Christian Majenz, Shibam Mukherjee, Emmanuela Orsini, Sebastian Ramacher, Christian Rechberger, Lawrence Roy, Peter Scholl

Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024

Scooby: Improved multi-party homomorphic secret sharing based on FHE.

Ilaria Chillotti, Emmanuela Orsini, Peter Scholl, Barry Van Leeuwen

Inf. Comput., 2024

Simple Two-Message OT in the Explicit Isogeny Model.

Emmanuela Orsini, Riccardo Zanotto

IACR Commun. Cryptol., 2024

Black-Box (and Fast) Non-malleable Zero Knowledge.

Vincenzo Botta, Michele Ciampi, Emmanuela Orsini, Luisa Siniscalchi, Ivan Visconti

Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

One Tree to Rule Them All: Optimizing GGM Trees and OWFs for Post-Quantum Signatures.

Carsten Baum, Ward Beullens, Shibam Mukherjee, Emmanuela Orsini, Sebastian Ramacher, Christian Rechberger, Lawrence Roy, Peter Scholl

Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

2023

Simple Two-Round OT in the Explicit Isogeny Model.

Emmanuela Orsini, Riccardo Zanotto

IACR Cryptol. ePrint Arch., 2023

ZK-for-Z2K: MPC-in-the-Head Zero-Knowledge Proofs for ℤ_2^k.

Lennart Braun, Cyprien Delpech de Saint Guilhem, Robin Jadoul, Emmanuela Orsini, Nigel P. Smart, Titouan Tanguy

IACR Cryptol. ePrint Arch., 2023

ZK-for-Z2K: MPC-in-the-Head Zero-Knowledge Proofs for $\mathbb {Z}_{2^k}$.

Lennart Braun, Cyprien Delpech de Saint Guilhem, Robin Jadoul, Emmanuela Orsini, Nigel P. Smart, Titouan Tanguy

Proceedings of the Cryptography and Coding - 19th IMA International Conference, 2023

Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-Head.

Carsten Baum, Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Klooß, Emmanuela Orsini, Lawrence Roy, Peter Scholl

Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

MPC with Delayed Parties over Star-Like Networks.

Mariana Gama, Emad Heydari Beni, Emmanuela Orsini, Nigel P. Smart, Oliver Zajonc

Proceedings of the Advances in Cryptology - ASIACRYPT 2023, 2023

2022

Four-Round Black-Box Non-Malleable Commitments from One-Way Permutations.

Michele Ciampi, Emmanuela Orsini, Luisa Siniscalchi

IACR Cryptol. ePrint Arch., 2022

Four-Round Black-Box Non-malleable Schemes from One-Way Permutations.

Michele Ciampi, Emmanuela Orsini, Luisa Siniscalchi

Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Efficient Proof of RAM Programs from Any Public-Coin Zero-Knowledge System.

Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, Titouan Tanguy, Michiel Verbauwhede

Proceedings of the Security and Cryptography for Networks - 13th International Conference, 2022

Scooby: Improved Multi-party Homomorphic Secret Sharing Based on FHE.

Ilaria Chillotti, Emmanuela Orsini, Peter Scholl, Nigel P. Smart, Barry Van Leeuwen

Proceedings of the Security and Cryptography for Networks - 13th International Conference, 2022

Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs.

Carsten Baum, Robin Jadoul, Emmanuela Orsini, Peter Scholl, Nigel P. Smart

Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021

Banquet: Short and Fast Signatures from AES.

Carsten Baum, Cyprien Delpech de Saint Guilhem, Daniel Kales, Emmanuela Orsini, Peter Scholl, Greg Zaverucha

Proceedings of the Public-Key Cryptography - PKC 2021, 2021

Large Scale, Actively Secure Computation from LPN and Free-XOR Garbled Circuits.

Aner Ben-Efraim, Kelong Cong, Eran Omri, Emmanuela Orsini, Nigel P. Smart, Eduardo Soria-Vazquez

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Compilation of Function Representations for Secure Computing Paradigms.

Karim Baghery, Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, Nigel P. Smart, Titouan Tanguy

Proceedings of the Topics in Cryptology - CT-RSA 2021, 2021

Limbo: Efficient Zero-knowledge MPCitH-based Arguments.

Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, Titouan Tanguy

Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

Error Term Checking: Towards Chosen Ciphertext Security without Re-encryption.

Jan-Pieter D'Anvers, Emmanuela Orsini, Frederik Vercauteren

Proceedings of the 8th on ASIA Public-Key Cryptography Workshop, 2021

2020

Efficient, Actively Secure MPC with a Dishonest Majority: A Survey.

Emmanuela Orsini

Proceedings of the Arithmetic of Finite Fields - 8th International Workshop, 2020

Overdrive2k: Efficient Secure MPC over $\mathbb {Z}_{2^k}$ from Somewhat Homomorphic Encryption.

Emmanuela Orsini, Nigel P. Smart, Frederik Vercauteren

Proceedings of the Topics in Cryptology - CT-RSA 2020, 2020

Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability.

Carsten Baum, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Semi-commutative Masking: A Framework for Isogeny-Based Protocols, with an Application to Fully Secure Two-Round Isogeny-Based OT.

Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, Christophe Petit, Nigel P. Smart

Proceedings of the Cryptology and Network Security - 19th International Conference, 2020

2019

Overdrive2k: Efficient Secure MPC over Z_2^k from Somewhat Homomorphic Encryption.

Emmanuela Orsini, Nigel P. Smart, Frederik Vercauteren

IACR Cryptol. ePrint Arch., 2019

BBQ: Using AES in Picnic Signatures.

Cyprien Delpech de Saint Guilhem, Lauren De Meyer, Emmanuela Orsini, Nigel P. Smart

Proceedings of the Selected Areas in Cryptography - SAC 2019, 2019

Zaphod: Efficiently Combining LSSS and Garbled Circuits in SCALE.

Abdelrahaman Aly, Emmanuela Orsini, Dragos Rotaru, Nigel P. Smart, Tim Wood

Proceedings of the 7th ACM Workshop on Encrypted Computing & Applied Homomorphic Cryptography, 2019

2018

Secure Oblivious Transfer from Semi-Commutative Masking.

Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, Christophe Petit, Nigel P. Smart

IACR Cryptol. ePrint Arch., 2018

TinyKeys: A New Approach to Efficient Multi-Party Computation.

Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT).

Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez

Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017

On the Shape of the General Error Locator Polynomial for Cyclic Codes.

Fabrizio Caruso, Emmanuela Orsini, Massimiliano Sala, Claudia Tinnirello

IEEE Trans. Inf. Theory, 2017

Tightly Secure Ring-LWE Based Key Encapsulation with Short Ciphertexts.

Martin R. Albrecht, Emmanuela Orsini, Kenneth G. Paterson, Guy Peer, Nigel P. Smart

Proceedings of the Computer Security - ESORICS 2017, 2017

Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection.

Michele Orrù, Emmanuela Orsini, Peter Scholl

Proceedings of the Topics in Cryptology - CT-RSA 2017, 2017

Faster Secure Multi-party Computation of AES and DES Using Lookup Tables.

Marcel Keller, Emmanuela Orsini, Dragos Rotaru, Peter Scholl, Eduardo Soria-Vazquez, Srinivas Vivek

Proceedings of the Applied Cryptography and Network Security, 2017

2016

Bootstrapping BGV ciphertexts with a wider choice of <i>p</i> and <i>q</i>.

Emmanuela Orsini, Joop van de Pol, Nigel P. Smart

IET Inf. Secur., 2016

Efficient Secure Multiparty Computation with Identifiable Abort.

Carsten Baum, Emmanuela Orsini, Peter Scholl

Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing.

Ashish Choudhury, Emmanuela Orsini, Arpita Patra, Nigel P. Smart

Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer.

Marcel Keller, Emmanuela Orsini, Peter Scholl

Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015

Linear Overhead Robust MPC with Honest Majority Using Preprocessing.

Ashish Choudhury, Emmanuela Orsini, Arpita Patra, Nigel P. Smart

IACR Cryptol. ePrint Arch., 2015

High Performance Multi-Party Computation for Binary Circuits Based on Oblivious Transfer.

Sai Sheshank Burra, Enrique Larraia, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, Emmanuela Orsini, Peter Scholl, Nigel P. Smart

IACR Cryptol. ePrint Arch., 2015

Bootstrapping BGV Ciphertexts with a Wider Choice of p and q.

Emmanuela Orsini, Joop van de Pol, Nigel P. Smart

Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015

Actively Secure OT Extension with Optimal Overhead.

Marcel Keller, Emmanuela Orsini, Peter Scholl

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

A Unified Approach to MPC with Preprocessing Using OT.

Tore Kasper Frederiksen, Marcel Keller, Emmanuela Orsini, Peter Scholl

Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014

Dishonest Majority Multi-Party Computation for Binary Circuits.

Enrique Larraia, Emmanuela Orsini, Nigel P. Smart

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2013

Between a Rock and a Hard Place: Interpolating between MPC and FHE.

Ashish Choudhury, Jake Loftus, Emmanuela Orsini, Arpita Patra, Nigel P. Smart

Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2009

Computing the distance distribution of systematic non-linear codes

Eleonora Guerrini, Emmanuela Orsini, Massimiliano Sala

CoRR, 2009

Decoding Cyclic Codes: the Cooper Philosophy.

Teo Mora, Emmanuela Orsini

Proceedings of the Gröbner Bases, Coding, and Cryptography, 2009

Gröbner Bases for the Distance Distribution of Systematic Codes.

Eleonora Guerrini, Emmanuela Orsini, Ilaria Simonetti

Proceedings of the Gröbner Bases, Coding, and Cryptography, 2009

An Introduction to Linear and Cyclic Codes.

Daniel Augot, Emanuele Betti, Emmanuela Orsini

Proceedings of the Gröbner Bases, Coding, and Cryptography, 2009

2008

Invited Talk: Decoding Cyclic Codes: The Cooper Philosophy.

Teo Mora, Emmanuela Orsini

Proceedings of the Mathematical Methods in Computer Science, 2008

2007

General Error Locator Polynomials for Binary Cyclic Codes With t<=2 and n<63.

Emmanuela Orsini, Massimiliano Sala

IEEE Trans. Inf. Theory, 2007