Affiliation:
1. Third Academic, PLA Information Engineering University, Zhengzhou 450001, China
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.
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Reference35 articles.
1. Shor, P.W. (1994, January 20–22). Algorithms for quantum computation: Discrete logarithms and factoring. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA.
2. An Efficient Protocol for Authenticated Key Agreement;Law;Des. Codes Cryptogr.,2003
3. Abdalla, M., Fouque, P.A., and Pointcheval, D. (2005, January 23–26). Password-Based Authenticated Key Exchange in the Three-Party Setting. Proceedings of the International Conference on Theory & Practice in Public Key Cryptography, Les Diablerets, Switzerland.
4. Dongna, E., Cheng, Q., and Ma, C. (2009, January 11–13). Password authenticated key exchange based on RSA in the three-party settings. Proceedings of the Provable Security: Third International Conference, ProvSec 2009, Guangzhou, China. Proceedings 3.
5. Three-party encrypted key exchange: Attacks and a solution;Lin;ACM SIGOPS Oper. Syst. Rev.,2000