You are looking at a specific version 20120802:121558 of this paper. See the latest version.

Paper 2010/621

Generic Compilers for Authenticated Key Exchange (Full Version)

Tibor Jager and Florian Kohlar and Sven Schäge and Jörg Schwenk

Abstract

So far, all solutions proposed for {\em authenticated key agreement} combine key agreement and authentication into a single cryptographic protocol. However, in many important application scenarios, key agreement and entity authentication are clearly separated protocols. This fact enables efficient attacks on the na\"ıve combination of these protocols. In this paper, we propose new compilers for two-party key agreement and authentication, which are provably secure in the standard Bellare-Rogaway model. The constructions are generic: key agreement is executed first and results (without intervention of the adversary) in a secret session key on both sides. This key (or a derived key) is handed over, together with a transcript of all key exchange messages, to the authentication protocol, where it is combined with the random challenge(s) exchanged during authentication.

Note: Full version of the paper presented at ASIACRYPT 2010, Singapore.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. ASIACRYPT 2010
Keywords
authenticated key exchangeprotocol compilerTLS
Contact author(s)
florian kohlar @ rub de
History
2012-08-02: last of 3 revisions
2010-12-08: received
See all versions
Short URL
https://ia.cr/2010/621
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.