With the rapid development of quantum computers, post-quantum cryptography (PQC) has become critical technology in the security field. PQC includes cryptographic techniques that are secure against quantum-computer-based attacks, utilizing methods such as code-based, isogeny-based, and lattice-based approaches. Among these, lattice-based cryptography is the most extensively studied due to its ease of implementation and efficiency. As quantum computing advances, the need for secure communication protocols that can withstand quantum computer-based threats becomes increasingly important. Traditional two-party AKE protocols have a significant limitation: the security of the entire system can be compromised if either of the communicating parties behaves maliciously. To overcome this limitation, researchers have proposed three-party AKE protocols, where a third party acts as an arbiter or verifier. However, we found that a recently proposed three-party AKE protocol is vulnerable to quantum-computer-based attacks. To address this issue, we propose a provably quantum secure three-party AKE protocol based on MLWE. The proposed scheme leverages the user’s biometric information and the server’s master key to prevent the exposure of critical parameters. We analyzed the security of the protocol using simulation tools such as the Burrows–Abadi–Needham (BAN) logic, Real-or-Random (RoR) model, and Automated Validation of Internet Security Protocols and Applications (AVISPA). Furthermore, comparative analysis with similar protocols demonstrates that our protocol is efficient and suitable.
With the rapid development of quantum computers, post-quantum cryptography (PQC) has become critical technology in the security field. PQC includes cryptographic techniques that are secure against quantum-computer-based attacks, utilizing methods such as code-based, isogeny-based, and lattice-based approaches. Among these, lattice-based cryptography is the most extensively studied due to its ease of implementation and efficiency. As quantum computing advances, the need for secure communication protocols that can withstand quantum computer-based threats becomes increasingly important. Traditional two-party AKE protocols have a significant limitation: the security of the entire system can be compromised if either of the communicating parties behaves maliciously. To overcome this limitation, researchers have proposed three-party AKE protocols, where a third party acts as an arbiter or verifier. However, we found that a recently proposed three-party AKE protocol is vulnerable to quantum-computer-based attacks. To address this issue, we propose a provably quantum secure three-party AKE protocol based on MLWE. The proposed scheme leverages the user’s biometric information and the server’s master key to prevent the exposure of critical parameters. We analyzed the security of the protocol using simulation tools such as the Burrows–Abadi–Needham (BAN) logic, Real-or-Random (RoR) model, and Automated Validation of Internet Security Protocols and Applications (AVISPA). Furthermore, comparative analysis with similar protocols demonstrates that our protocol is efficient and suitable.
Edge computing has emerged as a distributed computing technology to mitigate the cloud computing overload caused by the rapid increase in connected devices. However, because communications between devices and edge servers are conducted over public channels, authentication and secure session key establishment are imperative to protect against various security attacks. In this paper, we show that Kenioua et al.’s authentication scheme for edge computing is vulnerable to several attacks such as impersonation, offline password guessing, and stolen verifier attacks, and also lacking quantum resistance against the emerging threat posed by quantum computing. To overcome these limitations, we propose a quantum-resistant authentication scheme by adopting module lattice-based key encapsulation mechanism (ML-KEM). We demonstrate the robustness of the proposed scheme through “the Burrows–Abadi–Needham (BAN) logic”, “Quantum Random Oracle Model (QROM)”, “Automated Validation of Internet Security Protocols and Application (AVISPA) tool”, and “Scyther tool”, and show that the proposed scheme achieves security with efficient communication and computation costs by comparing it with related studies.
Objective: To design a secure and efficient three-party post-quantum authenticated key agreement (AKE) protocol that ensures mutual authentication, user anonymity, and forward secrecy, while resisting both classical and quantum adversaries. Methods: The proposed protocol is constructed using the Ring Learning with Errors (Ring-LWE) assumption, which is widely regarded as quantum-resistant. The scheme enables two users to establish a shared session key through a trusted server over an insecure channel. Cryptographic hash functions, lattice-based operations, and masking techniques are employed to achieve authentication, anonymity, and key confidentiality. Formal correctness proofs, informal security analysis, and comparative performance evaluations are conducted to validate the protocol. Findings: The study describes qualitative benefits like "outperforms current protocols" but lacks specific metrics, such as exact computation costs (e.g., 4913 ns total execution) or communication rounds, and "reduces user-side cost to 2438 ns vs. 5395 ns in Islam et al.". Also, substantially more efficient than pairing- or chaotic-map-based protocols, which incur costs exceeding 12000 ns. Communication overhead is reduced by limiting the exchange to two RLWE-based messages and one server response, avoiding expensive bilinear pairing or biometric hash transmissions. These results demonstrate that the proposed scheme provides stronger security guarantees at a lower computational and communication cost, making it suitable for resource-constrained mobile and IoT environments. Novelty: Unlike existing approaches, the proposed protocol simultaneously guarantees user anonymity, forward secrecy, and quantum resistance in a three-party setting based on Ring-LWE. It overcomes known vulnerabilities in prior schemes and achieves improved efficiency without compromising security, making it a practical and robust solution for post-quantum secure communications. Keywords: Key Establishment, Authentication, Ring Learning with Errors, Anonymous Key Exchange, Post Quantum Forward Secrecy
In this paper, we have proposed a two-party authenticated key establishment (AKE), and authenticated key transport protocols based on lattice-based cryptography, aiming to provide security against quantum attacks for secure communication. This protocol enables two parties, who may share long-term public keys, to securely establish a shared session key, and transportation of the session key from the server while achieving mutual authentication. Our construction leverages the hardness of lattice problems Ring Learning With Errors (Ring-LWE), ensuring robustness against quantum and classical adversaries. Unlike traditional schemes whose security depends upon number-theoretic assumptions being vulnerable to quantum attacks, our protocol ensures security in the post-quantum era. The proposed protocol ensures forward secrecy, and provides security even if the long-term key is compromised. This protocol also provides essential property key freshness and resistance against man-in-the-middle attacks, impersonation attacks, replay attacks, and key mismatch attacks. On the other hand, the proposed key transport protocol provides essential property key freshness, anonymity, and resistance against man-in-the-middle attacks, impersonation attacks, replay attacks, and key mismatch attacks. A two-party key transport protocol is a cryptographic protocol in which one party (typically a trusted key distribution center or sender) securely generates and sends a session key to another party. Unlike key exchange protocols (where both parties contribute to key generation), key transport protocols rely on one party to generate the key and deliver it securely. The protocol possesses a minimum number of exchanged messages and can reduce the number of communication rounds to help minimize the communication overhead.
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.
The integration of unmanned aerial vehicles (UAVs) into vehicular ad hoc networks (VANETs) has emerged as a promising solution to overcome the limited coverage of conventional roadside unit (RSU)-based infrastructures. However, UAVs operate in open environments and cannot be fully trusted, while the rapid advancement of quantum computing threatens the long-term security of classical public-key cryptographic systems. As a result, many existing UAV-based VANET authentication schemes face fundamental limitations in future deployments. Most existing schemes either lack post-quantum security or incur excessive computational and communication overhead, making them unsuitable for real-time and high-mobility vehicular environments. In addition, the common assumptions of trusted UAVs do not align with realistic threat models. To address these issues, this paper proposes a lightweight post-quantum authentication and key exchange protocol based on the module learning with errors (MLWE) problem and physically unclonable functions (PUFs). The proposed scheme treats UAVs as untrusted relay nodes and excludes them from session key generation. Its security is evaluated using informal analysis, the real-or-random (RoR) model, BAN logic, and AVISPA, while performance evaluation indicates improved efficiency compared to existing schemes.
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.