Code-Based Game-Playing Proofs and the Security of Triple Encryption TeX Export

@misc{citeulike:4264660, 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 maximal 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.}, author = {Bellare, Mihir and Rogaway, Phillip}, citeulike-article-id = {4264660}, citeulike-linkout-0 = {http://eprint.iacr.org/2004/331}, day = {30}, howpublished = {Cryptology ePrint Archive, Report 2004/331}, keywords = {encryption, games}, month = {Nov}, posted-at = {2009-04-02 22:24:07}, priority = {2}, title = {Code-Based Game-Playing Proofs and the Security of Triple Encryption}, url = {http://eprint.iacr.org/2004/331}, year = {2004} }

TY - ELEC ID - citeulike:4264660 L3 - citeulike-article-id:4264660 N2 - 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 maximal 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. TI - Code-Based Game-Playing Proofs and the Security of Triple Encryption KW - encryption KW - games AU - Bellare, Mihir AU - Rogaway, Phillip PY - 2004/Nov/30/ UR - http://eprint.iacr.org/2004/331 ER -