These tools are cornerstones in the design of privacy-preserving systems, e.g., in solutions for private machine learning and data analytics, for private outsourced storage, as well as in privacy-preserving cryptocurrencies.
This course will cover both theoretical foundations as well as efficient designs.
Required background. The class is open to students with theoretical background as well as to students with applied interests who want to use these tools. A basic understanding of cryptography is necessary, but a graduate-level cryptography class is not required. (Contact the instructor if in doubt.)
Wk | Date | Lecture contents | Reading |
---|---|---|---|
1 | 01/04 | Introduction
|
|
01/06 | Two-Party Computation & Garbled Circuits
|
|
|
2 | 01/11 | Garbled Circuits & Oblivious Transfer
|
|
01/13 | Optimizations for Two-Party Computation
|
|
|
3 | 01/18 | No Class (MLK day) | |
01/20 | Optimized Garbling & Private-Set Intersection
|
|
|
4 | 01/25 | Actively Secure 2PC | |
01/27 | MPC I | ||
5 | 02/01 | MPC II | |
02/03 | Fully-Homomorphic Encryption | ||
6 | 02/08 | Multi-Key FHE and Two-Round MPC | |
02/10 | Private Information Retrieval | ||
7 | 02/15 | Zero-knowledge Proofs for NP | |
02/17 | NIZK I | ||
8 | 02/22 | NIZK II | |
02/24 | SNARKs I | ||
9 | 03/01 | SNARKs II | |
03/03 | SNARKs III | ||
10 | 03/08 | Paper Presentations I | |
03/10 | Paper Presentations II |