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

Conference on Privacy, Security and Trust

Forward secure identity-based key agreement for dynamic groups

Nick Mailloux, Ali Miri, Monica Nevins

Published Jul 1, 2011• 1 citation
Publisher

Abstract

We propose a new identity-based authenticated group key agreement protocol that provides both perfect forward secrecy and key integrity, while offering low communication and computational complexity. We prove the security of our protocol under the decisional bilinear Diffie-Hellman assumption in the random oracle model. In addition, we propose efficient auxiliary key agreement protocols that maintain perfect forward secrecy, while allowing members to discard their ephemeral keys in the same session in which they were created.

DOI
10.1109/pst.2011.5971971

Related papers

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

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

An ID-based Dynamic Authenticated Group Key Agreement Scheme with Optimal Round Complexity from Pairings

Fei Li, Dongqing Xie, Wei Gao +2 more

This paper presents an identity-based dynamic authenticated group key agreement (DAGKA) protocol with following advantages. The algorithms of Setup and Join has only one round communication. There is no message exchange among members in Leave algorithm. Joining members cannot know previous session keys and leaving members cannot know future session keys. Its AKE-security is proved under Decisional Bilinear Diffie-Hellman (DBDH) assumption. The protocol can resist key control attack and has forward security.

... International Conference on Complex, Intelligent and Software Intensive Systems•Jul 1, 2016•4 citations

New Identity-based Authenticated Key Agreement Protocol

Hui Ding, Yin Xin-chun

This paper designs an identity-based authenticated key agreement protocol with perfect forward security of Private Key Generator(PKG).It is proved to provide known key security,forward secrecy,key-compromise impersonation and so on in standard model.Its security is based on Bilinear Decisional Diffie-Hellman(BDDH) assumption,so its security is higher than the protocols based on the weaker assumption.

Jisuanji gongcheng•Jan 1, 2010•0 citations

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

An Identity-Based Group Key Agreement Protocol from Pairing

Hongji Wang, Gang Yao, Qingshan Jiang

In recent years, a large number of identity-based key agreement protocols from pairings have been proposed. Some of them are elegant and practical. However, using most of those protocols, the session key which users arrive is depended on the identity information. In this paper, we first propose a two-party identity-based key agreement protocol based on pairings whose security relies on the hardness of the bilinear Diffie-Hellman problem in the random oracle model, and the session key is independent of the identity information. After that we extend the protocol to an identity-based group key agreement protocol, which uses no broadcasting. The proposed key agreement protocol achieves the security attributes: known session key security, perfect forward secrecy, no key compromise impersonation, no unknown key share and no key control.

International Conference on Availability, Reliability and Security (ARES)•Mar 1, 2008•9 citations
We propose a new identity-based authenticated group key agreement protocol that provides both perfect forward secrecy and key integrity, while offering low communication and computational complexity. We prove the security of our protocol under the decisional bilinear Diffie-Hellman assumption in the random oracle model. In addition, we propose efficient auxiliary key agreement protocols that maintain perfect forward secrecy, while allowing members to discard their ephemeral keys in the same session in which they were created.
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.
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.
This paper presents an identity-based dynamic authenticated group key agreement (DAGKA) protocol with following advantages. The algorithms of Setup and Join has only one round communication. There is no message exchange among members in Leave algorithm. Joining members cannot know previous session keys and leaving members cannot know future session keys. Its AKE-security is proved under Decisional Bilinear Diffie-Hellman (DBDH) assumption. The protocol can resist key control attack and has forward security.
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.
In recent years, a large number of identity-based key agreement protocols from pairings have been proposed. Some of them are elegant and practical. However, using most of those protocols, the session key which users arrive is depended on the identity information. In this paper, we first propose a two-party identity-based key agreement protocol based on pairings whose security relies on the hardness of the bilinear Diffie-Hellman problem in the random oracle model, and the session key is independent of the identity information. After that we extend the protocol to an identity-based group key agreement protocol, which uses no broadcasting. The proposed key agreement protocol achieves the security attributes: known session key security, perfect forward secrecy, no key compromise impersonation, no unknown key share and no key control.