Blaze: Fast SNARKs from Interleaved RAA Codes
Martijn Brehm, Binyi Chen, Ben Fisch, Nicolas Resch, Ron D. Rothblum, Hadas Zeilberger
EuroCrypt 2025
About: We introduce a SNARK with linear-time proving costs and polylogarithmic verifier costs. First, we encode the witness using the super efficient, linear time, Repeat-Accumulate-Accumulate (RAA) binary code. Next, we present a transformation from an RAA code to a Reed Solomon code, over which we can use Basefold over RS codes to obtain a polylogarithmic verifier.
Basefold: Efficient Polynomial Commitment Schemes from Foldable Codes
Hadas Zeilberger, Binyi Chen, Ben Fisch
Crypto 2024
(Paper, POC Implementation, Protocol website)
About: We design a new efficient field-agnostic polynomial commitment scheme, which can, for instance, prove signature verification circuits 20x faster than state of the art while maintaining polylogarithmic verifier time and proof size. It also adapts FRI-based SNARKs, a widely used coding-based family of argument systems, to the multilinear setting. To date, it has several follow-up works, and is being used to speed-up SNARKs in various real-world settings.
Traffic Analysis by Adversaries with Partial Visibility
Iness Ben-Guriat, Claudia Diaz, Karim Eldefrawy, Hadas Zeilberger (alphabetical)
ESORICS 2023
(Paper)
About: We introduce a new framework for analyzing the success probability of local adversaries in mix-networks, that have access to some of the mixes in the network (as opposed to ISPs, for example, which have access to the entire network).
Khatam: Reducing the Communication Complexity of Code-Based SNARKs
Hadas Zeilberger
About: We present a new proximity-gaps result that applies in particular to multilinear polynomial commitment schemes. Importantly, this proves that Basefold has the best-possible communication complexity for coding-based SNARKs. Additionally, this result also improves the communication complexity of other coding-based SNARKs, such as Blaze, WHIR, Ligero, Brakedown, and Binius.
Blaze
zkSummit (Upcoming), May 12, 2025
EuroCrypt (Upcoming), May 8, 2025
UPenn Security and Privacy Lab, April 7, 2025
Khatam
CMU Cylab Cryptography Seminar, March 13, 2025
sumcheck builders talk series, December 13, 2024
Basefold
University of Conneticut, Dec. 4, 2024
Zero-Knowledge Proofs From Error Correcting Codes (KU Lueven, October 2023)
Eurocrypt Reviewer: 2025, 2024
Crypto Reviewer 2025, 2024, 2023, 2022
AsiaCrypt Reviewer: 2024
SBC Reviewer: 2024
S&P Reviewer: 2025