Khatam: Proximity Gaps in Multilinear IOPs for All Linear Codes
Hadas Zeilberger
Crypto 2026 (to appear)
About: We present a new proximity gaps result for multilinear polynomial commitment schemes. It decreases the proof size of field-agnostic hash-based SNARKs by a factor of 2.
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 by a handful of companies.
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).