Emmanuela Orsini

发表

MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer

Marcel Keller, Emmanuela Orsini, Peter Scholl, 2016, IACR Cryptol. ePrint Arch..

NewHope Algorithm Specifications and Supporting Documentation

Martin R. Albrecht, Joppe W. Bos, K. Paterson, 2017 .

Correcting errors and erasures via the syndrome variety

M. Sala, Emmanuela Orsini, 2005 .

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

Sai Sheshank Burra, N. Smart, J. Nielsen, 2021, Journal of Cryptology.

TinyKeys: A New Approach to Efficient Multi-Party Computation

Emmanuela Orsini, Peter Scholl, Carmit Hazay, 2022, Journal of Cryptology.

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

Emmanuela Orsini, Michele Ciampi, Luisa Siniscalchi, 2022, IACR Cryptol. ePrint Arch..

Compilation of Function Representations for Secure Computing Paradigms

Emmanuela Orsini, Nigel P. Smart, Cyprien Delpech de Saint Guilhem, 2021, IACR Cryptol. ePrint Arch..

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

Eran Omri, Emmanuela Orsini, Eduardo Soria-Vazquez, 2021, IACR Cryptol. ePrint Arch..

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

Emmanuela Orsini, 2020, WAIFI.

Zaphod: Efficiently Combining LSSS and Garbled Circuits in SCALE

Emmanuela Orsini, Dragos Rotaru, Nigel P. Smart, 2019, IACR Cryptol. ePrint Arch..

Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing

Emmanuela Orsini, Ashish Choudhury, Arpita Patra, 2016, SCN.

Limbo: Efficient Zero-knowledge MPCitH-based Arguments

Emmanuela Orsini, Cyprien Delpech de Saint Guilhem, Titouan Tanguy, 2021, IACR Cryptol. ePrint Arch..

Finding Heaviest k-Subgraphs and Events in Social Media

Maximilien Danisch, Mauro Sozio, Oana Denisa Balalau, 2016, 2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW).

Efficient Secure Multiparty Computation with Identifiable Abort

Emmanuela Orsini, Carsten Baum, Peter Scholl, 2016, IACR Cryptol. ePrint Arch..

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

Emmanuela Orsini, Nigel P. Smart, Claudio Orlandi, 2021, IACR Cryptol. ePrint Arch..

BBQ: Using AES in Picnic Signatures

Emmanuela Orsini, Nigel P. Smart, Lauren De Meyer, 2019, IACR Cryptol. ePrint Arch..

An Introduction to Linear and Cyclic Codes

Emmanuela Orsini, Daniel Augot, Emanuele Betti, 2009, Gröbner Bases, Coding, and Cryptography.

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

Frederik Vercauteren, Emmanuela Orsini, Nigel P. Smart, 2020, CT-RSA.

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

Emmanuela Orsini, Michele Orrù, Peter Scholl, 2017, CT-RSA.

A Unified Approach to MPC with Preprocessing using OT

Marcel Keller, Emmanuela Orsini, Peter Scholl, 2015, IACR Cryptol. ePrint Arch..

Actively Secure OT Extension with Optimal Overhead

Marcel Keller, Emmanuela Orsini, Peter Scholl, 2015, CRYPTO.

Dishonest Majority Multi-Party Computation for Binary Circuits

Emmanuela Orsini, Nigel P. Smart, Enrique Larraia, 2014, IACR Cryptol. ePrint Arch..

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

Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez, 2018, IACR Cryptol. ePrint Arch..

TinyKeys: A New Approach to Efficient Multi-Party Computation

Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez, 2018, IACR Cryptol. ePrint Arch..

Improved decoding of affine-variety codes

Emmanuela Orsini, Massimiliano Sala, Chiara Marcolla, 2011, 1102.4186.

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

Emmanuela Orsini, Ashish Choudhury, Arpita Patra, 2013, IACR Cryptol. ePrint Arch..

Banquet: Short and Fast Signatures from AES

Emmanuela Orsini, Daniel Kales, Carsten Baum, 2021, IACR Cryptol. ePrint Arch..

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

Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, Peter Scholl, 2022, IACR Cryptol. ePrint Arch..

Simple Two-Round OT in the Explicit Isogeny Model

Emmanuela Orsini, Riccardo Zanotto, 2023, IACR Cryptol. ePrint Arch..

Computing the distance distribution of systematic non-linear codes pdf

Emmanuela Orsini, Massimiliano Sala, Eleonora Guerrini, 2009, ArXiv.

MPC With Delayed Parties Over Star-Like Networks

Emad Heydari Beni, N. Smart, Emmanuela Orsini, 2023, IACR Cryptol. ePrint Arch..

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

Marcel Keller, Emmanuela Orsini, Dragos Rotaru, 2017, ACNS.

Overdrive2k: Efficient Secure MPC over Z2k from Somewhat Homomorphic Encryption

Frederik Vercauteren, Emmanuela Orsini, Nigel P. Smart, 2020, IACR Cryptol. ePrint Arch..

Algorithm Speciﬁcations and Supporting Documentation

Martin R. Albrecht, N. Smart, Emmanuela Orsini, 2022 .

Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability

Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez, 2020, IACR Cryptol. ePrint Arch..

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

Emmanuela Orsini, Nigel P. Smart, Christophe Petit, 2020, CANS.

Secure Oblivious Transfer from Semi-Commutative Masking

Emmanuela Orsini, Nigel P. Smart, Christophe Petit, 2018, IACR Cryptol. ePrint Arch..

Edinburgh Research Explorer Four-Round Black-Box Non-malleable Schemes from One-Way Permutations

Emmanuela Orsini, Michele Ciampi, Luisa Siniscalchi, 2022 .

Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs

N. Smart, Emmanuela Orsini, Peter Scholl, 2022, IACR Cryptol. ePrint Arch..