|
 Syllabus |
|
|
| Slides |
0. Course Overview |
|
|
1. Classical vs. Modern Cryptography |
|
|
2. Perfect Secrecy and its Limitations |
|
|
3. Computational Secrecy |
|
|
4. From OWFs to PRGs and PRFs |
|
|
5. Message Authentication |
|
|
6. Number Theory and Hardness Assumptions |
|
|
7. Secret-Sharing Schemes |
|
|
8. Public-Key Cryptography |
|
|
9. Public-Key Encryption |
|
|
10. Digital Signatures |
|
|
11. Zero-Knowledge Proofs |
|
|
12. Secure Two-Party Computation |
|
|
13. Course Summary and Conclusions |
|