Zero Knowledge Proofs - Introduction

This is a talk by eleanor at Metauni

Notes

• Related but different from a Math Proof
• A proof is one statement $x$, with a artifact $\pi$ that you can verify with a verification algorithm $V(x,\pi )\in \{0,1\}$
• Zero-Knowledge Proofs can be categorized:
  • Non-Interactive Proof
  • Interactive Proof
• An example of an Interactive Proof is the Colorblind Friend Proof Example which has the properties of a:
  • Designated Verifier
  • Zero Knowledge
• We introduce Effective Relation
  • Discrete Logarithm Language is an example of a knowledge proof
• We introduce what a Cryptographic Protocol is
• Knowledge Proofs definition is:
  • Given all possibly cheating turing machine $\hat{P}$ that can make turing machine $V$ output accept, we can efficiently extract a Zero Knowledge authenticator by Turing Machine Rewinding $\hat{P}$
• Schnorr’s Protocol