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 Wireless Communications, Networking and Mobile Computing

Efficient ID-Based Two Round Authenticated Group Key Agreement Protocol

Hong Jun Tang, Liehuang Zhu, Zijian Zhang

Published Oct 1, 2008• 5 citations
Publisher

Abstract

Group key agreement protocol allows all the members to agree upon a common session key, which may be used for later secure communication among all the participants. Through incorporating ID-based authenticated two-party key agreement protocol proposed by McCullagh et al. and constant round group key agreement proposed by Burmester and Desmedt, we propose a new ID-based two round authenticated group key agreement protocol which is more efficient than previously proposed protocols in terms of both communication and computation cost.

DOI
10.1109/wicom.2008.1177

Related papers

An efficient dynamic group key agreement protocol

YE Cheng-qing

A new efficient dynamic group key agreement protocol was presented to reduce the communication cost in ID-based constant round authenticated group key agreement.All group members constructed a ring structure during the group key agreement.Utilizing the technology proposed in one round tripartite key agreement protocol,about half of group members did not need to broadcast their messages in the second round information exchange in this protocol.So the efficiency of this protocol was improved.Then the group key agreement protocol was extended to suit dynamic group membership.When the membership changed,the number of members participating in the message exchange was only dependent on the number of joining/leaving numbers instead of that of all members.Hence,the total communication cost in the protocol was reduced compared with other protocols.Analysis results show that it is a secure protocol and more efficient than other protocols.

Journal of Zhejiang University(Engineering Science)•Jan 1, 2007•0 citations

Authenticated Group Key Agreement Protocol

Lejian Liao

Group key agreement protocol allows all members to agree upon a common session key ,which may be used for later secure communication among all the participants,and supporting confidentiality,integrity,and authenticity for group communication.This paper proposes an authenticated group key agreement protocol (ABD) based on authenticated two party key agreement protocol and BD group key agreement protocol.Compared with BD,ABD can resist not only passive attack but also active attack.

Computer Engineering and Applications Journal•Jan 1, 2006•2 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

An Insider Attack Resistant Group Key Agreement Protocol from Pairings

Yongzhong He, Xiaoyong Li, Zhen Han

Authenticated group key agreement allows a group of users to generate a shared key which satisfies various security requirements. Several identity-based authenticated group key agreement schemes are proposed. However, these schemes are shown to be vulnerable to insider impersonation attacks that any two malicious group members can impersonate other user to agree some session keys in a new group. In this paper, a simple two round authenticated group agreement scheme based on Burmester and Desmedt's scheme is proposed. Compared to previous protocols, our protocol is efficient while secure against various known attacks, including key exposure attacks and insider impersonation attacks.

International Conference on Innovative Computing, Information and Control•Sep 1, 2007•4 citations

An Authenticated 3-Round Identity-Based Group Key Agreement Protocol

Gang Yao, Hongji Wang, Qingshan Jiang

Key agreement protocols allow two or more participants exchange information over an open network with each other. In modern collaborative and distributed applications, authenticated group key agreement is one of the important issues. Recently identity-based authenticated key agreement protocol has been increasingly investigated because of the simplicity of a public key management. In this paper, we propose an authenticated three-round identity-based group key agreement protocol. The first round is for identity authentication, the second round is for key agreement, and the third round is for key confirmation. The proposed protocol is based on the protocol of Burmester and Desmedt, and the protocol is provably- secure in the random oracle model. In particular, the proposed authenticated identity-based group key agreement protocol provides a batch verification technique, which verifies the validity of transcripts from other group players simultaneously.

International Conference on Availability, Reliability and Security (ARES)•Mar 1, 2008•12 citations

An efficient and secure one-round authenticated key agreement protocol without pairings

Mengbo Hou, Qiuliang Xu

Two-Party Authenticated key agreement protocol is essential for setting up the common session key for parties to establish secure channel for network communication in the open environment. Most of proposed schemes require expensive bilinear pairing operation and only provide limited security attributes. So such protocols are unsuitable for real-world applications that require stronger sense of secrecy. In this paper, we first analysis two schemes recently proposed by Cao etc., and then present a one-round ID-based authenticated key agreement protocol with more desired security attributes, which need no pairing operations while still achieve nice computational efficiency. These security attributes include known-key secrecy, perfect forward secrecy, PKG forward secrecy, key-compromise impersonation resilience, unknown key-share resilience and no key control. Moreover, it captures the enhanced security attributes known session-specific temporary key information secrecy, which means that even the ephemeral secret key were compromised, the adversary can hardly acquire the agreed session key.

International Conference on Multimedia Technology (ICMT)•Jul 1, 2011•4 citations
Group key agreement protocol allows all the members to agree upon a common session key, which may be used for later secure communication among all the participants. Through incorporating ID-based authenticated two-party key agreement protocol proposed by McCullagh et al. and constant round group key agreement proposed by Burmester and Desmedt, we propose a new ID-based two round authenticated group key agreement protocol which is more efficient than previously proposed protocols in terms of both communication and computation cost.
A new efficient dynamic group key agreement protocol was presented to reduce the communication cost in ID-based constant round authenticated group key agreement.All group members constructed a ring structure during the group key agreement.Utilizing the technology proposed in one round tripartite key agreement protocol,about half of group members did not need to broadcast their messages in the second round information exchange in this protocol.So the efficiency of this protocol was improved.Then the group key agreement protocol was extended to suit dynamic group membership.When the membership changed,the number of members participating in the message exchange was only dependent on the number of joining/leaving numbers instead of that of all members.Hence,the total communication cost in the protocol was reduced compared with other protocols.Analysis results show that it is a secure protocol and more efficient than other protocols.
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.
Authenticated group key agreement allows a group of users to generate a shared key which satisfies various security requirements. Several identity-based authenticated group key agreement schemes are proposed. However, these schemes are shown to be vulnerable to insider impersonation attacks that any two malicious group members can impersonate other user to agree some session keys in a new group. In this paper, a simple two round authenticated group agreement scheme based on Burmester and Desmedt's scheme is proposed. Compared to previous protocols, our protocol is efficient while secure against various known attacks, including key exposure attacks and insider impersonation attacks.
Key agreement protocols allow two or more participants exchange information over an open network with each other. In modern collaborative and distributed applications, authenticated group key agreement is one of the important issues. Recently identity-based authenticated key agreement protocol has been increasingly investigated because of the simplicity of a public key management. In this paper, we propose an authenticated three-round identity-based group key agreement protocol. The first round is for identity authentication, the second round is for key agreement, and the third round is for key confirmation. The proposed protocol is based on the protocol of Burmester and Desmedt, and the protocol is provably- secure in the random oracle model. In particular, the proposed authenticated identity-based group key agreement protocol provides a batch verification technique, which verifies the validity of transcripts from other group players simultaneously.
Two-Party Authenticated key agreement protocol is essential for setting up the common session key for parties to establish secure channel for network communication in the open environment. Most of proposed schemes require expensive bilinear pairing operation and only provide limited security attributes. So such protocols are unsuitable for real-world applications that require stronger sense of secrecy. In this paper, we first analysis two schemes recently proposed by Cao etc., and then present a one-round ID-based authenticated key agreement protocol with more desired security attributes, which need no pairing operations while still achieve nice computational efficiency. These security attributes include known-key secrecy, perfect forward secrecy, PKG forward secrecy, key-compromise impersonation resilience, unknown key-share resilience and no key control. Moreover, it captures the enhanced security attributes known session-specific temporary key information secrecy, which means that even the ephemeral secret key were compromised, the adversary can hardly acquire the agreed session key.