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

Strongly Secure Authenticated Key Exchange from Ideal Lattices.

Xiaopeng Yang, Wenping Ma

Published Jan 1, 2015• 1 citation
OpenAlex

Related papers

Strongly secure authenticated key exchange from factoring, codes, and lattices

Atsushi Fujioka, Koutarou Suzuki, Keita Xagawa +1 more

Designs Codes and Cryptography•Apr 22, 2014•46 citations

Strongly Secure Authenticated Key Exchange from Factoring, Codes, and Lattices

Atsushi Fujioka, Koutarou Suzuki, Keita Xagawa +1 more

Lecture notes in computer science•Jan 1, 2012•93 citations

Authenticated Key Exchange from Ideal Lattices

Jiang Zhang, Zhenfeng Zhang, Jíntai Ding +2 more

Lecture notes in computer science•Jan 1, 2015•184 citations

Two-Message Key Exchange with Strong Security from Ideal Lattices

Zheng Yang, Yu Chen, Song Luo

Lecture notes in computer science•Jan 1, 2018•6 citations

Lattice-Based Authenticated Key Exchange with Tight Security

Jiaxin Pan, Benedikt Wagner, Runzhi Zeng

Lecture notes in computer science•Jan 1, 2023•15 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
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.