Content
This course will teach you...
- Advanced Cryptographic Primitives: Zero-Knowledge, Multi-Party Computation, Fully Homomorphic Encryption
- Provable security: different models of security, the basics of reductionist, simulation-based, and game-based proofs, Ideal/Real World Paradigm
- Public Key Cryptography (public key encryption schemes, signature schemes, commitment schemes, zero knowledge, and more!)
- Modern Cryptography: Modules in lattices, Post-Quantum Cryptography, ...
Material
Potential Presentation Topics:
- Identity-Based Encryption
- Puncturable Encryption
- Pairings
- Modules in Saber
- Relations amongst security notions: https://www.cs.ucdavis.edu/%7Erogaway/papers/relations.pdf (taken)
- OCB Mode (incl. attack on OCB2)
- The Torus FHE scheme (taken)
- The IND-CPAD notion
- MPC: Switching computation domain
- Polynomial Commitment Schemes
- SNARK's
- Signature Schemes with MPC-in-the-Head ZKP
Administrative Information
Tick your exercises in the TeachCenter. The deadline is right before the beginning of the exercise slot. Use your TUGonline to log in.
Points from:
- Three exercises, 20 points each
- One Presentation at the end of the term, 40 points
- Participation in Class, 10 Points
Grades:
| 1 |
>=90 points |
| 2 |
80-89 points |
| 3 |
70-79 points |
| 4 |
60-69 points |
Lecturers
