A Pairing Free Certificateless Group Key Agreement Protocol with Constant Round

Abstract

Abstract. To allow a secure conversation among a group of members over a public network there is a need of group key agreement protocol which provide a group session key used in necessary cryptographic operations. Nowadays the protocols based on the certificateless public key cryptography (CL-PKC) creating more attraction for research because it does not require certificates to authenticates the public key as like ID-based cryptosystem and unlike ID based cryptosystem, it does not suffers from the key escrow problem. The almost all CL-PKC based group key agreement schemes in current literature are employ bilinear pairing in their operations. Since the relative computation cost of pairing is many times more than the elliptic curve point multiplication, so it motivates the researchers to propose pairing free protocols based on the CL-PKC. The present paper propose an efficient pairing free group key agreement protocol based on certificateless cryptography over elliptic curve group with their security and performance analysis. The analysis shows that the proposed protocol has strong security protection against various kinds of attack and involves comparatively lower computation and communication overheads than the other existing protocols.

A One-Round Certificateless Authenticated Group Key Agreement Protocol for Mobile Ad Hoc Networks

“…Later on, some CLGKAs [3]- [6], [14] without calculating of bilinear pairings were put forward. Among those GKA protocols, only two of them take rather small computing cost [5], [14], which make them suitable for mobile Ad Hoc networks environment, while the protocol [8] proposed by Heo et al falls short of perfect forward security.…”