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 Information Technology: Coding and Computing (ITCC)

ID-based one round authenticated group key agreement protocol with bilinear pairings

Yijuan Shi, Gongliang Chen, Jianhua Li

Published Jan 1, 2005• 31 citations
Publisher

Abstract

Authenticated group key agreement is important in many modern collaborative and distributed applications. Recently, identity-based authenticated group key agreement has been increasingly researched because of the simplicity of a public key management. Basically, these protocols provide authentication by signatures. Hence they are less efficient for the verification of signatures creates additional computational overhead. In the paper, we propose an efficient authenticated group key agreement protocol by introducing a modified identity-based public key infrastructure with new system setup and key extraction algorithms. The security of our protocol is assured by the discrete logarithm assumption. Moreover, our protocol requires only one round and is more efficient than all previously known ones since it provides authentication without using signatures.

DOI
10.1109/itcc.2005.169

Related papers

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

An Efficient Authenticated Group Key Agreement Protocol

Yongzhong He, Han Zhen

Authenticated group key agreement is an important cryptographic mechanism underlying many collaborative and distributed applications. Some identity-based authenticated group key agreement schemes are proposed, however most of these protocols are vulnerable to insider attacks, while the other protocols are not efficient in communication. In this paper a new authenticated group key agreement protocol is proposed based on a modified identity-based cryptography infrastructure with new system setup and key extraction algorithms. The main feature of this protocol is that it needs only one round, which is optimal in terms of communication complexity; meanwhile the protocol is secure against insider attacks such as impersonation attacks and other known attacks.

IEEE International Carnahan Conference on Security Technology (ICCST)•Oct 1, 2007•13 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

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

Perfect Forward Secure ID-based Key Agreement Protocol in Group Communication

Pengshuai Qiao

Several identity-based key agreement protocols using bilinear pairing have been proposed in recent years and none of them has achieved all required security properties. In this paper, we firstly propose an ID-based one round authenticated group key agreement protocol with bilinear pairings, where all participants can generate the group session key in one round. Based on the intractability of elliptic curve discrete logarithm problem, every user’s private key can be proved to be secure. Also an extended version of one round authenticated group key agreement protocol is given, it provide perfect forward secrecy and avoid key escrow by the Key Generation Center.  Finally, a comprehensive security analysis and a comprehensive security analysis are provided. By comparing with other protocols, the proposed protocol requires lower computation cost.

Indonesian Journal of Electrical Engineering and Computer Science•Oct 1, 2014•0 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
Authenticated group key agreement is important in many modern collaborative and distributed applications. Recently, identity-based authenticated group key agreement has been increasingly researched because of the simplicity of a public key management. Basically, these protocols provide authentication by signatures. Hence they are less efficient for the verification of signatures creates additional computational overhead. In the paper, we propose an efficient authenticated group key agreement protocol by introducing a modified identity-based public key infrastructure with new system setup and key extraction algorithms. The security of our protocol is assured by the discrete logarithm assumption. Moreover, our protocol requires only one round and is more efficient than all previously known ones since it provides authentication without using signatures.
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.
Authenticated group key agreement is an important cryptographic mechanism underlying many collaborative and distributed applications. Some identity-based authenticated group key agreement schemes are proposed, however most of these protocols are vulnerable to insider attacks, while the other protocols are not efficient in communication. In this paper a new authenticated group key agreement protocol is proposed based on a modified identity-based cryptography infrastructure with new system setup and key extraction algorithms. The main feature of this protocol is that it needs only one round, which is optimal in terms of communication complexity; meanwhile the protocol is secure against insider attacks such as impersonation attacks and other known attacks.
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.
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.
Several identity-based key agreement protocols using bilinear pairing have been proposed in recent years and none of them has achieved all required security properties. In this paper, we firstly propose an ID-based one round authenticated group key agreement protocol with bilinear pairings, where all participants can generate the group session key in one round. Based on the intractability of elliptic curve discrete logarithm problem, every user’s private key can be proved to be secure. Also an extended version of one round authenticated group key agreement protocol is given, it provide perfect forward secrecy and avoid key escrow by the Key Generation Center.  Finally, a comprehensive security analysis and a comprehensive security analysis are provided. By comparing with other protocols, the proposed protocol requires lower computation cost.
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.