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

Journal of Digital Contents Society

Security Vulnerability Analysis of Corresponding Lattice-Based Cryptography Protocols for User Authentication Against Quantum Attacks

Junghun Lee, Younsung Choi

Published Sep 30, 2024• 0 citations
Publisher
DOI
10.9728/dcs.2024.25.9.2471

Related papers

Lattice-based access authentication scheme for quantum communication networks

Min Wang, Gui‐Lu Long

Science China Information Sciences•Nov 7, 2024•17 citations

QT-PAKE: Secure Messaging via Quantum-Safe Threshold PAKE

Zengpeng Li, Hao Zhu, Guangyu Liao +3 more

Password authentication is a prevalent method of user verification across the Internet, and its use extends to scenarios where resources are limited. However, current password authentication protocols primarily rely on traditional password authenticated key exchange (PAKE) protocols (e.g., SRP, OPAQUE), which are vulnerable to attacks by quantum adversaries. To date, no efficient quantum algorithm has been found to solve the common challenges in lattice-based cryptography. Therefore, quantum-resistant PAKE protocols are generally built upon lattice-based cryptography. In this work, we propose a threshold verifiable oblivious pseudorandom function () protocol based on secret sharing. We then integrate it into a PAKE protocol and present an instantiation of a quantum-safe threshold PAKE protocol () based on the Ring Learning with Errors (RLWE) assumption. This integration gives our PAKE protocol resistance to precomputation attacks, similar to OPAQUE. Furthermore, by incorporating thresholding techniques into the PAKE protocol, we mitigate the risk of single points of failure on the server side. Our protocol not only preserves the security guarantees of traditional PAKE schemes but also resists attacks from quantum adversaries. We also provide a comprehensive security analysis and evaluation of, providing valuable insights for its practical implementation.

IEEE Transactions on Consumer Electronics•Sep 18, 2025•0 citations

A post-quantum authenticated key establishment protocol in healthcare systems

Amir Hossein Salmani, Maryam Rajabzadeh Asaar

Abstract In internet of things (IOT) healthcare systems, sensitive patient information is transmitted over the network to medical professionals. Numerous lightweight authentication protocols have been proposed; however, most of them remain vulnerable to various cyberattacks, allowing attackers to eavesdrop on or manipulate transmitted data. We examine several recently proposed lightweight authentication schemes for healthcare systems. Our security analysis demonstrates that these schemes remain vulnerable to malicious gateway attacks, desynchronization attacks, and key screw attacks. .To address these issues and ensure post- quantum security in healthcare IoT, we propose a post-quantum key establishment protocol based on lattice- based cryptography (LWE). the proposed scheme prevents the gateway from accessing both the secret keys and their parameters, thereby eliminating the possibility of malicious gateway attacks. The proposed protocol ensures user anonymity, forward secrecy, and resistance to impersonation, key screw, and desynchronization attacks.. The proposed protocol ensures secure and efficient establishment of three-round key establishment among entities . Our performance evaluation shows that the proposed scheme achieves lower computation and communication overhead compared to recent related works. The security of the protocol is thoroughly analyzed through informal reasoning, Burrows–Abadi–Needham (BAN) logic, and ProVerif, confirming its robustness and suitability for resource-constrained IoT-based healthcare environments.

•May 28, 2026•0 citations

An Analysis of Lattice-Based Cryptography with Existing Protocols

Atul Chaturvedi, Anand Ballabh Joshi, Sonam Yadav

Algorithms for intelligent systems•Jan 1, 2025•0 citations

Advances in Lattice-Based Cryptography for Post-Quantum Security: Protocols, Benchmarks, and Applications

G. Sunil, B. Girirajan, Manda Sai Anjani

Lecture notes in networks and systems•Jun 29, 2026•0 citations

Fuzzy Extractor and Elliptic Curve Based Efficient User Authentication Protocol for Wireless Sensor Networks and Internet of Things

Anup Kumar Maurya, V. N. Sastry

To improve the quality of service and reduce the possibility of security attacks, a secure and efficient user authentication mechanism is required for Wireless Sensor Networks (WSNs) and the Internet of Things (IoT). Session key establishment between the sensor node and the user is also required for secure communication. In this paper, we perform the security analysis of A.K.Das’s user authentication scheme (given in 2015), Choi et al.’s scheme (given in 2016), and Park et al.’s scheme (given in 2016). The security analysis shows that their schemes are vulnerable to various attacks like user impersonation attack, sensor node impersonation attack and attacks based on legitimate users. Based on the cryptanalysis of these existing protocols, we propose a secure and efficient authenticated session key establishment protocol which ensures various security features and overcomes the drawbacks of existing protocols. The formal and informal security analysis indicates that the proposed protocol withstands the various security vulnerabilities involved in WSNs. The automated validation using AVISPA and Scyther tool ensures the absence of security attacks in our scheme. The logical verification using the Burrows-Abadi-Needham (BAN) logic confirms the correctness of the proposed protocol. Finally, the comparative analysis based on computational overhead and security features of other existing protocol indicate that the proposed user authentication system is secure and efficient. In future, we intend to implement the proposed protocol in real-world applications of WSNs and IoT.

Information•Oct 30, 2017•38 citations
Password authentication is a prevalent method of user verification across the Internet, and its use extends to scenarios where resources are limited. However, current password authentication protocols primarily rely on traditional password authenticated key exchange (PAKE) protocols (e.g., SRP, OPAQUE), which are vulnerable to attacks by quantum adversaries. To date, no efficient quantum algorithm has been found to solve the common challenges in lattice-based cryptography. Therefore, quantum-resistant PAKE protocols are generally built upon lattice-based cryptography. In this work, we propose a threshold verifiable oblivious pseudorandom function () protocol based on secret sharing. We then integrate it into a PAKE protocol and present an instantiation of a quantum-safe threshold PAKE protocol () based on the Ring Learning with Errors (RLWE) assumption. This integration gives our PAKE protocol resistance to precomputation attacks, similar to OPAQUE. Furthermore, by incorporating thresholding techniques into the PAKE protocol, we mitigate the risk of single points of failure on the server side. Our protocol not only preserves the security guarantees of traditional PAKE schemes but also resists attacks from quantum adversaries. We also provide a comprehensive security analysis and evaluation of, providing valuable insights for its practical implementation.
Abstract In internet of things (IOT) healthcare systems, sensitive patient information is transmitted over the network to medical professionals. Numerous lightweight authentication protocols have been proposed; however, most of them remain vulnerable to various cyberattacks, allowing attackers to eavesdrop on or manipulate transmitted data. We examine several recently proposed lightweight authentication schemes for healthcare systems. Our security analysis demonstrates that these schemes remain vulnerable to malicious gateway attacks, desynchronization attacks, and key screw attacks. .To address these issues and ensure post- quantum security in healthcare IoT, we propose a post-quantum key establishment protocol based on lattice- based cryptography (LWE). the proposed scheme prevents the gateway from accessing both the secret keys and their parameters, thereby eliminating the possibility of malicious gateway attacks. The proposed protocol ensures user anonymity, forward secrecy, and resistance to impersonation, key screw, and desynchronization attacks.. The proposed protocol ensures secure and efficient establishment of three-round key establishment among entities . Our performance evaluation shows that the proposed scheme achieves lower computation and communication overhead compared to recent related works. The security of the protocol is thoroughly analyzed through informal reasoning, Burrows–Abadi–Needham (BAN) logic, and ProVerif, confirming its robustness and suitability for resource-constrained IoT-based healthcare environments.
To improve the quality of service and reduce the possibility of security attacks, a secure and efficient user authentication mechanism is required for Wireless Sensor Networks (WSNs) and the Internet of Things (IoT). Session key establishment between the sensor node and the user is also required for secure communication. In this paper, we perform the security analysis of A.K.Das’s user authentication scheme (given in 2015), Choi et al.’s scheme (given in 2016), and Park et al.’s scheme (given in 2016). The security analysis shows that their schemes are vulnerable to various attacks like user impersonation attack, sensor node impersonation attack and attacks based on legitimate users. Based on the cryptanalysis of these existing protocols, we propose a secure and efficient authenticated session key establishment protocol which ensures various security features and overcomes the drawbacks of existing protocols. The formal and informal security analysis indicates that the proposed protocol withstands the various security vulnerabilities involved in WSNs. The automated validation using AVISPA and Scyther tool ensures the absence of security attacks in our scheme. The logical verification using the Burrows-Abadi-Needham (BAN) logic confirms the correctness of the proposed protocol. Finally, the comparative analysis based on computational overhead and security features of other existing protocol indicate that the proposed user authentication system is secure and efficient. In future, we intend to implement the proposed protocol in real-world applications of WSNs and IoT.