Description
Lattices have turned out to a be key source of hardness assumptions for post-quantum cryptography. In this iteration of Advanced Tools from Modern Cryptography, we will look at some advanced cryptographic primitives like identity-based encryption, fully-homomorphic encryption and zero-knowledge proofs through the lens of lattices.
Prerequisites
Knowledge of basic cryptography, as covered in CS409 or CS409m, will be assumed. This course will involve some amount of theory, and thus we will expect mathematical maturity.
Who can credit?
The course is open to all CS, EE, Math and IEOR students except for BTech1s and BTech2s. If you are a BTech2 who has taken either CS409 or CS409m, and are keen to credit this course, please reach out to me.
Grading and Attendance
| Weightage | Towards |
|---|---|
| 30% | End-sem |
| 25% | Mid-sem |
| 20% | Paper presentation (two students per paper) |
| 15% | Two quizzes |
| 5% | Class participation |
| 5% | Scribing (~2 lectures per student) |
Attendance is not mandatory (but encouraged). There will be five ungraded assignments to help you with quizzes and exams.
| # | Date | Notes | + | Topics Covered |
|---|---|---|---|---|
| L01 | TBD | [↓][↓] |
|
|
| Module I: Introduction to Lattices | ||||
| Q1 | TBA | [↗] | Quiz 1 | |
| Module II: Basic Cryptography From Lattices | ||||
| M | TBD | [↗] | Mid-sem | |
| Module III: Advanced Cryptography from Lattices | ||||
| Q2 | TBA | [↗] | Quiz 2 | |
| Paper Presentation | ||||
| E | 14/Nov | [↗] | End-sem: 09:00-12:00 in LA002 | |
Below you can find the list of resources relevant to this course. The list of per-lecture resources (e.g., further reading) can be found at the end of the respective notes.
Textbooks