<--- Back to Details
| 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 |
Add to Reading List |
ECE/CS498: Applied Cryptography Instructor: Andrew Miller, TA: Kevin Liao Lecture 2: Interactive Proofs 1 | ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro CorettiDocID: 1rgbF - View Document |
 | Locally Random Reductions: Improvements and Applications D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995DocID: 1raDV - View Document |
 | ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro CorettiDocID: 1r8mX - View Document |
 | An Efficient Parallel Repetition Theorem Johan H˚ astad1 , Rafael Pass2, Douglas Wikstr¨ om3 , and Krzysztof Pietrzak4 1 KTH, Stockholm, supported by ERC grantDocID: 1qOst - View Document |
 | JOURNAL OF COMPUTER AND SYSTEM SCIENCESDocID: 1qf4Y - View Document |