We will discuss authentication schemes, protocols for identification and their variants. Afterwards, we will go into zero knowledge protocols. Finally, we will build numerous cryptographic primitives upon these techniques.
In the first half of the semester there is a course on the foundations of provably secure cryptography.For further information see the corresponding section in the module handbook (in German only).
This course will make use of the literature given below. Beside this, there will be no lecture notes for this course.
| Date | Topic | Section in Katz/Lindell |
| 07.06. | introduction, message authentication codes | 4.1, 4.2, 4.3 |
| 10.06. | pseudo random functions, fixed-length MACs from PRFs |
3.6.1, 4.4 |
| 14.06. | hash-functions, collision-resistance, "birthday" lower bound, one-wayness |
4.6, (6.1.1) |
| 17.06. | collision-resistance vs. one-wayness, Merkle-Damgård transform |
(no section on CR vs OW), 4.6 |
| 21.06. | Hash-and-MAC paradigm, NMAC, privacy & authentication |
(12.4), 4.7, 4.9 |
| 24.06. | digital signature schemes, RSA signatures |
12.1, 12.2, (7.1, 7.2), 12.3 |
| 28.06. | RSA signatures, Hash-and-Sign paradigm | 12.3, 12.4 |
| 01.07. | One-time security, Lamport signatures | 12.5 |
| 05.07. | Random oracle model, RSA-FDH (full domain hash) |
13.1, 13.3 |
| 08.07. | Coron's analysis of RSA-FDH, introduction to identification protocols |
(no section in the book) |
| 15.07. | Fiat-Shamir protocol | (no section in the book) |
| 19.07. | (no section in the book) | |
| 22.07. | (no section in the book) |
19.07.: in exercise 13 it should be gcd(f1-f2,e)=1 instead of gcd(f1-f2,phi(N))=1