Description

Cryptography is the science of securely carrying out tasks (e.g., secret communication) in an adversarial setting. In this course, we intend to broadly study certain foundational tasks in cryptography, with an emphasis on precise modelling of the adversary's capabilities and goal -- the security model -- and formally proving security in this model -- the security proof. The tasks we will cover will range from basic ones likes secure communication to more advanced ones like program obfuscation (see below for detailed syllabus). For each task, we will discuss the real-world motivation, go through the process of modelling security, and discuss constructions with security proofs. At the end of the course, you will have learnt how to model security for a certain task (e.g., secret communication), design a scheme for this task and then formally prove security of this scheme in the security model.

Grading and Attendance (tentative)

Attendance is not mandatory (but encouraged)

There will be six ungraded assignments to help you with quizzes and exams.

Prerequisites

Discrete structures and probability theory are soft prerequisites. This course will have a theoretical flavour, and thus we will expect some mathematical maturity.

Who can credit?

The course is open to (all PGs) and (UGs in third and fourth years). Since there is a considerable overlap with CS406, anyone who took that course is not eligible to credit.

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 lecture slide.

• Introduction to Modern Cryptography, by Jonathan Katz and Yehuda Lindell, which we will mostly follow for the first two modules
• Foundations of Cryptography, Volumes I and II by Oded Goldreich, which we will mostly follow for the third module
• The Joy of Cryptography, by Mike Rosulek

• Foundations of Cryptography (MIT6875) by Vinod Vaikuntanathan, the structure and syllabus of which we will largely follow
• Cryptography (CS406) by Manoj Prabhakaran

• Basic probability theory can be found in §A.3 of Katz-Lindell. The first recitation in MIT6875 is another resource.
• Basic number theory can be found in §B of Katz-Lindell. The third recitation in MIT6875 is another resource.
• Basic computational complexity can be found in the second recitation in MIT6875.