Paper 2006/260

A Note On Game-Hopping Proofs

Alexander W. Dent

Abstract

Game hopping is a method for proving the security of a cryptographic scheme. In a game hopping proof, we observe that an attacker running in a particular attack environment has an unknown probability of success. We then slowly alter the attack environment until the attackers success probability can be computed. We also bound the increase in the attacker's success probability caused by the changes to the attack environment. Thus, we can deduce a bound for the attacker's success probability in the original environment. Currently, there are three known ``types'' of game hop: transitions based on indistinguishability, transitions based on failure events, and bridging steps. This note introduces a fourth type of game hop.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Published elsewhere. Unknown status
Contact author(s)
a dent @ rhul ac uk
History
2013-10-27: last of 2 revisions
2006-08-02: received
See all versions
Short URL
https://ia.cr/2006/260
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2006/260,
      author = {Alexander W.  Dent},
      title = {A Note On Game-Hopping Proofs},
      howpublished = {Cryptology {ePrint} Archive, Paper 2006/260},
      year = {2006},
      url = {https://eprint.iacr.org/2006/260}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.