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

Computer Engineering and Applications Journal

Internet key exchange protocol based on zero knowledge proof

Xiaoyuan Yang

Published Jan 1, 2010• 0 citations
OpenAlex

Abstract

IKE protocol,with its complexity,is vulnerable to multiple attacks.This paper first analyzes its flaws,and then based on the idea of zero knowledge proof,proposes a new protocol,which can resist MITM attack efficiently as well as reduce system consumption.This protocol fits the users who need more strong security protect for their data.

Related papers

Analysis of Network-level Key Exchange Protocols in the Post-Quantum Era

Andrea Pazienza, Eufemia Lella, Pietro Noviello +1 more

A Virtual Private Network (VPN) ensures the confidentiality and integrity of data transferred between two endpoints, even if the means of transport are insecure. One popular protocol is Internet Protocol Security (IPSec) which operates at OSI layer 3 and protects all protocols at higher layers. Cryptographic keys in IPSec are negotiated using the Internet Key Exchange (IKE) protocol. IKE negotiates security parameters for IPSec sessions. In particular, the IKEv2 protocol uses the Elliptic Curve Diffie-Hellman (ECDH) algorithm to establish a secret key shared between two nodes on a network. Although solving such a problem remains difficult with current computing power, it is believed that generic quantum computers will be able to solve this problem, which implies that the security of IKEv2 is compromised. There are, however, several cryptographic systems that are trusted to be resistant to attacks by quantum computers. This family of cryptosystems is known as quantum-resistant cryptography (QRC). In this paper, after highlighting the requirements for a secure key exchange protocol, we briefly review the QRC solutions that have been proposed in the recent literature.

IEEE Workshop on Low Temperature Electronics (WOLTE)•Jun 6, 2022•8 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

Authenticated Deniable Internet KeyExchange

R.Pitch, S. Saranya

We propose two public-key schemes to achieve deniable authentication for the Internet Key Exchange (IKE). Authentication in security had is the essential factor in the key establishment over Internet. The Deniable Internet key exchange protocol gives more value to the IKE standard. Our schemes can in some situations be more efficient than existing IKE protocols as well as having stronger deniability properties. 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.

International Journal of Innovative Research in Computer and Communication Engineering•Jan 1, 2015•0 citations

Deniable Internet Key-Exchange.

Andrew Chi-Chih Yao, Frances Yao, Yunlei Zhao +1 more

In this work, we develop a family of protocols for deniable Internet Key-Exchange (IKE) with the following properties: • Highly practical efficiency, and conceptual simplicity and clarity. • Forward and concurrent (non-malleable) deniability against adversaries with arbitrary auxiliary inputs, and better privacy protection of players ’ roles. • Provable security in the Canetti-Krawczyk post-specified-peer model, and maintenance of essential security properties not captured by the Canetti-Krawczyk security model. • Compatibility with the widely deployed and standardized SIGMA (i.e., the basis of IKEv2) and (H)MQV protocols, when parties possess DL public-keys. Our protocols could potentially serve, in part, as either the underlying basis or a useful alternative for the next generation of IKE (i.e., IKEv3) of IPsec (in particular, when deniability is desired). In view of the wide deployment and use of IKE and increasing awareness of privacy protection (especially for E-commerce over Internet), this work is naturally of practical interest.

•Jan 1, 2007•9 citations

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

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
A Virtual Private Network (VPN) ensures the confidentiality and integrity of data transferred between two endpoints, even if the means of transport are insecure. One popular protocol is Internet Protocol Security (IPSec) which operates at OSI layer 3 and protects all protocols at higher layers. Cryptographic keys in IPSec are negotiated using the Internet Key Exchange (IKE) protocol. IKE negotiates security parameters for IPSec sessions. In particular, the IKEv2 protocol uses the Elliptic Curve Diffie-Hellman (ECDH) algorithm to establish a secret key shared between two nodes on a network. Although solving such a problem remains difficult with current computing power, it is believed that generic quantum computers will be able to solve this problem, which implies that the security of IKEv2 is compromised. There are, however, several cryptographic systems that are trusted to be resistant to attacks by quantum computers. This family of cryptosystems is known as quantum-resistant cryptography (QRC). In this paper, after highlighting the requirements for a secure key exchange protocol, we briefly review the QRC solutions that have been proposed in the recent literature.
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.
We propose two public-key schemes to achieve deniable authentication for the Internet Key Exchange (IKE). Authentication in security had is the essential factor in the key establishment over Internet. The Deniable Internet key exchange protocol gives more value to the IKE standard. Our schemes can in some situations be more efficient than existing IKE protocols as well as having stronger deniability properties. 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.
In this work, we develop a family of protocols for deniable Internet Key-Exchange (IKE) with the following properties: • Highly practical efficiency, and conceptual simplicity and clarity. • Forward and concurrent (non-malleable) deniability against adversaries with arbitrary auxiliary inputs, and better privacy protection of players ’ roles. • Provable security in the Canetti-Krawczyk post-specified-peer model, and maintenance of essential security properties not captured by the Canetti-Krawczyk security model. • Compatibility with the widely deployed and standardized SIGMA (i.e., the basis of IKEv2) and (H)MQV protocols, when parties possess DL public-keys. Our protocols could potentially serve, in part, as either the underlying basis or a useful alternative for the next generation of IKE (i.e., IKEv3) of IPsec (in particular, when deniability is desired). In view of the wide deployment and use of IKE and increasing awareness of privacy protection (especially for E-commerce over Internet), this work is naturally of practical interest.
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.
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.