Seminar Kryptographie - 150507

Wintersemester 2010/2011

Dozent Zeit Raum Erstmals am
Eike Kiltz dienstags 14.00 - 16.00 NA 5/64 19.10.2010

Vorbesprechung

Achtung: Vorbesprechung ist doch schon am 19.10.!!!!

Inhalt

Behandelt werden klassische und aktuelle Forschungsergebnisse aus dem Themengebiet der Kryptographie mit dem Fokus auf Public-Key Verschlüsselung und Digitale Signaturen.

Vortragsliste
Datum Thema Vortragender
07.12.2010 Sequences of games: a tool for taming complexity in security proofs Minh Duc Ngo
14.12.2010 Chosen-Ciphertext Security via Correlated Products Florian Giesen
21.12.2010 ???
Winterpause
11.01.2011 Fully Homomorphic Encryption over the Integers Ilya Ozerov
18.01.2011 Short Signatures from the Weil Pairing Jörn Buchwald
25.01.2011 Efficiency Improvements for Signature Schemes with Tight Security Reductions Michael Wientiedt
01.02.2011 Short Signatures Without Random Oracles Ingo Jesse

Themenbereich I: Public-Key Verschluesselung


  • Victor Shoup. Sequences of games: a tool for taming complexity in security proofs. Manuscript from shoup.net

  • Ronald Cramer, Victor Shoup: A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack. CRYPTO 1998: 13-25.

  • Y. Desmedt, R. Gennaro, K. Kurosawa, V. Shoup: A new and improved paradigm for hybrid encryption secure against chosen-ciphertext attack, . To appear, J. Cryptology. Available from shoup.net.

  • Eike Kiltz, Krzysztof Pietrzak, Martijn Stam, Moti Yung: A New Randomness Extraction Paradigm for Hybrid Encryption. EUROCRYPT 2009: 590-609

  • Chris Peikert, Brent Waters: Lossy trapdoor functions and their applications. STOC 2008: 187-196

  • Alon Rosen, Gil Segev: Chosen-Ciphertext Security via Correlated Products. TCC 2009: 419-436

  • David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev: More Constructions of Lossy and Correlation-Secure Trapdoor Functions. Public Key Cryptography 2010: 279-295

  • Eiichiro Fujisaki, Tatsuaki Okamoto, David Pointcheval, Jacques Stern: RSA-OAEP Is Secure under the RSA Assumption. J. Cryptology 17(2): 81-104 (2004)

  • Eike Kiltz, Adam O'Neill, Adam Smith: Instantiability of RSA-OAEP under Chosen-Plaintext Attack. CRYPTO 2010: 295-313

  • Eike Kiltz, Krzysztof Pietrzak: On the Security of Padding-Based Encryption Schemes - or - Why We Cannot Prove OAEP Secure in the Standard Model. EUROCRYPT 2009: 389-406

Themenbereich II: Digitale Signaturen

  • Dan Boneh, Ben Lynn, Hovav Shacham: Short Signatures from the Weil Pairing. ASIACRYPT 2001: 514-532

  • Dan Boneh, Xavier Boyen: Short Signatures Without Random Oracles. EUROCRYPT 2004: 56-73

  • Ronald Cramer, Victor Shoup: Signature Schemes Based on the Strong RSA Assumption. ACM Conference on Computer and Communications Security 1999: 46-51

  • Susan Hohenberger, Brent Waters: Short and Stateless Signatures from the RSA Assumption. CRYPTO 2009: 654-670

  • Dennis Hofheinz, Eike Kiltz: Programmable Hash Functions and Their Applications. CRYPTO 2008: 21-38

Spielregeln

* 45-60 minütiger Vortrag
* keine Ausarbeitung
* Anwesenheitspflicht an sämtlichen Terminen
* 2 Wochen vor dem Vortragstermin persönlich beim Betreuer erscheinen, um das Verständnis des Inhalts zu zeigen
* 1 Woche vor dem Vortragstermin die Folien kurz dem Betreuer präsentieren
* Viel Spass!