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 Computer Research and Development

A Modular Approach Towards Design and Analysis of Authenticated Key Exchange Protocol Based on Extended Canetti-Krawczyk Model

Pan Jiaxin and Wang Libin

Published Aug 15, 2011• 1 citation
OpenAlex

Related papers

Security model and modular design of fair authentication key exchange protocols

Dengguo Feng, Weidong Chen

Science China Information Sciences•Feb 1, 2010•3 citations

Provably Secure Mobile Key Exchange: Applying the Canetti-Krawczyk Approach

Yiu Shing Terry Tin, Colin Boyd, Juan Manuel González Nieto

Lecture notes in computer science•Jan 1, 2003•15 citations

Modular proofs for key exchange: rigorous optimizations in the Canetti–Krawczyk model

Yvonne Hitchcock, Colin Boyd, Juan Manuel González Nieto

Applicable Algebra in Engineering Communication and Computing•Nov 7, 2005•8 citations

Modular Design of Role-Symmetric Authenticated Key Exchange Protocols

Yuting Xiao, Rui Zhang, Hui Ma

Lecture notes in computer science•Jan 1, 2021•2 citations

Analysis of Two Provably Secure Authenticated Key Exchange Protocols in the eCK Model

Xuexian Hu

The extended Canetti-Krawczyk(eCK) model proposed by LaMacchia et al.is currently regarded as the strongest security model for authenticated key exchange(AKE) protocols.In the eCK model,the adversary can make queries on the test session,and reveal both ephemeral private keys,both long-term keys,or one of each from the two different parties.In this paper,we analyze two AKE protocols designed in the eCK model based on the definition of eCK model.We propose ephemeral keys compromised attacks and long-term keys compromised attacks on one of them,and also propose ephemeral keys compromised attacks on the other one.The results of analysis show that both of them are insecure in the eCK model.

Journal of Wuhan University•Jan 1, 2010•0 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
The extended Canetti-Krawczyk(eCK) model proposed by LaMacchia et al.is currently regarded as the strongest security model for authenticated key exchange(AKE) protocols.In the eCK model,the adversary can make queries on the test session,and reveal both ephemeral private keys,both long-term keys,or one of each from the two different parties.In this paper,we analyze two AKE protocols designed in the eCK model based on the definition of eCK model.We propose ephemeral keys compromised attacks and long-term keys compromised attacks on one of them,and also propose ephemeral keys compromised attacks on the other one.The results of analysis show that both of them are insecure in the eCK model.
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.