What ZK Actually Proves
Completeness, soundness, zero-knowledge — explained without symbols first. The history from Goldwasser-Micali-Rackoff to Fiat-Shamir, and what prover and verifier actually do.
35 min · expert · part of ZK Cryptography & Proof Systems
What you'll learn
- The Three Properties That Define a ZK Proof
- The Ali Baba Cave (Intuition Pump)
- The 1985 Breakthrough
- What Prover and Verifier Actually Do
- Interactive vs Non-Interactive (Fiat-Shamir)
- What Can Be Proven in Zero Knowledge
Key terms
- Zero-knowledge proof
- A cryptographic protocol in which a prover convinces a verifier that a statement is true without revealing any information beyond the validity of the statement itself.
- Completeness
- The property that an honest prover with a true statement can always convince an honest verifier.
- Soundness
- The property that no cheating prover can convince the verifier that a false statement is true, except with negligible probability.
- Zero-knowledge property
- The property that the verifier learns nothing from the proof beyond the truth of the statement, formalized by the existence of a simulator that can produce indistinguishable transcripts without the witness.
- Prover
- The party in a ZK protocol that holds the secret witness and produces a proof object convincing the verifier of a statement.
- Verifier
- The party in a ZK protocol that holds only the public statement and the proof, and runs an algorithm to accept or reject.
- Witness
- The secret piece of information held by the prover that demonstrates the truth of the statement (e.g., a private key, a preimage, a transaction sequence).
- Interactive proof
- A proof system in which prover and verifier exchange multiple rounds of messages, with the verifier issuing random challenges between prover responses.
- Fiat-Shamir transform
- A technique from 1986 that converts interactive sigma protocols into non-interactive proofs by replacing verifier randomness with the output of a cryptographic hash applied to the protocol transcript.
- Random oracle model
- A theoretical model in which a hash function is treated as an idealized random function, used to prove security of constructions like Fiat-Shamir; real hashes (SHA-256, Poseidon) are believed to approximate it well enough for practice.
Read the full lesson in the CryptoBipto app.
Open lessonEducational only — not financial advice.
