Emmanuela Orsini

85 papers A* 3B 5C 2Misc 4Journal 46Unranked 22

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Shorter, Tighter, FAESTer: Optimizations and Improved (QROM) Analysis for VOLE-in-the-Head Signatures. IACR Cryptol. ePrint Arch. 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
2025	J	`jnl`	Black-Box (and Fast) Non-Malleable Zero Knowledge. IACR Cryptol. ePrint Arch. Vincenzo Botta, Michele Ciampi, Emmanuela Orsini, Luisa Siniscalchi, Ivan Visconti
2025	—	`conf`	Row Reduction Techniques for n-Party Garbling. CRYPTO (4) Kelong Cong, Emmanuela Orsini, Erik Pohle, Oliver Zajonc
2025	J	`jnl`	Row Reduction Techniques for n-Party Garbling. IACR Cryptol. ePrint Arch. Kelong Cong, Emmanuela Orsini, Erik Pohle, Oliver Zajonc
2025	—	`conf`	Shorter, Tighter, FAESTer: Optimizations and Improved (QROM) Analysis for VOLE-in-the-Head Signatures. CRYPTO (6) 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
2024	—	`conf`	Black-Box (and Fast) Non-malleable Zero Knowledge. CRYPTO (9) Vincenzo Botta, Michele Ciampi, Emmanuela Orsini, Luisa Siniscalchi, Ivan Visconti
2024	—	`conf`	One Tree to Rule Them All: Optimizing GGM Trees and OWFs for Post-Quantum Signatures. ASIACRYPT (1) Carsten Baum, Ward Beullens, Shibam Mukherjee, Emmanuela Orsini, Sebastian Ramacher, Christian Rechberger, Lawrence Roy, Peter Scholl
2024	J	`jnl`	One Tree to Rule Them All: Optimizing GGM Trees and OWFs for Post-Quantum Signatures. IACR Cryptol. ePrint Arch. Carsten Baum, Ward Beullens, Shibam Mukherjee, Emmanuela Orsini, Sebastian Ramacher, Christian Rechberger, Lawrence Roy, Peter Scholl
2024	J	`jnl`	Scooby: Improved multi-party homomorphic secret sharing based on FHE. Inf. Comput. Ilaria Chillotti, Emmanuela Orsini, Peter Scholl, Barry Van Leeuwen
2024	J	`jnl`	Simple Two-Message OT in the Explicit Isogeny Model. IACR Commun. Cryptol. Emmanuela Orsini, Riccardo Zanotto
2023	J	`jnl`	MPC With Delayed Parties Over Star-Like Networks. IACR Cryptol. ePrint Arch. Mariana Botelho da Gama, Emad Heydari Beni, Emmanuela Orsini, Nigel P. Smart, Oliver Zajonc
2023	—	`conf`	MPC with Delayed Parties over Star-Like Networks. ASIACRYPT (1) Mariana Gama, Emad Heydari Beni, Emmanuela Orsini, Nigel P. Smart, Oliver Zajonc
2023	J	`jnl`	Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures From VOLE-in-the-Head. IACR Cryptol. ePrint Arch. Carsten Baum, Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Klooß, Emmanuela Orsini, Lawrence Roy, Peter Scholl
2023	—	`conf`	Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-Head. CRYPTO (5) Carsten Baum, Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Klooß, Emmanuela Orsini, Lawrence Roy, Peter Scholl
2023	J	`jnl`	Simple Two-Round OT in the Explicit Isogeny Model. IACR Cryptol. ePrint Arch. Emmanuela Orsini, Riccardo Zanotto
2023	C	`conf`	ZK-for-Z2K: MPC-in-the-Head Zero-Knowledge Proofs for $\mathbb {Z}_{2^k}$. IMACC Lennart Braun, Cyprien Delpech de Saint Guilhem, Robin Jadoul, Emmanuela Orsini, Nigel P. Smart, Titouan Tanguy
2023	J	`jnl`	ZK-for-Z2K: MPC-in-the-Head Zero-Knowledge Proofs for ℤ IACR Cryptol. ePrint Arch. Lennart Braun, Cyprien Delpech de Saint Guilhem, Robin Jadoul, Emmanuela Orsini, Nigel P. Smart, Titouan Tanguy
2022	Misc	`conf`	Efficient Proof of RAM Programs from Any Public-Coin Zero-Knowledge System. SCN Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, Titouan Tanguy, Michiel Verbauwhede
2022	J	`jnl`	Efficient Proof of RAM Programs from Any Public-Coin Zero-Knowledge System. IACR Cryptol. ePrint Arch. Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, Titouan Tanguy, Michiel Verbauwhede
2022	J	`jnl`	Efficient, Actively Secure MPC with a Dishonest Majority: a Survey. IACR Cryptol. ePrint Arch. Emmanuela Orsini
2022	A*	`conf`	Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs. CCS Carsten Baum, Robin Jadoul, Emmanuela Orsini, Peter Scholl, Nigel P. Smart
2022	J	`jnl`	Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. Carsten Baum, Robin Jadoul, Emmanuela Orsini, Peter Scholl, Nigel P. Smart
2022	J	`jnl`	Four-Round Black-Box Non-Malleable Commitments from One-Way Permutations. IACR Cryptol. ePrint Arch. Michele Ciampi, Emmanuela Orsini, Luisa Siniscalchi
2022	—	`conf`	Four-Round Black-Box Non-malleable Schemes from One-Way Permutations. TCC (2) Michele Ciampi, Emmanuela Orsini, Luisa Siniscalchi
2022	J	`jnl`	Scooby: Improved Multi-Party Homomorphic Secret Sharing Based on FHE. IACR Cryptol. ePrint Arch. Ilaria Chillotti, Emmanuela Orsini, Peter Scholl, Nigel P. Smart, Barry Van Leeuwen
2022	Misc	`conf`	Scooby: Improved Multi-party Homomorphic Secret Sharing Based on FHE. SCN Ilaria Chillotti, Emmanuela Orsini, Peter Scholl, Nigel P. Smart, Barry Van Leeuwen
2022	J	`jnl`	TinyKeys: A New Approach to Efficient Multi-Party Computation. J. Cryptol. Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
2021	—	`conf`	Banquet: Short and Fast Signatures from AES. Public Key Cryptography (1) Carsten Baum, Cyprien Delpech de Saint Guilhem, Daniel Kales, Emmanuela Orsini, Peter Scholl, Greg Zaverucha
2021	J	`jnl`	Banquet: Short and Fast Signatures from AES. IACR Cryptol. ePrint Arch. Carsten Baum, Cyprien Delpech de Saint Guilhem, Daniel Kales, Emmanuela Orsini, Peter Scholl, Greg Zaverucha
2021	B	`conf`	Compilation of Function Representations for Secure Computing Paradigms. CT-RSA Karim Baghery, Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, Nigel P. Smart, Titouan Tanguy
2021	J	`jnl`	Compilation of Function Representations for Secure Computing Paradigms. IACR Cryptol. ePrint Arch. Karim Baghery, Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, Nigel P. Smart, Titouan Tanguy
2021	—	`conf`	Error Term Checking: Towards Chosen Ciphertext Security without Re-encryption. APKC@AsiaCCS Jan-Pieter D'Anvers, Emmanuela Orsini, Frederik Vercauteren
2021	J	`jnl`	Error Term Checking: Towards Chosen Ciphertext Security without Re-encryption. IACR Cryptol. ePrint Arch. Jan-Pieter D'Anvers, Emmanuela Orsini, Frederik Vercauteren
2021	J	`jnl`	High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer. J. Cryptol. Sai Sheshank Burra, Enrique Larraia, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, Emmanuela Orsini, Peter Scholl, Nigel P. Smart
2021	—	`conf`	Large Scale, Actively Secure Computation from LPN and Free-XOR Garbled Circuits. EUROCRYPT (3) Aner Ben-Efraim, Kelong Cong, Eran Omri, Emmanuela Orsini, Nigel P. Smart, Eduardo Soria-Vazquez
2021	J	`jnl`	Large Scale, Actively Secure Computation from LPN and Free-XOR Garbled Circuits. IACR Cryptol. ePrint Arch. Aner Ben-Efraim, Kelong Cong, Eran Omri, Emmanuela Orsini, Nigel P. Smart, Eduardo Soria-Vazquez
2021	A*	`conf`	Limbo: Efficient Zero-knowledge MPCitH-based Arguments. CCS Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, Titouan Tanguy
2021	J	`jnl`	Limbo: Efficient Zero-knowledge MPCitH-based Arguments. IACR Cryptol. ePrint Arch. Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, Titouan Tanguy
2020	—	`conf`	Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability. CRYPTO (2) Carsten Baum, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
2020	J	`jnl`	Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability. IACR Cryptol. ePrint Arch. Carsten Baum, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
2020	C	`conf`	Efficient, Actively Secure MPC with a Dishonest Majority: A Survey. WAIFI Emmanuela Orsini
2020	B	`conf`	Overdrive2k: Efficient Secure MPC over $\mathbb {Z}_{2^k}$ from Somewhat Homomorphic Encryption. CT-RSA Emmanuela Orsini, Nigel P. Smart, Frederik Vercauteren
2020	B	`conf`	Semi-commutative Masking: A Framework for Isogeny-Based Protocols, with an Application to Fully Secure Two-Round Isogeny-Based OT. CANS Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, Christophe Petit, Nigel P. Smart
2019	Misc	`conf`	BBQ: Using AES in Picnic Signatures. SAC Cyprien Delpech de Saint Guilhem, Lauren De Meyer, Emmanuela Orsini, Nigel P. Smart
2019	J	`jnl`	BBQ: Using AES in Picnic Signatures. IACR Cryptol. ePrint Arch. Cyprien Delpech de Saint Guilhem, Lauren De Meyer, Emmanuela Orsini, Nigel P. Smart
2019	J	`jnl`	Overdrive2k: Efficient Secure MPC over Z IACR Cryptol. ePrint Arch. Emmanuela Orsini, Nigel P. Smart, Frederik Vercauteren
2019	—	`conf`	Zaphod: Efficiently Combining LSSS and Garbled Circuits in SCALE. WAHC@CCS Abdelrahaman Aly, Emmanuela Orsini, Dragos Rotaru, Nigel P. Smart, Tim Wood
2019	J	`jnl`	Zaphod: Efficiently Combining LSSS and Garbled Circuits in SCALE. IACR Cryptol. ePrint Arch. Abdelrahaman Aly, Emmanuela Orsini, Dragos Rotaru, Nigel P. Smart, Tim Wood
2018	—	`conf`	Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT). ASIACRYPT (3) Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
2018	J	`jnl`	Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT). IACR Cryptol. ePrint Arch. Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
2018	J	`jnl`	Secure Oblivious Transfer from Semi-Commutative Masking. IACR Cryptol. ePrint Arch. Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, Christophe Petit, Nigel P. Smart
2018	—	`conf`	TinyKeys: A New Approach to Efficient Multi-Party Computation. CRYPTO (3) Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
2018	J	`jnl`	TinyKeys: A New Approach to Efficient Multi-Party Computation. IACR Cryptol. ePrint Arch. Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
2017	B	`conf`	Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection. CT-RSA Michele Orrù, Emmanuela Orsini, Peter Scholl
2017	J	`jnl`	Faster Secure Multi-Party Computation of AES and DES Using Lookup Tables. IACR Cryptol. ePrint Arch. Marcel Keller, Emmanuela Orsini, Dragos Rotaru, Peter Scholl, Eduardo Soria-Vazquez, Srinivas Vivek
2017	B	`conf`	Faster Secure Multi-party Computation of AES and DES Using Lookup Tables. ACNS Marcel Keller, Emmanuela Orsini, Dragos Rotaru, Peter Scholl, Eduardo Soria-Vazquez, Srinivas Vivek
2017	J	`jnl`	On the Shape of the General Error Locator Polynomial for Cyclic Codes. IEEE Trans. Inf. Theory Fabrizio Caruso, Emmanuela Orsini, Massimiliano Sala, Claudia Tinnirello
2017	—	`conf`	Tightly Secure Ring-LWE Based Key Encapsulation with Short Ciphertexts. ESORICS (1) Martin R. Albrecht, Emmanuela Orsini, Kenneth G. Paterson, Guy Peer, Nigel P. Smart
2017	J	`jnl`	Tightly Secure Ring-LWE Based Key Encapsulation with Short Ciphertexts. IACR Cryptol. ePrint Arch. Martin R. Albrecht, Emmanuela Orsini, Kenneth G. Paterson, Guy Peer, Nigel P. Smart
2016	J	`jnl`	Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection. IACR Cryptol. ePrint Arch. Michele Orrù, Emmanuela Orsini, Peter Scholl
2016	J	`jnl`	Bootstrapping BGV ciphertexts with a wider choice of IET Inf. Secur. Emmanuela Orsini, Joop van de Pol, Nigel P. Smart
2016	—	`conf`	Efficient Secure Multiparty Computation with Identifiable Abort. TCC (B1) Carsten Baum, Emmanuela Orsini, Peter Scholl
2016	J	`jnl`	Efficient Secure Multiparty Computation with Identifiable Abort. IACR Cryptol. ePrint Arch. Carsten Baum, Emmanuela Orsini, Peter Scholl
2016	Misc	`conf`	Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing. SCN Ashish Choudhury, Emmanuela Orsini, Arpita Patra, Nigel P. Smart
2016	A*	`conf`	MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer. CCS Marcel Keller, Emmanuela Orsini, Peter Scholl
2016	J	`jnl`	MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer. IACR Cryptol. ePrint Arch. Marcel Keller, Emmanuela Orsini, Peter Scholl
2015	—	`conf`	A Unified Approach to MPC with Preprocessing Using OT. ASIACRYPT (1) Tore Kasper Frederiksen, Marcel Keller, Emmanuela Orsini, Peter Scholl
2015	J	`jnl`	A Unified Approach to MPC with Preprocessing using OT. IACR Cryptol. ePrint Arch. Tore Kasper Frederiksen, Marcel Keller, Emmanuela Orsini, Peter Scholl
2015	—	`conf`	Actively Secure OT Extension with Optimal Overhead. CRYPTO (1) Marcel Keller, Emmanuela Orsini, Peter Scholl
2015	J	`jnl`	Actively Secure OT Extension with Optimal Overhead. IACR Cryptol. ePrint Arch. Marcel Keller, Emmanuela Orsini, Peter Scholl
2015	—	`conf`	Bootstrapping BGV Ciphertexts with a Wider Choice of p and q. Public Key Cryptography Emmanuela Orsini, Joop van de Pol, Nigel P. Smart
2015	J	`jnl`	High Performance Multi-Party Computation for Binary Circuits Based on Oblivious Transfer. IACR Cryptol. ePrint Arch. Sai Sheshank Burra, Enrique Larraia, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, Emmanuela Orsini, Peter Scholl, Nigel P. Smart
2015	J	`jnl`	Linear Overhead Robust MPC with Honest Majority Using Preprocessing. IACR Cryptol. ePrint Arch. Ashish Choudhury, Emmanuela Orsini, Arpita Patra, Nigel P. Smart
2015	J	`jnl`	On the shape of the general error locator polynomial for cyclic codes. CoRR Fabrizio Caruso, Emmanuela Orsini, Massimiliano Sala, Claudia Tinnirello
2014	J	`jnl`	Bootstrapping BGV Ciphertexts With A Wider Choice of p and q. IACR Cryptol. ePrint Arch. Emmanuela Orsini, Joop van de Pol, Nigel P. Smart
2014	—	`conf`	Dishonest Majority Multi-Party Computation for Binary Circuits. CRYPTO (2) Enrique Larraia, Emmanuela Orsini, Nigel P. Smart
2014	J	`jnl`	Dishonest Majority Multi-Party Computation for Binary Circuits. IACR Cryptol. ePrint Arch. Enrique Larraia, Emmanuela Orsini, Nigel P. Smart
2013	J	`jnl`	Between a Rock and a Hard Place: Interpolating Between MPC and FHE. IACR Cryptol. ePrint Arch. Ashish Choudhury, Jake Loftus, Emmanuela Orsini, Arpita Patra, Nigel P. Smart
2013	—	`conf`	Between a Rock and a Hard Place: Interpolating between MPC and FHE. ASIACRYPT (2) Ashish Choudhury, Jake Loftus, Emmanuela Orsini, Arpita Patra, Nigel P. Smart
2009	—	`ch.`	An Introduction to Linear and Cyclic Codes. Gröbner Bases, Coding, and Cryptography Daniel Augot, Emanuele Betti, Emmanuela Orsini
2009	J	`jnl`	Computing the distance distribution of systematic non-linear codes CoRR Eleonora Guerrini, Emmanuela Orsini, Massimiliano Sala
2009	—	`ch.`	Decoding Cyclic Codes: the Cooper Philosophy. Gröbner Bases, Coding, and Cryptography Teo Mora, Emmanuela Orsini
2009	—	`ch.`	Gröbner Bases for the Distance Distribution of Systematic Codes. Gröbner Bases, Coding, and Cryptography Eleonora Guerrini, Emmanuela Orsini, Ilaria Simonetti
2008	—	`conf`	Invited Talk: Decoding Cyclic Codes: The Cooper Philosophy. MMICS Teo Mora, Emmanuela Orsini
2007	J	`jnl`	General Error Locator Polynomials for Binary Cyclic Codes With t<=2 and n<63. IEEE Trans. Inf. Theory Emmanuela Orsini, Massimiliano Sala