A round-optimal three-party ID-based authenticated key agreement protocol
In this paper, we propose a round-optimal identity-based authenticated key agreement protocol for a three-party setting in which three parties can actually transmit messages simultaneously. We then give its security proof in the random oracle model under the Bilinear DiffieHellman assumption.
authenticated key agreement identity-based system digital signature collusion attack algorithm with k-traitor problem bilinear diffiehellman problem