iiinova — where your digital self keeps evolving

Giacomo Fenzi @giacomofenzi.bsky.social · 02/09/2026

New work out! We (royally) show that Fiat-Shamir transformation is insecure for a class of proof systems for *generated* relations (including variants of commonly deployed protocols for R1CS). A thread to explain where this applies ia.cr/2026/1838

151

Giacomo Fenzi @giacomofenzi.bsky.social · 09/04/2026

We have an update on the proximity prize: a 1m$ initiative to prove or disprove coding theoretic conjectures, with applications to shorter quantum-secure proof systems. We have released the first draft: ia.cr/2026/680 cc Gal Arnon and @danboneh.bsky.social

110

Reposted by Giacomo Fenzi

ePrint Updates @eprint.ing.bot · 08/04/2026

Open Problems in List Decoding and Correlated Agreement (Gal Arnon, Dan Boneh, Giacomo Fenzi) ia.cr/2026/680

Abstract. The Ethereum Foundation recently announced the Proximity Prize which aims to resolve some open problems that play an important role in the design of succinct proof systems. This paper reviews the open problems relevant to the Proximity Prize. We focus on some grand challenges relating to list decoding bounds, proximity gaps, correlated agreement, and mutual correlated agreement,as they relate to proof systems and Reed–Solomon codes. Along the way we survey the known results on these topics.

095

Giacomo Fenzi @giacomofenzi.bsky.social · 15/03/2026

Excited to announce IOPFest: a day to celebrate a decade of advancements in interactive oracle proofs! We have a brilliant lineup: Noor Athamnah, Dan Boneh, Alessandro Chiesa, Pratyush Mishra and William Wang. Also: Rome in May. Need I say more? Details below:

140

Giacomo Fenzi @giacomofenzi.bsky.social · 26/02/2026

New work with Ale and Guy! We present ZO0K 🦓: a family of zero-overhead zero-knowledge hash-based SNARKs, built from interleaved linear codes.

A screenshot of the name of the paper: Zero-Knowledge IOPPs for Constrained Interleaved Codes

130

Giacomo Fenzi @giacomofenzi.bsky.social · 29/12/2025

Super exciting work from Ziyi and Eylon! They construct the first SNARG for NP in the *plain* model (no random oracle) using *only* (subexponential) LWE! Perhaps most surprisingly, the SNARG is one (very clever) instantiation of the classical Killian-Micali construction!

121

Giacomo Fenzi @giacomofenzi.bsky.social · 13/11/2025

We present Tensorswitch🧮: a new nearly optimal hash-based polynomial commitment scheme from tensor codes! Joint work with Benedikt Bünz, Ron Rothblum and @defund.bsky.social 📚: ia.cr/2025/2065

163

Giacomo Fenzi @giacomofenzi.bsky.social · 14/08/2025

Back to actual research… We present a family of space-efficient sumcheck algorithms, and show that they are optimal! 🍹 Joint work with Anubhav, Ale, Elisabetta, @zkproofs.bsky.social, Tushar and Andrew 📚: ia.cr/2025/1473 🧑🏻‍💻: github.com/compsec-epfl...

172

Giacomo Fenzi @giacomofenzi.bsky.social · 12/08/2025

Excited to share the new frontier of reducing hash-based SNARKs proof size: a post-quantum secure lightweight black-box technique to reduce proof size to 60% of the original one! w/ my wonderful coauthor Yuwen Zhang. ia.cr/2025/1446

181

Reposted by Giacomo Fenzi

Miro Haller @mirohaller.bsky.social · 11/08/2025

Our WOOT paper went out of disclosure today. We found 5 attacks on the Master Lock D1000 which allow unauthorized unlocking, bypassing access revocation, forging log entries, and causing DoS. If you're in Seattle, come to our talk given by Chengsong, one of the students I mentored for this paper.

