Marlin - Preprocessing zkSNARKs with Universal and Updatable SRS

Explore a presentation from Eurocrypt 2020 on Marlin, a novel approach to preprocessing zkSNARKs with Universal and Updatable SRS. Delve into the foundations of succinct non-interactive arguments and verification for circuits before examining the theoretical and implementation contributions of the research. Investigate algebraic holographic proofs, polynomial commitments, and the challenges of verifier scalability. Learn about universal setup, circuit-specific preprocessing, and the prove and verify processes. Gain insights into the properties and methodology of this innovative cryptographic technique, essential for those interested in advanced zero-knowledge proof systems and their applications.

Intro
Succinct Non-Interactive Arguments
Succinct Verification for Circuits
Contributions Part 1: Theory
Contribution Part 3: Implementation
Algebraic Holographic Proofs
Problem: Verifier is linear in circuit siz
Polynomial Commitments
Preprocessing zkSNARKS
Universal Setup
Circuit-specific Preprocessing
Prove and Verify
Properties
Conclusion In this talk: Our methodology