Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International journal of tomography and simulation

A New Design of Asymmetric Group Key Agreement Protocol without any Third Party Controller

Shruti Nathani, B. P. Tripathi

Published Sep 26, 2020• 0 citations
OpenAlex

Abstract

Recently in 2016, to authenticate the group members Li et al. uses the identity based public key cryptography in their proposed authenticated and dynamic round optimal asymmetric group key agreement protocol(ADASGKA). Inspire from this ADASGKA protocol in this paper we propose a new identity based authenticated and dynamic asymmetric group protocol using bilinear pairing without any extra third party controller. Our security analysis shows that the proposed protocol can resist all the required attacks and satisfies the desirable security attributes.

Related papers

A Dynamic ID-based Authenticated Group Key Agreement Protocol

Jun Zheng, Cheng Yang, Jinrong Xue +1 more

Through the group key agreement, all group members could negotiate a common session key which is used in later secure communication.While simple GKA cannot provide enough security to resist the adversary's attack, and the malicious damage during the agreement makes the authenticated key agreement particularly important.In identity-based authentication, user's unique identity information is used as the public key, which makes it exempt from a series of management of the certification in public-key infrastructure.Thereby, the identity-based key agreement can simplify the key management procedures and reduce the risk of failure at the certification authority.Recently, several identity-based group key agreement protocols have been proposed, however most of them are either vulnerable to impersonation and replay attack or inefficient and unscalable.This paper proposes a novel authenticated group key agreement protocol which is based on bilinear pairings.It needs two rounds to negotiate the session key, and the low computational complexity makes the protocol efficient and scalable.Meanwhile, our protocol also ensures the forward and backward secrecy and the key independence.Under the Decisional Diffie-Hellman assumption, our protocol is proved to be secure against the adversary. 1.

National Conference on Electrical, Electronics and Computer Engineering (NCEECE)•Jan 1, 2016•12 citations

An ID-based Dynamic Authenticated Group Key Agreement Scheme with Optimal Round Complexity from Pairings

Fei Li, Dongqing Xie, Wei Gao +2 more

This paper presents an identity-based dynamic authenticated group key agreement (DAGKA) protocol with following advantages. The algorithms of Setup and Join has only one round communication. There is no message exchange among members in Leave algorithm. Joining members cannot know previous session keys and leaving members cannot know future session keys. Its AKE-security is proved under Decisional Bilinear Diffie-Hellman (DBDH) assumption. The protocol can resist key control attack and has forward security.

... International Conference on Complex, Intelligent and Software Intensive Systems•Jul 1, 2016•4 citations

Round-optimal ID-based dynamic authenticated group key agreement

Fei Li, Dongqing Xie, Wei Gao +2 more

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.

International Journal of High Performance Systems Architecture•Jan 1, 2016•0 citations

Round-optimal ID-based dynamic authenticated group key agreement

Xu An Wang, Jianhua Yan, Dongqing Xie +2 more

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.

International Journal of High Performance Systems Architecture•Jan 1, 2016•0 citations

AD‐ASGKA – authenticated dynamic protocols for asymmetric group key agreement

Mingchu Li, Xiaodong Xu, Cheng Guo +1 more

Abstract Asymmetric group key agreement is a cryptographic primitive allowing a group of users to negotiate a common public encryption key while each of them holds a different secret private decryption key. Anyone (including outsiders) with the public encryption key can send encrypted messages to the group members, and then the group members can decrypt the messages. Authenticated key agreement protocols authenticate the identities of users to ensure that only the intended group members can establish a session in which the group members can communicate with each other. Dynamic asymmetric group key agreement concerns about the scenarios such as ad hoc networks in which the group members may join or leave at any given time. In this paper, we propose a one‐round authenticated dynamic protocol for symmetric group key agreement. For efficiency reasons, we employ the identity‐based public‐key cryptography (IB‐PKC) to authenticate users rather than the public key infrastructure and the certificate‐less public‐key cryptography. Our analysis shows that the proposals in the paper can resist active attacks and meet many desirable security attributes. Besides, our protocol allows users to join or leave the group at the same time. Furthermore, our protocol is round‐optimal and has a quite good performance as compared with previous works. Copyright © 2016 John Wiley & Sons, Ltd.

Security and Communication Networks•Jan 26, 2016•14 citations

An authenticated hierarchical asymmetric group key agreement protocol based on identity

