Authentication Protocol For RFID Systems Research Articles

MDS Code Based Ultralightweight Authentication Protocol for RFID System

Privacy and security are central issues in the deployment of an RFID system. It is vulnerable to several attacks, such as replay attacks, location tracking, man-in-middle attack, de-synchronization attack, etc., due to the inherent weaknesses of underlying wireless communications. In order to tackle these privacy and security concerns, this paper presents an ultralightweight authentication protocol based on group homomorphism and maximum distance separable (MDS) code. We use group homomorphism properties to make a server lookup table that reduces searching complexity and overcomes scalability issues. We develop an ultralightweight protocol using MDS code properties that employs only bit-wise operators. Formal and informal security analysis of the proposed protocol shows that our proposed protocol resists various attacks. In addition, we use automated security protocol verification tools, AVISPA and Scyther, to validate the security features of the proposed protocol. We demonstrate the correctness proof of the proposed protocol using BAN logic. To measure the level of privacy of the proposed protocol, we use two benchmark metrics to simulate the proposed protocol. The performance analysis indicates that the proposed protocol is efficient for a low-cost environment.

Quadratic residue-based unilateral authentication protocol for RFID system

Quadratic residue-based unilateral authentication protocol for RFID system

Rank-metric code-based mutual authentication protocol for RFID

This paper presents the first mutual authentication protocol for RFID systems based on hard problems from rank metric codes, and we discuss its security in the post quantum scenario. Furthermore, our protocol uses two improvements. The first one consists in using double circulant low rank parity check codes and permits to reduce communication costs and to get smaller key size than previous code-based protocols. The second one consists in using a hash function to get the full inside secrecy property. Moreover, our protocol saves at least 42% in terms of communication data compared to the most recent code-based authentication protocols for RFID systems.

Tracking and impersonating tags in a CRC-based ultralightweight RFID authentication protocol

Design of ultralightweight authentication protocols for RFID systems conformed with the EPC Class-1 Generation-2 standard is still a challenging issue in RFID security. Recently, Maurya et al. proposed a CRC-based authentication protocol and claimed that their protocol resists against all attacks known in RFID systems. However, in this paper, we criticize employment of CRC function as a security primitive for authentication protocols by proposing two serious attacks against Maurya et al.’s protocol. These two effective and low-complexity attacks include a tag impersonation attack and a tag traceability attack. Our attacks use the linearity of the CRC function employed in this protocol. Our analyses show that the success probability of our attacks is “1” while the complexity is only one session eavesdropping, two XORs and one CRC computation. Moreover, we verify correctness of our attacks by simulating them.

Secure and Privacy-Preserving RFID Authentication Scheme for Internet of Things Applications

Privacy issue has become a crucial concern in internet of things (IoT) applications ranging from home appliances to vehicular networks. RFID system has found enormous scope in IoT applications such as consumer electronics, healthcare, tracking objects and transport system. In this paper, we present a privacy preserving authentication protocol for RFID system. The protocol provides mutual authentication of tag and reader, and preserves privacy of tags. We analyze the proposed protocol against active adversary and show that the protocol preserves narrow-strong privacy of the tags. We compare our protocol with the related work and show its usefulness in wide range of IoT applications.

Cyclic group based mutual authentication protocol for RFID system

Widespread deployment of RFID system arises security and privacy concerns of users. There are several proposals in the literature to avoid these concerns, but most of them provide reasonable privacy at the cost of search complexity on the server side. The search complexity increases linearly with the number of tags in the system. Some schemes use a group based approach to solve the search complexity problem. In this paper, we proposed a group based authentication protocol for RFID system which is based on some characteristics of cyclic groups. The scheme uses only bitwise XOR, circular left shift ($$\ll$$) and modulo operations for the computational work. Also, the scheme does not use any pseudo-random number generator on the tag side. We use two benchmark metric based on anonymity set to measure the privacy level of the system when some tags are compromised by an adversary. We present some simulation results which show that the scheme preserves the high level of privacy and discloses very less amount of information when some tags are compromised. Furthermore, its formal and informal analysis show that our scheme preserves information privacy as well as un-traceability and also withstand various well-known attacks.

A Secure PUF-Based Unilateral Authentication Scheme for RFID System

Privacy and security concerns are significant barrier for RFID deployment in many applications in modern day world. The implementation of authentication schemes which provide reasonable security under the resource constraints of tiny-powered RFID tags are an efficient way to avoid these concerns. In this paper, we present physical unclonable function based unilateral authentication protocol for RFID system. In addition, we use error-correcting code properties to enhance security of the proposed scheme. Use of error-correcting code also reduces computational cost of the proposed scheme drastically. Security and privacy analysis indicates that the proposed scheme resists various attacks. Cost analysis shows that the scheme outshines the existing protocols in terms of storage requirement, computational operations, and communication cost.

Providing destructive privacy and scalability in RFID systems using PUFs

