ORSINI, EMMANUELA

ORSINI, EMMANUELA  

Dipartimento di Scienze della Computazione  

Mostra records
Risultati 1 - 20 di 26 (tempo di esecuzione: 0.017 secondi).
Titolo Data di pubblicazione Autore(i) Rivista Editore
Actively secure 1-out-of-N OT extension with application to private set intersection 1-gen-2017 Orrù, Michele; Orsini, Emmanuela; Scholl, Peter - Springer
Banquet: short and fast signatures from AES 1-gen-2021 Baum, Carsten; Delpech de Saint Guilhem, Cyprien; Kales, Daniel; Orsini, Emmanuela; Scholl, Peter; Zaverucha, Greg - Springer
BBQ: using AES in Picnic signatures 1-gen-2020 Delpech de Saint Guilhem, Cyprien; De Meyer, Lauren; Orsini, Emmanuela; Smart, Nigel P. - Springer
Compilation of function representations for secure computing paradigms 1-gen-2021 Baghery, Karim; Delpech de Saint Guilhem, Cyprien; Orsini, Emmanuela; Smart, Nigel P.; Tanguy, Titouan - Springer
Concretely efficient large-scale MPC with active security (or, tinykeys for TinyOT) 1-gen-2018 Hazay, Carmit; Orsini, Emmanuela; Scholl, Peter; Soria-Vazquez, Eduardo - Springer
Efficient constant-round MPC with identifiable abort and public verifiability 1-gen-2020 Baum, Carsten; Orsini, Emmanuela; Scholl, Peter; Soria-Vazquez, Eduardo - Springer
Efficient proof of RAM programs from any public-coin zero-knowledge system 1-gen-2022 Delpech de Saint Guilhem, Cyprien; Orsini, Emmanuela; Tanguy, Titouan; Verbauwhede, Michiel - Springer
Efficient, actively secure MPC with a dishonest majority: a survey 1-gen-2021 Orsini, Emmanuela - Springer
Error term checking: towards chosen ciphertext security without re-encryption 1-gen-2021 D’Anvers, Jan-Pieter; Orsini, Emmanuela; Vercauteren, Frederik - Association for Computing Machinery
Feta: efficient threshold designated-verifier zero-knowledge proofs 1-gen-2022 Baum, Carsten; Jadoul, Robin; Orsini, Emmanuela; Scholl, Peter; Smart, Nigel P. - Association for Computing Machinery
Four-round black-box non-malleable schemes from one-way permutations 1-gen-2022 Ciampi, Michele; Orsini, Emmanuela; Siniscalchi, Luisa - Springer
High-performance multi-party computation for binary circuits based on oblivious transfer 1-gen-2021 Burra, Sai Sheshank; Larraia, Enrique; Nielsen, Jesper Buus; Nordholt, Peter Sebastian; Orlandi, Claudio; Orsini, Emmanuela; Scholl, Peter; Smart, Nigel P. JOURNAL OF CRYPTOLOGY -
Large scale, actively secure computation from LPN and Free-XOR garbled circuits 1-gen-2021 Ben-Efraim, Aner; Cong, Kelong; Omri, Eran; Orsini, Emmanuela; Smart, Nigel P.; Soria-Vazquez, Eduardo - Springer
Limbo: efficient zero-knowledge MPCitH-based arguments 1-gen-2021 Delpech de Saint Guilhem, Cyprien; Orsini, Emmanuela; Tanguy, Titouan - Association for Computing Machinery
MASCOT: faster malicious arithmetic secure computation with oblivious transfer 1-gen-2016 Keller, Marcel; Orsini, Emmanuela; Scholl, Peter - Association for Computing Machinery
MPC With Delayed Parties Over Star-Like Networks 1-gen-2023 Gama, Mariana; Heydari Beni, Emad; Orsini, Emmanuela; Smart, Nigel P.; Zajonc, Oliver - Springer
On the shape of the general error locator polynomial for cyclic codes 1-gen-2017 Caruso, Fabrizio; Orsini, Emmanuela; Sala, Massimiliano; Tinnirello, Claudia IEEE TRANSACTIONS ON INFORMATION THEORY -
Overdrive2k: efficient secure MPC over Z2k from somewhat homomorphic encryption 1-gen-2020 Orsini, Emmanuela; Smart, Nigel P.; Vercauteren, Frederik - Springer
Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-Head 1-gen-2023 Baum, Carsten; Braun, Lennart; de Saint Guilhem, Cyprien Delpech; Klooss, Michael; Orsini, Emmanuela; Roy, Lawrence; Scholl, Peter - Springer
Scooby: Improved Multi-Party Homomorphic Secret Sharing Based on FHE In corso di stampa Chillotti, Ilaria; Orsini, Emmanuela; Scholl, Peter; Paul Smart, Nigel; Van Leeuwen, Barry INFORMATION AND COMPUTATION -