General Error Locator Polynomials for Binary Cyclic Codes With t<=2 and n<63. - Emmanuela Orsini; Massimiliano Sala (IEEE Trans. Inf. Theory, 2007)

Invited Talk: Decoding Cyclic Codes: The Cooper Philosophy. - Teo Mora; Emmanuela Orsini (MMICS, 2008)

An Introduction to Linear and Cyclic Codes. - Daniel Augot; Emanuele Betti; Emmanuela Orsini (Gröbner Bases, Coding, and Cryptography, 2009)

Gröbner Bases for the Distance Distribution of Systematic Codes. - Eleonora Guerrini; Emmanuela Orsini; Ilaria Simonetti (Gröbner Bases, Coding, and Cryptography, 2009)

Decoding Cyclic Codes: the Cooper Philosophy. - Teo Mora; Emmanuela Orsini (Gröbner Bases, Coding, and Cryptography, 2009)

Computing the distance distribution of systematic non-linear codes - Eleonora Guerrini; Emmanuela Orsini; Massimiliano Sala (CoRR, 2009)

Between a Rock and a Hard Place: Interpolating Between MPC and FHE. - Ashish Choudhury; Jake Loftus; Emmanuela Orsini; Arpita Patra; Nigel P. Smart (IACR Cryptol. ePrint Arch., 2013)

Dishonest Majority Multi-Party Computation for Binary Circuits. - Enrique Larraia; Emmanuela Orsini; Nigel P. Smart (IACR Cryptol. ePrint Arch., 2014)

Bootstrapping BGV Ciphertexts With A Wider Choice of p and q. - Emmanuela Orsini; Joop van de Pol; Nigel P. Smart (IACR Cryptol. ePrint Arch., 2014)

Linear Overhead Robust MPC with Honest Majority Using Preprocessing. - Ashish Choudhury; Emmanuela Orsini; Arpita Patra; Nigel P. Smart (IACR Cryptol. ePrint Arch., 2015)

A Unified Approach to MPC with Preprocessing using OT. - Tore Kasper Frederiksen; Marcel Keller; Emmanuela Orsini; Peter Scholl (IACR Cryptol. ePrint Arch., 2015)

Actively Secure OT Extension with Optimal Overhead. - Marcel Keller; Emmanuela Orsini; Peter Scholl (IACR Cryptol. ePrint Arch., 2015)

Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing. - Ashish Choudhury; Emmanuela Orsini; Arpita Patra; Nigel P. Smart (SCN, 2016)

Efficient Secure Multiparty Computation with Identifiable Abort. - Carsten Baum; Emmanuela Orsini; Peter Scholl (IACR Cryptol. ePrint Arch., 2016)

MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer. - Marcel Keller; Emmanuela Orsini; Peter Scholl (IACR Cryptol. ePrint Arch., 2016)

Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection. - Michele Orrù; Emmanuela Orsini; Peter Scholl (IACR Cryptol. ePrint Arch., 2016)

Bootstrapping BGV ciphertexts with a wider choice of p and q. - Emmanuela Orsini; Joop van de Pol; Nigel P. Smart (IET Inf. Secur., 2016)

Tightly Secure Ring-LWE Based Key Encapsulation with Short Ciphertexts. - Martin R. Albrecht; Emmanuela Orsini; Kenneth G. Paterson; Guy Peer; Nigel P. Smart (IACR Cryptol. ePrint Arch., 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 001 (IACR Cryptol. ePrint Arch., 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)

Secure Oblivious Transfer from Semi-Commutative Masking. - Cyprien Delpech de Saint Guilhem; Emmanuela Orsini; Christophe Petit 001; Nigel P. Smart (IACR Cryptol. ePrint Arch., 2018)

Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT). - Carmit Hazay; Emmanuela Orsini; Peter Scholl; Eduardo Soria-Vazquez (IACR Cryptol. ePrint Arch., 2018)

Zaphod: Efficiently Combining LSSS and Garbled Circuits in SCALE. - Abdelrahaman Aly; Emmanuela Orsini; Dragos Rotaru; Nigel P. Smart; Tim Wood 003 (IACR Cryptol. ePrint Arch., 2019)

BBQ: Using AES in Picnic Signatures. - Cyprien Delpech de Saint Guilhem; Lauren De Meyer; Emmanuela Orsini; Nigel P. Smart (IACR Cryptol. ePrint Arch., 2019)

Overdrive2k: Efficient Secure MPC over Z2k from Somewhat Homomorphic Encryption. - Emmanuela Orsini; Nigel P. Smart; Frederik Vercauteren (IACR Cryptol. ePrint Arch., 2019)

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 001; Nigel P. Smart (CANS, 2020)

