How did the GMR paper on zero-knowledge interactive proofs face rejection before publication?
Answered at 9:00 in How Zero-Knowledge Proofs Were Invented (ft. Co-Inventor and Turing Award Winner Shafi Goldwasser) · a16z crypto show
How did the GMR paper on zero-knowledge interactive proofs face rejection before publication?
The paper on zero-knowledge proofs by Goldwasser, Micali, and Rackoff was submitted six times and kept getting rejected before finally being published. Despite the rejections, the authors remained determined, believing they had the right definition and that the work was very interesting. Goldwasser credits her co-author Silvio Micali's competitive nature as helping them persevere through the rejection process.
Full answer and detailsRead the whole answer, key facts and every other question from this episode
In short
The paper on zero-knowledge proofs by Goldwasser, Micali, and Rackoff was submitted six times and kept getting rejected before finally being published.
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 9:00
Key takeaways
- The paper on zero-knowledge proofs by Goldwasser, Micali, and Rackoff was submitted six times and kept getting rejected before finally being published.
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
The paper on zero-knowledge proofs by Goldwasser, Micali, and Rackoff was submitted six times and kept getting rejected before finally being published. Despite the rejections, the authors remained determined, believing they had the right definition and that the work was very interesting. Goldwasser credits her co-author Silvio Micali's competitive nature as helping them persevere through the rejection process.
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?
- 5:00Why did interaction and randomness become essential to zero-knowledge proof design?
- 6:40What is the simulation paradigm in zero-knowledge proof verification?
- 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?