CS 601.642/442: Modern Cryptography (Fall 2017)
Overview:
  • Instructor: Abhishek Jain
  • Time: 1:30 pm - 2:45 pm, Monday and Wednesday
  • Location: Shaffer 2
  • Office Hours: Drop by my office (Malone 315) or email
  • Prerequisites: Exposure to probability and maturity with mathemtical proofs. Some exposure to theory of computation.
  • Grading: 45% Homework, 15% Midterm, 30% (Take-home) Final, 10% Class participation
  • Lecture Notes: Preliminary draft (Under continual update)
  • TA: Aarushi Goel
  • Office Hours: Setup appointment by email (agoel10 AT jhu.edu)
  • Review Session: Friday 2-3pm in Malone 228.
    Exceptions: Sep 1 (1-2pm Malone 228), Sep 15 (TBA), Oct 27 (TBA)

Class Schedule:

Date Lecture Additional Notes
Aug 31 Introduction (Slides) Mathematical Background: Notes by Boaz Barak
Pre-reqs refresh in Review Session (Sep 1)
Sep 6 One-Way Functions (I) (Slides) More Detailed Notes: See Chapter 2
Sep 11 One-Way Functions (II) (Slides) Hardness Amplification: See Chapter 2.4
Sep 13 Hard Core Predicate (Slides)
Pseudorandomness (I) (Slides)		 Goldreich-Levin Theorem: See Chapter 3.4
Levin's Universal OWF: See Chapter 2.13
Sep 18 Pseudorandomness (II) (Slides) Notes by Yehuda Lindell: See Chapter 4
Sep 20 Pseudorandomness (III) (Slides) Notes by Yehuda Lindell: See Chapters 5.1, 5.2
Sep 25 Key Exchange (Slides)
Sep 27 Secret-Key Encryption (Slides) Notes by Yehuda Lindell: See Chapters 9, 10.1
Oct 2 Public-Key Encryption (Slides) Notes by Yehuda Lindell: See Chapters 9, 10.1
Additional Reading: El Gamal Encryption
Oct 4 Authentication (Slides) Notes by Yehuda Lindell: See Chapters 11, 12
Additional Reading: Number-theoretic Hash Functions
Additional Reading: Random Oracles and Full Domain Hash
Oct 9 Zero-Knowledge Proofs (Slides) Notes by Yehuda Lindell: See Chapters 5.3, 6
Physical ZK: ZK Proofs for Nuclear Warhead Verification
Mike Rosulek: ZK Proofs for Sudoku and Where's Waldo
Oct 11, Oct 16 Zero-Knowledge Proofs (II) (Slides) Notes by Yehuda Lindell: See Chapter 7
Oded Goldreich: ZK twenty years after its invention
Boaz Barak: How to do Non-Black-Box Simulation
Oct 18 Secure Computation (I) (Slides) Notes by Yehuda Lindell: See Chapter 13
Oct 23 Secure Computation (II) (Slides) Notes by Yehuda Lindell: See Chapter 13
Oct 25 Secure Computation (III) (Slides) Yao's Protocol with Proof: Lindell-Pinkas
Nov 6 Non-Interactive Zero Knowledge (I) (Slides) Notes by Jonathan Katz: Lecture 11, Lecture 12
Nov 8 Non-Interactive Zero Knowledge (II) (Slides) Notes by Jonathan Katz: Lecture 12, Lecture 13
Nov 15 CCA Security (I) (Slides) Notes by Victor Shoup: Lecture 10
Nov 27 CCA Security (II) (Slides)

Homeworks:

Useful Lecture Notes: Useful Books: