Emmanuela Orsini
LightNews LightNews
banner
emmanuelaorsini.bsky.social
Emmanuela Orsini
@emmanuelaorsini.bsky.social
160 followers 150 following 3 posts
Posts Replies Media Videos
Reposted by Emmanuela Orsini
dfaranha.bsky.social
Well, this horrible idea refuses to die so we should refuse to let it pass and start organizing again.

ec.europa.eu/commission/p...
Commission presents Roadmap for effective and lawful access to data for law enforcement
The European Commission presented today a Roadmap setting out the way forward to ensure law enforcement authorities in the EU have effective and lawful access to data.
ec.europa.eu
July 5, 2025 at 5:25 PM
Reposted by Emmanuela Orsini
mkskeller.bsky.social
Researchers at the Chinese Academy of Sciences implemented OT on FPGAs and made MASCOT up to 600 times faster: ojs.ub.rub.de/index.php/TC...
POTA: A Pipelined Oblivious Transfer Acceleration Architecture for Secure Multi-Party Computation | IACR Transactions on Cryptographic Hardware and Embedded Systems
ojs.ub.rub.de
June 14, 2025 at 4:21 AM
Reposted by Emmanuela Orsini
acelli.bsky.social
Join us for Theory Day 2025!

We’re hosting a one-day theory workshop at Bocconi featuring a great lineup of speakers covering exciting topics in TCS. Great opportunity to hear some fantastic talks and connect!

📅 June 17 2025 @ Bocconi University, Milan
May 20, 2025 at 12:56 PM
emmanuelaorsini.bsky.social
Our paper on row reduction for multiparty garbling is finally out! It will be presented at Crypto 2025.
eprint.ing.bot ePrint Updates @eprint.ing.bot · May 12
Row Reduction Techniques for n-Party Garbling (Kelong Cong, Emmanuela Orsini, Erik Pohle, Oliver Zajonc) ia.cr/2025/829
Abstract. Recent advancements in maliciously secure garbling have significantly improved the efficiency of constant-round multi-party computation. Research in the field has primarily focused on reducing communication complexity through row reduction techniques and improvements to the preprocessing phase with the use of simpler correlations. In this work, we present two contributions to reduce the communication complexity of state of the art multi-party garbling with an arbitrary number of corruptions. First, we show how to achieve full row reduction for n-party garbled circuits in HSS17-style protocols (Hazay et al., Asiacrypt’17 & JC’20) and authenticated garbling (Yang et al., CCS’20), reducing the size of the garbled circuit by 25% from 4nκ to 3nκ and from (4n−6)κ to 3(n−1)κ bits per AND gate, respectively. Achieving row reduction in multi-party garbling has been an open problem which was partly addressed by the work of Yang et al. for authenticated garbling. In our work, we show a full row reduction for both garbling approaches, thus addressing this open problem completely. Second, drawing inspiration from the work of Dittmer et al. (Crypto 2022), we propose a new preprocessing protocol to obtain the required materials for the garbling phase using large field triples that can be generated with sublinear communication. The new preprocessing significantly reduces the communication overhead of garbled circuits. Our optimizations result in up to a 6× reduction in communication compared to HSS17 and a 2.2× reduction over the state of the art authenticated garbling of Yang et al. for 3 parties in a circuit with 10 million AND gates. Image showing part 2 of abstract.
May 12, 2025 at 7:42 AM
Reposted by Emmanuela Orsini
eprint.ing.bot
Black-Box (and Fast) Non-Malleable Zero Knowledge (Vincenzo Botta, Michele Ciampi, Emmanuela Orsini, Luisa Siniscalchi, Ivan Visconti) ia.cr/2025/432
Abstract. Non-malleable zero-knowledge (NMZK), originally introduced in the seminal work of Dolev, Dwork, and Naor (STOC 91), is a fundamental concept for modeling the security of proof systems against man-in-the-middle attacks. Recently, Kim, Liang, and Pandey (CRYPTO 2022) presented the first efficient constant-round NMZK argument system based solely on symmetric-key cryptography. Their construction relies on a non-black-box use of the involved cryptographic primitives and on multiple executions of Ligero (CCS 2017) that affect both the round complexity and the computational efficiency of their protocol. Their work left open the natural important challenge of achieving NMZK using the underlying primitives only in a black-box fashion (regardless of the number of rounds and actual efficiency). In this paper, we solve the aforementioned open problem by presenting the first NMZK argument system based on the black-box use of cryptographic primitives. Our work is optimal in the use of primitives since we only need one-way functions, and asymptotically optimal in the number of rounds since we only require a constant number of rounds. Our argument system is non-malleable with respect to the strong “simulation-extractability” flavor of non-malleability. Furthermore, we also show that our construction can be efficiently instantiated in Minicrypt, significantly improving upon the work of Kim et al., both in terms of round complexity and computational efficiency. Image showing part 2 of abstract.
March 6, 2025 at 10:35 PM
emmanuelaorsini.bsky.social
Check out FAEST updates. Thank you to all the team!!
cryptocarsten.bsky.social Carsten Baum @cryptocarsten.bsky.social · Feb 25
I'm happy to share some updates on the FAEST round 2 digital signature algorithm:
- we have achieved substantially smaller signatures
- at the same time, the new sign/verify algorithms achieve more competitive performance
February 25, 2025 at 6:04 PM
Reposted by Emmanuela Orsini
eprint.ing.bot
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) ia.cr/2024/490
Abstract. The use of MPC-in-the-Head (MPCitH)-based zero-knowledge proofs of knowledge (ZKPoK) to prove knowledge of a preimage of a one-way function (OWF) is a popular approach towards constructing efficient post-quantum digital signatures. Starting with the Picnic signature scheme, many optimized MPCitH signatures using a variety of (candidate) OWFs have been proposed. Recently, Baum et al. (CRYPTO 2023) showed a fundamental improvement to MPCitH, called VOLE-in-the-Head (VOLEitH), which can generically reduce the signature size by at least a factor of two without decreasing computational performance or introducing new assumptions. Based on this, they designed the FAEST signature which uses AES as the underlying OWF. However, in comparison to MPCitH, the behavior of VOLEitH when using other OWFs is still unexplored. In this work, we improve a crucial building block of the VOLEitH and MPCitH approaches, the so-called all-but-one vector commitment, thus decreasing the signature size of VOLEitH and MPCitH signature schemes. Moreover, by introducing a small Proof of Work into the signing procedure, we can improve the parameters of VOLEitH (further decreasing signature size) without compromising the computational performance of the scheme. Based on these optimizations, we propose three VOLEitH signature schemes FAESTER, KuMQuat, and MandaRain based on AES, MQ, and Rain, respectively. We carefully explore the parameter space for these schemes and implement each, showcasing their performance with benchmarks. Our experiments show that these three signature schemes outperform MPCitH-based competitors that use comparable OWFs, in terms of both signature size and signing/verification time. Image showing part 2 of abstract.
March 27, 2024 at 6:04 PM
emmanuelaorsini.bsky.social
The TCC '24 PC is up with the cfp

tcc.iacr.org/2024/
March 27, 2024 at 4:16 PM