Instructor: Adam Smith
Office hours: Mondays, 3pm-5pm, IST 338K
| Date | Syllabus | Reading | Homework |
|---|---|---|---|
| Tue, Aug 28 | Introduction (slides), Classical Cryptography | KL, Chap. 1 | |
| Thu, Aug. 30 | Perfect Security | KL, Chap. 2 | |
| Tue, Sep. 4 | (Double lecture) Computational model, PPT, negligible functions, next-bit security of pseudorandom generators, the discrete log problem, Blum-Micali generator. | KL Chap. 3.1-3.3. Leonid Reyzin's notes for lecture 2 | Homework 1, due Thursday, Sept. 13: pdf, .tex |
| Thu, Sep. 6: No lecture. | |||
| Tue, Sep. 11 | Defining p.r.g.'s via indistinguishability. Equivalence to next-bit test (hybrid argument). | Reyzin, Lecture 3 | |
| Thu, Sep. 13 | Discussion of Homework 1, hybrid arguments, security of encryption and one-time pad with generator | KL, Chap. 3.4. | HW1 solutions on Angel. |
| Tue, Sep. 18 | Quiz 1 (pdf, tex). Discussion of negligible functions. | Quiz solutions on Angel. | |
| Thu, Sep. 20 | Semantic Security for private-key encryption schemes | KL Chap. 3.2.2. | Homework 2, due Tuesday, Oct.2: pdf, .tex |
| Tue, Sep. 25 | Pseudorandom functions and multiple-use ciphers. | KL Chap. 3.5 | |
| Thu, Sep. 27 | Counter mode. Block ciphers and pseudorandom permutations. Modes of operation. | KL Chap. 3.6.3-2.6.4 | |
| Tue, Oct. 2 | Block cipher constructions | KL Chap. 5 | Homework 2 in. Homework 3, due Thursday, Oct. 11: pdf, .tex |
| Thu, Oct. 4 | Modular Arithmetic | KL Chap 7.1 | |
| Tue, Oct. 9 | Using the Chinese Remainder Theorem | KL, Chap. 7.2 | |
| Thu, Oct. 11 | Cyclic groups and the discrete logarithm problem | KL, Chap 7.3 | Homework 3 in. |
| Tue, Oct. 16 | Lecture canceled for NSRC Industry day. | ||
| Thu, Oct. 18 | Key Exchange and Public-Key Encryption | Chap. 9, 10.1, 10.2, 10.3, 10.5 | |
| Tue, Oct. 23 | Guest lecture: Patrick Traynor | ||
| Thu, Oct. 25 | More Public-Key Encryption | ||
| Tue, Oct. 30 | Rabin's Scheme | Homework 4, due Tuesday, Nov. 6: pdf, .tex | |
| Thu, Nov. 1 | Chosen-ciphertext attacks and malleability | ||
| Tue, Nov. 6 | Message Authentication (fixed-length) | Chap. 4 | Quiz 2. HW 4 in. |
| Thu, Nov. 8 | Mesage Authentication (variable length) | Chap. 4 | HW 4, Q3 in. |
| Tue, Nov. 13 | Digital Signatures. One-way functions and Lamport's scheme. | Chap 12 | |
| Thu, Nov. 15 | One-way functions as a basic assumption. GGM Construction of PRF's. Collision-Resistant Hash Functions | Chap. 6.5 & Chap. 4. | |
| Tue, Nov. 20 and Thu, Nov. 22: Thanksgiving | |||
| Tue, Nov. 27 | Random oracle model, part 1 | KL, Chap. 13.1 | Homework 5, due Tuesday, December 4: pdf, .tex |
| Thu, Nov. 29 | Random oracle model, part 2 | KL, CHap. 13.2 | |
| Tue, Dec. 4 | Protocols and 2-party computation | Salil Vadhan's notes: L19 | HW 5 in. HW 6 out: pdf |
| Thu, Dec. 6 | Two-party computation. Bit commitment. | Vadhan notes: L19, L20, L21 | Quiz 3. |
| Tue, Dec. 11 | Zero-Knowledge Proofs | ||
| Thu, Dec. 13 | Wrap up. | HW 6 in. | |