flâneur

lec5.pdf

crypto.stanford.edu · 1,603 words · saved by 1 readers

N/A

CS 355: Topics in Cryptography Spring 2019 Lecture 5: Proofs of Knowledge, Schnorr’s protocol, NIZK Dima Kogan Recap Last lecture we saw that languages in NP have zero knowledge proofs (if commitments exist). We’ll start by a slightly differet view of NP. We say that a relation R ⊆ X × Y is an NP relation if: • It is polynomially bounded: there exists a polynomial p, such that |x| ≤ p(|y|)…

related reading