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

Symmetry

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

Songhui Guo, Yun Song, Song Guo, Yeming Yang, Shuaichao Song

Published Sep 13, 2023• 13 citations
Publisher

Abstract

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.

DOI
10.3390/sym15091750

Related papers

A Quantum-Resistant Authenticated Key Exchange Protocol Based on RLWE and Error Reconciliation Mechanism

Wentao Li, Yu Zhou, Jie Chen +3 more

The rapid development of quantum computers poses a significant threat to the majority of current authenticated key exchang protocols, designed on the hardness of large integer factorization and discrete logarithm problems. Therefore, it is imperative to develop secure and efficient quantum-resistant authenticated key exchang protocols. This paper designs a new public-key cryptographic scheme for identity authentication based on Ring Learning With Errors (RLWE) problem and error reconciliation mechanism. Based on the scheme, we further design a quantum-resistant authenticated key exchange protocol (AKE). This protocol is provably secure under the standard eCK model and achieves forward secrecy. Compared with other classic key exchange protocols based on the RLWE problem, our protocol shows comprehensive advantages in terms of security, computational complexity, and communication complexity.

International Conference on Cloud Computing and Big Data Analytics (ICCCBDA)•Apr 24, 2025•1 citation

Anonymous Password-Authenticated Key Exchange Protocol Based on Lattice

Yun Song, Songhui Guo, Ruiyang Ding

As the security of password authenticated key exchange protocols based on traditional public key cryptosystems is threatened by quantum computing, the research on password authenticated key exchange protocols that can resist quantum computing attacks has become a hot spot of current research. At present, the anonymity of anonymous PAKE protocol is generally linkable, and cannot completely protect the user’s identity privacy information. This paper proposes a two-party password authenticated key exchange protocol with anonymity based on SPHF from ideal lattice, and gives a strict security proofunder the BPR model. The security and performance analysis proves that the proposed protocol has good advantages in communication costs and security.

International Conference on Big Data, Information and Computer Network (BDICN)•Jan 1, 2023•5 citations

Efficient module learning with errors‐based post‐quantum password‐authenticated key exchange

Peixin Ren, Xiaozhuo Gu, Ziliang Wang

Abstract Password‐authenticated key exchange ( PAKE ) is a cryptographic primitive that can establish secure remote communications between the client and the server, especially with the advantage of amplifying memorable passwords into strong session keys. However, the arrival of the quantum computing era has brought new challenges to traditional PAKE protocols. Thus, designing an efficient post‐quantum PAKE scheme becomes an open research question. In this paper, the authors construct a quantum‐safe PAKE protocol, which is a horizontal extension of the password‐authenticated key (PAK) protocol in the field of module lattices. Subsequently, the authors accompany the proposed protocol with a rigorous security proof in the random oracle model with two adaptions: applying the CDF‐Zipf model to characterise the ability of the adversary and using the pairing with errors assumption to simplify the proof. Taking the flexibility of the module learning with errors ( MLWE ) problem, the authors elaborately select three parameter sets to meet different application scenarios. Specifically, the authors’ Recommended‐PAKE implementation achieves 177‐bit post‐quantum security with a generous margin to cope with later improvement in cryptanalysis. The performance results indicate that the authors’ MLWE‐PAKE is quite practical: compared with the latest Yang‐PAK , the authors’ Recommended‐PAK reduces the communication cost and the running time by 36.8% and 13.8%, respectively.

IET Information Security•Sep 20, 2022•18 citations

Quantum Safe Construction of Authentication and Key Exchange Based on Module Lattices

Sayan Banerjee, M Nikhilesh, Ankit Sharma +3 more

An authenticated mobile key exchange is necessary for post quantum secure communication over a public channel. It allows two entities to create a secure and unique session key for every communication session. We feel a need to design two party efficient and secure authenticated key agreement. We have also observed all the protocols given above are based on learning with error assumption over a finite ring. The ”Module Learning with Errors” assumption is the more appropriate choice among ”Learning with Errors” and ”Ring Learning with Errors” for designing practical password-authenticated key exchange protocols. With the help of ”Module Learning with Errors” assumption, and by lowering the number of ring polynomials, several implementations of the protocols can be realized. Therefore, this paper contains quantum safe, efficient, and practical ”Module Learning with Errors” assumption based authenticated key agreement protocol. The protocol’s security analysis is presented within the framework of the random oracle model.

IEEE Global Conference for Advancement in Technology (GCAT)•Oct 6, 2023•3 citations

A Construction of Three Party Post Quantum Secure Authenticated Key Exchange Using Ring Learning With Errors and ECC Cryptography

Dharminder Chaudhary, Uddeshaya Kumar, Kashif Saleem

A three-party authenticated key exchange protocol enables two entities to agree on a session key with the help of a dedicated server over public channel. Shor’s algorithm is a big threat for existing authenticated key exchange protocols. Lattice based cryptography plays a very important role in designing authentication and key agreement secure against the threat of quantum attacks. However, it is not easy job to design quantum resistant password based three party protocol due to the high demand for security requirements and the limited resources nature of mobile devices. In this article, we have proposed a new post quantum three party key exchange based on ring learning with errors assumption. This protocol is motivated from Islam et al.’s authenticated key exchange protocol. Their protocol is not secure against stolen smartcard attack, password guessing attack, and can’t provide user anonymity. The anonymous communication is a big requirement for practical applications like e-healthcare services/smart vehicular communication. This paper also contains the performance analysis of the proposed protocol along with other relevant protocols.

IEEE Access•Jan 1, 2023•40 citations

A Secure Remote Password Protocol From The Learning With Errors Problem

Huapeng Li, Baocheng Wang

