First Page | Document Content | |
---|---|---|
Cryptography Computational complexity theory Theory of computation Randomized algorithms Complexity classes Zero-knowledge proof Interactive proof system Quantum complexity theory NP IP Soundness Computational indistinguishability | ECE/CS498: Applied Cryptography Instructor: Andrew Miller, TA: Kevin Liao Lecture 2: Interactive Proofs 1Add to Reading ListSource URL: gitlab-beta.engr.illinois.eduDownload Document from Source WebsiteFile Size: 260,06 KBShare Document on Facebook |