![Computational complexity theory / Zero-knowledge proof / Proof of knowledge / IP / Soundness / NP / Quadratic residue / Probabilistic method / Mathematical proof / Theoretical computer science / Cryptography / Cryptographic protocols Computational complexity theory / Zero-knowledge proof / Proof of knowledge / IP / Soundness / NP / Quadratic residue / Probabilistic method / Mathematical proof / Theoretical computer science / Cryptography / Cryptographic protocols](https://www.pdfsearch.io/img/b6c2a113f368e972f51c0c60d2d6ee10.jpg) Date: 2010-04-05 00:17:40Computational complexity theory Zero-knowledge proof Proof of knowledge IP Soundness NP Quadratic residue Probabilistic method Mathematical proof Theoretical computer science Cryptography Cryptographic protocols | | Lecture 17 - Zero Knowledge Proofs Boaz Barak April 5, 2010 Review connections between: pseudorandom generators, one-way functions, pseudorandom functions, CPA secure symmetric encryption, message authentication codes, CAdd to Reading ListSource URL: www.cs.princeton.eduDownload Document from Source Website File Size: 210,21 KBShare Document on Facebook
|