We propose a novel quantum-resistant mutual authentication scheme for radio-frequency identification (RFID) systems. Our scheme uses lattice-based cryptography and, in particular, achieves quantum-resistance by leveraging the hardness of the inhomogeneous short integer solution (ISIS) problem. In contrast to prior work, which assumes that the reader-server communication channel is secure, our scheme is secure even when both the reader-server and tag-reader communication channels are insecure. Our proposed protocol provides robust security against man-in-the-middle (MITM), replay, impersonation, and reflection attacks, while also ensuring unforgeability and preserving anonymity. We present a detailed security analysis, including semi-formal analysis and formal verification using the Automated Validation of Internet Security Protocols and Applications (AVISPA) tool. In addition, we analyze the storage, computation, and communication costs of the proposed protocol and compare its security properties with those of existing protocols, demonstrating that our scheme offers strong security guarantees. To the best of our knowledge, this paper is the first quantum-resistant authentication protocol for RFID systems that comprehensively addresses the insecurity of both the reader-server and tag-reader communication channels.
We propose a novel quantum-resistant mutual authentication scheme for radio-frequency identification (RFID) systems. Our scheme uses lattice-based cryptography and, in particular, achieves quantum-resistance by leveraging the hardness of the inhomogeneous short integer solution (ISIS) problem. In contrast to prior work, which assumes that the reader-server communication channel is secure, our scheme is secure even when both the reader-server and tag-reader communication channels are insecure. Our proposed protocol provides robust security against man-in-the-middle (MITM), replay, impersonation, and reflection attacks, while also ensuring unforgeability and preserving anonymity. We present a detailed security analysis, including semi-formal analysis and formal verification using the Automated Validation of Internet Security Protocols and Applications (AVISPA) tool. In addition, we analyze the storage, computation, and communication costs of the proposed protocol and compare its security properties with those of existing protocols, demonstrating that our scheme offers strong security guarantees. To the best of our knowledge, this paper is the first quantum-resistant authentication protocol for RFID systems that comprehensively addresses the insecurity of both the reader-server and tag-reader communication channels.
Radio Frequency Identification (RFID) systems represent a key technology for ubiquitous computing and for the deployment of the Internet of Things (IoT). In RFID technology, authentication protocols are often necessary in order to confirm the identity of the parties involved (i.e. RFID readers, RFID tags and/or database servers). In this article, we analyze the security of a mutual authentication protocol proposed by Wang and Ma. Our security analysis clearly shows major security pitfalls in this protocol. Firstly, we show two approaches that an adversary may use to mislead an honest reader into thinking that it is communicating with a legitimate database. Secondly, we show how an adversary that has compromised some tags can impersonate an RFID reader to a legitimate database. Furthermore, we present a new adversary model, which pays heed on cases missed by previous proposals. In contrast to previous models where the communication between an RFID reader and a back-end server is through a secure channel, our model facilitates the security analysis of more general schemes where this communication channel (RFID reader-to-server) is insecure. This model determines whether the compromise of RFID tags has any impact on the security of the reader-to-server communication or vice versa. In a secure protocol, the possible compromise of RFID tags should not affect the RFID reader-server communication. In this paper, we show that compromising of RFID tags in Wang and Ma protocol has a direct impact on the reader-server security. Finally, we propose a new authentication protocol that offers an adequate security level and is resistant against the mentioned security risks. The security proofs of the proposed protocol are supported with Gong-Needham-Yahalom (GNY) logic and Scyther tool, which are formal methods to evaluate the security of a cryptographic protocol.
Radio Frequency Identification (RFID) is a prominent technology within the Internet of Things (IoT) ecosystem, offering efficient and reliable object identification in various domains, including business, healthcare, and manufacturing. The security of RFID systems is of paramount importance, and recent authentication protocols have been developed to address these security concerns. In this survey paper, we explore and evaluate the latest authentication protocols designed to enhance security in RFID communications, primarily concentrating on the interaction between RFID readers and tags. We critically assess contemporary lightweight RFID authentication protocols, considering aspects such as security requirements, computational efficiency, and resilience against potential attacks. However, with the advent of quantum computing, these protocols are under scrutiny for their vulnerability. As a result, we emphasize the need for researchers to shift their focus toward post-quantum cryptography solutions to bolster the security of RFID systems. This paper serves as a comprehensive overview of recent developments in RFID authentication, shedding light on the pressing need for quantum-resistant security measures in this field.
As a non-contact identification technology, RFID (Radio Frequency Identification) is widely used in various Internet of Things applications. However, RFID systems are highly vulnerable to diverse attacks due to the openness of communication links between readers and tags, leading to serious security and privacy concerns. Numerous RFID authentication protocols have been designed that employ hash functions and symmetric cryptography to secure communications. Despite these efforts, such schemes generally exhibit limitations in key management flexibility and scalability, which significantly restricts their applicability in large-scale RFID deployments. Confronted with this challenge, public key cryptography offers an effective solution. Taking into account factors such as parameter size, computational complexity, and resistance to quantum attacks, the NTRU algorithm emerges as one of the most promising choices. Since the NTRU signature algorithm is highly complex and requires large parameters, there are currently only a few NTRU encryption-based RFID authentication protocols available, all of which exhibit significant security flaws-such as supporting only one-way authentication, failing to address public key distribution, and so on. Moreover, performance evaluations of the algorithm in these contexts are often incomplete. This paper proposes a mutual authentication protocol for RFID based on the NTRU encryption algorithm to address security and privacy issues. The security of the protocol is analyzed using the BAN-logic tools and some non-formalized methods, and it is further validated through simulation with the AVISPA tool. With the parameter set (N, p, q) = (443, 3, 2048), the NTRU algorithm can provide 128 bits of post-quantum security strength. This configuration not only demonstrates greater foresight at the theoretical security level but also offers significant advantages in practical energy consumption and computation time when compared to traditional algorithms such as ECC, making it a highly competitive candidate in the field of post-quantum cryptography.
In 2006, Lee and Ahn proposed a matrix-based RFID authentication protocol which eliminates the security problems in HB and RFID authentication protocols. Their proposed protocol provides the following three merits: (1) it reduces the computational costs of the RFID tag. (2) it reduces the communication overhead between the reader and the tag. (3) it protects the user privacy. However, this paper points out that Lee and Ahn's proposed protocol is insecure to various attacks because it does not provide mutual authentication which the RFID tag does not authenticate the legality of the RFID reader unlike their claims. In addition, this paper proposes an improved matrix-based RFID mutual authentication protocol that can provide the mutual authentication. As a result, the proposed protocol not only can provide strong security and but also guarantee high efficiency because it reduces the communication rounds compare with Lee-Ahn's protocol.
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.
The proliferation of Unmanned Aerial Vehicle (UAV) networks and their numerous benefits in critical scenarios, UAV become crucial for Internet of Drones (IoD) operations. However, due to their communication methods, such as the micro-air-vehicle communication (MAVlink) protocol, wireless connections, and potentially insecure Internet channels, UAV networks are highly vulnerable to potentially lethal attacks. To overcome such issues, public key cryptographic techniques relying on integer factorization problem (IFP) and discrete logarithm problems (DLP) have been used form decades. However, with the significant advancements in quantum computing and adaptation of Shor's algorithm such cryptographic techniques based on IFP and DLP become insecure today and vulnerable to quantum attacks, which demand new ways of thinking about security. In this paper, we propose a quantum-secure access control protocol for UAV-based IoD applications, and its primary focus is on preserving user anonymity. A comprehensive security analysis validates the accuracy, security, and resilience against various active and passive attacks in both classical and quantum scenarios. A thorough formal security verification using the Scyther automated software validation tool to showcases the robustness of the proposed scheme. Furthermore, a real-time testbed experiment on Raspberry Pi 4 devices to assess the computational overhead of various cryptographic primitives demonstrates its practicality. Lastly, a detailed comparative performance evaluation, including authentication accuracy, performance under unknown attacks with existing related schemes illustrates its scalability and efficiency in real-world applications.