ZKProof 7 Talks: Videos, Slides and Papers
ZKProof 7 took place in Sofia, Bulgaria, on March 23–25, 2025. The program featured 24 accepted papers on zero-knowledge proofs, presented alongside keynotes and invited talks. This page collects every talk from the workshop, grouped by topic.
Each talk has its own page with the video recording, the slides, a link to the accepted paper and a written summary of the talk. Talk pages are being published progressively, and the titles below become links as they go live.
Topics: Proof systems: hash-based, lattice-based and pairing-based SNARKs · Security foundations: Fiat–Shamir, knowledge soundness and composability · Formal verification, zkVMs and tooling · Applications: private delegation, finance, MPC and e-voting
Proof systems: hash-based, lattice-based and pairing-based SNARKs
New and improved SNARK constructions, from Reed–Solomon proximity testing and hash-based arguments to post-quantum folding and short pairing-based proofs.
WHIR: Reed–Solomon Proximity Testing with Super-Fast Verification
Giacomo Fenzi, Alessandro Chiesa (EPFL); Gal Arnon (Weizmann Institute); Eylon Yogev (Bar-Ilan University)
Zinc: a hash-based SNARK without arithmetization overheads
Luca Dall'Ava, Albert Garreta, Katerina Hristova, Hendrik Waldner (Nethermind)
A Crack in the Firmament: Restoring Soundness of the Orion Proof System and More
Thomas den Hollander, Daniel Slamanig (Universität der Bundeswehr München)
Implementing LatticeFold: Advancing Post-Quantum Folding
Ilia Vlasov, Isaac Villalobos, Matthew A. Klein, Marko Čupić, Emanuel S. Vieira, Albert Garreta, Antonio Larriba (Nethermind)
Polymath: Groth16 Is Not The Limit
Helger Lipmaa (University of Tartu)
Recursive Proofs and Private Delegation of zkSNARK Provers from Amortized Holography
Carla Ràfols, Nikitas Paslis (Universitat Pompeu Fabra); Alexandros Zacharakis (No affiliation)
Security foundations: Fiat–Shamir, knowledge soundness and composability
The theory behind deployed SNARKs: Fiat–Shamir security, knowledge soundness of Plonk, universal composability of Groth16 and the security of proof-carrying data.
On the Fiat–Shamir Security of FIOP-Based Succinct Arguments
Alessandro Chiesa, Ziyi Guan, Christian Knabenhans, Zihan Yu (EPFL)
On Knowledge-Soundness of Plonk in ROM from Falsifiable Assumptions
Helger Lipmaa (University of Tartu); Roberto Parisella (Simula UiB); Janno Siim (University of Tartu)
Groth16 is UC-Secure: The Brave New World of Global Generic Groups and UC-Secure Zero-Overhead SNARKs
Jan Bobolz (University of Edinburgh); Pooya Farshim (Durham University, IOG); Markulf Kohlweiss (University of Edinburgh, IOG); Akira Takahashi (JPMorgan AI Research & AlgoCRYPT CoE)
SNARKs for Virtual Machines are Non-Malleable
Matteo Campanelli (Offchain Labs); Antonio Faonio, Luigi Russo (EURECOM)
Security Bounds for Proof-Carrying Data from Straightline Extractors
Alessandro Chiesa, Ziyi Guan (EPFL); Shahar Samocha (StarkWare); Eylon Yogev (Bar-Ilan University)
Relativized Succinct Arguments in the ROM Do Not Exist
Annalisa Barbara (Bocconi University); Alessandro Chiesa, Ziyi Guan (EPFL)
Formal verification, zkVMs and tooling
Verifying zkVMs, rollups, polynomial commitments and constraint systems, plus languages and benchmarks for building correct ZK applications.
Towards a verified Jolt zkVM
James Parker, Ben Hamlin, Benoit Razet, Ben Selfridge, Brett Decker (Galois, Inc.)
Towards a Formal Foundation for Blockchain ZK Rollups
Stefanos Chaliasos (Imperial College London); Denis Firsov (Input Output); Ben Livshits (Imperial College London)
On the Formal Verification of Polynomial Commitment Schemes: the KZG and beyond
Tobias Rothmann (Technical University of Munich (TUM), Arcium)
PLINK: Verified Generation of Constraints for PLONK
Pablo Castellanos, Ignacio Cascudo, Dario Fiore, Niki Vazou (IMDEA Software Institute)
ZK-SecreC: a Domain-Specific Language for Zero-Knowledge Proofs
Raul-Martin Rebane, Peeter Laud (Cybernetica AS)
Using Hax for Correct and Secure Zero-Knowledge Implementations
Lasse Letager Hansen, Bas Spitters, Eske Hoy Nielsen (Aarhus University)
Benchmarking zkVMs: Efficiency, Bottlenecks, and Best Practices
Masato Tsutsumi, Kazue Sako (Waseda University)
Applications: private delegation, finance, MPC and e-voting
Zero-knowledge proofs in practice: private proof delegation, verifiable computation on encrypted data, auditable ledgers for finance, threshold ECDSA and national e-voting.
Blind zkSNARKs for Private Proof Delegation and Verifiable Computation over Encrypted Data
Jannik Spiessens, Jiayi Kang, Frederik Vercauteren (COSIC, KU Leuven); Emad Heydari Beni (Nokia Bell Labs); Mariana Botelho da Gama (COSIC, KU Leuven)
Verifiable Computation for Approximate Homomorphic Encryption Schemes
Daniele Cozzo (IMDEA Software Institute); Anamaria Costache (Norwegian University of Science and Technology (NTNU)); Ignacio Cascudo, Dario Fiore, Antonio Guimarães (IMDEA Software Institute); Eduardo Soria Vazquez (Technology Innovation Institute)
Private, Auditable, and Distributed Ledger for Financial Institutes
Shaltiel Eloul, Yash Satsangi (JP Morgan Chase); Yeoh Wei Zhu (CISPA Helmholtz Center/JP Morgan Chase)
Application of ZK Proofs to MPC: Round-Optimized 2PC ECDSA at the Cost of only 1 OLE
Michael Adjedj, Constantin Blokh (Fireblocks); Geoffroy Couteau (CNRS, IRIF); Antoine Joux (CISPA Helmholtz Center for Information Security); Nikolaos Makriyannis (Fireblocks)
zkVoting: Zero-knowledge proof based coercion-resistant and E2E verifiable e-voting system and its application to national election commission of the Republic of Korea
Seongho Park (Hanyang University); Jaekyoung Choi (Zkrypto); Jihye Kim (Kookmin University); Hyunok Oh (Hanyang University)
More from ZKProof 7
See the speakers, program committee, photos and venue of ZKProof 7, or explore talks from other ZKProof workshops.
