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 |
Monotone Batch NP-Delegation with Applications to Access Control Zvika Brakerski∗ Yael Tauman Kalai†DocID: 1xUdf - View Document | |
Lecture 25, Thurs April 20: Hamiltonians Now we’ll move on to our second-to-last unit… Hamiltonians and the Adiabatic Algorithm We’ve seen how it’s an open question whether quantum computers can solve NP-coDocID: 1xTKi - View Document | |
PDF DocumentDocID: 1xSVG - View Document | |
PDF DocumentDocID: 1xSM6 - View Document | |
PDF DocumentDocID: 1xSJs - View Document |