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 Wuhan University

Provably Secure Internet Key Exchange Protocol

Jianfeng Ma

Published Jan 1, 2006• 0 citations
OpenAlex

Abstract

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.

Related papers

Universally composable secure Internet key exchange protocol

Jianfeng Ma

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.

Journal of Xidian University•Jan 1, 2009•0 citations

Provable secure authenticated key exchange protocol under standard model

LI Yi-fa

This paper presents an identity-based authenticated key exchange protocol in the standard model.Protocol design isinspired by bilinear pairings.Strand space knowledge and Game method in provable security are comprehensively used.Thecorrectness of the protocol is analysed and a strict proof is given.The protocol has good forward security and session keynon-hosting.At the same time,through the explicit authentication,it improves the efficiency of the implementation of the pro-tocol.Compared with the protocol in the random oracle model,the protocol has the same computational and communicationefficiencies.

Computer Engineering and Applications Journal•Jan 1, 2011•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

Analysis and improvement of identity-based authenticated key agreement

MU Ning-bo

The security of a provably secure identity-based authenticated key agreement protocol in the standard model was analyzed,and it was found that the protocol used in escrowless mode has security flaws.When the private key generator(PKG) is controlled or attacked,all of the session keys can be obtained.To resist this attack,the identity-based authenticated key agreement protocol was improved.This new protocol was proven to be secure in the standard model and has the property of not needing session key escrow.

Harbin Gongcheng Daxue Xuebao/Journal of Harbin Engineering University•Jan 1, 2009•0 citations

Privacy-Preserving Authenticated Key-Exchange Over Internet

Andrew Chi-Chih Yao, Yunlei Zhao

Key-exchange, in particular Diffie-Hellman key-exchange (DHKE), is among the core cryptographic mechanisms for ensuring network security. For key-exchange over the Internet, both security and privacy are desired. In this paper, we develop a family of privacy-preserving authenticated DHKE protocols named deniable Internet key-exchange (DIKE), both in the traditional PKI setting and in the identity-based setting. The newly developed DIKE protocols are of conceptual clarity and practical (online) efficiency. They provide useful privacy protection to both protocol participants, and add novelty and new value to the IKE standard. To the best of our knowledge, our protocols are the first provably secure DHKE protocols that additionally enjoy all the following privacy protection advantages: 1) forward deniability, actually concurrent non-malleable statistical zero-knowledge, for both protocol participants simultaneously; 2) the session transcript and session-key can be generated merely from DH-exponents (together with some public values), which thus cannot be traced to the pair of protocol participants; and 3) exchanged messages do not bear peer's identity, and do not explicitly bear player role information.

IEEE Transactions on Information Forensics and Security•Jan 1, 2014•36 citations

Provably Secure Two-Party Authenticated Key Exchange Protocol in eCK Model

Zhao Jian

How to construct secure key agreement protocol is one of the most challenging problems in information security area.However,most of the current secure protocols can only achieve heuristic security,the security assumptions and efficiencies of these protocols are not perfect.To solve these problems,the authors propose a new 2 rounds two-party authenticated key agreement protocol and point out some principles to construct a secure protocol by analyzing the security properties of the protocol,then prove strictly that the new protocol is secure in eCK model.According to pertinent literature,eCK model provides the strongest definition of security for two party key agreement protocol at present.Performance analysis shows that the protocol has a good balance between computational cost and security assumption.The authors also present a three-round variant of the protocol to realize key conformation property.

Chinese Journal of Computers•Jan 1, 2011•0 citations
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 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.
This paper presents an identity-based authenticated key exchange protocol in the standard model.Protocol design isinspired by bilinear pairings.Strand space knowledge and Game method in provable security are comprehensively used.Thecorrectness of the protocol is analysed and a strict proof is given.The protocol has good forward security and session keynon-hosting.At the same time,through the explicit authentication,it improves the efficiency of the implementation of the pro-tocol.Compared with the protocol in the random oracle model,the protocol has the same computational and communicationefficiencies.
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.
The security of a provably secure identity-based authenticated key agreement protocol in the standard model was analyzed,and it was found that the protocol used in escrowless mode has security flaws.When the private key generator(PKG) is controlled or attacked,all of the session keys can be obtained.To resist this attack,the identity-based authenticated key agreement protocol was improved.This new protocol was proven to be secure in the standard model and has the property of not needing session key escrow.
Key-exchange, in particular Diffie-Hellman key-exchange (DHKE), is among the core cryptographic mechanisms for ensuring network security. For key-exchange over the Internet, both security and privacy are desired. In this paper, we develop a family of privacy-preserving authenticated DHKE protocols named deniable Internet key-exchange (DIKE), both in the traditional PKI setting and in the identity-based setting. The newly developed DIKE protocols are of conceptual clarity and practical (online) efficiency. They provide useful privacy protection to both protocol participants, and add novelty and new value to the IKE standard. To the best of our knowledge, our protocols are the first provably secure DHKE protocols that additionally enjoy all the following privacy protection advantages: 1) forward deniability, actually concurrent non-malleable statistical zero-knowledge, for both protocol participants simultaneously; 2) the session transcript and session-key can be generated merely from DH-exponents (together with some public values), which thus cannot be traced to the pair of protocol participants; and 3) exchanged messages do not bear peer's identity, and do not explicitly bear player role information.
How to construct secure key agreement protocol is one of the most challenging problems in information security area.However,most of the current secure protocols can only achieve heuristic security,the security assumptions and efficiencies of these protocols are not perfect.To solve these problems,the authors propose a new 2 rounds two-party authenticated key agreement protocol and point out some principles to construct a secure protocol by analyzing the security properties of the protocol,then prove strictly that the new protocol is secure in eCK model.According to pertinent literature,eCK model provides the strongest definition of security for two party key agreement protocol at present.Performance analysis shows that the protocol has a good balance between computational cost and security assumption.The authors also present a three-round variant of the protocol to realize key conformation property.