Welcome to the resource topic for 2006/056
Title:
Key Exchange Protocols: Security Definition, Proof Method and Applications
Authors: Anupam Datta, Ante Derek, John C. Mitchell, Bogdan Warinschi
Abstract:We develop a compositional method for proving cryptographically
sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventional runs of a protocol against a probabilistic polynomial-time attacker.
Since key indistinguishability and other previous specifications
of secure key exchange suffer from specific compositionality problems, we develop a suitable specification of acceptable key generation. This definition is based on a simple game played by an adversary against a key exchange protocol and a conventional challenger characterizing secure encryption (or other primitives of interest). The method is illustrated using a sample protocol.
ePrint: https://eprint.iacr.org/2006/056
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .