A new identity-based key exchange protocol minimizing computation and communication

Abstract

We propose a new identity-based key exchange protocol that minimizes the computation and communication required by participants in the protocol, and show that its security is closely related to some wellknown difficult problems. More specifically, we will argue that forging a key linked to a given identity is related to the difficulty of RSA inversion while finding the key established by the protocol is equivalent to breaking the Diffie-Hellman problem with composite modulus.