Giacomo Fenzi
@giacomofenzi.bsky.social
PhD student @EPFL, previously @ETH
Interested in cryptography at large, post quantum and interactive proofs in particular.
Interista alla Prisco.
Interested in cryptography at large, post quantum and interactive proofs in particular.
Interista alla Prisco.
Pinned
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
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
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
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
November 13, 2025 at 10:11 AM
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
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
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...
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...
August 14, 2025 at 2:36 PM
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...
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...
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
w/ my wonderful coauthor Yuwen Zhang.
ia.cr/2025/1446
August 12, 2025 at 10:52 PM
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
w/ my wonderful coauthor Yuwen Zhang.
ia.cr/2025/1446
Reposted by Giacomo Fenzi
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.
If you're in Seattle, come to our talk given by Chengsong, one of the students I mentored for this paper.
August 11, 2025 at 3:44 PM
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.
If you're in Seattle, come to our talk given by Chengsong, one of the students I mentored for this paper.
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
🧵👇
🧵👇
July 22, 2025 at 4:03 PM
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
🧵👇
🧵👇
Reposted by Giacomo Fenzi
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
lattirust
Lattice zero-knowledge/succinct arguments, and more - lattirust
github.com
May 20, 2025 at 2:55 PM
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
Reposted by Giacomo Fenzi
Linear-Time Accumulation Schemes (Benedikt Bünz, Alessandro Chiesa, Giacomo Fenzi, William Wang) ia.cr/2025/753
May 3, 2025 at 8:13 PM
Linear-Time Accumulation Schemes (Benedikt Bünz, Alessandro Chiesa, Giacomo Fenzi, William Wang) ia.cr/2025/753
🪄✨ 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)
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)
April 28, 2025 at 11:05 AM
🪄✨ 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)
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)
Reposted by Giacomo Fenzi
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
#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
March 18, 2025 at 1:20 AM
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
#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
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!
February 25, 2025 at 5:06 PM
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!
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? 🧵
Why is this important? 🧵
December 19, 2024 at 11:41 AM
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? 🧵
Why is this important? 🧵
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)!
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)!
Lova 💕 (aka lattice Nova): Duc Tu Pham, @giacomofenzi.bsky.social, Ngoc Khanh Nguyen
and I built a folding scheme from (unstructured) lattice assumptions, which will be presented at Asiacrypt this week! (1/8)
and I built a folding scheme from (unstructured) lattice assumptions, which will be presented at Asiacrypt this week! (1/8)
December 9, 2024 at 2:53 PM
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)!
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)!