4th ZKProof Workshop (Home Edition)
2021-04-19..2021-04-29
-- online --
who it's for
zero-knowledge researchers, cryptographers, protocol engineers, library implementers, rust developers, security engineers, blockchain developers
topics
MPC-in-the-head protocols; inner product arguments; vector-OLE commitments; zkSNARKs without trusted setup; sum-check based SNARKs; commit-and-prove systems; SRS ceremony frameworks; arkworks SNARK development; Leo language for ZK; Groth16 aggregation; recursive verifiability and accumulation; ring-arithmetic SNARKs
| title | author | length |
|---|---|---|
| Distributed Zero-Knowledge Proofs and Applications to Secure Computation | Elette Boyle | 51m |
Introduces a construction of fully linear PCP/IOP tools that let a prover give a proof split as additive shares to multiple verifiers, using secret sharing… | ||
| Leo: A Programming Language for Formally Verified, ZK Applications | Howard Wu, Collin Chin | 52m |
Leo claims a language that compiles ZK apps with mechanically checked compiler passes: a Rust compiler (≈65k LOC, 12 contributors) converts source to an ASG… | ||
| Closing Remarks for #ZKProof4 | Daniel Benarroch, Eran Tromer | 14m |
Attendees run a live unmute experiment to surface one-word expectations, then focus on concrete next steps: turn proposal feedback into updated papers within… | ||
| Recent progress in MPC-in-the-Head protocols | Emmanuela Orsini | 23m |
Describes an MPC-in-the-Head pipeline that compiles a two-step client-server MPC into a zero-knowledge IOP with linear prover and linear communication, claims… | ||
| Inner Product Arguments | Mary Maller | 18m |
Survey of inner product arguments that pin down what changes: a 2016 breakthrough yields a logarithmic proof size inner product protocol in discrete-log groups… | ||
| Scalable Zero-Knowledge Protocols From Vector-OLE | Peter Scholl | 22m |
Uses vector-OLE as the core primitive to get information‑theoretic homomorphic MACs that act as tiny interactive commitments, and builds a commit‑and‑prove… | ||
| High-Speed zkSNARKs without Trusted Setup | Srinath Setty | 25m |
Claims a family of zkSNARKs that needs no trusted setup and achieves sub-linear verification and tiny proofs by combining the sum‑check protocol with… | ||
| Writathon: ZKProof Community Reference (ZkpComRef) 2021 | Daniel, Luis, Eran | 25m |
ZkpComRef is a live collaborative reference moving from version 0.2 toward 0.3 with an editorial push: editors consolidate the taxonomy into four new sections… | ||
| ZK Tutorial: An Introduction to SNARK Development with arkworks | Pratyush Mishra | 19m |
Builds a simple zero‑knowledge rollup using the arkworks Rust ecosystem, showing complete circuit writing, gadgets for signatures/hashes/merkle trees, and how… | ||
| Framework for Snarky Ceremonies | Mikhail Volkhov | 58m |
A concrete framework defines ceremony structure, models the two‑phase MPC that produces an SRS, and proves Groth16+BGW/BGM17 security in the algebraic group +… | ||
| Formal security analysis of MPC-in-the-headzero-knowledge protocols | Nikolaj Sidorenco | 53m |
Formal claim: define a reusable decomposition interface for MPC-in-the-head, move sigma-protocol soundness into the MPC layer, and prove a generic… | ||
| Commit-and-Prove Zero-Knowledge Proof Systems and Extensions | Jiwon Lee | 59m |
Proposal defines a standard for commit-and-prove and its encryption extension, provides a reference doc and asks the working group to pick concrete… | ||
| Verification Dilemmas, Law, and the Promise of Zero-Knowledge Proofs | Shafi Goldwasser | 54m |
Defines a formal notion called PAC verification and gives constructive protocols and lower bounds showing verification can be strictly easier than learning… | ||
| Practical Groth16 Aggregation | Anca Nitulescu, Nicolas Gailly | 57m |
Proposes a practical Groth16 aggregation that collapses many SNARKs into a logarithmic-size aggregation and reduces verifier work from O(n) to O(log n). Adapts… | ||
| An Algebraic Framework for Universal and Updatable zkSNARKs | Arantxa Zapico | 01h 05m |
Claims an algebraic decomposition that builds updatable, universal zkSNARKs by splitting circuit satisfiability into three concrete pieces: Hadamard product… | ||
| Pushing the Limits of Zero Knowledge Applications | Joshua Baron | 43m |
DARPA's CIV program funds concrete progress: zero-knowledge proof of vulnerability now runs on an MSP430-style microcontroller with exploits proved in 30–360s… | ||
| SNARKs from the sum-check protocol | Justin Thaler | 20m |
Explains how the sum-check protocol underpins a three-step snark design: produce a polynomial IOP + polynomial commitment, apply Fiat–Shamir, and get a… | ||
| Proofs of proofs: incremental verifiability from recursion and accumulation | Nick Spooner | 27m |
Builds incremental verifiability for t‑step computations by three concrete paradigms: starting from SNARKs with subliminal verification (needs a strong… | ||
| Sigma Protocols | Michele Orru | 55m |
Proposal targets standardizing Sigma protocols for prime-order groups and non‑interactive proofs via Fiat‑Shamir, prescribing concrete hashes and encodings… | ||
| Rinocchio: SNARKs for Ring Arithmetic | Anca Nitulescu | 01h 00m |
Proposal adapts preprocessing SNARK machinery to computations over rings instead of fields by defining Quadratic Ring Programs and an evaluation strategy that… | ||
| Panel Discussion: The Challenges and Best Practices of Deploying Zero-Knowledge Proofs | Pratyush Mishra, Jordi Baylina, Zac Williamson, Daira Hopwood, Izaak Meckler | 01h 26m |
Panelists report real deployments: a private rollup on Ethereum using recursive zk-SNARKs (Aztec’s PLONK-style system), Hermez running payments on Groth16, and… | ||
| nothing matches | ||