Sequences of games: a tool for taming complexity in security proofs

By Victor Shoup. IACR Cryptology ePrint Archive, 2004

990 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/d63c80e9c30bda56c1718d58867ccffe7df07240

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

On Privacy Models for RFID (2007, methodology): “We use the proof methodology of Shoup [37].”
A Modular Analysis of the Fujisaki-Okamoto Transformation (2017, methodology): “Following [38, 8], we use code-based games.”
The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs (2006, background): “Shoup has independently and contemporaneously prepared a manuscript on game playing [15], advocating the use of game chains to make proofs more accessible.”
Formal certification of code-based cryptographic proofs (2009, methodology): “Shoup [32] classifies proof steps into three categories: tra nsitions based on indistinguishability—which typically involve ap plying a security hypothesis, e.”
Provably Secure Authenticated Key Agreement Scheme for Smart Grid (2018, methodology): “We also use the difference lemma [23], [24] for our formal”
Formal Proofs for the Security of Signcryption (2002, background): “(Readers are referred to the surveys on this technique such as [28] or [9].”
New Proofs for NMAC and HMAC: Security without Collision Resistance (2006, unknown): “(The Prf(AU)=Prf lemma is alluded to in [4, 11], and variants are in [11, 12].) A simple proof of Lemma 2, using games [10, 29 ], is in [2].”
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries (2008, methodology): “The use of a KDF for this purpose was proven secure in the context of hashed ElGamal in [22], on the assumption that KDF is chosen from a family of hash functions which are entropy smoothing.”
How To Simulate It - A Tutorial on the Simulation Proof Technique (2016, methodology): “We recommend reading more about this technique in the tutorial on sequences of games by Shoup [37].”
A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications (2003, background): “From the fundamental lemma of game-playing (Lemma 4 of [4] and Lemma 1 of [29]), we have that ∣∣∣Pr [ GameS0K,D(A) = 1 ]− Pr [ GameS1K,D(A) = 1 ] ∣∣∣ ≤ Pr0 [B ] .”
Computer-Aided Security Proofs for the Working Cryptographer (2011, methodology): “This can be seen as a semantic variant of the Fundamental Lemma of Game-Playing; the logic allows to dispense with the code instrumentation needed to apply the syntactic counterpart of the lemma.”
On Signatures of Knowledge (2006, background): “Our second definition is a game-style one [22, 3].”