Emmanuela Orsini

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Row reduction techniques for \(n\)-party garbling2026-02-04Paper
Shorter, tighter, FAESTer: optimizations and improved (QROM) analysis for VOLE-in-the-head signatures2026-01-28Paper
Black-box (and fast) non-malleable zero knowledge2024-12-13Paper
MPC with delayed parties over star-like networks2024-08-30Paper
ZK-for-Z2K: MPC-in-the-head zero-knowledge proofs for \(\mathbb{Z}_{2^k}\)2024-08-30Paper
Scooby: improved multi-party homomorphic secret sharing based on FHE
Information and Computation
2024-03-27Paper
Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
Advances in Cryptology – CRYPTO 2023
2024-02-06Paper
Four-round black-box non-malleable schemes from one-way permutations
Theory of Cryptography
2023-08-14Paper
Scooby: improved multi-party homomorphic secret sharing based on FHE
Lecture Notes in Computer Science
2023-07-25Paper
Efficient proof of RAM programs from any public-coin zero-knowledge system
Lecture Notes in Computer Science
2023-07-25Paper
Semi-commutative Masking: A Framework for Isogeny-Based Protocols, with an Application to Fully Secure Two-Round Isogeny-Based OT2023-03-22Paper
Efficient constant-round MPC with identifiable abort and public verifiability2022-11-09Paper
Tightly secure ring-LWE based key encapsulation with short ciphertexts2022-08-25Paper
Faster secure multi-party computation of AES and DES using lookup tables2022-07-01Paper
TinyKeys: a new approach to efficient multi-party computation
Journal of Cryptology
2022-04-11Paper
Banquet: short and fast signatures from AES2021-12-21Paper
Compilation of function representations for secure computing paradigms2021-12-20Paper
Large scale, actively secure computation from LPN and free-XOR garbled circuits2021-12-08Paper
Efficient, actively secure MPC with a dishonest majority: a survey2021-10-04Paper
High-performance multi-party computation for binary circuits based on oblivious transfer
Journal of Cryptology
2021-08-10Paper
Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption2020-08-05Paper
BBQ: using AES in Picnic signatures2020-07-21Paper
TinyKeys: a new approach to efficient multi-party computation
Lecture Notes in Computer Science
2020-06-30Paper
Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)2019-01-23Paper
On the Shape of the General Error Locator Polynomial for Cyclic Codes
IEEE Transactions on Information Theory
2018-09-19Paper
Actively secure 1-out-of-\(N\) OT extension with application to private set intersection
Topics in Cryptology – CT-RSA 2017
2017-04-12Paper
Efficient secure multiparty computation with identifiable abort
Theory of Cryptography
2016-12-21Paper
Linear overhead optimally-resilient robust MPC using preprocessing
Lecture Notes in Computer Science
2016-10-21Paper
A Unified Approach to MPC with Preprocessing Using OT
Advances in Cryptology -- ASIACRYPT 2015
2016-06-10Paper
Actively secure OT extension with optimal overhead
Lecture Notes in Computer Science
2015-12-10Paper
Bootstrapping BGV ciphertexts with a wider choice of \(p\) and \(q\)
Lecture Notes in Computer Science
2015-08-27Paper
Dishonest majority multi-party computation for binary circuits
Advances in Cryptology – CRYPTO 2014
2014-08-07Paper
Between a rock and a hard place: interpolating between MPC and FHE
Advances in Cryptology - ASIACRYPT 2013
2013-12-10Paper
Improved decoding of affine-variety codes
Journal of Pure and Applied Algebra
2012-10-19Paper
Computing the distance distribution of systematic nonlinear codes
Journal of Algebra and its Applications
2010-05-21Paper
Decoding cyclic codes: the Cooper philosophy
Gröbner Bases, Coding, and Cryptography
2009-12-16Paper
An introduction to linear and cyclic codes
Gröbner Bases, Coding, and Cryptography
2009-12-16Paper
Gröbner bases for the distance distribution of systematic codes
Gröbner Bases, Coding, and Cryptography
2009-12-16Paper
Invited Talk: Decoding Cyclic Codes: The Cooper Philosophy
Mathematical Methods in Computer Science
2009-01-22Paper
General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n &lt; 63$</tex></formula>
IEEE Transactions on Information Theory
2008-12-21Paper
Correcting errors and erasures via the syndrome variety
Journal of Pure and Applied Algebra
2005-06-23Paper


Research outcomes over time


This page was built for person: Emmanuela Orsini