Qikun Zhang, Zengyu Cai, Yong Gan +2 more

Asymmetric group key agreement protocol is to negotiate a shared group encryption key. Each member can calculate a decryption key corresponding to the encryption key. With the rapid development of network and system technology, secure information exchange has been one of the foci. In this paper, we propose an authenticated hierarchical asymmetric group key agreement protocol based on identity. Based on the realisation of a round of asymmetric group key agreement, the protocol carries out a second round of agreement. Different levels of secrets exchange information between a group of players with different permissions as the number of rounds increases, which can achieve anonymity and authentication and support dynamic group key updating of nodes to achieve forward and backward security of group key. The protocol proved to be secure under the assumption of bilinear computational Diffie-Hellman problem. The performance analysis shows that the proposed scheme is efficient.

International Journal of Embedded Systems•Jan 1, 2019•0 citations
Recently in 2016, to authenticate the group members Li et al. uses the identity based public key cryptography in their proposed authenticated and dynamic round optimal asymmetric group key agreement protocol(ADASGKA). Inspire from this ADASGKA protocol in this paper we propose a new identity based authenticated and dynamic asymmetric group protocol using bilinear pairing without any extra third party controller. Our security analysis shows that the proposed protocol can resist all the required attacks and satisfies the desirable security attributes.
Through the group key agreement, all group members could negotiate a common session key which is used in later secure communication.While simple GKA cannot provide enough security to resist the adversary's attack, and the malicious damage during the agreement makes the authenticated key agreement particularly important.In identity-based authentication, user's unique identity information is used as the public key, which makes it exempt from a series of management of the certification in public-key infrastructure.Thereby, the identity-based key agreement can simplify the key management procedures and reduce the risk of failure at the certification authority.Recently, several identity-based group key agreement protocols have been proposed, however most of them are either vulnerable to impersonation and replay attack or inefficient and unscalable.This paper proposes a novel authenticated group key agreement protocol which is based on bilinear pairings.It needs two rounds to negotiate the session key, and the low computational complexity makes the protocol efficient and scalable.Meanwhile, our protocol also ensures the forward and backward secrecy and the key independence.Under the Decisional Diffie-Hellman assumption, our protocol is proved to be secure against the adversary. 1.
This paper presents an identity-based dynamic authenticated group key agreement (DAGKA) protocol with following advantages. The algorithms of Setup and Join has only one round communication. There is no message exchange among members in Leave algorithm. Joining members cannot know previous session keys and leaving members cannot know future session keys. Its AKE-security is proved under Decisional Bilinear Diffie-Hellman (DBDH) assumption. The protocol can resist key control attack and has forward security.
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 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.
Abstract Asymmetric group key agreement is a cryptographic primitive allowing a group of users to negotiate a common public encryption key while each of them holds a different secret private decryption key. Anyone (including outsiders) with the public encryption key can send encrypted messages to the group members, and then the group members can decrypt the messages. Authenticated key agreement protocols authenticate the identities of users to ensure that only the intended group members can establish a session in which the group members can communicate with each other. Dynamic asymmetric group key agreement concerns about the scenarios such as ad hoc networks in which the group members may join or leave at any given time. In this paper, we propose a one‐round authenticated dynamic protocol for symmetric group key agreement. For efficiency reasons, we employ the identity‐based public‐key cryptography (IB‐PKC) to authenticate users rather than the public key infrastructure and the certificate‐less public‐key cryptography. Our analysis shows that the proposals in the paper can resist active attacks and meet many desirable security attributes. Besides, our protocol allows users to join or leave the group at the same time. Furthermore, our protocol is round‐optimal and has a quite good performance as compared with previous works. Copyright © 2016 John Wiley & Sons, Ltd.
Asymmetric group key agreement protocol is to negotiate a shared group encryption key. Each member can calculate a decryption key corresponding to the encryption key. With the rapid development of network and system technology, secure information exchange has been one of the foci. In this paper, we propose an authenticated hierarchical asymmetric group key agreement protocol based on identity. Based on the realisation of a round of asymmetric group key agreement, the protocol carries out a second round of agreement. Different levels of secrets exchange information between a group of players with different permissions as the number of rounds increases, which can achieve anonymity and authentication and support dynamic group key updating of nodes to achieve forward and backward security of group key. The protocol proved to be secure under the assumption of bilinear computational Diffie-Hellman problem. The performance analysis shows that the proposed scheme is efficient.