We discuss several advanced security concepts like semantic security and plaintext indistinguishability. We also describe several techniques to design cryptosystems that meet these strong security requirements. In particular, we discuss one-way functions, pseudorandom generators, and pseudorandom functions. Finally, we compare the security of cryptosystems used in practice (like AES and RSA) with advanced security concepts.
In the second half of the semester there will be a course on cryptographic protocols.
For further information see the corresponding section in the module handbook (in German only).
The second slot for the exams is at the end of september. Write an E-mail to Claudia Jahn with your desired date 25, 26 or 28 September.
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|
|03.04.||introduction, private-key encryption, perfect secrecy||1.1, 1.2, 1.3, 2.1|
|05.04.||perfect secrecy & 1-time pad||2.1, 2.2, 2.3|
|10.04.||indistinguishable encryptions and pseudorandom generators||3.1, 3.2, 3.3|
|12.04.||indistinguishable encryption from PRG; multiple encryptions||3.4|
|17.04||cpa-secure encryption schemes and pseudo-random functions||3.5|
|24.04||From PRF to cpa-security||3.6.2|
|26.04||Block ciphers, Feistel ciphers, DES||3.6.3, 5.2 - 5.4|
|03.05||SPNs and AES||5.1, 5.5|
|08.05||One-way-functions, hardcore predicates and PRG||6.1, 6.2, 6.3.1|
|10.05||Constructing pseudorandom generators, hybrid distributions||6.4|
|15.05||Constructing pseudorandom functions||6.5|
|22.05||Final lecture - summary|