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

Springer eBooks

Stronger Security of Authenticated Key Exchange

Brian A. LaMacchia, Kristin Lauter, Anton Mityagin

Published Oct 5, 2007• 718 citations
Publisher
DOI
10.1007/978-3-540-75670-5_1

Related papers

Authentication and authenticated key exchanges

Whitfield Diffie, Paul C. van Oorschot, Michael J. Wiener

Designs Codes and Cryptography•Jun 1, 1992•1,155 citations

A provably secure authenticated key exchange protocol based on lattice with stronger anonymity

Yun Song, Songhui Guo, Yeming Yang +1 more

Stronger anonymity password authentication key exchange protocols based on traditional cryptography are not resistant to quantum computing attacks, and there is no lattice-only anonymous password authentication key exchange protocol protocol that satisfies the strong anonymity requirement. Therefore, this paper constructs stronger anonymity PAKE protocol based on the ring learning with errors (RLWE) and smooth projective hash function (SPHF) based on ideal lattice. The proposed protocol can achieve stronger anonymity and resists to desynchronization attacks and quantum attack. The security of the protocol is proved under the BPR model. The security and performance analysis shows that the proposed PAKE protocol has better advantages in security and efficiency.

International Conference on Cryptography, Network Security and Communication Technology (CNSCT)•May 12, 2023•1 citation

Security Model for Authenticated Key Exchange, Reconsidered

Xichen Zhang, Keitaro Hashimoto, Wakaha Ogata

Lecture notes in computer science•Jan 1, 2024•0 citations

A modified eCK model with stronger security for tripartite authenticated key exchange.

Qingfeng Cheng, Chuangui Ma, Fushan Wei

Since Bellare and Rogaway presented the first formal security model for authenticated key exchange (AKE) protocols in 1993, many formal security models have been proposed. The extended Canetti-Krawczyk (eCK) model proposed by LaMacchia et al. is currently regarded as the strongest security model for two-party AKE protocols. In this paper, we first generalize the eCK model for tripartite AKE protocols, called teCK model, and enhance the security of the new model by adding a new reveal query. In the teCK model, the adversary has stronger powers, and can learn more secret information. Then we present a new tripartite AKE protocol based on the NAXOS protocol, called T-NAXOS protocol, and analyze its security in the teCK model under the random oracle assumption.

•Jan 1, 2010•0 citations

Stronger Security Tripartite Authenticated Key Exchange Protocol

Hai Ping Huang

Currently there are few tripartite Authenticated Key Exchange(AKE) protocols which have a formal security proof.Aiming at this problem,this paper investigates the security model for the tripartite AKE protocols.A strong security model named enhanced CanettiKrawczyk(eCK) model for two-party AKE protocols is proposed.A strong security model for three-party AKE protocols is introduced which generalizes the eCK model for two-party setting,and the insider attack is taken into account.It presents a new tripartite AKE protocol and shows that the protocol is provably secure in the strong security model.

Jisuanji gongcheng•Jan 1, 2010•0 citations

Tightly-Secure Authenticated Key Exchange

Christoph Bader, Dennis Hofheinz, Tibor Jager +2 more

Lecture notes in computer science•Jan 1, 2015•103 citations
Stronger anonymity password authentication key exchange protocols based on traditional cryptography are not resistant to quantum computing attacks, and there is no lattice-only anonymous password authentication key exchange protocol protocol that satisfies the strong anonymity requirement. Therefore, this paper constructs stronger anonymity PAKE protocol based on the ring learning with errors (RLWE) and smooth projective hash function (SPHF) based on ideal lattice. The proposed protocol can achieve stronger anonymity and resists to desynchronization attacks and quantum attack. The security of the protocol is proved under the BPR model. The security and performance analysis shows that the proposed PAKE protocol has better advantages in security and efficiency.
Since Bellare and Rogaway presented the first formal security model for authenticated key exchange (AKE) protocols in 1993, many formal security models have been proposed. The extended Canetti-Krawczyk (eCK) model proposed by LaMacchia et al. is currently regarded as the strongest security model for two-party AKE protocols. In this paper, we first generalize the eCK model for tripartite AKE protocols, called teCK model, and enhance the security of the new model by adding a new reveal query. In the teCK model, the adversary has stronger powers, and can learn more secret information. Then we present a new tripartite AKE protocol based on the NAXOS protocol, called T-NAXOS protocol, and analyze its security in the teCK model under the random oracle assumption.
Currently there are few tripartite Authenticated Key Exchange(AKE) protocols which have a formal security proof.Aiming at this problem,this paper investigates the security model for the tripartite AKE protocols.A strong security model named enhanced CanettiKrawczyk(eCK) model for two-party AKE protocols is proposed.A strong security model for three-party AKE protocols is introduced which generalizes the eCK model for two-party setting,and the insider attack is taken into account.It presents a new tripartite AKE protocol and shows that the protocol is provably secure in the strong security model.