March
MondayTuesdayWednesdayThursdayFriday
30
Introduction
  • Formal details
  • Examples of cryptographic applications
  • Introduction to games and advantages
 31 1
Pseudorandomness I
  • Generic attacks against UF-CMA security
  • Computational efficiency
  • Concrete vs asymptotic security
  • Reductions: Key-recovery, random messages, and multiple verification queries
 2 3
April
MondayTuesdayWednesdayThursdayFriday
6
Pseudorandomness II
  • Definition of pseudorandom functions (PRFs)
  • UF-CMA vs PRF
  • Range extension and hybrid argument
 7 8
Pseudorandomness III
  • Hybrid argument/game hopping
  • Block ciphers
  • Security/syntax of secret-key encryption
Problem Set 1 Out
9 10
13
Secret-Key Encryption I
  • Encryption from PRFs
  • Modes of operation
  • Intro to authenticated encryption
 14 15
Secret-Key Encryption II
  • Plaintext and ciphertext integrity
  • Generic composition: Encrypt-then-MAC
  • VIL-PRFs
 16 17
20
Groups and Number Theory
  • Finite groups
  • Modular arithmetic
  • Exponentiations and discrete logarithms
  • The hardness of the discrete logarithm problem
 21 22
Diffie-Hellman
  • Diffie-Hellman key exchange
  • The DDH assumption
  • PRF construction from DDH
Problem Set 1 Due
11:59pm
Problem Set 2 Out
23 24
27
Public-Key Encryption I
  • IND-CPA security
  • ElGamal encryption
  • One vs many encryptions
 28 29
Public-Key Encryption II
  • CCA security
  • The random-oracle model
  • The Fujisaki-Okamoto transform
 30 1
May
MondayTuesdayWednesdayThursdayFriday
4
Digital Signatures I
  • UF-CMA security of signatures
  • Application: Authenticated key exchange
  • Hash functions
  • Trapdoor permutations and the full-domain hash
 5 6
Digital Signatures II
  • Katz-Wang signatures
Problem Set 2 Due
11:59pm
Problem Set 3 Out
7 8
11
Lattice-Based Cryptography I
  • A brief introduction to lattices and shortest vectors
  • The LWE assumption
  • Regev encryption
 12 13
Lattice-Based Cryptography II
  • Fully homomorphic encryption
  • The GSW construction
  • Application: Private information retrieval
 14 15
18
Lattice-Based Cryptography III
  • Lattice trapdoors
  • Lattice-based signatures
 19 20
Multi-Party Computation I
  • 2PC security definition
  • Garbled circuits and oblivious transfer
Problem Set 3 Due
11:59pm
Problem Set 4 Out
21 22
25
Memorial Day
26 27
Multi-Party Computation II
  • Secret sharing and the GMW protocol
 28 29
June
MondayTuesdayWednesdayThursdayFriday
1
Zero-Knowledge I
  • General formalism
  • Proofs of knowledge for discrete logarithms
 2 3
Zero-Knowledge II
  • Zero-knowledge proofs for NP
  • Non-interactive zero-knowledge
Problem Set 4 Due
11:59pm
Take-Home Final Exam Out
4 5
8 9 10
Take-Home Final Exam Due
11:59pm
11 12