Home > Proof Systems > NIZK-Blum
Non-Interactive Zero-Knowledge and Its Applications¶
Description¶
The genesis paper for non-interactive zero-knowledge proofs. Introduces the Common Reference String (CRS) model in which prover and verifier share a public string to enable non-interactive proofs. Foundational for all SNARK systems that use a trusted setup (CRS).
Technical Characteristics¶
Complexity: - Prover: Polynomial - Verifier: Polynomial - Proof Size: Non-interactive - Setup: trusted (CRS model)
Security: - Assumption: computational - Post-quantum: no (original formulation) - Basis: CRS model, hardness assumptions
Dependencies¶
Based on: GMR85-Knowledge-Complexity Circuit representation:
Applications¶
Used by: Groth16, Pinocchio, QSP-GGPR13 — all trusted-setup SNARKs
Resources¶
- Paper: BFM88-NIZK-Intro
- Code:
- Explainer: