Key Exchange Protocols: Security Definition, Proof Method and Applications

@misc{citeulike:1287886, 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 reasoning about an unbounded number of runs of a protocol involves induction-like arguments about properties preserved by each run, we formulate a specification of secure key exchange that, unlike conventional key indistinguishability,...}, author = {Datta, Anupam and Derek, Ante and Mitchell, John C. and Warinschi, Bogdan }, citeulike-article-id = {1287886}, keywords = {keyexchange, security}, posted-at = {2007-05-10 11:38:02}, priority = {3}, title = {Key Exchange Protocols: Security Definition, Proof Method and Applications}, url = {http://citeseer.ist.psu.edu/datta06key.html} }

TY - GEN ID - citeulike:1287886 L3 - citeulike-article-id:1287886 TI - Key Exchange Protocols: Security Definition, Proof Method and Applications N2 - 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 reasoning about an unbounded number of runs of a protocol involves induction-like arguments about properties preserved by each run, we formulate a specification of secure key exchange that, unlike conventional key indistinguishability,... KW - keyexchange KW - security AU - Datta, Anupam AU - Derek, Ante AU - Mitchell, John AU - Warinschi, Bogdan UR - http://citeseer.ist.psu.edu/datta06key.html ER -