Attack 1 (session replay): An adversary in physical proximity of the lock (without ever having a valid account on the lock) can record the Bluetooth Low Energy (BLE) communication of a whole session and replay it to repeat all executed commands, including unlocking the lock.
Attack 2 (exceeding access): Former guests can continue unlocking the lock after their access has been revoked.
Attack 3 (clock tampering): Malicious guests can adjust the clock time of the smart lock arbitrarily, extending their own access past expiration or locking out all legitimate users.
Attack 4 (audit log tampering): An adversary that only knows the lock’s identifier (which is advertised over BLE) can upload arbitrary audit events to the telemetry server, and prevent legitimate audit events from being uploaded. Hence, the adversary can hide their own activities.
Attack 5 (malformed messages): Without valid access, an adversary can send malformed BLE messages to the lock that make it unresponsive or corrupt memory, which results in a Denial of Service (DoS) for authorized users. A malicious authorized user can even leak the memory of the smart lock.

2103

Giacomo Fenzi @giacomofenzi.bsky.social · 22/07/2025

Excited to share that I've been awarded a research grant from the @ethereum.foundation under the 2025 Academic Grants Round to explore how Ethereum can be made secure against quantum adversaries using hash-based arguments: a critical step for the long-term resilience of the network 🧵👇

A visualization on how signatures and aggregation are used within the Ethereum network: validator agree on a state, they sign and the signatures are then aggregated and propagated to the network.

3160

Reposted by Giacomo Fenzi

Christian Knabenhans @cknabs.bsky.social · 20/05/2025

I'm happy to finally open-source lattirust, a library for lattice-based zero-knowledge/succinct arguments! Lattirust is somewhat like arkworks, but for lattices; and like lattigo, but for arguments. ➔ github.com/lattirust

github.com

lattirust

Lattice zero-knowledge/succinct arguments, and more - lattirust

23216

Reposted by Giacomo Fenzi

ePrint Updates @eprint.ing.bot · 03/05/2025

Linear-Time Accumulation Schemes (Benedikt Bünz, Alessandro Chiesa, Giacomo Fenzi, William Wang) ia.cr/2025/753

Abstract. Proof-carrying data (PCD) is a powerful cryptographic primitive for computational integrity in a distributed setting. State-of-the-art constructions of PCD are based on accumulation schemes (and, closely related, folding schemes).

We present WARP, the first accumulation scheme with linear prover time and logarithmic verifier time. Our scheme is hash-based (secure in the random oracle model), plausibly post-quantum secure, and supports unbounded accumulation depth.

We achieve our result by constructing an interactive oracle reduction of proximity that works with any linear code over a sufficiently large field. We take a novel approach by constructing a straightline extractor that relies on erasure correction, rather than error-tolerant decoding like prior extractors. Along the way, we introduce a variant of straightline round-by-round knowledge soundness that is compatible with our extraction strategy.

052

Giacomo Fenzi @giacomofenzi.bsky.social · 28/04/2025

🪄✨ And for our next trick, choose a code, any code! Introducing WARP 🌀, the first linear-time accumulation scheme. Brought to you by Benedikt Bünz, Alessandro Chiesa, @defund.bsky.social and myself. 📚: ia.cr/2025/753 🧑‍💻: (soon)

A screenshot of the paper name and the authors

184

Reposted by Giacomo Fenzi

Miro Haller @mirohaller.bsky.social · 18/03/2025

The preliminary program for the Cryptographic Applications Workshop (CAW) at Eurocrypt'25 is out. #CAW focuses on the construction and analysis of cryptography built for practice. This thread gives a quick overview; the full program and abstracts are here: caw.cryptanalysis.fun#program

197

Giacomo Fenzi @giacomofenzi.bsky.social · 25/02/2025

Amazing new work by Gal and Eylon on how to securely instantiate the Fiat-Shamir transformation and avoid the recent brilliant diagonalization attack of Rothblum, Khovratovich and Soukhanov!

111

Giacomo Fenzi @giacomofenzi.bsky.social · 19/12/2024

Transparent and post-quantum SNARK verification on Ethereum using WHIR 🌪️! Together with Pierre at EF, we developed a PoC open-source and MIT licensed EVM verifier for WHIR, achieving ~1.5m-2m gas cost for verification. Why is this important? 🧵

132

Giacomo Fenzi @giacomofenzi.bsky.social · 09/12/2024

Our new work Lova 💕 is out! A lattice folding scheme from unstructured lattice assumptions! See @cknabs.bsky.social's thread and blog post for more details, and look forward to Tu's talk at ASIACRYPT this week (thanks in big part to Khanh's aura)!

170