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

J. Inf. Hiding Multim. Signal Process.

Provably Secure and Password-Authenticated Quantum Key Agreement Protocol with Dynamic Basis.

Tianhua Liu, Yanlin Meng, Hongfeng Zhu

Published Jan 1, 2018• 0 citations
OpenAlex

Related papers

Provably Secure and Distributed Authenticated Quantum Key Agreement Protocol with User-Privacy using Dynamic Basis.

Hongfeng Zhu, Zixi Wang

J. Inf. Hiding Multim. Signal Process.•Jan 1, 2018•0 citations

Provably Secure and Password-Authenticated Hybrid Key Agreement Protocol in Two-realm with Privacy-Protection.

Dan Zhu, Hongfeng Zhu, Shuai Geng +1 more

J. Inf. Hiding Multim. Signal Process.•Jan 1, 2018•0 citations

Provably secure two-party authenticated key agreement protocol for post-quantum environments

SK Hafizul Islam

Journal of Information Security and Applications•Feb 23, 2020•47 citations

Provable Secure ID-Based Authenticated Key Agreement Protocol

Haiying Gao

Journal of Computer Research and Development•Aug 15, 2012•2 citations

Provably secure anonymous authenticated key agreement protocols with enhanced security models

Xie Qing, Tan X, Hu B +4 more

Science•Jan 1, 2018•4 citations

Three-Party Password Authentication and Key Exchange Protocol Based on MLWE

Songhui Guo, Yun Song, Song Guo +2 more

With the rapid development of quantum theory, the discrete logarithm problem and significant integer factorization problem have polynomial solution algorithms under quantum computing, and their security is seriously threatened. Therefore, a three-party password-authenticated key agreement scheme based on module learning with errors problem was proposed, and its security was proved in the BPR model. Compared with other password-authenticated key agreement protocols, the proposed protocol has higher efficiency and a shorter key length, which can resist quantum attacks. Therefore, the protocol is efficient and secure and suitable for large-scale network communication.

Symmetry•Sep 13, 2023•13 citations
With the rapid development of quantum theory, the discrete logarithm problem and significant integer factorization problem have polynomial solution algorithms under quantum computing, and their security is seriously threatened. Therefore, a three-party password-authenticated key agreement scheme based on module learning with errors problem was proposed, and its security was proved in the BPR model. Compared with other password-authenticated key agreement protocols, the proposed protocol has higher efficiency and a shorter key length, which can resist quantum attacks. Therefore, the protocol is efficient and secure and suitable for large-scale network communication.