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

Xinxi wangluo anquan

Identity-based Encryption Authenticated Key Agreement Protocol

Yuan Yan-xian

Published Jan 1, 2014• 0 citations
OpenAlex

Abstract

The key agreement is an important part of the secure communication. By the key agreement protocol. the shared session key is established between communication nodes in order to achieve secure communications in network. In the context of the Internet of Things, the authenticated key agreement protocol proposed in this paper is based on identity-based authenticated key agreement protocol without the bilinear pairing. The protocol mainly includes three parts: initialization, parameter extraction and key agreement. Comparing with the key agreement protocol using bilinear pairings, the protocol not only provides the same level of security and scalability, but also has obvious advantages in terms of energy overhead, time overhead and computational complexity.

Related papers

Cryptanalysis and Improvement of Several Identity-Based Authenticated and Pairing-Free Key Agreement Protocols for IoT Applications

Haiyan Sun, Chaoyang Li, Jianwei Zhang +2 more

Internet of Things (IoT) applications have been increasingly developed. Authenticated key agreement (AKA) plays an essential role in secure communication in IoT applications. Without the PKI certificate and high time-complexity bilinear pairing operations, identity-based AKA (ID-AKA) protocols without pairings are more suitable for protecting the keys in IoT applications. In recent years, many pairing-free ID-AKA protocols have been proposed. Moreover, these protocols have some security flaws or relatively extensive computation and communication efficiency. Focusing on these problems, the security analyses of some recently proposed protocols have been provided first. We then proposed a family of eCK secure ID-AKA protocols without pairings to solve these security problems, which can be applied in IoT applications to guarantee communication security. Meanwhile, the security proofs of these proposed ID-AKA protocols are provided, which show they can hold provable eCK security. Some more efficient instantiations have been provided, which show the efficient performance of these proposed ID-AKA protocols. Moreover, comparisons with similar schemes have shown that these protocols have the least computation and communication efficiency at the same time.

Sensors•Dec 22, 2023•1 citation

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

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

A Provably Secure and Lightweight Identity-Based Two-Party Authenticated Key Agreement Protocol for IIoT Environments

Daya Sagar Gupta, SK Hafizul Islam, Mohammad S. Obaidat +3 more

With the significant development of the Internet, Internet of Things (IoT) has become an emerging technology in many industries. To support security and privacy in the Industrial IoT environment, a user may interact with another user on the Internet to share confidential information, which requires an authenticated communication channel. To meet this demand, in this article the authors developed an identity-based two-party authenticated key agreement (ID-2PAKA) protocol that allows two users to communicate securely and share sensitive data across IoT-enabled regions. Similar protocols found in the literature either proven to be insecure or carry the burden of high communication and computational costs. The proposed ID-2PAKA protocol is analyzed in the random oracle model to achieve provable security based on the hardness assumptions of computational Diffie-Hellman and bilinear Diffie-Hellman problems. The performance analysis of the proposed ID-2PAKA protocol is performed using the pairing-based cryptography library. The comparative results from the perspective of the computation and communication costs against the competing protocols showed that the proposed ID-2PAKA protocol is secure and efficient.

IEEE Systems Journal•Jul 3, 2020•85 citations

Secure and Efficient Two-Party Authenticated Key Agreement Protocol from Certificateless Public Key Encryption Scheme

Mengbo Hou, Qiuliang Xu

As the fundamental building block for secure communication in the open network, authenticated key agreement protocols are usually constructed in the public key setting. Certificateless public key cryptography combines the advantage of the identity-based public key cryptography (ID-PKC) and the traditional PKI. In this paper, we present a secure and efficient two-party authenticated key agreement protocol based on the efficient certificateless public key encryption scheme due to Cheng and Comley. Security analysis shows that it achieves perfect forward secrecy, PKG forward secrecy and almost all the other known security attributes for authenticated key agreement protocol, such as known-key secrecy, key-compromise impersonation resilience, unknown key-share resilience, known session-specific temporary information security, message independence and no key control. Compared to other comparable schemes, it is more secure and has nice efficiency.

International Joint Conference on INC, IMS and IDC (NCM)•Jan 1, 2009•4 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
The key agreement is an important part of the secure communication. By the key agreement protocol. the shared session key is established between communication nodes in order to achieve secure communications in network. In the context of the Internet of Things, the authenticated key agreement protocol proposed in this paper is based on identity-based authenticated key agreement protocol without the bilinear pairing. The protocol mainly includes three parts: initialization, parameter extraction and key agreement. Comparing with the key agreement protocol using bilinear pairings, the protocol not only provides the same level of security and scalability, but also has obvious advantages in terms of energy overhead, time overhead and computational complexity.
Internet of Things (IoT) applications have been increasingly developed. Authenticated key agreement (AKA) plays an essential role in secure communication in IoT applications. Without the PKI certificate and high time-complexity bilinear pairing operations, identity-based AKA (ID-AKA) protocols without pairings are more suitable for protecting the keys in IoT applications. In recent years, many pairing-free ID-AKA protocols have been proposed. Moreover, these protocols have some security flaws or relatively extensive computation and communication efficiency. Focusing on these problems, the security analyses of some recently proposed protocols have been provided first. We then proposed a family of eCK secure ID-AKA protocols without pairings to solve these security problems, which can be applied in IoT applications to guarantee communication security. Meanwhile, the security proofs of these proposed ID-AKA protocols are provided, which show they can hold provable eCK security. Some more efficient instantiations have been provided, which show the efficient performance of these proposed ID-AKA protocols. Moreover, comparisons with similar schemes have shown that these protocols have the least computation and communication efficiency at the same time.
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.
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.
With the significant development of the Internet, Internet of Things (IoT) has become an emerging technology in many industries. To support security and privacy in the Industrial IoT environment, a user may interact with another user on the Internet to share confidential information, which requires an authenticated communication channel. To meet this demand, in this article the authors developed an identity-based two-party authenticated key agreement (ID-2PAKA) protocol that allows two users to communicate securely and share sensitive data across IoT-enabled regions. Similar protocols found in the literature either proven to be insecure or carry the burden of high communication and computational costs. The proposed ID-2PAKA protocol is analyzed in the random oracle model to achieve provable security based on the hardness assumptions of computational Diffie-Hellman and bilinear Diffie-Hellman problems. The performance analysis of the proposed ID-2PAKA protocol is performed using the pairing-based cryptography library. The comparative results from the perspective of the computation and communication costs against the competing protocols showed that the proposed ID-2PAKA protocol is secure and efficient.
As the fundamental building block for secure communication in the open network, authenticated key agreement protocols are usually constructed in the public key setting. Certificateless public key cryptography combines the advantage of the identity-based public key cryptography (ID-PKC) and the traditional PKI. In this paper, we present a secure and efficient two-party authenticated key agreement protocol based on the efficient certificateless public key encryption scheme due to Cheng and Comley. Security analysis shows that it achieves perfect forward secrecy, PKG forward secrecy and almost all the other known security attributes for authenticated key agreement protocol, such as known-key secrecy, key-compromise impersonation resilience, unknown key-share resilience, known session-specific temporary information security, message independence and no key control. Compared to other comparable schemes, it is more secure and has nice efficiency.
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.