Why did interaction and randomness become essential to zero-knowledge proof design?
Answered at 5:00 in How Zero-Knowledge Proofs Were Invented (ft. Co-Inventor and Turing Award Winner Shafi Goldwasser) · a16z crypto show
Why did interaction and randomness become essential to zero-knowledge proof design?
Interaction and randomness were introduced as the way to obtain privacy in cryptographic proofs. The verifier needed to accept a small chance of error, which enabled not revealing everything. This required modifying the notion of proof itself to allow for interactive protocols between a prover and verifier, rather than traditional non-interactive proofs. The definition of zero knowledge formalized that you will believe what is claimed but discover nothing else.
Full answer and detailsRead the whole answer, key facts and every other question from this episode
In short
Interaction and randomness were introduced as the way to obtain privacy in cryptographic proofs.
Shafi Goldwasser, Turing Award-winning cryptographer · How Zero-Knowledge Proofs Were Invented (ft. Co-Inventor and Turing Award Winner Shafi Goldwasser) · a16z crypto show · answer at 5:00
Key takeaways
- Interaction and randomness were introduced as the way to obtain privacy in cryptographic proofs.
Quote to remember
“The definition of zero knowledge is in some sense that at the end you will believe what I claim, but you will discover nothing else.”
— Shafi Goldwasser
The full answer · about 1 min
Interaction and randomness were introduced as the way to obtain privacy in cryptographic proofs. The verifier needed to accept a small chance of error, which enabled not revealing everything. This required modifying the notion of proof itself to allow for interactive protocols between a prover and verifier, rather than traditional non-interactive proofs. The definition of zero knowledge formalized that you will believe what is claimed but discover nothing else.
Key facts
- Six submissions and rejections before publication of the GMR zero-knowledge interactive proofs paper
- Two provers used in multi-prover interactive proof systems before reduction to single-prover protocols
- IP equals PSPACE complexity class result derived from interactive proof techniques
People, companies and topics mentioned
More answers from this episode
- 4:03What was the mental poker problem that inspired the invention of zero-knowledge proofs?
- 6:40What is the simulation paradigm in zero-knowledge proof verification?
- 9:00How did the GMR paper on zero-knowledge interactive proofs face rejection before publication?
- 14:00What is the relationship between probabilistically checkable proofs and SNARKs in modern cryptography?
- 21:00Why is the SumCheck protocol particularly efficient for building modern SNARKs?