Proofs (Simons Institute)
2025-07-11..2025-07-17
Berkeley, United States
who it's for
zero-knowledge researchers, snark designers, verifiable computation engineers, lattice cryptographers, cryptographic protocol designers, theoretical cryptographers
topics
commitment-based succinct arguments; vector commitments and batching; functional commitments; Fiat-Shamir in standard model; IOP/PCP of proximity; lattice SNARGs from SIS; LWE-based NIZK constructions; incrementally verifiable computation (IVC); batch arguments (BARGs); jagged polynomial commitments; hash-based folding schemes; multilinear zkVMs and zkVM implementation
| title | author | length |
|---|---|---|
| An Introduction to Commitment-Based Succinct Arguments | Alessandro Chiesa | 01h 12m |
Explains a concrete recipe: short arguments come from combining an information‑theoretic probabilistic proof (PCP/IOP) with a cryptographic commitment so that… | ||
| Talk by Alex Lombardi (Princeton University) | Alex Lombardi | 01h 11m |
Provides a concrete path for when Fiat–Shamir is provably safe in the standard model: if the starting protocol has information-theoretic soundness and the hash… | ||
| Functional Commitments | Pratyush Mishra | 01h 00m |
Defines functional commitments (commit, local opening, check) and proves two security tiers: function binding (local consistency) vs stronger extractability… | ||
| Incremental proof systems | Benedikt Bunz | 01h 02m |
Defines IVC and PCD and claims they can be built without full SNARKs by using accumulation schemes plus a homomorphic vector commitment (Pedersen-like), so the… | ||
| Error-Correcting Codes That Enable Efficient SNARKs | Hadas Zeilberger | 01h 00m |
Claim: building SNARKs from linear error-correcting codes yields very fast provers (operations limited to field add/mul and hashes) and plausible post‑quantum… | ||
| SP1 Hypercube and the Jagged PCS | Ron D. Rothblum | 01h 07m |
SP1 Hypercube is a multilinear-based zkVM that implements a new jagged polynomial commitment to pack many opcode-specific tables into one sparse encoding… | ||
| SNARGs for P/poly from SIS | Hoeteck Wee | 58m |
New lattice construction gives SNARGs for P/poly from SIS (no random oracles) by building functional commitments that compress GSW-style encryptions into a… | ||
| A New Approach for Non-Interactive Zero-Knowledge from Learning with Errors | Brent Waters | 33m |
New result builds a concrete LWE-based hidden bits generator that yields NIZKs with a dual-mode CRS (statistically binding versus computationally hiding) using… | ||
| A Zero-Knowledge PCP Theorem | Nicholas Spooner | 01h 13m |
Claims a constructive method that achieves polynomial-size proofs for every NP language whose verifier makes constant-query verification while leaking nothing… | ||
| Towards a White-Box Secure Fiat-Shamir Transformation | Gal Arnon | 01h 03m |
Proposes XFS, an extended Fiat–Shamir that inserts a short, efficiently-verified proof-of-work so the circuit cannot compute the Fiat–Shamir challenge itself… | ||
| Batch Arguments and Their Applications | Omer Paneth | 01h 10m |
Defines batch arguments (BARGs) as short proofs that jointly certify k NP statements with succinctness that grows with one instance but not k, and shows how… | ||
| Towards SNARGs for NP from Standard Assumptions | Zhengzhong Jin | 01h 08m |
Constructs a SNARG that, under LWE, handles any NP instance whose non‑membership has a polynomial‑size Extended Frege (propositional) proof: uses FHE of the… | ||
| Succinct Non-interactive Arguments of Proximity | Daniel Wichs | 01h 02m |
Constructs succinct noninteractive arguments of proximity (SNAPs) with tight parameters: adaptive SNAPs for P achieve O(n^{1/2}) proof length, verifier query… | ||
| Incrementally Verifiable Computation for NP from Standard Assumptions | Surya Mathialagan | 01h 08m |
Construction shows two concrete IVC routes: one uses subexponential iO + LWE (or bilinear maps) plus rate‑1 BARGs and complexity leveraging to get proofs of… | ||
| Tree PCPs | Tamer Mour | 01h 02m |
Introduces a new object called tree PCPs and constructs them for nondeterministic space-s computations, where each time step appends only poly(s, log t) bits… | ||
| An introduction to lattice-based folding schemes | Binyi Chen | 01h 06m |
Claims a lattice-based folding pipeline that yields post-quantum security plausibly and provers that run in about n·λ·log d field multiplications (highly… | ||
| Hash-based Folding Schemes | William Wang | 52m |
Introduces interactive oracle reductions and a hash-based recipe using Merkle commitments plus Fiat–Shamir to compile IORs into succinct folding reductions… | ||
| VerITAS: Verifying Image Transformations at Scale | Trisha Datta | 31m |
VerITAS proves that a published edited image derives from a signed original for realistically large photos (≈30 megapixels, 90 MB), using zk-SNARKs (Plonky2 +… | ||
| Accountable AI with ZKPs: Certifying Fairness and Explanations under model Confidentiality | Chhavi Yadav | 29m |
System builds a model commitment and produces per-query proofs of inference and explanation using zero-knowledge techniques, integrating the EZKL backend. LIME… | ||
| Twist and Shout: Fast, Simple Memory Arguments | Justin Thaler | 01h 12m |
Two new memory-checking arguments, Twist and Shout, turn lookup-heavy proofs into practical zkVM plumbing: Shout gives a batch-evaluation/lookup protocol with… | ||
| Collaborative zk-SNARKs: Proving as One over Distributed Secrets | Aarushi Goel | 56m |
Shows that secret‑sharing MPCs that are secure up to additive attacks can already yield a weak malicious guarantee called L‑malicious security, and because… | ||
| nothing matches | ||