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 Emerging Security Information, Systems and Technologies

Forward Secure ID-Based Group Key Agreement Protocol with Anonymity

Hyewon Park, Zeen Kim, Kwangjo Kim

Published Jan 1, 2009• 5 citations
Publisher

Abstract

ID-based group key agreement (GKA) has been increasingly researched with the advantage of simple public key management. However, identities of group members can be exposed in the ID-based GKA protocol, so eavesdroppers can easily learn who belongs to the specific group. Recently, Wan et al. proposed a solution for this problem, an anonymous ID-based GKA protocol, which can keep group memberspsila anonymity to outside eavesdroppers; nevertheless, the protocol has some security flaws. This paper shows that Wan et al.psilas GKA is insecure against colluding attack and their joining/leaving protocols do not guarantee forward and backward secrecy. We also propose a new forward secure ID-based GKA with anonymity from enhancing Wan et al.psilas joining/leaving protocols. Our scheme provides forward and backward secrecy and is essentially just efficient as Wan et al.psilas scheme.

DOI
10.1109/securware.2009.49

Related papers

A New Group Key Agreement Protocol with Anonymity

Gang Yao, Li Guo

Popularity of group-oriented applications motivates research on security protection for group communications. A number of group key agreement protocols have been proposed for this objective, but most current group key agreement protocols do not consider privacy protection. Group key agreement protocols for networks should also handle dynamic group membership events such as user join and leave events. The Join and Leave Protocols provide backward and forward secrecy respectively. In this paper, we proposed a new anonymous group key agreement protocol based on ID-based encryption cryptosystems. The proposed protocol not only benefits from the desirable features of ID-based cryptosystem, but also provides privacy protection for users. The proposed protocol achieves the following security attribute: anonymity, unlinkability, group key secrecy, group forward secrecy, group backward secrecy, perfect forward secrecy for the group session key and entity authentication.

Applied Mechanics and Materials•Aug 30, 2013•0 citations

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

A Complete Anonymous Group Key Agreement Protocol

Gang Yao, Dengguo Feng

Identity-based key agreement protocols allow the participants in a group exchange information over an open network with each other. However, in most of proposed IDbased protocol, identities of group users are exposed, so that eavesdroppers can easily learn who belongs to the specific group. In this paper, we proposed a complete anonymous group key agreement protocol based on the Burmester and Desmedt mechanism and ID-based encryption cryptosystems. The proposed protocol is provably-secure in the random oracle model, and achieves the following security attribute: complete anonymity, unlinkability, group key secrecy, perfect forward secrecy for the group session key and entity authentication.

International Conference on Networks Security, Wireless Communications and Trusted Computing (NSWCTC)•Jan 1, 2010•7 citations

A novel ID-based authenticated group key agreement protocol using bilinear pairings

Lung-Chung Li, Yao-Pin Tsai, Ru‐Sheng Liu

Recently, several ID-based authenticated group key agreement (AGKA) crytosystems based on bilinear pairings have been proposed. It is an increasingly active research area because of the simplicity of the public key management and the efficiency. However most of the group key agreement protocols have the security and performance weakness. In this paper, we propose an authenticated group key agreement protocol with perfect forward secrecy that requires only one round without verifying signatures. We show that our scheme satisfies all known security requirements, and therefore it is more secure and efficient than other protocols.

IFIP International Conference on Wireless and Optical Communications Networks (WOCN)•May 1, 2008•6 citations

Group key agreement from bilinear pairings

Nicholas J Mailloux

The use of bilinear pairings as a building block for cryptographic protocols, most notably in the construction of identity-based cryptosystems, is a very popular area of cryptographic research. In this thesis, we provide a novel classification of pairing-based group key agreement (GKA) from current literature. We propose a new framework for constructing secure and efficient computationally asymmetric authenticated GKA protocols from identity-based signcryption schemes and adapt this framework to construct a novel identity-based authenticated GKA protocol with perfect forward secrecy. To the best of our knowledge, our protocol is the first that maintains perfect forward secrecy in the presence of auxiliary key agreement protocols. We formally prove the security of our protocols in the random oracle model and show that they are communication and computationally efficient in comparison to the pairing-based protocols from the literature.

•Jan 1, 2009•0 citations

An Efficient Group Key Exchange Protocol from Pairings

