A Provable Secure ID-Based Explicit Authenticated Key Agreement Protocol Without Random Oracles

In this paper, we present an identity-based \it explicit authenticatedkey agreement protocol that is provably secure without random oracles.The protocol employs a new method to isolate a session key from keyconfirmation keys so that there is no direct usage of hash functionsin the protocol. The protocol is proved secure without randomoracles in a variant of Bellare and Rogaway style model, anexception to current proof method in this style model in theID-based setting. We believe that this key isolation method is noveland can be further studied for constructing more efficient protocols.