Milestone & High-Impact Papers in Zero-Knowledge Proof History

Abstract

Zero-knowledge proofs (ZKPs) have evolved from foundational interactive proof systems to highly efficient, scalable, and trusted-setup-free constructions powering today’s privacy-preserving and blockchain applications. The field began with the seminal works of Goldwasser, Micali, and Rackoff (GMR) and Goldreich, Micali, Wigderson (GMW) in the 1980s, which introduced interactive proofs, knowledge complexity, and showed that all NP languages admit zero-knowledge proofs. The 1990s brought non-interactive ZK (NIZK) via the CRS model (Blum–Feldman–Micali) and practical sigma-protocols like Schnorr proofs, establishing foundational tools still used today. From the 2000s through early 2010s, research integrated pairings, PCPs, and cryptographic soundness, culminating in pairing-based NIZKs and early succinct argument systems. The SNARK revolution accelerated with QAP-based zk-SNARKs (Gennaro–Gentry–Parno), practical implementations like Pinocchio and libsnark, and the highly efficient Groth16 proving system that became a blockchain standard. Since 2018, the field has shifted toward transparent, universal, and post-quantum-secure systems. Innovations include Bulletproofs (short proofs without trusted setup), zk-STARKs (scalable and PQ-secure), PLONK (universal/updatable setup), and Halo/Halo2 enabling recursive proofs without trusted setup. These advances underpin modern Zcash deployments, zk-rollups, and privacy-preserving scaling systems across Web3. Overall, the ZKP landscape has progressed from theoretical constructs to practical, scalable, and secure systems central to modern cryptography and decentralized computation.