An ECC‐based authenticated group key exchange protocol in IBE framework

Abstract

With the rapid demand for various increasing applications, the internet users require a common secret key to communicate among a group. The traditional key exchange protocols involve a trusted key generation center for generation and distribution of the group key among the various group members. Therefore, the establishment of a trusted key generation center server and the generation (and distribution) of common session key require an extra overhead. To avoid this difficulty, a number of group key exchange protocols have been proposed in the literature. However, these protocols are vulnerable to many attacks and have a high computational and communication cost. In this paper, we present an elliptic curve cryptography-based authenticated group key exchange (ECC-AGKE) protocol, which provides better security and has lower computational cost compared to related proposed schemes. Further, a complexity reduction method is deployed to reduce the overall complexity of the proposed elliptic curve cryptography-based authenticated group key exchange protocol. The security of proposed work is ensured by the properties of elliptic curves. A security adversarial model is given and an extensive formal security analysis against our claim is done in the random oracle model. We also made a comparison of our proposed protocol with similar works and found that ours have better complexity, security and efficiency over others. KEYWORDSauthentication, bilinear pairing, elliptic curve cryptography, group key exchange, secure communication to negotiate a common session key to secure their communication on a public network. The formal definition of key exchange protocol is given below: Definition 1.1. (Key negotiation technique): Suppose there are N-end users, namely, U 1 , U 2 … U N . These end users are willing to generate a common secret key K for securing the network communications among them. Each participating user {U i , i = 1, 2, … N} generates his key-related message, say {m i , i = 1, 2, … N} using some security parameter n and exchanges this message among themselves. Using these key-related messages m i , each Int J Commun Syst. 2017;30:e3363.wileyonlinelibrary.com/journal/dac

Simple and Effective Secure Group Communications in Dynamic Wireless Sensor Networks

“…Gupta and Biswas [43] proposed a group key by asking each node in the group to produce certain values. These values can be computed by each node to generate the group key for the group.…”

On the Security of Authenticated Group Key Agreement Protocols

“…Ephemeral Key Leakage Attack: Another drawback of the scheme is, the leakage of ephemeral key directly compromises the group session key. However, the authors claim in Theorem 7.9 [10], the session key resistance against the leakage of session specific temporary information but the given session key formula K i = nr i ψ i−1 + Y i is completely dependent on r i .…”

“…Another work on authenticated group key agreement protocol without pairing is presented by Sharma et al [18]. Recently in 2017, Gupta and Biswas [10] presented an ECCbased AGKA protocol and claimed it computationally efficient. However, in this paper, we present security flaws in their construction and proved it insecure.…”

Tightly‐secure two‐pass authenticated key exchange protocol using twin Diffie–Hellman problem

“…Several cryptographic primitives have tight security construction, such as public‐key encryption [4, 6, 8, 13 ], identity‐based encryption [9, 17 ], and signature scheme [5, 7, 18 ]. Unfortunately, most of the existing AKE protocols such as [10–12, 19–23 ] do not consider tight security. To achieve tight security, Bader et al 's protocol [4 ] used multi‐user secure KEM and multi‐user secure signature scheme as building blocks, and has a three‐pass execution.…”