Group Key Agreement Protocol Research Articles

Anonymous ID-based Group Key Agreement Protocol without Pairing

Secure group communication is an active area of research and its popularity is fuelled by the growing importance of group-oriented applications such as teleconferences, collaborative workspace, pay per-view etc. A number of group key agreement protocols have been proposed for these objectives. However most of the protocols have not considers the anonymity of the participants. Although in some applications the privacy of member's identity becomes more crucial and urgent especially for mobile users of a wireless network due to the open nature of radio media. The protocols having complex computations like large modular exponentiations, pairing computations, etc. are not well suited in wireless environments. Hence this paper proposes an anonymous ID-based group key agreement protocol without bilinear pairings. The proposed protocol also have anonymous join and leave procedures to facilitates the dynamic group operations. Security and performance analysis of proposed protocol shows that it provides strong security protection under different security attributes, and needs comparatively less computation and communication overheads than the other existing protocols. In addition the formal security verification of proposed protocol has been done by using AVISPA tool which shows that it is unforgeable against active and passive attacks.

On the Security of a Group Key Agreement Protocol and Its Improvement with Pairings

On the Security of a Group Key Agreement Protocol and Its Improvement with Pairings

Contributory Broadcast Encryption with Efficient Encryption and Short Ciphertexts

Broadcast encryption (BE) schemes allow a sender to securely broadcast to any subset of members but require a trusted party to distribute decryption keys. Group key agreement (GKA) protocols enable a group of members to negotiate a common encryption key via open networks so that only the group members can decrypt the ciphertexts encrypted under the shared encryption key, but a sender cannot exclude any particular member from decrypting the ciphertexts. In this paper, we bridge these two notions with a hybrid primitive referred to as contributory broadcast encryption (ConBE). In this new primitive, a group of members negotiate a common public encryption key while each member holds a decryption key. A sender seeing the public group encryption key can limit the decryption to a subset of members of his choice. Following this model, we propose a ConBE scheme with short ciphertexts. The scheme is proven to be fully collusion-resistant under the decision $n$ -Bilinear Diffie-Hellman Exponentiation (BDHE) assumption in the standard model. Of independent interest, we present a new BE scheme that is aggregatable. The aggregatability property is shown to be useful to construct advanced protocols.

Pair-wise key agreement and hop-by-hop authentication protocol for MANET

In MANET, the most important issues are authentication of data packet in the network. Due to the hostile environment, security is major concern while data transmission. In order to overcome this issue, in this paper, we propose hop by hop group key agreement protocol where each node generates pairwise key for encryption of data. The session key is generated only between the nodes which is carrying the data packet for transmission. The key exchange can be performed between two nodes before data transmission. Ni constructs Lagrange interpolating polynomial with degree n ? 1. Each Ni broadcasts the generated polynomial. After that, group key agreement protocol is used to provide complete authentication for those nodes. Simulation result show that the proposed algorithm is efficient as it minimizes bandwidth usage, delay, packet drop, and overhead, as well as fulfills all primary security concern, with improved delivery ratio and throughput.

Round-optimal ID-based dynamic authenticated group key agreement

A group key agreement protocol provides a set of users with a shared secret key to achieve cryptographic goal. When membership changes, group session key should be updated efficiently and securely. Hence, dynamic group key agreement protocols are of practical significance. Identity-based group key agreement protocols are preferred to certificate-based ones since identity-based protocols can simplify public key management procedure. Most of previous dynamic group key agreement protocols need at least two rounds to establish or refresh group session keys. In this paper, an identity-based dynamic authenticated group key agreement (DAGKA) protocol is presented. It is round-optimal, since: 1) in setup and join algorithms, only one round of communication is required; 2) in leave algorithm, there is no message exchange among group members. Joining members cannot compute previous session keys and leaving members cannot compute subsequent session keys. The protocol is provably secure. Its AKE-security is proved under decisional bilinear Diffie-Hellman (DBDH) assumption. In addition, the protocol resists key control attack and achieves forward security.

Round-optimal ID-based dynamic authenticated group key agreement

A group key agreement protocol provides a set of users with a shared secret key to achieve cryptographic goal. When membership changes, group session key should be updated efficiently and securely. Hence, dynamic group key agreement protocols are of practical significance. Identity-based group key agreement protocols are preferred to certificate-based ones since identity-based protocols can simplify public key management procedure. Most of previous dynamic group key agreement protocols need at least two rounds to establish or refresh group session keys. In this paper, an identity-based dynamic authenticated group key agreement DAGKA protocol is presented. It is round-optimal, since: 1 in setup and join algorithms, only one round of communication is required; 2 in leave algorithm, there is no message exchange among group members. Joining members cannot compute previous session keys and leaving members cannot compute subsequent session keys. The protocol is provably secure. Its AKE-security is proved under decisional bilinear Diffie-Hellman DBDH assumption. In addition, the protocol resists key control attack and achieves forward security.

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

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

Provably secure group key agreement protocol based on ECDH with integrated signature

