Efficient Group Key Agreement Protocol Research Articles

Tree and elliptic curve based efficient and secure group key agreement protocol

Group Key Agreement Protocol (GKAP) is a cryptographic mechanism where members of a group agree on a common key by sharing their blinded keys over a public channel. Sharing a key over a public channel is a security threat and expensive in terms of communication cost. In this paper, we proposed the GKAP based on tree and elliptic curve. For reducing the communication cost, we have used the divide-and-conquer mechanism with that group is divided into small subgroups and forming a tree-like structure. The modified Elliptic-Curve-Diffie–Hellman used for sharing the blinded key over a public network channel securely. This paper discussing different group key management operations are initialization, join, mass join, leave, mass-leave, merge with their communication cost are the number of rounds, unicast cost, broadcast cost, messages. This paper discussing the establishment of common keys not only for the group but also for the subgroups. Based on communication cost, we have compared the performance of proposed method with the existing approaches like Communication-Computation Efficient Group Key Algorithm (CCEGK), Tree-based group key agreement (TGDH), Ternary-tree based group key agreement protocol for dynamic group (TTGKAP), Group key generation tree protocol (GKGT), Ternary tree-based group key agreement protocol over elliptic curve for dynamic group (TTEGKAP), Efficient Group key agreement using hierarchical key tree (EGKAKT). From performance analysis, it is cleared that proposed approach performed better in most of the cases than the existing approaches. The proposed approach is safe against passive attack, collaborative attack, forward secrecy, backward secrecy, and man-in-the-middle attack.

A secure and efficient group key agreement approach for mobile ad hoc networks

Mobile ad hoc networks have been used in many application areas such as sensors, file sharing and vehicle-to-vehicle communications. Providing secure communications among the users in such networks is a significant issue. Group key agreement protocols are frequently used to provide security in mobile ad hoc networks. There is a number of problems related to the use of group key agreement protocols in mobile ad hoc networks, such as adaptation in cluster-based communications, securely selecting the cluster head for inter-cluster communications, providing secure group key update mechanism for dynamic groups and reducing costs of communications and computations. In this study, we propose a secure and efficient group key agreement protocol that is adaptive for cluster-based communications in mobile ad hoc networks. We describe a novel secure cluster-head selection mechanism in the proposed protocol. The protocol provides security for dynamic group operations in addition to the basic security properties. The proposed protocol also provides better performance in terms of reducing the communications and computational costs. Finally, we present a set of simulations for the proposed protocol in mobile ad hoc networks scenario.

A Self-Authentication and Deniable Efficient Group Key Agreement Protocol for VANET

With the rapid development of vehicular ad hoc Network (VANET), it is gaining significant popularity and receiving increasing attentions from academics and industry in security and efficiency. To address security and efficiency issues, a self-authentication and deniable efficient group key agreement protocol is proposed in this paper. This scheme establishes a group between road-side unit (RSU) and vehicles by using self-authentication without certification authority, and enhances certification efficiency by using group key (GK) transmission method. At the same time, to avoid the attacker to attack the legal vehicle by RSU, we adopt deniable group key agreement method to negotiation session key (sk) and use it to transmit GK between RSU. In addition, vehicles not only broadcast messages to other vehicles, but also communicate with other members in the same group. So group communication is necessary in VANET. Finally, the security and performance analysis shown that our scheme is security, meanwhile the verification delay, transmission overheard and message delay are more efficient than other related schemes in authentication, transmission and communication.

A secure key agreement protocol for dynamic group

To accomplish secure group communication, it is essential to share a unique cryptographic key among group members. The underlying challenges to group key agreement are scalability, efficiency, and security. In a dynamic group environment, the rekeying process is more frequent; therefore, it is more crucial to design an efficient group key agreement protocol. Moreover, with the emergence of various group-based services, it is becoming common for several multicast groups to coexist in the same network. These multicast groups may have several shared users; a join or leave request by a single user can trigger regeneration of multiple group keys. Under the given circumstances the rekeying process becomes a challenging task. In this work, we propose a novel methodology for group key agreement which exploits the state vectors of group members. The state vector is a set of randomly generated nonce instances which determine the logical link between group members and which empowers the group member to generate multiple cryptographic keys independently. Using local knowledge of a secret nonce, each member can generate and share a large number of secure keys, indicating that SGRS inherently provides a considerable amount of secure subgroup multicast communication using subgroup multicasting keys derived from local state vectors. The resulting protocol is secure and efficient in terms of both communication and computation.