Secure Remote Password (SRP) protocol is an essential password-authenticated key exchange (PAKE) protocol based on the discrete logarithm problem (DLP). The protocol is specifically designed to obtain a session key and it has been widely used in various scenarios due to its attractive security features. In the SRP protocol, the server is not required to save any data directly associated with passwords. And this makes attackers who manage to corrupt the server fail to impersonate the client unless performing a brute-force search for the password. However, the development of quantum computing has potentially made classic DLP-based public-key cryptography schemes not secure, including the SRP protocol. So it is significant to design a quantum-resistant SRP protocol. In this paper, based on the original scheme, we propose a post-quantum SRP protocol from the learning with errors (LWE) problem. And we give rigorous proof and analyses on the correctness and security of the scheme. Besides being resistant to known quantum attacks, it maintains the various secure qualities of the original protocol.

arXiv:2501.07208•IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)•Dec 1, 2022•0 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.
The rapid development of quantum computers poses a significant threat to the majority of current authenticated key exchang protocols, designed on the hardness of large integer factorization and discrete logarithm problems. Therefore, it is imperative to develop secure and efficient quantum-resistant authenticated key exchang protocols. This paper designs a new public-key cryptographic scheme for identity authentication based on Ring Learning With Errors (RLWE) problem and error reconciliation mechanism. Based on the scheme, we further design a quantum-resistant authenticated key exchange protocol (AKE). This protocol is provably secure under the standard eCK model and achieves forward secrecy. Compared with other classic key exchange protocols based on the RLWE problem, our protocol shows comprehensive advantages in terms of security, computational complexity, and communication complexity.
As the security of password authenticated key exchange protocols based on traditional public key cryptosystems is threatened by quantum computing, the research on password authenticated key exchange protocols that can resist quantum computing attacks has become a hot spot of current research. At present, the anonymity of anonymous PAKE protocol is generally linkable, and cannot completely protect the user’s identity privacy information. This paper proposes a two-party password authenticated key exchange protocol with anonymity based on SPHF from ideal lattice, and gives a strict security proofunder the BPR model. The security and performance analysis proves that the proposed protocol has good advantages in communication costs and security.
Abstract Password‐authenticated key exchange ( PAKE ) is a cryptographic primitive that can establish secure remote communications between the client and the server, especially with the advantage of amplifying memorable passwords into strong session keys. However, the arrival of the quantum computing era has brought new challenges to traditional PAKE protocols. Thus, designing an efficient post‐quantum PAKE scheme becomes an open research question. In this paper, the authors construct a quantum‐safe PAKE protocol, which is a horizontal extension of the password‐authenticated key (PAK) protocol in the field of module lattices. Subsequently, the authors accompany the proposed protocol with a rigorous security proof in the random oracle model with two adaptions: applying the CDF‐Zipf model to characterise the ability of the adversary and using the pairing with errors assumption to simplify the proof. Taking the flexibility of the module learning with errors ( MLWE ) problem, the authors elaborately select three parameter sets to meet different application scenarios. Specifically, the authors’ Recommended‐PAKE implementation achieves 177‐bit post‐quantum security with a generous margin to cope with later improvement in cryptanalysis. The performance results indicate that the authors’ MLWE‐PAKE is quite practical: compared with the latest Yang‐PAK , the authors’ Recommended‐PAK reduces the communication cost and the running time by 36.8% and 13.8%, respectively.
An authenticated mobile key exchange is necessary for post quantum secure communication over a public channel. It allows two entities to create a secure and unique session key for every communication session. We feel a need to design two party efficient and secure authenticated key agreement. We have also observed all the protocols given above are based on learning with error assumption over a finite ring. The ”Module Learning with Errors” assumption is the more appropriate choice among ”Learning with Errors” and ”Ring Learning with Errors” for designing practical password-authenticated key exchange protocols. With the help of ”Module Learning with Errors” assumption, and by lowering the number of ring polynomials, several implementations of the protocols can be realized. Therefore, this paper contains quantum safe, efficient, and practical ”Module Learning with Errors” assumption based authenticated key agreement protocol. The protocol’s security analysis is presented within the framework of the random oracle model.
A three-party authenticated key exchange protocol enables two entities to agree on a session key with the help of a dedicated server over public channel. Shor’s algorithm is a big threat for existing authenticated key exchange protocols. Lattice based cryptography plays a very important role in designing authentication and key agreement secure against the threat of quantum attacks. However, it is not easy job to design quantum resistant password based three party protocol due to the high demand for security requirements and the limited resources nature of mobile devices. In this article, we have proposed a new post quantum three party key exchange based on ring learning with errors assumption. This protocol is motivated from Islam et al.’s authenticated key exchange protocol. Their protocol is not secure against stolen smartcard attack, password guessing attack, and can’t provide user anonymity. The anonymous communication is a big requirement for practical applications like e-healthcare services/smart vehicular communication. This paper also contains the performance analysis of the proposed protocol along with other relevant protocols.
Secure Remote Password (SRP) protocol is an essential password-authenticated key exchange (PAKE) protocol based on the discrete logarithm problem (DLP). The protocol is specifically designed to obtain a session key and it has been widely used in various scenarios due to its attractive security features. In the SRP protocol, the server is not required to save any data directly associated with passwords. And this makes attackers who manage to corrupt the server fail to impersonate the client unless performing a brute-force search for the password. However, the development of quantum computing has potentially made classic DLP-based public-key cryptography schemes not secure, including the SRP protocol. So it is significant to design a quantum-resistant SRP protocol. In this paper, based on the original scheme, we propose a post-quantum SRP protocol from the learning with errors (LWE) problem. And we give rigorous proof and analyses on the correctness and security of the scheme. Besides being resistant to known quantum attacks, it maintains the various secure qualities of the original protocol.