Overdrive2k: Efficient Secure MPC over $ mathbb {Z}_{2^k}$ from Somewhat Homomorphic Encryption. - Emmanuela Orsini; Nigel P. Smart; Frederik Vercauteren (CT-RSA, 2020)

Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability. - Carsten Baum; Emmanuela Orsini; Peter Scholl; Eduardo Soria-Vazquez (IACR Cryptol. ePrint Arch., 2020)

Compilation of Function Representations for Secure Computing Paradigms. - Karim Baghery; Cyprien Delpech de Saint Guilhem; Emmanuela Orsini; Nigel P. Smart; Titouan Tanguy (IACR Cryptol. ePrint Arch., 2021)

Banquet: Short and Fast Signatures from AES. - Carsten Baum; Cyprien Delpech de Saint Guilhem; Daniel Kales; Emmanuela Orsini; Peter Scholl; Greg Zaverucha (IACR Cryptol. ePrint Arch., 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 (IACR Cryptol. ePrint Arch., 2021)

Error Term Checking: Towards Chosen Ciphertext Security without Re-encryption. - Jan-Pieter D'Anvers; Emmanuela Orsini; Frederik Vercauteren (IACR Cryptol. ePrint Arch., 2021)

Limbo: Efficient Zero-knowledge MPCitH-based Arguments. - Cyprien Delpech de Saint Guilhem; Emmanuela Orsini; Titouan Tanguy (IACR Cryptol. ePrint Arch., 2021)

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 (J. Cryptol., 2021)

Four-Round Black-Box Non-malleable Schemes from One-Way Permutations. - Michele Ciampi; Emmanuela Orsini; Luisa Siniscalchi (TCC (2), 2022)

Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs. - Carsten Baum; Robin Jadoul; Emmanuela Orsini; Peter Scholl; Nigel P. Smart (IACR Cryptol. ePrint Arch., 2022)

Scooby: Improved Multi-Party Homomorphic Secret Sharing Based on FHE. - Ilaria Chillotti; Emmanuela Orsini; Peter Scholl; Nigel P. Smart; Barry Van Leeuwen (IACR Cryptol. ePrint Arch., 2022)

Four-Round Black-Box Non-Malleable Commitments from One-Way Permutations. - Michele Ciampi; Emmanuela Orsini; Luisa Siniscalchi (IACR Cryptol. ePrint Arch., 2022)

Efficient Proof of RAM Programs from Any Public-Coin Zero-Knowledge System. - Cyprien Delpech de Saint Guilhem; Emmanuela Orsini; Titouan Tanguy; Michiel Verbauwhede (IACR Cryptol. ePrint Arch., 2022)

Efficient, Actively Secure MPC with a Dishonest Majority: a Survey. - Emmanuela Orsini (IACR Cryptol. ePrint Arch., 2022)

TinyKeys: A New Approach to Efficient Multi-Party Computation. - Carmit Hazay; Emmanuela Orsini; Peter Scholl; Eduardo Soria-Vazquez (J. Cryptol., 2022)

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 (IMACC, 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 (IACR Cryptol. ePrint Arch., 2023)

ZK-for-Z2K: MPC-in-the-Head Zero-Knowledge Proofs for ℤ2k. - Lennart Braun; Cyprien Delpech de Saint Guilhem; Robin Jadoul; Emmanuela Orsini; Nigel P. Smart; Titouan Tanguy (IACR Cryptol. ePrint Arch., 2023)

MPC With Delayed Parties Over Star-Like Networks. - Mariana Botelho da Gama; Emad Heydari Beni; Emmanuela Orsini; Nigel P. Smart; Oliver Zajonc (IACR Cryptol. ePrint Arch., 2023)

Simple Two-Round OT in the Explicit Isogeny Model. - Emmanuela Orsini; Riccardo Zanotto (IACR Cryptol. ePrint Arch., 2023)

Simple Two-Message OT in the Explicit Isogeny Model. - Emmanuela Orsini; Riccardo Zanotto (IACR Commun. Cryptol., 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 (IACR Cryptol. ePrint Arch., 2024)

Scooby: Improved multi-party homomorphic secret sharing based on FHE. - Ilaria Chillotti; Emmanuela Orsini; Peter Scholl; Barry Van Leeuwen (Inf. Comput., 2024)

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 (CRYPTO (6), 2025)

Black-Box (and Fast) Non-Malleable Zero Knowledge. - Vincenzo Botta; Michele Ciampi; Emmanuela Orsini; Luisa Siniscalchi; Ivan Visconti (IACR Cryptol. ePrint Arch., 2025)

Row Reduction Techniques for n-Party Garbling. - Kelong Cong; Emmanuela Orsini; Erik Pohle; Oliver Zajonc (IACR Cryptol. ePrint Arch., 2025)