Internet of Things (IoT) emerges as a global network in which any things (including humans and the real world things) having unique identifier can communicate each other. The RFID system has very important role in the IoT system for solving the identification issues of things cost-effectively. However, RFID systems have serious security and privacy issues. In the literature, there are many proposals that aim to solve to security and privacy issues of RFID systems. The common drawback of these solution is scalability because they generally require a linear search on the back-end database in order to identify a tag. Some proposals use tree structures to store the keys. They reduce the search complexity from O(n) to O(log n). However, these protocols are susceptible to compromising attack in which an adversary compromising one tag can reveal the secrets of other tags. That means tree-based protocols can provide only a weak level of privacy. In this paper, we propose a scalable authentication protocol for RFID systems. Our solution utilizes Physically Unclonable Functions (PUFs) in order to achieve higher level of privacy with constant identification time. It provides destructive privacy according to the Vaudenay’s privacy and security model. It defends against compromising attack by using PUFs as a secure storage to keep secrets of the tag. To the best of our knowledge, it is the first protocol providing such a privacy level with constant identification time.

A Quadratic Residue-Based Lightweight RFID Mutual Authentication Protocol with Constant-Time Identification

Many RFID authentication protocols have been developed in recent years. However, most require the reader to search all tags in the system to identify a single tag. This problem makes the protocols impractical in large-scale RFID deployments. To address this problem, we propose a privacy- preserving mutual authentication protocol for RFID systems with constant-time identification, based on Quadratic Residue. Furthermore, the validity period of each tag is stored in the database so the reader can revoke an expired tag. Formal security proof shows the proposed protocol has no obvious design defects. Compared with existing approaches, the proposed protocol achieves higher efficiency. Index Terms—Mutual authentication, quadratic residue, privacy, security

Scalable RFID Systems: A Privacy-Preserving Protocol with Constant-Time Identification

In RFID literature, most “privacy-preserving” protocols require the reader to search all tags in the system in order to identify a single tag. In another class of protocols, the search complexity is reduced to be logarithmic in the number of tags, but it comes with two major drawbacks: it requires a large communication overhead over the fragile wireless channel, and the compromise of a tag in the system reveals secret information about other, uncompromised, tags in the same system. In this work, we take a different approach to address time complexity of private identification in large-scale RFID systems. We utilize the special architecture of RFID systems to propose a symmetric-key privacy-preserving authentication protocol for RFID systems with constant-time identification. Instead of increasing communication overhead, the existence of a large storage device in RFID systems, the database, is utilized for improving the time efficiency of tag identification.

An efficient and secure authentication protocol for RFID systems

The use of RFID tags may cause privacy violation of users carrying an RFID tag. Due to the unique identification number of the RFID tag, the possible privacy threats are information leakage of a tag, traceability of the consumer, denial of service attack, replay attack and impersonation of a tag. There are some challenges in providing privacy and security in the RFID tag due to the extremely limited computation, storage and communication ability of passive RFID tags. Many research works have already been conducted using hash functions and random numbers. As the same random number can recur many times the adversary can use the response derived from the same random number for replay attack and it can cause a break in location privacy. This paper proposes an RFID authentication protocol using a static identifier, a monotonically increasing timestamp, a tag side random number and a hash function to protect the RFID system from adversary attacks. The proposed protocol also indicates that it requires less storage and computation than previous existing RFID authentication protocols but offers a larger range of security protection. A simulation experiment is also conducted to verify some of the privacy and security properties of the proposed protocol.

Security Problems in an RFID System

This paper focuses on the security and privacy threats being faced by the low-cost RFID communication system, the most challenging of which relate to eavesdropping, impersonation, and tag cloning problems. The security issues can be improved and solved by utilizing both prevention and detection strategies. Prevention technique is needed since it offers resistance capabilities toward eavesdroppers and impersonators. Detection technique is vital to minimize the negative effects of tag cloning threats. This paper proposes the use of both prevention and detection techniques to make RFID communication more secure. Lightweight cryptographic algorithm, which conforms to the EPC Class-1 Generation-2 standard, is used in the proposed mutual authentication protocol for RFID system to raise security levels. In addition, electronic fingerprinting system is deployed in the proposed solution as a detection method to distinguish counterfeit and legitimate tags.

A Modified Two-Way Authentication Protocol without Server for RFID

It is necessary for researchers to design lightweight authentication protocols to protect information security between tag and reader in RFID system. It is a great challenge to design an efficient and secure protocol because the tag has limited computation resource. In the paper, we firstly analyze some protocols. Secondly, we introduce a serverless authentication protocol for RFID system and analyze its security. We find it does not provide two-way authentication. Thirdly, we propose a modified two-way authentication protocol without server for RFID. The result indicates it provides privacy protection, resists tracking, and resists cloning attack. Moreover, it provides two-way authentication. For the efficiency, we think the computational complexity of our protocol is at the same level with the original protocol.

A Revised Serverless Authentication Protocol with Forward Security for RFID

Information security problem has become one of the hottest issues in RFID system. More and more researchers begin to study how to provide security protection in the RFID system. In the paper, we mainly research lightweight authentication protocols in RFID system. Firstly, we analyze some protocols. Secondly, we introduce a serverless authentication protocol for RFID system and analyze its security. We find it does not provide forward security. Thirdly, we propose a revised serverless authentication protocol with forward security. It provides two-way authentication and privacy protection, resists tracking and cloning attack as well as the original protocol. Moreover, it provides forward security protection and resists desynchronization attack. For the efficiency, its computational complexity is at the same level with the protocol proposed by Tan et al.