Listenly

What is the simulation paradigm in zero-knowledge proof verification?

Answered at 6:40 in How Zero-Knowledge Proofs Were Invented (ft. Co-Inventor and Turing Award Winner Shafi Goldwasser) · a16z crypto show

— questions searchable right now

What is the simulation paradigm in zero-knowledge proof verification?

The simulation paradigm is the way to formally define that a verifier learns nothing beyond the claim. It requires showing that whatever knowledge the verifier has after the interactive proof, they could have simulated that knowledge even without the prover and interaction occurring. Everything the verifier could do computationally before engaging in the proof interaction, they could do afterwards.

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

The simulation paradigm is the way to formally define that a verifier learns nothing beyond the claim.

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 6:40

Key takeaways

  • The simulation paradigm is the way to formally define that a verifier learns nothing beyond the claim.

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 simulation paradigm is the way to formally define that a verifier learns nothing beyond the claim. It requires showing that whatever knowledge the verifier has after the interactive proof, they could have simulated that knowledge even without the prover and interaction occurring. Everything the verifier could do computationally before engaging in the proof interaction, they could do afterwards.

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