CS355 Topics in Cryptography

Course Syllabus

Spring 2014

Part 1: Pseudoranomness
 
Lecture 1:
4/ 1/14
Pseudorandomness and the Blum-Micali generator
Reading:
  • Chapter 3 from the book.
 
Lecture 2:
4/ 3/14
The Goldreich-Levin theorem, generalizations, and its applications
Reading:
  • Chapter 3 from the book.
 
Lecture 3:
4/ 8/14
Pseudorandom functions: the GGM and cascade constructions
Reading:
 
Lecture 4:
4/10/14
Algebraic PRFs from the augmented cascade and their applications
Reading:
Part 2: Secure multiparty computation
 
Lecture 5:
4/15/14
Private information retrieval (PIR)
Reading:
 
Lecture 6:
4/17/14
Oblivious transfer (strong PIR)
Reading:
 
Lecture 7:
4/22/14
Garbled circuits and Yao's 2-party protocol
Reading:
 
Lecture 8:
4/24/14
The BGW multiparty protocol
Reading:
 
Lecture 9:
4/29/14
Set intersection and comparison protocols
Reading:
Part 3: Zero-knowledge
 
Lecture 10:
5/ 1/14
Zero knowledge proof systems
 
Lecture 11:
5/ 6/14
Zero knowledge proofs of knowledge
 
Lecture 12:
5/ 8/14
Sigma protocols, ID protocols, and digital signatures
Reading:
  • Chapter 18 from the book.
Part 4: Pairings-based cryptography
 
Lecture 13:
5/13/14
Elliptic curves
Reading:
 
Lecture 14:
5/15/14
Pairings and Miller's algorithm
 
Lecture 15:
5/20/14
Identity based encryption and chosen ciphertext security   [pdf]