This paper proposes a new two round authenticated contributory group key agreement (ACGKA) protocol based on elliptic curve Diffie–Hellman (ECDH) with integrated signature. In this technique, one node is picked up as the group controller, and this node runs an authenticated ECDH with the rest of the nodes to generate an authenticated shared key per each two-party. It then merges these keys in another round in such a way that every member obtains the identical authenticated group key. Further, ACGKA is extended to dynamic ACGKA protocol. The dynamic ACGKA, being elliptic curve decisional Diffie Hellman-based, is less expensive and well suited for resource constrained networks such as mobile ad-hoc networks, and wireless sensor network. Also, we demonstrate that all the protocols proposed in this paper are provably secure in the standard model under ECDDH assumption and moreover secure against most of the active and passive attacks. Finally, the proposed protocol is compared with other prevalent ECDH and Diffie Hellman based group key agreement protocols, and results are found to be satisfactory. Copyright © 2015 John Wiley & Sons, Ltd

Vulnerability Analysis of a Password-based Authenticated Group Key Agreement Protocol for the EPR Information System

Vulnerability Analysis of a Password-based Authenticated Group Key Agreement Protocol for the EPR Information System

Round-Efficient and Sender-Unrestricted Dynamic Group Key Agreement Protocol for Secure Group Communications

Modern collaborative and group-oriented applications typically involve communications over open networks. Given the openness of today’s networks, communications among group members must be secure and, at the same time, efficient. Group key agreement (GKA) is widely employed for secure group communications in modern collaborative and group-oriented applications. This paper studies the problem of GKA in identity-based cryptosystems with an emphasis on round-efficient, sender-unrestricted, member-dynamic, and provably secure key escrow freeness. The problem is resolved by proposing a one-round dynamic asymmetric GKA protocol which allows a group of members to dynamically establish a public group encryption key, while each member has a different secret decryption key in an identity-based cryptosystem. Knowing the group encryption key, any entity can encrypt to the group members so that only the members can decrypt. We construct this protocol with a strongly unforgeable stateful identity-based batch multisignature scheme. The proposed protocol is shown to be secure under the $k$ -bilinear Diffie–Hellman exponent assumption.

A new two-round dynamic authenticated contributory group key agreement protocol using elliptic curve Diffie–Hellman with privacy preserving public key infrastructure

In this paper a new two-round authenticated contributory group key agreement based on Elliptic Curve Diffie–Hellman protocol with Privacy Preserving Public Key Infrastructure (PP-PKI) is introduced and is extended to a dynamic authenticated contributory group key agreement with join and leave protocols for dynamic groups. The proposed protocol provides such security attributes as forward secrecy, backward secrecy, and defense against man in the middle (MITM) and Unknown key-share security attacks and also authentication along with privacy preserving attributes like anonymity, traceability and unlinkability. In the end, they are compared with other popular Diffie–Hellman and Elliptic Curve Diffie–Hellman based group key agreement protocols and the results are found to be satisfactory.

Pruned nodes in ternary key tree during batch rekeying in group key agreement for cognitive radio ad hoc networks

AbstractCognitive radio networks need stringent and secure group communication as nodes dynamically access the free portions of radio frequency spectrum to solve the spectrum scarcity in wireless networks. The cognitive radio ad hoc networks can use group key agreement to achieve security in group communication and tree topology to organize the group members in order to reduce the complexity of group operations. This paper proposes a ternary key tree model for tree‐based group key agreement in cognitive radio ad hoc networks, and it considers batch rekeying scheme. The range of ids for member, non‐member and pruned nodes in the ternary key tree are analysed in this paper. This paper proposes the analysis of two types of leave operations in the key tree, and the concept of subtree structure is used to analyse the total number of internal nodes that are pruned during leave operations in the key tree through mathematical expressions. This pruned nodes analysis can be used in finding the total number of renewed nodes in the key tree during rekeying process to measure the communication complexity of tree‐based group key agreement protocol. Copyright © 2015 John Wiley & Sons, Ltd.

Multi-factor User Authentication on Group Communication

Group communications are becoming popular by explosively increased Internet usage, and there are various group communications on Internet applications such as video conferences, on-line text chatting programs, online games and gambling. However, the conventional group key agreement protocols are only focused on how to minimize the computational overhead by concentrating on generating the common group key efficiently. As a result, the common group key is generated efficiently. However, a failure in user authentication permits unknown attackers to obtain valuable information during the group communication. This paper proposes a Media Access Control (MAC)-based authentication in the group key agreement in order to secure the user authentication process in group communications. Without a preliminary agreement, participants in a group communication cannot trust each other in the beginning of the group setup. Therefore, the group controller, who is randomly selected from the group members, needs a security deposit from all members in case an illegitimate user tries to join the group. The user MAC address proposed in this paper can act as a security deposit to provide a secure communication channel while preventing the MAC spoofing problem.

Provably secure one-round certificateless authenticated group key agreement protocol for secure communications

