CS355 Topics in Cryptography

Course Syllabus

Spring 2010

Part 1: Pseudoranomness
 
Lecture 1:
4/ 1/10
Pseudorandomness and the Blum-Micali generator
Reading:
  • Chapter 3 from the book.
 
Lecture 2:
4/ 6/10
Computational indistinguishability. Pseudorandom functions.
The GGM and cascade constructions
Reading:
  • Chapter 4 from the book.
 
Lecture 3:
4/ 8/10
Security of cascade and augmented cascade
Reading:
 
Lecture 4:
4/13/10
Algebraic PRFs from the augmented cascade
Reading:
 
Lecture 5:
4/15/10
More algebraic PRFs
Reading:
Part 2: Secure multiparty computation
 
Lecture 6:
4/20/10
Private information retrieval (PIR)
Reading:
 
Lecture 7:
4/22/10
Oblivious transfer (strong PIR)
Reading:
 
Lecture 8:
4/27/10
Yao's 2-party protocol
Reading:
 
Lecture 9:
4/29/10
The BGW multiparty protocol
Reading:
 
Lecture 10:
5/ 4/10
Comparison protocols
Reading:
 
Lecture 11:
5/ 6/10
Set intersection protocols
Reading: