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 Wireless Communications and Mobile Computing Conference (IWCMC)

An authenticated key agreement protocol for cross-domain based on heterogeneous signcryption scheme

Caifen Wang, Chao Liu, Shufen Niu, Li Chen, Xu Wang

Published Jun 1, 2017• 16 citations
Publisher

Abstract

In this paper, we present a new efficient authenticated key agreement protocol. Compared with other cross-domain protocols which are all in the same cryptosystem, our protocol is innovatively designed to shift between the Public Key Infrastructure (PKI) and the Identity-based Cryptosystem (IBC). This protocol combined with heterogeneous signcryption method is proved to satisfy confidentiality and unforgeability on the basis of the assumptions of Computational Diffie-Hellman problem (CDHP) and Bilinear Diffie-Hellman problem (BDHP) in the authentication phases, and it simultaneously guarantees the ciphertext anonymity. In addition, it can efficiently resist kinds of active attacks such as known-session key attack, key forge attack, and known-temporary secret key attack. Compared with other two-party authenticated key agreement protocols, the newly proposed key agreement protocol has better security, practicability and efficiency.

DOI
10.1109/iwcmc.2017.7986374

Related papers

Secure and efficient two-party certificateless authenticated key agreement protocol

Mengbo Hou, Qiuliang Xu

Authenticated key agreement protocol is used to provide data confidentiality and integrity to subsequent communications among two or more parties over a public network. Certificateless public key cryptography (CL-PKC) 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 certificateless encryption scheme due to Libert and Quisquater. Security analysis shows that it achieves perfect forward secrecy, PKG forward secrecy and almost all the other known security attributes, 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 efficient.

International Colloquium on Computing, Communication, Control, and Management•Aug 1, 2009•6 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

Authenticated conference key agreement based on identity

Zecheng Wang

In order to ensure authenticity of the information for conference key negotiation, the information which each party sends should be authenticated. Digital signature and share secret are two methods for authentication. Identity-based public key cryptosystems from the Weil pairing on elliptic curve are introduced. Two authenticated conference key agreement protocols are designed using identitybased signature scheme and identity-based Diffie-Hellman shared key. The protocols are secure and efficient. They can be applied to all kinds of environment in which multi-parties negotiate session keys.

Jisuanji gongcheng yu sheji•Jan 1, 2004•0 citations

A Provably Secure Heterogeneous Authenticated Key Agreement Protocol for IoT Scenarios

Xiangyu Pan, Yanyan Liu, Wenhui Ye +3 more

The rapid development of network technology has made the application of the Internet of Things an essential part of daily life. However, most IoT communications are based on public wireless networks, which exposes them to various security threats. Moreover, with the increase in the number of IoT devices and the emergence of their diverse application scenarios, the possibility of cross-domain communication between service providers is also increasing. Considering these factors, this paper proposes an efficient heterogeneous authentication key agreement protocol suitable for resource-inequality environments. One of the interacting parties is a resource-constrained mobile device using the identity-based cryptography (IBC) mechanism, and the other is an application server using the public key Infrastructure (PKI) system. Through analysis, this protocol has provable security under the extended Canetti-Krawczyk (eCK) model and possesses forward secrecy, it also supports mutual authentication and is capable of defending against replay attacks, impersonation attacks and other common malicious exploits. In addition, compared with related research results, this protocol achieves better security and higher computational efficiency on IoT devices.

International Conference on Big Data and Information Analytics (BigDIA)•Aug 1, 2026•0 citations

An Efficient Tripartite Identity-Based Authenticated Key Agreement Protocol

Xiaotong Fu, Shufang Guo, Ruijun Shi

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.

International Conference on Intelligent Networking and Collaborative Systems (INCoS)•Sep 1, 2013•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
In this paper, we present a new efficient authenticated key agreement protocol. Compared with other cross-domain protocols which are all in the same cryptosystem, our protocol is innovatively designed to shift between the Public Key Infrastructure (PKI) and the Identity-based Cryptosystem (IBC). This protocol combined with heterogeneous signcryption method is proved to satisfy confidentiality and unforgeability on the basis of the assumptions of Computational Diffie-Hellman problem (CDHP) and Bilinear Diffie-Hellman problem (BDHP) in the authentication phases, and it simultaneously guarantees the ciphertext anonymity. In addition, it can efficiently resist kinds of active attacks such as known-session key attack, key forge attack, and known-temporary secret key attack. Compared with other two-party authenticated key agreement protocols, the newly proposed key agreement protocol has better security, practicability and efficiency.
Authenticated key agreement protocol is used to provide data confidentiality and integrity to subsequent communications among two or more parties over a public network. Certificateless public key cryptography (CL-PKC) 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 certificateless encryption scheme due to Libert and Quisquater. Security analysis shows that it achieves perfect forward secrecy, PKG forward secrecy and almost all the other known security attributes, 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 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.
In order to ensure authenticity of the information for conference key negotiation, the information which each party sends should be authenticated. Digital signature and share secret are two methods for authentication. Identity-based public key cryptosystems from the Weil pairing on elliptic curve are introduced. Two authenticated conference key agreement protocols are designed using identitybased signature scheme and identity-based Diffie-Hellman shared key. The protocols are secure and efficient. They can be applied to all kinds of environment in which multi-parties negotiate session keys.
The rapid development of network technology has made the application of the Internet of Things an essential part of daily life. However, most IoT communications are based on public wireless networks, which exposes them to various security threats. Moreover, with the increase in the number of IoT devices and the emergence of their diverse application scenarios, the possibility of cross-domain communication between service providers is also increasing. Considering these factors, this paper proposes an efficient heterogeneous authentication key agreement protocol suitable for resource-inequality environments. One of the interacting parties is a resource-constrained mobile device using the identity-based cryptography (IBC) mechanism, and the other is an application server using the public key Infrastructure (PKI) system. Through analysis, this protocol has provable security under the extended Canetti-Krawczyk (eCK) model and possesses forward secrecy, it also supports mutual authentication and is capable of defending against replay attacks, impersonation attacks and other common malicious exploits. In addition, compared with related research results, this protocol achieves better security and higher computational efficiency on IoT devices.
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.
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.