Listenly

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

— questions searchable right now

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.

Shafi Goldwasser on a16z crypto showAll answers from this podcast →
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

Zero-knowledge proofsMental poker problemInteractive proofsProbabilistically checkable proofs (PCP)SumCheck protocolSNARKsMerkle treesFiat-Shamir transformation

More answers from this episode

 ·  All answers from a16z crypto show →
—
—
0:00
0:00