| Week
| Date
| Class Topics
|
| 1 |
Nov. 1 |
Introduction; Administrativia and course topics [slides]
and , basic notations and One-Way Functions [slides] |
| 2 |
Nov. 8 |
Finish lecture #1 and,
Ccomputational Iindistinguishability and Pseudorandom Generators [slides] |
| 3 |
Nov. 15 |
Finish lecture #2 |
| 4 |
Nov. 22 |
Hardcore Predicates for any one-way function [slides] |
| 5 |
Nov. 29 |
Pseudorandom Functions [slides] |
| 6 |
Dec. 6 |
Non adaptive to adaptive PRFs (slides coming soon), and Interactive Proof and Zero Knowledge [slides] |
| 7 |
Dec. 13 |
Commitment Schemes [slides]
and Zero Knowledge for NP [slides] |
| 8 |
Dec. 20 |
Non Interactive Zero Knowledge [slides] |
| 9 |
Dec. 27 |
MACs and Signature Schemes [slides] |
| 10 |
Jan. 3 |
Encryption Schemes [slides] |
| 11 |
Jan. 10 |
No Class |
| 12 |
Jan. 17 |
Encryption Schemes cont. |
| 13 |
Jan. 24 |
Encryption Schemes cont. and Secure Computation [slides] |
| 13 |
Jan. 31 |
Secure Computation cont. and Summary |
| 14 |
Feb. 6 (Monday) |
Exam |