Slides Intro to Provable Security online
You will now find the slides for the introductory lecture on provable security in the "materials" section.
Please note that the schedule has changed.
Schedule and Topic Assignment
The schedule with Zoom details and the topic assignment have been sent out via email. Home page updated to reflect this. Calendar entries added.
Students assigned to the proseminar can now register for the course in the CMS until May 10, 2020.
Seminal Papers in Cryptography
In this proseminar we study a selection of seminal research works in cryptography—starting with the invention of public-key cryptography in the 1970s and making our way towards the present. We discuss the novelty of these research results when they were first published as well as how they have shaped our understanding of modern cryptography.
Kick-off: Thu, May 07 16:15-17:45 (Zoom details received by mail, if not contact me)
- Weekly slot: Fridays, 16:15-17:45 (Zoom details received via email) (12 June - 17 July)
- Assignment of Topics: received via email
- 2 presentations à 20-23 min + 20 min group discussion
- Final grade determined by presentation + active participation in discussion (read each paper before the session)
- Language is English both for presentation and discussion
Requirements: A basic understanding of cryptographic primitives such as encryption, signatures, and hash functions
|12 June||A Short Introduction to Provable Security in Modern Cryptography|
|19 June||Diffie, Hellman: New Directions in Cryptography (1976)|
|Merkle: Secure Communications over Insecure Channels (1978)|
|26 June||Rivest, Shamir, Adleman: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (1978)|
|Joux: A One Round Protocol for Tripartite Diffie-Hellman (2000)|
|03 July||Shamir: How to Share a Secret (1979)|
|Micali, Rogaway: Secure Computation (Abstract) (1991)|
|10 July||Goldwasser, Micali: Probabilistic Encryption & How to Play Mental Poker Keeping Secret All Partial Information (1982)|
|Goldreich, Goldwasser, Micali: How to Construct Random Functions (1986)|
|17 July||Bellare Rogaway: Random Oracles are Practical: A Paradigm for Designing Efficient Protocols (1993)|
|Bellare, Canetti, Krawczyk: Keying Hash Functions for Message Authentication (1996)|