What was the mental poker problem that inspired the invention of zero-knowledge proofs?
Answered at 4:03 in How Zero-Knowledge Proofs Were Invented (ft. Co-Inventor and Turing Award Winner Shafi Goldwasser) · a16z crypto show
What was the mental poker problem that inspired the invention of zero-knowledge proofs?
The mental poker problem asked how two people sitting in different parts of the world could play cards over the phone without having any physical cards. They needed to deal a deck and play according to the rules while proving they followed those rules without revealing the cards or their encryption. This led Goldwasser and Micali to ask how to prove you're dealing cards properly without revealing everything about what you've encrypted and the randomness used to encrypt.
Full answer and detailsRead the whole answer, key facts and every other question from this episode
In short
The mental poker problem asked how two people sitting in different parts of the world could play cards over the phone without having any physical cards.
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 4:03
Key takeaways
- The mental poker problem asked how two people sitting in different parts of the world could play cards over the phone without having any physical cards.
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 mental poker problem asked how two people sitting in different parts of the world could play cards over the phone without having any physical cards. They needed to deal a deck and play according to the rules while proving they followed those rules without revealing the cards or their encryption. This led Goldwasser and Micali to ask how to prove you're dealing cards properly without revealing everything about what you've encrypted and the randomness used to encrypt.
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
- 5:00Why did interaction and randomness become essential to zero-knowledge proof design?
- 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?