Instructor: | Mark Zhandry () |

Office Hours: Mondays 3-4pm (COS 314) | |

TA: | Fermi Ma () |

Office Hours: Fridays 2-3pm (Theory lounge, COS 3rd floor) | |

Lecture: | MW 1:30am - 2:50pm, Room TBA |

Grading: | 50% for roughly weekly homeworks, 20% take-home midterm, 30% take-home final |

Piazza: | https://piazza.com/princeton/spring2017/cos433mat473_s2017 |

Textbook: | There is no official text for this course, however Introduction to Modern Cryptography by Katz and Lindell (KL) is a good resource. Each lecture will have pointers to the appropriate sections of KL for those following along with the book. |

Another new feature in modern cryptography is its foundations. Until recently, cryptography was largely an art form based on intuition and ad hoc tweaks to block vulnerabilities. Modern crytpography is instead more of a science, characterized by rigorous mathematical definitions and theorems that guide the design of new systems.

This course is an introduction to modern cryptography, focusing on the theoretical foundations, with some attention to practical considerations. We will cover a variety of topics, including secret key and public key encryption, authentication, commitments, pseudorandom generators, and zero knowledge proofs.

Lecture | Topic | KL Section | Notes |

1 - M, 2/6 | Course introduction, A Brief History of Cryptography | 1.3 | [1] |

2 - W, 2/8 | Definitions in Cryptography, the One-time Pad | 1.4-2.2 | [2] |

3 - M, 2/13 | Multiple Message Security, Issues, Randomized Encryption | [3] | |

4 - W, 2/15 | Limitations of Information-Theoretic Security, Stream Ciphers, PRGs, and Computational Assumptions | 2.3-3.3 | [4] |

5 - M, 2/20 | Constructing PRGs | 6.1 | [5] |

6 - W, 2/22 | CPA security and PRFs | 3.4-3.5 | [6] |

7 - M, 2/27 | PRPs, Block Ciphers, Modes of Operation | 3.6, 6.2 | [7] |

8 - W, 3/1 | Constructing Block Ciphers | 6.2 | [8] |

9 - M, 3/6 | Attacks on Block Ciphers | 6.2 | [9] |

10 - W, 3/8 | Message Integrity, MACs | 4.1-4.4, 4.6 | [10] |

11 - M, 3/13 | Authenticated Encryption, CCA Security | 4.5 | [11] |

12 - W, 3/15 | Collision Resistant Hashing, Random Oracle Model | 5.1-5.4, 6.3 | [12] |

M, 3/20 | No Class - Spring Break | ||

W, 3/22 | |||

13 - M, 3/27 | Commitment Schemes | [13] | |

14 - W, 3/29 | Number-theoretic constructions of symmetric primitives | 8.3-8.4 | [14] |

15 - M, 4/3 | One-way permutations, hardcore predicates | 7.1 | [15] |

16 - W, 4/5 | Relationships between Symmetric Primitives | 7.2 | [16] |

17 - M, 4/10 | Diffie Hellman Key Exchange | 10.3 | [17] |

18 - W, 4/12 | Public Key Encryption | 11.1-11.4 | [18] |

19 - M, 4/17 | RSA, Trapdoor Permutations | 11.5, 13.1 | [19] |

20 - W, 4/19 | Digital Signatures | 12.1-12.4 | [20] |

21 - M, 4/24 | Digital Signatures from One-way Functions | 12.6 | [21] |

22 - W, 4/26 | Identification Protocols | 12.5 | [22] |

23 - M, 5/1 | Zero Knowledge | [23] | |

24 - W, 5/1 | CCA-secure Public Key Encryption without Random Oracles | [24] |

Homework 2 (Due Feb 21)

Homework 3 (Due Feb 28)

Homework 4 (Due Mar 7)

Homework 5 (Due April 4)

Homework 6 (Due April 11)

Homework 7 (Due April 18)

Homework 8 (Due April 25)

Homework 8

Homeworks will be assigned roughly every week. Homework assignments will be posted on the course webpage early in the week (hopefully by Monday, definitely by Tuesday) and will be due the following Tuesday. Expect there to be a homework assignment