Topic outline
General
Slides
Problem Sets
Lecture Schedule
- Week 1 (7/11):
0. Course Overview
1. Classical vs. Modern Cryptography
2. Perfect Secrecy and its Limitations
- Week 2 (14/11):
3. Computational Secrecy (slides 1-23)
Problem set 1 is available
- Week 3 (21/11):
3. Computational Secrecy (slides 24-50) - Week 4 (28/11):
3. Computational Secrecy (cont.)
4. From OWFs to PRGs and PRFs (slides 1-19)
Problem set 2 is available
- Week 5 (5/12):
4. From OWFs to PRGs and PRFs (cont.)
5. Message Authentication (slides 1-14)
Review of problem set 1
- Week 6 (12/12):
5. Message Authentication (cont.)
Problem set 3 is available
- Week 7 (19/12):
6. Number Theory and Hardness Assumptions
Review of problem set 2 - Week 8 (26/12):
7. Public-Key Cryptography
8. Public-Key Encryption (slides 1-21)
- Week 9 (2/1):
8. Public-Key Encryption (cont.)
Review of problem set 3
Problem set 4 is available
- Week 10 (9/1):
9. Digital Signatures
Problem set 5 is available
- Week 11 (16/1):
No lecture.
- Week 12 (23/1):
10. Zero-Knowledge Proofs
- Week 13 (30/1):
11. Course Summary and Conclusions
Review of problem set 4
Review of problem set 5
- Week 1 (7/11):