Cryptography 2

elective monographs

Algorithms and data structures 1000-213bASD
Cryptography I 1000-2M12KI1
Discrete mathematics 1000-212bMD
Foundations of mathematics 1000-211bPM
Geometry with linear algebra 1000-211bGAL
Languages, automata and computations 1000-214bJAO
Mathematical analysis for computer science I 1000-211bAM1
Mathematical analysis for computer science II 1000-212bAM2
Probability theory and statistics 1000-213bRPS

Computability Theory 3800-KOG-MS1-TO
Information theory 1000-2N03TI
Security of computer systems 1000-215bBSK

The course "Cryptography 2" is a follow-up to the course "Cryptography 1" taught in the winter semester. Passing it (or the course "Cryptography" taught by S. Dziembowski in earlier years) is required to attend this course. Compared to "Cryptography 1", this course is more theoretical and focuses on the latest developments in cryptography (often those that have not yet entered practical use) and formal proofs. The main criterion for the selection of topics taught is scientific curiosity. The subject will be mainly conducted using a blackboard (no slides).

The content of the course will be dynamically adapted to the classes' progress. The preliminary plan is as follows (the order is subject to change):

1. Advanced definitions of security (including non-malleability)

2. Theoretical aspects of cryptography (Goldreich-Levin theorem, black-box separations, obfuscation, witness encryption)

3. Bilinear transformations and their applications in cryptography (Boneh-Franklin encryption, BLS signatures)

4. Algorithms of post-quantum cryptography

5. Consensus protocols and algorithms used in blockchain technology

6. Interactive and zero-knowledge proofs (including non-interactive proofs such as NIZK and zk-SNARK)

7. Multiparty computations and homomorphic encryption

8. Introduction to Universal Composability

9. Threshold schemes for encryption and signatures

10. Randomness extractors and their applications in leakage-resistant cryptography

• Jonathan Katz and Yehuda Lindell Introduction to Modern Cryptography

• Dan Boneh and Victor Shoup A Graduate Course in Applied Cryptography

• Oded Goldreich Foundations of Cryptography: Volume 1

• Oded Goldreich Foundations of Cryptography: Volume 2

• Mike Rosulek The Joy of Cryptography

• research papers available freely online

To pass the course, you must pass the exercises and the exam.

To pass the exercises, you must :

• deliver homework and

• pass the mid-term exam

The passing of the exercises is decided by the instructor.

The exam is conducted in written form.

Both the mid-term exam and the exam will consist of two parts:

1. testing knowledge (no materials such as notes and books will be allowed on it)

2. testing skills (without the above restriction)

The final grade for the course will be determined (on the first date) based on the weighted average of the mid-term exam (50%) and the exam results (50%).

Lecture and exercise instructors may decide to increase the grade for particularly active students.