Secure Chaotic Maps-based Group Key Agreement Scheme with Privacy Preserving

Nowadays chaos theory related to cryptography has been addressed widely, so there is an intuitive connection between group key agreement and chaotic maps. Such a connector may lead to a novel way to construct authenticated and efficient group key agreement protocols. Many chaotic maps based two-party/three-party password authenticated key agreement (2PAKA/3PAKA) schemes have been proposed. However, to the best of our knowledge, no chaotic maps based group (N-party) key agreement protocol without using a timestamp and password has been proposed yet. In this paper, we propose the first chaotic maps-based group authentication key agreement protocol. The proposed protocol is based on chaotic maps to create a kind of signcryption method to transmit authenticated information and make the calculated consumption and communicating round restrict to an acceptable bound. At the same time our proposed protocol can achieve members' revocation or join easily, which not only refrains from consuming modular exponential computing and scalar multiplication on an elliptic curve, but is also robust to resist various attacks and achieves perfect forward secrecy with privacy preserving.

An efficient group key agreement protocol for secure P2P communication

AbstractThe efficient design of a distributed group key management for a peer to peer (P2P) network with minimal computation complexity in dynamic secure group communication is a challenging issue. This is because of the absence of a centralized coordinator. In order to provide this facility, a self‐composed distributed group key management framework is proposed for secure P2P communication. In this proposed work, group key computation is performed using Chinese remainder theorem and secure communication is performed through RSA encryption algorithm. This self‐composed key management is a one round protocol in which a shared group key is generated using the public key of each individual user, and it is derived from the respective private key. The main advantage of the group key management scheme proposed in this paper is that it reduces the computation complexity of the peer users to O(1). This reduction in computation complexity is achieved by performing one addition and multiplication operation during a single member join and one subtraction operation during a single member leave operation. The proposed algorithm has been implemented and analyzed with well‐known existing distributed group key management protocols and observed that it reduces the computation complexity significantly. Copyright © 2016 John Wiley & Sons, Ltd.

Ternary Tree based Group Key Agreement Protocol Over Elliptic Curve for Dynamic Group

group communication is an active area of research and its popularity is fuelled by the growing importance of group oriented internet applications such as voice & video conferences, pay per view, etc. Several groupware applications like video conferences, distributed computations, etc requires secure transmission while communicating over the Internet. For secure communication, the integrity of the messages, member authentication, and confidentiality are must be provided among group members. To provide message integrity all group members must be agreed up on a common group key to encrypt and decrypt the messages. This paper proposes an efficient and contributory group key agreement protocol and also support dynamic operations like join, leave, merge, etc. by using ECC based Diffie Hellman key exchange. This protocol employs ternary tree like structure instead of binary tree in the process of group key generation. The performance of the proposed scheme is compared with that of several others existing schemes in literature and it is found that the proposed one is performs well in terms of communication and computation cost. In addition, the formal security validation is done using AVISPA tool that demonstrated that the proposed protocol is safe against passive and active attacks.

Design and Performance Analysis of Queue-based Group Diffie-Hellman Protocol (QGDH)

Current group key agreement protocols, which are often tree-based, have unnecessary delays that are caused when members with low-performance computer systems join a group key computation process. These delays are caused by the computations necessary to balance a key tree after membership changes. An alternate approach to group key generation that reduces delays is the dynamic prioritizing mechanism of queue-based group key generation. We propose an efficient group key agreement protocol and present the results of performance evaluation tests of this protocol. The queue-based approach that we propose is scalable and requires less computational overhead than conventional tree-based protocols.

Group Key Agreement From Signcryption

There is an intuitive connection between signcryption and key agreement. Such a connector may lead to a novel way to construct authenticated and efficient group key agreement protocols. In this paper, we present a primary approach for constructing an authenticated group key agreement protocol from signcryption. This approach introduces desired properties to group key agreement. What this means is that the signcryption gives assurance to a sender that the key is available only to the recipient, and assurance to the recipient that the key indeed comes from the sender. Following the generic construction, we instantiate a distributed two-round group key agreement protocol based on signcryption scheme given by Dent [8]. We also show that this concrete protocol is secure in the outsider unforgeability notion and the outsider confidentiality notion assuming hardness of the Gap Diffie-Hellman problem.

Re-Ordering of Users in the Group Key Generation Tree Protocol

