Lectures
Table of Contents
| Week | Dates | Topics | Scribe |
|---|---|---|---|
| 1 | Oct 31 | Administrative, Introduction, Perfect Secrecy and its Limitations | Lec1 |
| 2 | Nov 7 | Computational Secrecy | Lec2 |
| 3 | Nov 14 | Pseudorandomness, One-Way Functions, and Hardcore Bits | Lec3 |
| 4 | Nov 21 | The Goldreich-Levin Theorem and Pseudorandom Functions | Lec4 |
| 5 | Nov 28 | Pseudorandom Functions: Constructions and Applications (MACs and Signatures) | Lec5 |
| 6 | Dec 12 | Digital Signatures Recap, Public-Key Encryption | Lec6 |
| 7 | Dec 19 | Zero-Knowledge Proofs | Lec7 |
| 8 | Dec 26 | Multi-Party Computation, Reduction to Semi-Honest Adversaries | Lec8 |
| 9 | January 2 | MPC against Semi-Honest Adversaries, GMW, and Yao's Garbled Circuit | Lec9 |
| 10 | Jan 9 | Fully-Homomorphic Encryption | Lec10 |
| 11 | Jan 16 | Non-Interactive Zero Knowledge | Lec11 |
| 12 | Jan 23 | Adaptive NIZK and Chosen-Ciphertext Attacks | Lec12 |
