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 Conference on Network Computing and Information Security

Improvement of an Efficient Identity-Based Group Key Agreement Protocol

Wei Yuan, Liang Qing Hu, Kuo Zhao, Hongtu Li, Jiang-feng Chu, Yuyu Sun

Published May 1, 2011• 3 citations
Publisher

Abstract

In 2009, Zeng Ping et al. proposed a new Group Key Agreement protocol Based on the ID-AGKA protocol which uses full binary tree structure and each tree node represents a user. Their protocol support users to join or leave the group at any time and the session key will be changed with the users' dynamic changes. In this paper, we point out that Zeng Ping et al.'s Group Key Agreement protocol is non-authenticated and easy to be forged or modified. Then we give a method that attacker can force all group members accepted the modified session private key in BR security model. So, It means that the Zeng Ping et al.'s Protocol can not meet the attribute of implicit key authentication and key control. Finally, we propose an improved protocol to overcome this problem.

DOI
10.1109/ncis.2011.53

Related papers

Analysis and Improvement of Group Key Agreement Protocol ID-AGKA

HE Da-ke

A more security analysis on the ID-based Authenticated Group Key Agreement(ID-AGKA) is given and it is found that the ID-based AGKA does not resist outsider attack, that is, an adversary can make a group session key inconsistent, which can not be detected by the users in the group however. An improvement of the AGKA scheme is proposed. Security analysis shows the scheme can resist outside attack.

Jisuanji gongcheng•Jan 1, 2009•1 citation

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

Identity-based group key exchange protocols resistant to colluding attacks

Yunjie Jiang

An ID-based authenticated group key agreement (AGKA) protocol allows a group of members to share a key and provide an assurance of key sharing with an intended group with the user's identity, which is used for conferencing environments. In 2004, Choi et al proposed an ID-based authenticated group key agreement with bilinear maps (also called CHL protocols), which was extended from Burmester and Desmedt conference key agreement protocols. Unfortunately, their protocols were found to be vulnerable to the insider attacks in which cases that the two malicious users have the previous authentication transcripts of the party by Zhang, Chen and Shim. In this paper, we proposed an improved ID-based AGKA. In our scheme, each session has a unique session identity which is published by Key Generation Center. With such unique session identity binding to each session, our protocols can prevent the insider attack. Especially, our protocols can not enhance the computationally cost and it is still efficient.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jan 11, 2012•0 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

Improved ID-based Authenticated Group Key Agreement Secure Against Impersonation Attack by Insider

Hyewon Park, Tomoyuki Asano, Kwangjo Kim

Many conference systems over the Internet require authenticated group key agreement (AGKA) for secure and reliable communication. After Shamir [1] proposed the ID-based cryptosystem in 1984, ID-based AGKA protocols have been actively studied because of the simple public key management. In 2006, Zhou et al. [12] proposed two-round ID-based AGKA protocol which is very efficient in communication and computation complexity. However, their protocol does not provide user identification and suffers from the impersonation attack by malicious participants. In this paper, we propose improved ID-based AGKA protocol to prevent impersonation attack from Zhou et al.'s protocol. In our protocol, the malicious insider cannot impersonate another participants even if he knows the ephemeral group secret value. Moreover, our protocol reduces the computation cost from Zhou et al.'s protocol.

Information Security and Cryptology•Oct 1, 2009•4 citations

An Improved secure certificateless authenticated group key agreement protocol

Manman Geng, Futai Zhang

In modern collaborative and distributed applications, authenticated group key agreement (AGKA) is one of the important issues. In this paper, we present that one existing certificateless AGKA protocol has some security drawbacks and does not satisfy some security attributes required for AGKA protocols. To overcome its drawbacks, we propose a secure and efficient protocol upon the initial one and a signature scheme proved secure in the random oracle model. The security analysis shows that our improved protocol can achieve Explicit key authentication, Known session key security, Known ephemeral secrets security, Perfect forward security, No key compromise impersonation, No key control and No unknown key share. With respect to efficiency, our protocol only needs three communication rounds. In each protocol run, only three pairing computations are involved for each participant.

IEEE International Conference on Intelligent Computing and Intelligent Systems (ICIS)•Nov 1, 2009•1 citation
In 2009, Zeng Ping et al. proposed a new Group Key Agreement protocol Based on the ID-AGKA protocol which uses full binary tree structure and each tree node represents a user. Their protocol support users to join or leave the group at any time and the session key will be changed with the users' dynamic changes. In this paper, we point out that Zeng Ping et al.'s Group Key Agreement protocol is non-authenticated and easy to be forged or modified. Then we give a method that attacker can force all group members accepted the modified session private key in BR security model. So, It means that the Zeng Ping et al.'s Protocol can not meet the attribute of implicit key authentication and key control. Finally, we propose an improved protocol to overcome this problem.
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.
An ID-based authenticated group key agreement (AGKA) protocol allows a group of members to share a key and provide an assurance of key sharing with an intended group with the user's identity, which is used for conferencing environments. In 2004, Choi et al proposed an ID-based authenticated group key agreement with bilinear maps (also called CHL protocols), which was extended from Burmester and Desmedt conference key agreement protocols. Unfortunately, their protocols were found to be vulnerable to the insider attacks in which cases that the two malicious users have the previous authentication transcripts of the party by Zhang, Chen and Shim. In this paper, we proposed an improved ID-based AGKA. In our scheme, each session has a unique session identity which is published by Key Generation Center. With such unique session identity binding to each session, our protocols can prevent the insider attack. Especially, our protocols can not enhance the computationally cost and it is still efficient.
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.
Many conference systems over the Internet require authenticated group key agreement (AGKA) for secure and reliable communication. After Shamir [1] proposed the ID-based cryptosystem in 1984, ID-based AGKA protocols have been actively studied because of the simple public key management. In 2006, Zhou et al. [12] proposed two-round ID-based AGKA protocol which is very efficient in communication and computation complexity. However, their protocol does not provide user identification and suffers from the impersonation attack by malicious participants. In this paper, we propose improved ID-based AGKA protocol to prevent impersonation attack from Zhou et al.'s protocol. In our protocol, the malicious insider cannot impersonate another participants even if he knows the ephemeral group secret value. Moreover, our protocol reduces the computation cost from Zhou et al.'s protocol.
In modern collaborative and distributed applications, authenticated group key agreement (AGKA) is one of the important issues. In this paper, we present that one existing certificateless AGKA protocol has some security drawbacks and does not satisfy some security attributes required for AGKA protocols. To overcome its drawbacks, we propose a secure and efficient protocol upon the initial one and a signature scheme proved secure in the random oracle model. The security analysis shows that our improved protocol can achieve Explicit key authentication, Known session key security, Known ephemeral secrets security, Perfect forward security, No key compromise impersonation, No key control and No unknown key share. With respect to efficiency, our protocol only needs three communication rounds. In each protocol run, only three pairing computations are involved for each participant.