Lung-Chung Li, Yao-Pin Tsai, Ru‐Sheng Liu

Recently, several ID-based authenticated group key agreement (AGKA) crytosystems based on bilinear pairings have been proposed. It is an increasingly active research area because of the simplicity of the public key management and the efficiency. However most of the group key agreement protocols have the security and performance weakness. In this paper, we propose an authenticated group key agreement protocol with perfect forward secrecy that requires only one round without verifying signatures. We show that our scheme satisfies all known security requirements, and therefore it is more secure and efficient than other protocols.

International Conference on Information and Communication Technologies: From Theory to Applications (ICTTA)•Apr 1, 2008•0 citations
ID-based group key agreement (GKA) has been increasingly researched with the advantage of simple public key management. However, identities of group members can be exposed in the ID-based GKA protocol, so eavesdroppers can easily learn who belongs to the specific group. Recently, Wan et al. proposed a solution for this problem, an anonymous ID-based GKA protocol, which can keep group memberspsila anonymity to outside eavesdroppers; nevertheless, the protocol has some security flaws. This paper shows that Wan et al.psilas GKA is insecure against colluding attack and their joining/leaving protocols do not guarantee forward and backward secrecy. We also propose a new forward secure ID-based GKA with anonymity from enhancing Wan et al.psilas joining/leaving protocols. Our scheme provides forward and backward secrecy and is essentially just efficient as Wan et al.psilas scheme.
Popularity of group-oriented applications motivates research on security protection for group communications. A number of group key agreement protocols have been proposed for this objective, but most current group key agreement protocols do not consider privacy protection. Group key agreement protocols for networks should also handle dynamic group membership events such as user join and leave events. The Join and Leave Protocols provide backward and forward secrecy respectively. In this paper, we proposed a new anonymous group key agreement protocol based on ID-based encryption cryptosystems. The proposed protocol not only benefits from the desirable features of ID-based cryptosystem, but also provides privacy protection for users. The proposed protocol achieves the following security attribute: anonymity, unlinkability, group key secrecy, group forward secrecy, group backward secrecy, perfect forward secrecy for the group session key and entity authentication.
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.
Identity-based key agreement protocols allow the participants in a group exchange information over an open network with each other. However, in most of proposed IDbased protocol, identities of group users are exposed, so that eavesdroppers can easily learn who belongs to the specific group. In this paper, we proposed a complete anonymous group key agreement protocol based on the Burmester and Desmedt mechanism and ID-based encryption cryptosystems. The proposed protocol is provably-secure in the random oracle model, and achieves the following security attribute: complete anonymity, unlinkability, group key secrecy, perfect forward secrecy for the group session key and entity authentication.
Recently, several ID-based authenticated group key agreement (AGKA) crytosystems based on bilinear pairings have been proposed. It is an increasingly active research area because of the simplicity of the public key management and the efficiency. However most of the group key agreement protocols have the security and performance weakness. In this paper, we propose an authenticated group key agreement protocol with perfect forward secrecy that requires only one round without verifying signatures. We show that our scheme satisfies all known security requirements, and therefore it is more secure and efficient than other protocols.
The use of bilinear pairings as a building block for cryptographic protocols, most notably in the construction of identity-based cryptosystems, is a very popular area of cryptographic research. In this thesis, we provide a novel classification of pairing-based group key agreement (GKA) from current literature. We propose a new framework for constructing secure and efficient computationally asymmetric authenticated GKA protocols from identity-based signcryption schemes and adapt this framework to construct a novel identity-based authenticated GKA protocol with perfect forward secrecy. To the best of our knowledge, our protocol is the first that maintains perfect forward secrecy in the presence of auxiliary key agreement protocols. We formally prove the security of our protocols in the random oracle model and show that they are communication and computationally efficient in comparison to the pairing-based protocols from the literature.
Recently, several ID-based authenticated group key agreement (AGKA) crytosystems based on bilinear pairings have been proposed. It is an increasingly active research area because of the simplicity of the public key management and the efficiency. However most of the group key agreement protocols have the security and performance weakness. In this paper, we propose an authenticated group key agreement protocol with perfect forward secrecy that requires only one round without verifying signatures. We show that our scheme satisfies all known security requirements, and therefore it is more secure and efficient than other protocols.