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

Chinese Journal of Computers

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

Zhao Jian

Published Jan 1, 2011• 0 citations
OpenAlex

Abstract

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.

Related papers

High-efficiency and provably secure key agreement of double rounds in both sides

Chen Kai-bin

Under the circumstance of completely open up of network,in order to guarantee the security of the communication,construct secure and efficient key agreement protocol.A new two rounds two-party authenticated key agreement protocol is proposed.According to the key agreement,two models in the new key agreement protocol by both sides is analyzed with key agreement to make a session key,and then new forms of double rounds key negotiation meeting is proved formally,in addition,a triple rounds confirmed key negotiation meeting is,the good effect is obtained through the experiment performance analysis.

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

Improved two-party authenticated key agreement protocol

Zhang Long-xiang

Two-party authenticated key agreement is one of the methods to generate session keys.In this paper,the authors analyzed a new provably secure two-party authenticated key agreement protocol proposed in 2011 by Jianjie Zhao et al.and pointed out that this protocol was not secure if the adversary can obtain the long-term key of a participant.Then an improved protocol was presented,and in the new scheme,the parameters that may leak the long-term keys were encrypted.The authors also discussed the security and computational cost of the new scheme.The result shows that the new protocol realizes the secure key agreement with lower computational cost.

Journal of Computer Applications•Jan 1, 2012•0 citations

TUP: A New eCK-Secure AKE Protocol under the CDH Assumption

Qinglei Zhou, Zengfu Yang

The design and analysis of authenticated key exchange protocol is an important problem in information security area. At present, extended Canetti-Krawczyk (eCK) model provides the strongest definition of security for two party key agreement protocol, however most of the current secure protocols can not be prove to secure without Gap assumption. To avoid this phenomenon, by using twinning key technology we propose a new two party key agreement protocol TUP which is obtained by modifying the UP protocol, then in conjunction with the trapdoor test, we prove strictly that the new protocol is secure in eCK model. Compared with previous protocols, the security assumption of new proposal is more standard and weaker, and it also solves an open problem in ProvSec'09.

International Journal of Communications Network and System Sciences•Jan 1, 2012•2 citations

eCK-security authenticated key agreement protocol based on CDH assumption

Mengzhi Liu, Yanli Zhao, Shuying Chen

By far, the extended Canetti-Krawczyk (eCK) model still is one of strongest security model for authenticated key exchange (AKE) protocols. In this paper, a secure authenticated key agreement protocol named SAKA is analyzed in the model, the results show that the SAKA protocol does not support forward security which all key exchange protocol should satisfy. Furthermore, it does not meet security goals of the eCK model. In order to overcome all of above flaws, a variant of SAKA protocol is proposed based on Computation Diffie-Hellman assumption, and secure analysis shows that the new protocol has some good security properties including perfect forward secrecy and known session key excepting those desired security properties that SAKA has. Furthermore, fewer number of modular exponentiation indicates that the new scheme is more efficient.

IEEE International Conference on Computer and Communications (ICCC)•Oct 1, 2016•1 citation

Strongly Secure One Round Authenticated Key Exchange Protocol with Perfect Forward Security.

Hai Huang

Abstract. This paper investigates the two-pass authenticated key exchange protocol in the enhanced Canetti-Krawczyk (eCK) with perfect forward security. Currently, there exist no authenticated key exchange protocols which are provably secure in eCK model and meanwhile achieve perfect forward security against active adversary in one round. We propose a new two-pass authenticated key exchange protocol which enjoys following desirable properties. First, our protocol is shown secure in the eCK model under the gap Diffie-Hellman (GDH) assumption. Moreover, our protocol does not use the NAXOS transformation, the drawback of which will be discussed in the introduction. Second, under the same assumption, we prove that our protocol achieves perfect forward security against active adversary in one round. To the best of our knowledge, our proposal is first two-pass (one round) AKE protocol provably secure in the eCK model and achieving perfect forward security against active adversary.

•Jan 1, 2011•0 citations

Efficient and secure certificateless key agreement protocol

Xiaolei Dong

