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

Journal of Xidian University

Universally composable secure Internet key exchange protocol

Jianfeng Ma

Published Jan 1, 2009• 0 citations
OpenAlex

Abstract

The new Internet key exchange protocol(IKEv2) is analyzed,and it is found that the protocol can not achieve active identity protection to the initiator and has the security flaw of authentication failure in its initial exchange.However,it is necessary to protect the identity information to the initiator under the environment of a wireless access network.In this paper,a novel key exchange protocol for the wireless network based on IKEv2 initial exchange is proposed,which realizes active identity protection to the initiator by the responder explicitly proving his true identity,and achieves successful authentication by reconstructing the authentication payload.With the Universally Composable(UC) security model,this new protocol is analyzed in detail,with the analytical results showing that it affords provably UC security.Performance analysis and simulation results show that the proposed protocol has less computation and communication overhead.

Related papers

Provably Secure Internet Key Exchange Protocol

Jianfeng Ma

IKEv2 can not achieve active identity protection to initiator in initial exchange,and it has the security flaw of authentication failure.So an improvement protocol is presented.In the new protocol,the SIGn-andMAc approach is adopted to realize explicit key authentication and the responder is first authenticated to actively protect the initiator's identity.By including the peer's identity in the sending messages,the new protocol solves the problem of authentication failure.Moreover,the non-repudiation of the peers for their interactions is also achieved.The analysis results show that our protocol is session key secure and has a good performance.

Journal of Wuhan University•Jan 1, 2006•0 citations

Universally composable key exchange protocol for WLAN

Haojun Zhang, Qi Qinglei

The security is the core in the applications of WLAN. The 4-WAY handshake protocol realized the key exchange and update in the WLAN security basement framework which was defined by IEEE 802. 11i. The analysis showed that the 4-WAY handshake was vulnerable to denial-of-service attack. This paper advanced the modified session key agreement protocol, 3-WAY,which was showed that it provided better information authentication,integrality protection and efficiency. In addition,analyzed the 3-way handshake protocol in the universally composable ( UC) security model and proved that this new protocol could realize the key-exchanged ideal function and came to the universally composable security. This new protocol has abroad flexibility.

Jisuanji yingyong yanjiu•Jan 1, 2010•0 citations

Formal Protocol Design of ESIKE Based on Authentication Tests

Rui Jiang, Aiqun Hu, Jianhua Li

In this paper, we first present a concrete formal protocol design approach, which is based on authentication tests, to create an Efficient and Secure Internet Key Exchange (ESIKE) protocol. Then we formally prove the secure properties of ESIKE with strand space model and authentication tests. The ESIKE protocol overcomes the security shortages of the Internet Key Exchange (IKE), and can provide secure negotiation of session key and Security Association (SA), protection of endpoints ’ identities, and mutual authentication between the initiator and the responder. It needs only three messages and less computational load, so it is simple and efficient.

•Feb 15, 2012•2 citations

Universally Composable Secure Just Fast Keying Protocol

Wang Yi-fang

Aiming at the redundancy of Just Fast Keying(JFKi) and the absence of its forma proof,a new Lightly Just Fast Keying(LJFKi) is proposed.Through the contrast analysis,it is found that the protocol proved is one-third shorter than the natural protocol,which has higher communication efficiency and is more convenient for the sensitive network to communication payload.The proposed protocol can realize secure session ideal function and afford Universally Composable(UC) security by proving with universally composable secure model.

Jisuanji gongcheng•Jan 1, 2011•0 citations

Universally Composable Key Bootstrapping and Secure Communication Protocols for the Energy Internet

Abubakar Sadiq Sani, Dong Yuan, Wei Bao +3 more

The Energy Internet is an advanced smart grid solution to increase energy efficiency by jointly operating multiple energy resources via the Internet. However, such an increasing integration of energy resources requires secure and efficient communication in the Energy Internet. To address such a requirement, we propose a new secure key bootstrapping protocol to support the integration and operation of energy resources. By using a universal composability model that provides a strong security notion for designing and analyzing cryptographic protocols, we define an ideal functionality that supports several cryptographic primitives used in this paper. Furthermore, we provide an ideal functionality for key bootstrapping and secure communication, which allows exchanged session keys to be used for secure communication in an ideal manner. We propose the first secure key bootstrapping protocol that enables a user to verify the identities of other users before key bootstrapping. We also present a secure communication protocol for unicast and multicast communications. The ideal functionalities help in the design and analysis of the proposed protocols. We perform some experiments to validate the performance of our protocols, and the results show that our protocols are superior to the existing related protocols and are suitable for the Energy Internet. As a proof of concept, we apply our functionalities to a practical key bootstrapping protocol, namely generic bootstrapping architecture.

IEEE Transactions on Information Forensics and Security•Jan 10, 2019•7 citations

A Universally Composable PAKE with Zero Communication Cost

Lawrence Roy, Jiayu Xu