A novel one-round authenticated group key agreement (CL-AGKA) protocol is devised in this paper on certificateless public key cryptography. Our CL-AGKA protocol abolished the certificate management burden existing in certificate authority-based public key cryptography and the private-key escrow problem occurring in identity-based cryptography. Our CL-AGKA protocol is designed to establish an authenticated group session key between a group participants by ensuring that the session key is not revealed to any outsiders. The proposed CL-AGKA protocol designed a security model in the computational model, called the random oracle model. It is formally examined that our CL-AGKA protocol achieved the strong authenticated key exchange security and thus provably secured in the random oracle model. The security of the designed protocol is achieved against the intractability assumptions of the computational Diffie---Hellman problem and bilinear Diffie---Hellman problem. In addition, the proposed CL-AGKA protocol offered low message exchange cost and computational cost against the related group key agreement protocols.

Genetic-IDGKA: Genetic ID-Based Group Key Agreement Protocol for Large MANETs

The Research works on Key Management Schemes in Mobile Ad-Hoc Networks (MANETs) are attracting more and more attention to Researchers. Proving secured communication in MANET is extremely challenging one as it is dynamic in nature and the lack of centralized management. To address these issues, several researchers have proposed Key Management Schemes. In this work, we have identified and thoroughly studied three popular Key Management Schemes namely i. ID-based Multiple Secrets Key Management Scheme ii. RSA Certificate-Based Cryptography and iii. ID-Based Authenticated Group Key Agreement Protocol. We have proposed an efficient Genetic Model to optimize the performances of Key Management Schemes in terms of Key Initialization, Selecting Random Number Generator, Key Updation Timing, Packet Size, Computing Future Session Key and Session Group Key and forming Dynamic Clustering Group. The proposed Genetic Model was successfully implemented with VC++ and integrated with the above mentioned Key Management Schemes. From our experimental results, we revealed that the Genetic Model Based Key Management Schemes achieving higher security level as compared with ordinary Key Management Schemes, particularly the Genetic ID-Based Authenticated Group Key Agreement Protocol outperforms all the other two identified Key management Schemes in terms of Mobility Robustness, Computational and Message Overhead, Strength of Security, Key Exchange Time, Power Consumption and Key Update Time.

A provable authenticated group key agreement protocol for mobile environment

Secure group communication over an untrusted open network is a continuing problem, especially in mobile environments. With the development of 3G networks and mobile computing technology, the number of group-oriented applications is increasing rapidly. Although these applications are convenient, achieving secure group communication to protect user privacy is a major concern. This study presents an authenticated group key agreement protocol for mobile environments. By using certificateless public key cryptography, the protocol reduces the cost of managing the certificates and avoids the key escrow problem. Instead of a fully-trusted server, the protocol uses a semi-trusted server, which helps users communicate but does not learn about the group key. The analytical results indicate that the proposed protocol provides good security in mobile environments.

A Pairing Free Anonymous Certificateless Group Key Agreement Protocol for Dynamic Group

Group key agreement protocol is the primary requirement of several groupware applications like secure conferences; pay-per view, etc. which requires secure and authentic conversations among a group...

A collusion attack on asymmetric group key exchange

In Eurocrypt 2009, Wu et al. introduced the notion of asymmetric group key agreement ASGKA and presented a generic construction of ASGKA protocols with one communication round. Most of ASGKA protocols are designed under that generic construction. In asymmetric group key agreement protocols, users obtain different decryption keys. Any subset of group members may collude to construct pirate decryption keys, which are different from those of colluders but can correctly decrypt ciphertexts. If a pirate decryption box is found, it is possible to find traitors since their decryption keys are related to their identities. In this paper, a collusion attack on the generic construction of ASGKA by Wu et al. is proposed. It is formally proved that each of colluders participating in the proposed collusion attack is unable to be traced. The attack is additionally applied to a concrete protocol to exemplify the collusion attack. Copyright © 2014 John Wiley & Sons, Ltd.

One-Round Affiliation-Hiding Authenticated Asymmetric Group Key Agreement with Semi-trusted Group Authority

Affiliation-Hiding Authenticated Asymmetric Group Key Agreement (AH-AAGKA) protocol can be utilized by the members of a group to authenticate each other secretly. The participants affiliated to the group can execute the AH-AAGKA protocol to establish a common encryption key. Any legitimate participant can compute its own decryption key corresponding to the encryption key. Particularly, every legitimate player's affiliation information is only revealed to other legitimate players. In this paper, we present a one-round AH-AAGKA protocol. Compared with previous work, in our protocol, Group Authority (GA) does not need to be fully trusted (we call it semi-trusted). Therefore, GA cannot impersonate any honest user to execute the protocol. Meanwhile, GA can trace group members through analyzing the communication flows. Our protocol holds the affiliation-hiding property and detectability. Additionally, our scheme exhibits Perfect Forward Secrecy for both GA and outside attackers.

An improved ID-based group key agreement protocol

ID-based constant-round group key agreement protocols are efficient in both computation and communication, but previous protocols did not provide valid message authentication. An improvement based on attack analysis is proposed in this paper. The improved method takes full advantage of the data transmitted at various stages of the protocol. By guaranteeing the freshness of authentication messages, the authenticity of the generator of authentication messages, and the completeness of the authenticator, the improved protocol can resist various passive and active attacks. The forward secrecy of the improved protocol is proved under a Katz-Yung (KY) model. Compared with existing methods, the improved protocol is more effective and applicable.