Reading the Crypto Classics: Bellare and Rogaway: „Code-based Game-playing Proofs and the Security of Triple Encryption“

19.05.2021 10:00-11:00

Moderator: Patrick Struck (TU Darmstadt, QPC Group) | Location: Online

Organizer: Christian Janson, TU Darmstadt, Cryptoplexity Group


Abstract

This talk is the second one in the seminar series „Reading the Crypto Classics“ for the very special summer term 2021. The idea of this seminar is to jointly read classical milestone papers in the area of cryptography, to discuss their impact and understand their relevance for current research areas. The seminar is running as an Oberseminar, but at the same time meant to be a joint reading group seminar of the CROSSING Special Interest Group on Advanced Cryptography with all interested CROSSING members being invited to participate.


This issue will cover the paper

Bellare and Rogaway: „Code-based Game-playing Proofs and the Security of Triple Encryption“ (Eurocrypt 2006); available at https://eprint.iacr.org/2004/331.pdf with the following abstract:

„The game-playing technique is a powerful tool for analyzing cryptographic constructions. We illustrate this by using games as the central tool for proving security of three-key triple-encryption, a long-standing open problem. Our result, which is in the ideal-cipher model, demonstrates that for DES parameters (56-bit keys and 64-bit plaintexts) an adversary’s maxi-mal advantage is small until it asks about 2^78 queries. Beyond this application, we develop the foundations for game playing, formalizing a general framework for game-playing proofs and discussing techniques used within such proofs. To further exercise the game-playing framework we show how to use games to get simple proofs for the PRP/PRF Switching Lemma, the security of the basic CBC MAC, and the chosen-plaintext-attack security of OAEP.“


Further information about the virtual format

For participation the following Meeting Link is required:
https://bbb.cryptoplexity.informatik.tu-darmstadt.de/r/CX-Crypto-Classics


More information

CROSSING Wiki