Corpus ID: 326377

The Game-Playing Technique

@inproceedings{Bellare2004TheGT,
  title={The Game-Playing Technique},
  author={M. Bellare and P. Rogaway},
  year={2004}
}
In the game-playing technique, one writes a pseudocode game such that an adversary’s advantage in attacking some cryptographic construction is bounded above by the probability that the game sets a ∞ag bad. This probability is then upper bounded by making stepwise, syntactical reflnements to the pseudocode|a chain of games. The approach was flrst used by Kilian and Rogaway (1996) and has been used repeatedly since, but it has never received a systematic treatment. In this paper we provide one… Expand
A Computationally Sound Mechanized Prover for Security Protocols
  • B. Blanchet
  • Computer Science
  • IEEE Transactions on Dependable and Secure Computing
  • 2008
A plausible approach to computer-aided cryptographic proofs
  • S. Halevi
  • Computer Science
  • IACR Cryptol. ePrint Arch.
  • 2005
Towards mechanized correctness proofs for cryptographic algorithms: Axiomatization of a probabilistic Hoare style logic
A probabilistic framework for Automated Mechanism Design
  • E. M. Tadjouddine
  • Computer Science
  • Proceedings of 2010 IEEE International Conference on Service Operations and Logistics, and Informatics
  • 2010
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 49 REFERENCES
Random oracles are practical: a paradigm for designing efficient protocols
OAEP Reconsidered
  • V. Shoup
  • Computer Science
  • Journal of Cryptology
  • 2002
Decorrelation over Infinite Domains: The Encrypted CBC-MAC Case
  • S. Vaudenay
  • Computer Science, Mathematics
  • Selected Areas in Cryptography
  • 2000
Using Hash Functions as a Hedge against Chosen Ciphertext Attack
  • V. Shoup
  • Mathematics, Computer Science
  • EUROCRYPT
  • 2000
Fujisaki-Okamoto IND-CCA hybrid encryption revisited
Indistinguishability of Random Systems
  • U. Maurer
  • Mathematics, Computer Science
  • EUROCRYPT
  • 2002
...
1
2
3
4
5
...