After successful completion of the course, students are able to argue about security in the provably-security framework; they will be familiar with advanced cryptographic concepts such as zero-knowledge proof systems, multi-party computation and schemes that are resistant to attacks on quantum computers. They will have a good overview of the main currently active research areas in public-key cryptography.
This course will not be held in spring 2024.
• Provable security, the random-oracle model• Pairing-based cryptography• Zero-knowledge and succinct proof systems• Lattice-based cryptography (quantum-secure public-key schemes)• Secure multi-party computation
Lectures with slides and problem assignments as homework to deepen the taught material. Lectures on Thursdays will be recorded; presence on Fridays in the exercise sessions is mandatory.
ECTS Breakdown (6 ECTS = 150 hours)
22h lecture20h self-study 3h exam18h tutorials87h homework
The course being a VU, there will be homework, with solutions to be uploaded in the TUWEL course, which are then presented and discussed by the students in the exercise sessions on Fridays. There will be a final closed-book exam.
Composition of the final grade: 50% homeworks and presentations; 50% final exam.
Material used in the lecture:• Katz, Lindell: Introduction to Modern Cryptography, 2nd Ed.• Boneh, Shoup: A Graduate Course in Applied Cryptography v0.5 (online: https://crypto.stanford.edu/~dabo/cryptobook)• Peikert: A Decade of Lattice Cryptography (online: https://eprint.iacr.org/2015/939)• Lindell: Secure Multiparty Computation (online: https://eprint.iacr.org/2020/300)
Knowledge of the basics of cryptography, in particular the concept of provable security, as taught in introductory courses such as 192.125 is expected.
