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

Jisuanji gongcheng

New Identity-based Authenticated Key Agreement Protocol

Hui Ding, Yin Xin-chun

Published Jan 1, 2010• 0 citations
OpenAlex

Abstract

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.

Related papers

A New Identity-Based Tripartite Authenticated Key Agreement Protocol

Hongyuan Wang

Now,most of the tripartite authenticated key agreement protocols have been proven to be insecure.We design the new identity-based tripartite authenticated key agreement protocol,it is based on the secure IBE scheme by Peng.This protocol's security based on bilinear decisional Diffie-Hellman assumption.This protocol could provide known key security,PKG forward secrecy,key-compromise impersonation resilience and unknown key-share resilience,so it's a secure tripartite authenticated key agreement protocol.

Microelectronics & Computer•Jan 1, 2011•0 citations

Forward secure identity-based key agreement for dynamic groups

Nick Mailloux, Ali Miri, Monica Nevins

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.

Conference on Privacy, Security and Trust•Jul 1, 2011•1 citation

Analysis and improvement of an ID-based authenticated key agreement protocol

Xiao Guo-zhen

The security of a recently proposed ID-based authenticated key agreement protocol was analyzed. Although it is provably secure in the standard model, a malicious PKG （private key generator） can still obtain all of the agreed ses-sion keys, that is, it doesn’t provide PKG-forward secrecy in escrowless mode. To satisfy the security requirement in es-crowless mode, an improved version of the protocol was presented and it was proved to be a secure authenticated key agreement in the standard model. Results show that it provides perfect forward secrecy and PKG-forward secrecy.

Journal of Communications•Jan 1, 2008•2 citations

Efficient Identity-based Authenticated Key Agreement Protocol with PKG Forward Secrecy

Shengbao Wang, Zhenfu Cao, Feng Cao

For an identity-based authenticated key agreement (IDAK) protocol, PKG forward secrecy is the strongest notion of forward secrecy, which is about the security of previously established session keys after the master secret key of the Private Key Generatior (PKG) is compromised. In this paper, we put forward a new identity-based authenticated key agreement protocol which achieves PKG for-ward secrecy. On its performance, we show that it is more computational efficient than a previously proposed protocol of Chen and Kudla (called Protocol 2'). Furthermore, we examine other security attributes that our new protocol possesses one bye one.

International journal of network security•Sep 1, 2008•16 citations

Identity-Based Authenticated Key Agreement Protocols without Bilinear Pairing in Multiple PKG Environments

Junquan Li

The authors present an identity-based authenticated key agreement protocol without bilinear pairing in multiple PKG environments.Reduced to the standard computational Diffie-Hellman(CDH) assumption in the random oracle model,the protocol security is given a complete proof based on the security of proposed ID-based exponential challenge-response(XCR) signature scheme and dual challenge-response(DCR) signature scheme.Compared with previous identity-based authenticated key agreement protocols,the new protocol shows better performances.

Beijing Daxue Xuebao. Zirankexueban•Jan 1, 2012•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
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.
Now,most of the tripartite authenticated key agreement protocols have been proven to be insecure.We design the new identity-based tripartite authenticated key agreement protocol,it is based on the secure IBE scheme by Peng.This protocol's security based on bilinear decisional Diffie-Hellman assumption.This protocol could provide known key security,PKG forward secrecy,key-compromise impersonation resilience and unknown key-share resilience,so it's a secure tripartite authenticated key agreement protocol.
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.
The security of a recently proposed ID-based authenticated key agreement protocol was analyzed. Although it is provably secure in the standard model, a malicious PKG （private key generator） can still obtain all of the agreed ses-sion keys, that is, it doesn’t provide PKG-forward secrecy in escrowless mode. To satisfy the security requirement in es-crowless mode, an improved version of the protocol was presented and it was proved to be a secure authenticated key agreement in the standard model. Results show that it provides perfect forward secrecy and PKG-forward secrecy.
For an identity-based authenticated key agreement (IDAK) protocol, PKG forward secrecy is the strongest notion of forward secrecy, which is about the security of previously established session keys after the master secret key of the Private Key Generatior (PKG) is compromised. In this paper, we put forward a new identity-based authenticated key agreement protocol which achieves PKG for-ward secrecy. On its performance, we show that it is more computational efficient than a previously proposed protocol of Chen and Kudla (called Protocol 2'). Furthermore, we examine other security attributes that our new protocol possesses one bye one.
The authors present an identity-based authenticated key agreement protocol without bilinear pairing in multiple PKG environments.Reduced to the standard computational Diffie-Hellman(CDH) assumption in the random oracle model,the protocol security is given a complete proof based on the security of proposed ID-based exponential challenge-response(XCR) signature scheme and dual challenge-response(DCR) signature scheme.Compared with previous identity-based authenticated key agreement protocols,the new protocol shows better performances.
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.