In the area of network information security,key agreement is essential between servers and clients.To overcome the key escrow property of identity-based cryptography,proposed certificateless public key cryptography,it combined the advantages of the traditional PKI and the identity-based cryptography.This paper proposed a new certificateless two-party key agreement protocol using pairing operation in elliptic curves,it only required each party to compute one pairing.Proved its security in ECK(extended Canetti-Krawczyk) model.Compared with existing certificateless protocols,the newly proposed key agreement protocol has better security and efficiency.

Jisuanji yingyong yanjiu•Jan 1, 2009•0 citations
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.
Under the circumstance of completely open up of network,in order to guarantee the security of the communication,construct secure and efficient key agreement protocol.A new two rounds two-party authenticated key agreement protocol is proposed.According to the key agreement,two models in the new key agreement protocol by both sides is analyzed with key agreement to make a session key,and then new forms of double rounds key negotiation meeting is proved formally,in addition,a triple rounds confirmed key negotiation meeting is,the good effect is obtained through the experiment performance analysis.
Two-party authenticated key agreement is one of the methods to generate session keys.In this paper,the authors analyzed a new provably secure two-party authenticated key agreement protocol proposed in 2011 by Jianjie Zhao et al.and pointed out that this protocol was not secure if the adversary can obtain the long-term key of a participant.Then an improved protocol was presented,and in the new scheme,the parameters that may leak the long-term keys were encrypted.The authors also discussed the security and computational cost of the new scheme.The result shows that the new protocol realizes the secure key agreement with lower computational cost.
The design and analysis of authenticated key exchange protocol is an important problem in information security area. At present, extended Canetti-Krawczyk (eCK) model provides the strongest definition of security for two party key agreement protocol, however most of the current secure protocols can not be prove to secure without Gap assumption. To avoid this phenomenon, by using twinning key technology we propose a new two party key agreement protocol TUP which is obtained by modifying the UP protocol, then in conjunction with the trapdoor test, we prove strictly that the new protocol is secure in eCK model. Compared with previous protocols, the security assumption of new proposal is more standard and weaker, and it also solves an open problem in ProvSec'09.
By far, the extended Canetti-Krawczyk (eCK) model still is one of strongest security model for authenticated key exchange (AKE) protocols. In this paper, a secure authenticated key agreement protocol named SAKA is analyzed in the model, the results show that the SAKA protocol does not support forward security which all key exchange protocol should satisfy. Furthermore, it does not meet security goals of the eCK model. In order to overcome all of above flaws, a variant of SAKA protocol is proposed based on Computation Diffie-Hellman assumption, and secure analysis shows that the new protocol has some good security properties including perfect forward secrecy and known session key excepting those desired security properties that SAKA has. Furthermore, fewer number of modular exponentiation indicates that the new scheme is more efficient.
Abstract. This paper investigates the two-pass authenticated key exchange protocol in the enhanced Canetti-Krawczyk (eCK) with perfect forward security. Currently, there exist no authenticated key exchange protocols which are provably secure in eCK model and meanwhile achieve perfect forward security against active adversary in one round. We propose a new two-pass authenticated key exchange protocol which enjoys following desirable properties. First, our protocol is shown secure in the eCK model under the gap Diffie-Hellman (GDH) assumption. Moreover, our protocol does not use the NAXOS transformation, the drawback of which will be discussed in the introduction. Second, under the same assumption, we prove that our protocol achieves perfect forward security against active adversary in one round. To the best of our knowledge, our proposal is first two-pass (one round) AKE protocol provably secure in the eCK model and achieving perfect forward security against active adversary.
In the area of network information security,key agreement is essential between servers and clients.To overcome the key escrow property of identity-based cryptography,proposed certificateless public key cryptography,it combined the advantages of the traditional PKI and the identity-based cryptography.This paper proposed a new certificateless two-party key agreement protocol using pairing operation in elliptic curves,it only required each party to compute one pairing.Proved its security in ECK(extended Canetti-Krawczyk) model.Compared with existing certificateless protocols,the newly proposed key agreement protocol has better security and efficiency.