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 Intelligent Networking and Collaborative Systems (INCoS)

An Efficient Tripartite Identity-Based Authenticated Key Agreement Protocol

Xiaotong Fu, Shufang Guo, Ruijun Shi

Published Sep 1, 2013• 2 citations
Publisher

Abstract

In this paper, the tripartite identity-based key agreement is investigated. Inspired by designated verifier signature schemes, a tripartite identity-based key agreement protocol with explicit authentication is proposed with the good authentication of signatures. The new protocol can achieve remarkable security properties, such as perfect forward secrecy and unknown key share. More theoretically, the security proving of the protocol is given in the random oracle model under the Bilinear Diffie-Hellman assumption. The efficiency of the protocol is lying on that three parties can establish an agreed session key after only one round of message exchange. Detailed efficiency analysis compared with other protocols is also made.

DOI
10.1109/incos.2013.162

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

A Two-Party Identity-Based Key Agreement Protocol with Explicit Authentication

Haomin Yang, Yaoxue Zhang, Yuezhi Zhou

A two-message two-party key agreement protocol with explicit authentication provides perfect forward secrecy. Digital signatures can usually be used as providing explicit authentication for a key agreement protocol. Shim proposed an efficient identity-based signature scheme using bilinear pairings; however, he did not give a formal security proof for it. In this paper, we present a formal security proof for Shim's signature scheme. Using Shim's signature scheme as building blocks, we propose a new two-party identity-based key agreement protocol with explicit authentication. The proposed protocol satisfies a set of desirable security properties. Compared with the related protocols, the proposed protocol has distinct advantages in terms of security and computational efficiency.

International Conference on Wireless Communications, Networking and Mobile Computing•Sep 1, 2012•0 citations

Efficient strongly-secure identity-based authenticated key agreement protocol

Jian Shu

Most of the existing Identity-based(ID) authenticated protocols are proven secure in the Canetti-Krawczyk(CK) model which is weaker than the extended Canetti-Krawczyk(eCK) model.Based on NAXOS trick,a new scheme using bilinear pairing was proposed.The security of the scheme was proven in the eCK model under the random oracle assumption and the Gap Bilinear Diffie-Hellman(GBDH) assumption.The proposed protocol was efficient in computational cost and communication round when compared with other solutions.The new protocol also satisfied master key forward security,perfect forward security and anti-key-leak disguise.

Journal of Computer Applications•Jan 1, 2012•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

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

A one-round ID-based authenticated key agreement protocol with enhanced security

Mengbo Hou, Qiuliang Xu

Authenticated key agreement protocol is used to set up the session key and establish secure channel for network communication in the open environment. So far, great deals of identity-based protocols have been proposed to provide robust mutual authentication and key establishment in the two-party setting. Majority of the existing identity-based key agreement protocols require expensive bilinear pairing operation and only provide limited security attributes. Therefore, such protocols are unsuitable for real-world applications that require stronger sense of secrecy. In this paper, we first analysis some of the schemes proposed recently, and then present a one-round ID-based authenticated key agreement protocol with enhanced security attributes, which doesn't need pairing operation and achieves most of the required security attributes, such as known-key secrecy, perfect forward secrecy, PKG Forward Secrecy, key-compromise impersonation resilience, unknown key-share resilience and no key control. In addition, it captures the enhanced security attributes-Known session-specific temporary key information secrecy.

International Conference on Intelligent Control and Information Processing•Jul 1, 2011•2 citations
In this paper, the tripartite identity-based key agreement is investigated. Inspired by designated verifier signature schemes, a tripartite identity-based key agreement protocol with explicit authentication is proposed with the good authentication of signatures. The new protocol can achieve remarkable security properties, such as perfect forward secrecy and unknown key share. More theoretically, the security proving of the protocol is given in the random oracle model under the Bilinear Diffie-Hellman assumption. The efficiency of the protocol is lying on that three parties can establish an agreed session key after only one round of message exchange. Detailed efficiency analysis compared with other protocols is also made.
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.
A two-message two-party key agreement protocol with explicit authentication provides perfect forward secrecy. Digital signatures can usually be used as providing explicit authentication for a key agreement protocol. Shim proposed an efficient identity-based signature scheme using bilinear pairings; however, he did not give a formal security proof for it. In this paper, we present a formal security proof for Shim's signature scheme. Using Shim's signature scheme as building blocks, we propose a new two-party identity-based key agreement protocol with explicit authentication. The proposed protocol satisfies a set of desirable security properties. Compared with the related protocols, the proposed protocol has distinct advantages in terms of security and computational efficiency.
Most of the existing Identity-based(ID) authenticated protocols are proven secure in the Canetti-Krawczyk(CK) model which is weaker than the extended Canetti-Krawczyk(eCK) model.Based on NAXOS trick,a new scheme using bilinear pairing was proposed.The security of the scheme was proven in the eCK model under the random oracle assumption and the Gap Bilinear Diffie-Hellman(GBDH) assumption.The proposed protocol was efficient in computational cost and communication round when compared with other solutions.The new protocol also satisfied master key forward security,perfect forward security and anti-key-leak disguise.
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.
Authenticated key agreement protocol is used to set up the session key and establish secure channel for network communication in the open environment. So far, great deals of identity-based protocols have been proposed to provide robust mutual authentication and key establishment in the two-party setting. Majority of the existing identity-based key agreement protocols require expensive bilinear pairing operation and only provide limited security attributes. Therefore, such protocols are unsuitable for real-world applications that require stronger sense of secrecy. In this paper, we first analysis some of the schemes proposed recently, and then present a one-round ID-based authenticated key agreement protocol with enhanced security attributes, which doesn't need pairing operation and achieves most of the required security attributes, such as known-key secrecy, perfect forward secrecy, PKG Forward Secrecy, key-compromise impersonation resilience, unknown key-share resilience and no key control. In addition, it captures the enhanced security attributes-Known session-specific temporary key information secrecy.