The discovery and study of probabilistic proof systems, such as PCPs and IPs, have had a tremendous impact on theoretical computer science. These proof systems have numerous applications (e.g., to hardness of approximation) but one of their most compelling uses is a direct one: to construct cryptographic protocols that enable super fast verification of long computations. This course will introduce students to the foundations of probabilistic proof systems, covering both classical results as well as modern efficient constructions.
This course requires knowledge of basic algorithms and complexity.
Completing the course for credit requires regular attendance/participation (on Piazza or during online lecture), completing occasional homework, scribing (once or twice), and a research project.
This course has no required textbook. Each lecture will have specific references.
Interactive Proofs 1
Formulation of interactive proofs: