The Department of Computer Science at PSU's Maseeh College of Engineering and Computer Science presents as part of the Computer Science Colloquium Series, The Game-Playing Technique and its Application to Triple Encryption.
Title: "The Game-Playing Technique and its Application to Triple Encryption"
Speaker: Phillip Rogaway, University of California, Davis
Date: March 13, 2006
Time: 12:00 - 1:00 p.m.
Location: Room 10, Fourth Avenue Building, 1900 SW Fourth Avenue, Portland, Oregon 97201 (map)
This series is free and open to the public. For further information, contact the Department of Computer Science, (503) 725-2416 or email@example.com.
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 278 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.
Phil Rogaway completed his Ph.D. in 1991 at MIT, under Silvio Micali. After a stint at IBM, he came to UC Davis in 1994. Phil is the co-inventor of "practice-oriented provable-security". In recent years, Phil spends about half his time in the US and half in Northern Thailand.