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
TLDR
This work presents a new mechanized prover for secrecy properties of security protocols that provides a generic method for specifying security properties of the cryptographic primitives, which can handle shared-key and public-key encryption, signatures, message authentication codes, and hash functions. Expand
Game-Based Criterion Partition Applied to Computational Soundness of Adaptive Security
TLDR
A general result of composition for security criteria is presented that can be applied to deduce security of a criterion from security of one of its sub-criterion and an indistinguishability criterion and gives a modular proof of computational soundness of symbolic encryption. Expand
A plausible approach to computer-aided cryptographic proofs
  • S. Halevi
  • Computer Science
  • IACR Cryptol. ePrint Arch.
  • 2005
TLDR
This paper advises creating an automated tool to help with the mundane parts of writing and checking common arguments in the authors' proofs and explains why it is thought that such a tool would be useful, by considering two very different proofs of security from the literature and showing the places where having this tool would have been useful. Expand
Towards mechanized correctness proofs for cryptographic algorithms: Axiomatization of a probabilistic Hoare style logic
TLDR
An axiomatization of implication between predicates which is purely semantically defined in the latter reference cited above is provided and illustrated its place in the formal verification technique given in the former. Expand
Modular code-based cryptographic verification
TLDR
This work presents the first modular automated program verification method based on standard cryptographic assumptions using F7, a refinement type checker coupled with an SMT-solver, and develops a probabilistic core calculus for F7 and formalizes its type safety in Coq. Expand
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
TLDR
A probabilistic framework that can be used to automatically generate verifiable mechanisms for multi-agent systems wherein agents need to trust the system and identified cases where the interactions between the designer and the game yield a positive outcome. Expand
Sufficient Conditions for Computational Intractability Regarding Generic Algorithms
The generic group model is a valuable methodology for analyzing the computational hardness of the number-theoretic problems used in cryptography. Although generic hardness proofs exhibit manyExpand
Towards mechanized correctness proofs for cryptographic algorithms
In [5] we build a formal verification technique for game based correctness proofs of cryptograhic algorithms based on a probabilistic Hoare style logic [10]. An important step towards enablingExpand
A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications
TLDR
This work begins by introducing definitions for the concepts of PRPs and PRFs secure against classes of RKAs, each such class being specified by an associated set of related-key deriving (RKD) functions, and proves impossibility results for some classes of attacks. Expand
The Security of Key Derivation Functions in WINRAR
TLDR
The security of PBKDF algorithm and the encrypted file in WINRAR are analyzed by the Game-Playing approach and the upper boundary of the Adversary’s Advantage over the random function is shown. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 49 REFERENCES
Luby-Rackoff Backwards: Increasing Security by Making Block Ciphers Non-invertible
TLDR
Strong quantitative bounds on the value of data-dependent re-keying in the Shannon model of an ideal cipher are proved, and some initial steps towards an analysis in the standard model are taken. Expand
On the Security of Randomized CBC-MAC Beyond the Birthday Paradox Limit: A New Construction
TLDR
This paper proposes a new construction of randomized CBC-MACs that resists birthday paradox attacks and provably reaches full security, and gives a full standard proof of this construction using one pass of a block-cipher with 2n-bit keys. Expand
Random oracles are practical: a paradigm for designing efficient protocols
TLDR
It is argued that the random oracles model—where all parties have access to a public random oracle—provides a bridge between cryptographic theory and cryptographic practice, and yields protocols much more efficient than standard ones while retaining many of the advantages of provable security. Expand
OAEP Reconsidered
  • V. Shoup
  • Computer Science
  • Journal of Cryptology
  • 2002
TLDR
It turns out—essentially by accident, rather than by design—that RSA-OAEP is secure in the random oracle model; however, this fact relies on special algebraic properties of the RSA function, and not on the security of the general OAEP scheme. Expand
Decorrelation over Infinite Domains: The Encrypted CBC-MAC Case
  • S. Vaudenay
  • Computer Science, Mathematics
  • Selected Areas in Cryptography
  • 2000
TLDR
This paper proves a result similar to Petrank and Racko 's one by using decorrelation theory, and with a slightly improved reduction, to be a general proving technique for security, which can be compared to the approach which was announced by Maurer at CRYPTO'99. Expand
Using Hash Functions as a Hedge against Chosen Ciphertext Attack
  • V. Shoup
  • Mathematics, Computer Science
  • EUROCRYPT
  • 2000
TLDR
A practical hybrid scheme is presented that is just as efficient as the scheme of of Cramer and Shoup and is slightly more efficient than the one originally presented, and it is proved that the scheme is secure if the Decisional Diffie-Hellman assumption is true. Expand
Fujisaki-Okamoto IND-CCA hybrid encryption revisited
TLDR
The aim of this work is to avoid attacks from the generic transformation, identifying the properties that an asymmetric scheme must hold to obtain a secure hybrid scheme, and improving the concrete security claimed in the original work for the Easy Verifiable Primitives. Expand
The Security of the Cipher Block Chaining Message Authentication Code
TLDR
A technical lemma of independent interest is bounding the success probability of a computationally unbounded adversary in distinguishing between a random ml-bit to l-bit function and the CBC MAC of a random l- bit to l -bit function. Expand
Indistinguishability of Random Systems
  • U. Maurer
  • Mathematics, Computer Science
  • EUROCRYPT
  • 2002
TLDR
A general framework for proving the indistinguishability of two random systems is proposed, based on the concept of the equivalence of two systems, conditioned on certain events, and an efficient construction of a quasi-random function is given which can be used as a building block in cryptographic systems based on pseudorandom functions. Expand
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
TLDR
A general framework that allows one to construct secure encryption schemes in a generic fashion from language membership problems that satisfy certain technical requirements is introduced, as does the Cramer-Shoup scheme based on the Decision Diffie-Hellman assumption. Expand
...
1
2
3
4
5
...