Zero-Knowledge Proof Systems
zk-SNARKs, zk-STARKs, and Bulletproofs.
Zero-Knowledge Proof Systems. zk-SNARKs, zk-STARKs, and Bulletproofs.
Foundations and canonical references
The standard treatments of zero-knowledge proof systems approach the subject from complementary angles. Goldreich, Foundations of Cryptography (2004) is the anchor reference for the subject and lays out the core definitions, theorems, and worked examples that practitioners return to.
Supporting and adjacent work
A number of supporting contributions sharpen specific aspects of zero-knowledge proof systems or connect it to neighbouring problems. The knowledge complexity of interactive proof systems (Goldwasser et al., 1989) contributes to this area as one of the supporting references that inform current practice.
Open methodological questions for zero-knowledge proof systems include sharpening the bridges between foundational theory and computational practice, extending classical results to broader or more structured settings, and integrating the techniques surveyed above with adjacent mathematical disciplines. The references listed in this page are the entry points that current work builds on.
Prerequisites
Sources
- paper · historical · 1989goldwasser-1989, micali-1989, rackoff-1989
- textbook · primary · 2004Foundations of Cryptographygoldreich-2004
In context
Where this topic sits in the prerequisite graph. Click any node to jump.
Review this topic
This page was drafted by an agent and is waiting on expert review. Spotted a wrong prerequisite, a missing concept, a misattributed source, or a factual slip? Tell us — your review opens a tracked issue maintainers act on.