Time: Thursday 10:00-13:00.
Instructor: Iftach Haitner
Reception. Please coordinate by email.
Abstract: This is a a graduate-level introduction to the theoretical foundations of Cryptography. We'll study the basic cryptographic primitives (e.g., one-way functions and pseudorandom generators) while focusing on formal definitions and rigorous proofs. Some more advanced topics will be also touched upon.
Prerequisite: Basic complexity theory (the classes P, NP, BPP), basic probability and discrete math.
This is a graduate course, where undergrads are encouraged to take 0369.3049.
An undergrad who wishes to take the course should get a personal approval from the instructors.
Course requirements: The grade is composed of two parts: (20%) Homework (5-6 problem sets) and (80%) final exam.
Course will be given in English.
- Literature and Links
You may find the following to be useful references (but beware that some of the notation, conventions, and definitions may differ slightly from lecture):
- Jonathan Katz and Yehuda Lindell. An Introduction to Modern Cryptography.
- Oded Goldreich. Foundations of Cryptography.
Crypto Courses with Online Material:
- HWSubmission:1. Printed solutions should be submitted in class or sent via email to quefumas at gmail.com.2. In case you submit by email: The title of the email should be: "Crypto PS# ID name". Please submit one PDF file with the name [your ID]_name_PS[# of PS].pdf3. You may write in English (preferred), but if you write in Hebrew please seperate lines with equations from lines with text.4. If you hand in a handwritten solution, please add your email (for clarifications, if needed).5. Late submissions will be ignored unless approved first by the instructors.
6. Writing your solution using Latex is recommended. For newcomers to Latex,
- Tentative Schedule
The following schedule is tentative and some of the material may be changed during the semester.
Week Date Class Topics
Introduction, administrativia and course topics. slides
One-way functions. slides
One-way functions cont. and Pseudorandom Generators. slides
Hardcore Predicates. slides
Pseudorandom Functions slides
MACs and Signature Schemes slides
Interactive Proofs and Zero Knowledge slides
April 15 (Monday!)
Zero Knowledge and Commitment Schemes slides
Zero Knowledge cont., and Non Interactive Zero Knowledge slides
Non Interactive Zero Knowledge cont. and Proof of Knowledge
Encryption Schemes slides
Secure Multi-Party Computation slides
No Class (GTACS at tau)
Non black-Box Zero-Knowlege slides
Lecture slides will be published here during the semester.
The exam will take place on February 28. You can find below the two exams (moed A and B) of the 2014 course.