A Password-Authenticated Key Exchange (PAKE) protocol allows two parties to agree upon a cryptographic key, when the only information shared in advance is a low-entropy password. The standard security notion for PAKE (Canetti et al., Eurocrypt 2005) is in the Universally Composable (UC) framework. We show that unlike most UC security notions, UC PAKE does not imply correctness. While Canetti et al. has briefly noticed this issue, we present the first comprehensive study of correctness in UC PAKE: We show that TrivialPAKE, a no-message protocol that does not satisfy correctness, is a UC PAKE; We propose nine approaches to guaranteeing correctness in the UC security notion of PAKE, and show that seven of them are equivalent, whereas the other two are unachievable; We prove that a direct solution, namely changing the UC PAKE functionality to incorporate correctness, is impossible; Finally, we show how to naturally incorporate correctness by changing the model—we view PAKE as a three-party protocol, with the man-in-the-middle adversary as the third party. In this way, we hope to shed some light on the very nature of UC-security in the man-in-the-middle setting.

Lecture notes in computer science•Jan 1, 2023•8 citations
The new Internet key exchange protocol(IKEv2) is analyzed,and it is found that the protocol can not achieve active identity protection to the initiator and has the security flaw of authentication failure in its initial exchange.However,it is necessary to protect the identity information to the initiator under the environment of a wireless access network.In this paper,a novel key exchange protocol for the wireless network based on IKEv2 initial exchange is proposed,which realizes active identity protection to the initiator by the responder explicitly proving his true identity,and achieves successful authentication by reconstructing the authentication payload.With the Universally Composable(UC) security model,this new protocol is analyzed in detail,with the analytical results showing that it affords provably UC security.Performance analysis and simulation results show that the proposed protocol has less computation and communication overhead.
IKEv2 can not achieve active identity protection to initiator in initial exchange,and it has the security flaw of authentication failure.So an improvement protocol is presented.In the new protocol,the SIGn-andMAc approach is adopted to realize explicit key authentication and the responder is first authenticated to actively protect the initiator's identity.By including the peer's identity in the sending messages,the new protocol solves the problem of authentication failure.Moreover,the non-repudiation of the peers for their interactions is also achieved.The analysis results show that our protocol is session key secure and has a good performance.
The security is the core in the applications of WLAN. The 4-WAY handshake protocol realized the key exchange and update in the WLAN security basement framework which was defined by IEEE 802. 11i. The analysis showed that the 4-WAY handshake was vulnerable to denial-of-service attack. This paper advanced the modified session key agreement protocol, 3-WAY,which was showed that it provided better information authentication,integrality protection and efficiency. In addition,analyzed the 3-way handshake protocol in the universally composable ( UC) security model and proved that this new protocol could realize the key-exchanged ideal function and came to the universally composable security. This new protocol has abroad flexibility.
In this paper, we first present a concrete formal protocol design approach, which is based on authentication tests, to create an Efficient and Secure Internet Key Exchange (ESIKE) protocol. Then we formally prove the secure properties of ESIKE with strand space model and authentication tests. The ESIKE protocol overcomes the security shortages of the Internet Key Exchange (IKE), and can provide secure negotiation of session key and Security Association (SA), protection of endpoints ’ identities, and mutual authentication between the initiator and the responder. It needs only three messages and less computational load, so it is simple and efficient.
Aiming at the redundancy of Just Fast Keying(JFKi) and the absence of its forma proof,a new Lightly Just Fast Keying(LJFKi) is proposed.Through the contrast analysis,it is found that the protocol proved is one-third shorter than the natural protocol,which has higher communication efficiency and is more convenient for the sensitive network to communication payload.The proposed protocol can realize secure session ideal function and afford Universally Composable(UC) security by proving with universally composable secure model.
The Energy Internet is an advanced smart grid solution to increase energy efficiency by jointly operating multiple energy resources via the Internet. However, such an increasing integration of energy resources requires secure and efficient communication in the Energy Internet. To address such a requirement, we propose a new secure key bootstrapping protocol to support the integration and operation of energy resources. By using a universal composability model that provides a strong security notion for designing and analyzing cryptographic protocols, we define an ideal functionality that supports several cryptographic primitives used in this paper. Furthermore, we provide an ideal functionality for key bootstrapping and secure communication, which allows exchanged session keys to be used for secure communication in an ideal manner. We propose the first secure key bootstrapping protocol that enables a user to verify the identities of other users before key bootstrapping. We also present a secure communication protocol for unicast and multicast communications. The ideal functionalities help in the design and analysis of the proposed protocols. We perform some experiments to validate the performance of our protocols, and the results show that our protocols are superior to the existing related protocols and are suitable for the Energy Internet. As a proof of concept, we apply our functionalities to a practical key bootstrapping protocol, namely generic bootstrapping architecture.
A Password-Authenticated Key Exchange (PAKE) protocol allows two parties to agree upon a cryptographic key, when the only information shared in advance is a low-entropy password. The standard security notion for PAKE (Canetti et al., Eurocrypt 2005) is in the Universally Composable (UC) framework. We show that unlike most UC security notions, UC PAKE does not imply correctness. While Canetti et al. has briefly noticed this issue, we present the first comprehensive study of correctness in UC PAKE: We show that TrivialPAKE, a no-message protocol that does not satisfy correctness, is a UC PAKE; We propose nine approaches to guaranteeing correctness in the UC security notion of PAKE, and show that seven of them are equivalent, whereas the other two are unachievable; We prove that a direct solution, namely changing the UC PAKE functionality to incorporate correctness, is impossible; Finally, we show how to naturally incorporate correctness by changing the model—we view PAKE as a three-party protocol, with the man-in-the-middle adversary as the third party. In this way, we hope to shed some light on the very nature of UC-security in the man-in-the-middle setting.