Abstract Tree-based Group Diffie-Hellman (TGDH) is one of the efficient group key agreement protocols to generate the GK. TGDH assumes all members have an equal computing power. As one of the characteristics of distributed computing is heterogeneity, the member can be at a workstation, a laptop or even a mobile computer. Therefore, the group member sequence should be reordered in terms of the member’s computing power to improve performance. This research proposes a reordering of members in the group key generation tree to enhance the efficiency of the group key generation. Key Words : Protocol design, network security, authentication, group communication, agreement protocols, group key management. * 소속 직책: 백석대학교 정보통신학부 조교수논문접수: 2012년 6월 27일, 1차 수정을 거쳐, 심사완료: 2012년 7월 23일 1. Introduction Android phones and iPhone are used a lot by users. More than 70% of cell phone users are smart phones which are able to communicate with other smart phone users. Group communications are pervaded over the network such as video conferences and on-line chatting programs, games, and gambling. Security plays an important role in these instances of group communication. According to [11], user authentication processes and key distribution are just at the beginning of the group communication [11]. The CGK generation, on the other hand, takes a relatively long time to complete. For achieving a high level of security, the CGK should be changed after every user joins and leaves so that a former group member has no access to current communications and a new member has no access to previous communications [11] To improve the group communication efficiency, the CGK generation needs to be optimized by the improved key generation algorithm. Accordingly, group key agreement protocol focuses on the CGK generation. The function for generating CGK in the group key agreement is a modular exponentiation. In order to calculate the CGK using modular exponentiations, the adaptation of key trees is needed to reduce the computational overhead. Modular exponentiation is the computationally most expensive operation in TGDH [2]. The number of exponentiations for membership events depends on the number of

Key Agreement for Large-Scale Dynamic Peer Group

Many applications in distributed computing systems, such as IP telephony, teleconferencing, collaborative workspaces, interactive chats and multi-user games, involve dynamic peer groups. In order to secure communications in dynamic peer groups, group key agreement protocols are needed. In this paper, we come up with a new group key agreement protocol, composed of a basic protocol and a dynamic protocol, for large-scale dynamic peer groups. Our protocols are natural extensions of one round tripartite Diffie-Hellman key agreement protocol. In view of it, our protocols are believed to be more efficient than those group key agreement protocols built on two-party Diffie- Hellman key agreement protocol. In addition, our protocols have the properties of group key secrecy, forward and backward secrecy, and key independence.

Cryptanalysis of an efficient password-based group key agreement protocol

Password-based group key agreement protocols are fundamental component of the communications systems. In 2009, Zheng et al. proposed an efficient and provably secure password-based agreement protocol and declared their protocol is secure in the ideal-cipher and random oracle models under the DDH problem. In this paper, we propose an online dictionary attack against Zheng et al.’ protocol, which an adversary can test more than one password in a session. If the number of users is few, this attack can not lead to security problem. However, if many users participate in this protocol, the security problem can not be ignored.

Insider Attack on A Password-Based Group Key Agreement

In 2009, Zheng et al. proposed an efficient password-based group key agreement protocol resistant to the dictionary attacks by adding password-authentication services to a non-authenticated multi-party key agreement protocol proposed by Horng. They claimed that the proposed protocol is very efficient since it only requires constant rounds to agree upon a session key, and each user broadcasts a constant number of messages and only requires four exponentiations. Under the Decisional Diffie-Hellman assumption, they shown the proposed protocol is provably secure in both the ideal-cipher model and the random-oracle model. But in this paper, we show that the protocol Zheng et al. proposed is vulnerable to an active insider attack.

Secure and efficient group key agreement protocol

Group Key Agreement ( GKA ) is one of the important methods to ensure the subsequent secure communication. A new group key agreement protocol was proposed in this paper. In this protocol, the participants could verify the honesty of other participants by a series of algorithms. The new protocol realized the secure session key agreement with lower computational cost. In addition, it has the fault-tolerance property and the long term key-reuse property. The performance analysis results show that this protocol can resist many common attacks.

A New Group Key Agreement Protocol for Ad Hoc Networks

A mobile ad hoc network is a collection of autonomous nodes that communicate with each other by forming a multi-top wireless network. Different from conventional wireless networks, the resource of the nodes in ad hoc networks is limited and there may be tens of thousands of low-power energy constrained nodes in ad hoc networks. As such, the costs of the nodes resource and the network size should be taken into consideration when constructing a group key agreement protocol in the ad hoc networks. In this paper, an efficient and scalable group key agreement protocol based on layer-cluster group model for mobile ad hoc networks was proposed. In this protocol, multi-linear map is employed on layer-cluster structure to establish and allocate group key. So that it can not only meet security demands of larger mobile ad hoc networks but also improve executing performance.

