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 and Communication Technologies: From Theory to Applications (ICTTA)

An Efficient Group Key Exchange Protocol from Pairings

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

Published Apr 1, 2008• 0 citations
Publisher

Abstract

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.

DOI
10.1109/ictta.2008.4530130

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

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

Yijuan Shi, Gongliang Chen, Jianhua Li

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.

International Conference on Information Technology: Coding and Computing (ITCC)•Jan 1, 2005•31 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

A Secure Certificateless Authenticated Group Key Agreement Protocol

Manman Geng, Futai Zhang, Meng Gao

We present an efficient authenticated group key agreement (AGKA) protocol in certificateless public key setting (CL-AGKA). The protocol only needs two communication rounds. In each protocol run, only four pairing computations are involved for each participant. The authentication in our protocol is realized using a signature scheme which is provably secure in the strongest security model for certificateless signature (CLS) schemes where the type I/II adversary is a super type I/II adversary. The security analysis shows our protocol satisfies Key authentication, Known session key security, Key compromise impersonation security, Perfect forward security, and Known session-specific temporary information security.

International Conference on Multimedia Information Networking and Security•Jan 1, 2009•13 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 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
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.
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 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.
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.
We present an efficient authenticated group key agreement (AGKA) protocol in certificateless public key setting (CL-AGKA). The protocol only needs two communication rounds. In each protocol run, only four pairing computations are involved for each participant. The authentication in our protocol is realized using a signature scheme which is provably secure in the strongest security model for certificateless signature (CLS) schemes where the type I/II adversary is a super type I/II adversary. The security analysis shows our protocol satisfies Key authentication, Known session key security, Key compromise impersonation security, Perfect forward security, and Known session-specific temporary information security.
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.
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.