englishCryptography - Provable Security (SS 2012)
Topics
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.
Module information
- Module III.2.3: Komplexität und Kryptographie (complexity and cryptography)
- V2 + Ü1 SWS (contact time)
- 4 ECTS credits (workload)
- Useful previos knowledge: Introduction to Cryptography or Einführung in Kryptographie (German) or any equivalent course
- This course will be held in english.
For further information see the corresponding section in the module handbook (in German only).
Dates
This course will be held in the first half (April/May) of the semester.- Lecture:
- Tuesday, 9 - 11 o'clock, room F0.530
- Thursday, 14 - 16 o'clock, room F1.110
- Tutorials:
- Tuesday, 7:30 - 9 o'clock, room F0.530
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.
Lecture Notes
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 |
| 19.04 | pseudo-random functions | 3.6.1 |
| 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 |
Slides
Exercises
Literature
- Bellare, Rogaway: Lecture Notes on "Introduction to Modern Cryptography", University of California, San Diego, 2004--2005. Lecture notes available online!
- Goldreich: "Foundations of Cryptography, Volume 1: Basic Tools", Cambridge University Press, 2001. ISBN: 0-521-79172-3. Early draft version available online!
- Goldreich: "Foundations of Cryptography, Volume 2: Basic Applications", Cambridge University Press, 2004. ISBN: 0-521-83084-2.
- Goldwasser, Bellare: Lecture Notes on "Cryptography", MIT, 1996--2001. Lecture notes available online!
- Katz, Lindell: "Introduction to Modern Cryptography", Chapman & Hall / CRC Press, 2007. ISBN: 1-5848-8551-3
- Lindell: Lecture Notes on "Introduction to Cryptography", Bar-Ilan University, 2005. Lecture notes available online!
- Menezes, van Oorschot, Vanstone: "Handbook of Applied Cryptography", CRC Press, 1996. ISBN: 0-8493-8523-7. Complete book available online!
- Shoup: "A Computational Introduction to Number Theory and Algebra", Cambridge University Press, 2005. ISBN: 0-521-85154-8. Complete book available online!
- Stinson: "Cryptography: Theory and Practice", 2nd edition, Chapman & Hall / CRC Press, 2001. ISBN: 1-5848-8206-9.
- Trappe, Washington: "Introduction to Cryptography with Coding Theory", 3rd edition, Chapman & Hall / CRC Press, 2005. ISBN: 1-5848-8508-4.
see also the corresponding entry in