An efficient dynamic group key agreement protocol for imbalanced wireless networks

AbstractOwing to the popularity of wireless networks, the group key agreement (GKA) design is critical for providing secure group communications over an insecure wireless channel. In 2005, Nam et al. proposed a GKA protocol for imbalanced wireless networks in which an imbalanced wireless network consists of many mobile nodes with limited computing capability and a powerful node with less restriction. In 2007, Tseng showed that Nam et al.'s protocol is not a contributory GKA, while he also proposed a new GKA protocol. However, neither GKA protocol is concerned with dynamic member joining/leaving. This is an important functionality of GKA, especially for a wireless network environment. In this paper, we propose a dynamic group key agreement protocol for imbalanced wireless networks, and show that it requires less computation cost for dynamic member joining/leaving as compared to the previously proposed protocols. We also show that the proposed protocol is provably secure against passive attacks under the decision Diffie–Hellman problem and the hash function assumptions. Furthermore, by the pre‐shared two‐party key between a mobile node and the powerful node in the existing imbalanced wireless networks, we propose a generalized GKA protocol that requires only several hash functions. Copyright © 2010 John Wiley & Sons, Ltd.

Efficient cluster-based group key agreement protocols for wireless ad hoc networks

The special nature and the constraints posed by wireless ad hoc networks make the establishment of a group key among all nodes a difficult and challenging task. Therefore, the execution of a group key agreement protocol which involves all the nodes in the network must be very carefully selected having in mind both the computation and communication efficiency. In this paper, we present an efficient group key agreement protocol which is particularly suitable for energy constrained, dynamically evolving wireless ad hoc networks. The topology of the network is reflected in a structure composed by small clusters. This clustering allows the synchronous execution of efficient tripartite key agreement protocols based on pairings. The required computations are simple for the devices to implement, the size of the exchanged messages is minimum and the storage memory required in every node is very small. The proposed protocol achieves a good energy balance and is very flexible because it can be used either as contributory, non-contributory, unauthenticated or authenticated protocol by simply modifying a step of the protocol. Finally, we compare the communication/computation complexity of the unauthenticated and authenticated versions of our protocol with previously known protocols and show that they compare favourably with them.

An efficient fault-tolerant group key agreement protocol

Group key agreement (GKA) is a mechanism important for establishing a session key used to encrypt and/or decrypt sensitive messages transmitted to an intended group of receivers in an open network. An efficient group key agreement protocol capable of fault-tolerance named efficient GKA (EGKA) is proposed in this paper. EGKA is not only resistant to DoS attacks, replay attacks, man-in-the-middle attacks and common modulus attacks but also achieves forward secrecy. The efficiency analysis shows that EGKA is more efficient than previous fault-tolerant GKA protocols mentioned in our paper. Moreover, the long-term keys of participants can be reused which reduce the computational burden of the server.

A Novel Approach towards Cost Effective Region-Based Group Key Agreement Protocol for Ad Hoc Networks Using Elliptic Curve Cryptography

This paper addresses an interesting security problem in wireless ad hoc networks: the dynamic group key agreement key establishment. For secure group communication in an ad hoc network, a group key shared by all group members is required. This group key should be updated when there are membership changes (when the new member joins or current member leaves) in the group. In this paper, we propose a novel, secure, scalable and efficient region-based group key agreement protocol for ad hoc networks. This is implemented by a two-level structure and a new scheme of group key update. The idea is to divide the group into subgroups, each maintaining its subgroup keys using group elliptic curve diffie-hellman (GECDH) Protocol and links with other subgroups in a tree structure using tree-based group elliptic curve diffie-hellman (TGECDH) protocol. By introducing region-based approach, messages and key updates will be limited within subgroup and outer group; hence computation load is distributed to many hosts. Both theoretical analysis and experimental results show that this Region-based key agreement protocol performs well for the key establishment problem in ad hoc network in terms of memory cost, computation cost and communication cost.

Secure and Efficient Tree-based Group Diffie-Hellman Protocol

Current group key agreement protocols (often tree-based) involve unnecessary delays because members with low-performance computer systems can join group key computation. These delays are caused by the computations needed to balance a key tree after membership changes. An alternate approach to group key generation that reduces delays is the dynamic prioritizing mechanism of filtering low performance members in group key generation. This paper presents an efficient tree-based group key agreement protocol and the results of its performance evaluation. The proposed approach to filtering of low performance members in group key generation is scalable and it requires less computational overhead than conventional tree-based protocols.