RFID Mutual Authentication Protocol Research Articles

Retraction Note: Improved RFID mutual authentication protocol against exhaustive attack in the context of big data

This article has been retracted. Please see the Retraction Notice for more detail: https://doi.org/10.1186/s13635-024-00151-w.

Improved RFID mutual authentication protocol against exhaustive attack in the context of big data

The development of big data has epromoted the development of Internet technology, but it has brought more network security and privacy problems. Therefore, how to solve network security problems is the main research direction of current network technology development. In order to deal with the harm of network attacks to personal privacy security, this paper studies and proposes an RFID mutual authentication protocol against exhaustive attacks based on improved Hash function, and proposes a security proof based on BAN logic rules. At the same time, to enhance the computing resources of the improved protocol, this paper proposes an improved authentication query protocol for multi-source RFID tags. In the performance analysis, when the distance between the reader and the tag reaches 10 m, the improved protocol can still be higher than 90%. The application test shows that the improved protocol proposed in the study is capable of resisting exhaustive attacks, its execution time is short, and it is less affected by the number of tags. The above results show that in the context of big data, the improved RFID mutual authentication protocol proposed by the research against network exhaustive attacks has a more significant defense effect, can effectively protect user privacy, and has a greater reference value in network security research.

SDRLAP: A secure lightweight RFID mutual authentication protocol based on PUF with strong desynchronization resistance

SDRLAP: A secure lightweight RFID mutual authentication protocol based on PUF with strong desynchronization resistance

Closed-loop and open-loop authentication protocols for blockchain-based IoT systems

Designers of smart environments based on radio frequency identification devices have a challenging task to build secure mutual authentication protocols. These systems are classified into two major factions which are traditional closed-loop systems, and open-loop systems. To the best of our knowledge, all of the mutual authentication protocols previously introduced for these two categories rely on a centralized database but they fail to address decentralized mutual authentication and their related attacks. Thanks to the blockchain technology, which is a novel distributed technology, in this paper, we propose two decentralized mutual authentication protocols for IoT systems. Our first scheme is utilized for traditional closed-loop RFID systems (called CLAB), and the second one applies to open-loop RFID systems (called OLAB). Meanwhile, we examine the security of the Chebyshev chaotic map-based authentication algorithm and confirm that this algorithm is unprotected against tag and reader impersonation attacks. Likewise, we present a denial of service (DoS), tag impersonation, and reader impersonation attacks against the Chebyshev chaotic-map based protocol when employed in open-loop IoT networks. Moreover, we discover a full secret recovery attack against a recent RFID mutual authentication protocol which is based on blockchain. Finally, we use the BAN-logic method to approve the security characteristics of our CLAB and OLAB proposals.

Cryptographic Solution-Based Secure Elliptic Curve Cryptography Enabled Radio Frequency Identification Mutual Authentication Protocol for Internet of Vehicles

Internet of Vehicles (IoV) is one of the most active research disciplines in Intelligent Transportation Systems (ITS), intending to improve Vehicular Ad-hoc Network (VANET) capabilities. The main objective of IoV is to enhance the safety of passengers by incorporating various advanced information and communication technologies thus, easing the driving experience of passengers and enhancing traffic efficiency. The IoV has numerous key technologies, and one of them is Radio-Frequency Identification Technology (RFID) which has a plethora of applications in IoV like automatic toll collection, intelligent parking, data dissemination, tracking the location of the vehicle, etc. which enhances the overall performance of IoV networks. Along with this, RFID devices are resource-constrained, thus security and privacy are a major concern and also IoV is a real-time sensitive network where security is of utmost importance. Keeping in mind the security perspective, the concept of Elliptic-Curve Cryptography (ECC) is taken into consideration. So, in this paper, we have proposed a Cryptographic solution-based secure ECC-enabled RFID mutual authentication protocol for IoV. The proposed protocol is comprised of three phases: Setup Phase, Tag Authentication Phase, and Server Authentication Phase. Security evaluation of the proposed protocol is performed by taking into consideration the analysis of security requirements as well as security attacks. Also, the simulation of the proposed protocol is done using the AVISPA tool and the results indicate that the proposed protocol is safe against various malevolent attacks. Performance evaluation of the proposed protocol is computed based on parameters i.e., storage requirements, communication cost, and computational cost. Results indicate that the proposed protocol contributes to high performance and security and has low computational cost than other existing authentication protocols. A novel Blockchain-based security framework for RFID-enabled IoV has also been proposed to further enhance the security of the IoV network.

Novel ECC-Based RFID Mutual Authentication Protocol for Emerging IoT Applications

The implementation of RFID technology has globally impacted several industries and this revolution has improved the aspects of service delivery in many sectors, such as logistics, supply chain visibility, access control, military, and agri-food sector. RFID provides several security services to protect the data transmitted between a tag and a reader in the IoT environment. However, these advantages do not prevent an attacker to access this communication and remaining various security and privacy issues in these systems. Furthermore, with the rapid growth of IoT, there is an urgent need of security authentication and confidential data protection. Authentication protocols based on cryptographic primitives were widely investigated and implemented to guarantee protection against various attacks that can suffer an RFID system. Among those cryptosystems is the Elliptic Curve Integrated Encryption Scheme (ECIES), which can be found in several cryptographic standards. It offers mutual authentication and data integrity that has become highly employed in RFID applications. In this paper, we present a novel secure ECC-based RFID authentication protocol that meets the security needs of existing published protocols and ensures data confidentiality and privacy. Beforehand, we present an overview of some ECC-based RFID authentication protocols and highlight their security weaknesses against server spoofing, tracking, and impersonation attacks. After that, a comparative study with existing protocols in terms of computational performance and security strength is performed. Finally, our protocol is analyzed and verified with the Automated Validation of Internet Security Protocols and Applications (AVISPA) analysis tool after being modeled in High Level Protocol Specification Language (HLPSL).

Research on Ultra-Lightweight RFID Mutual Authentication Protocol Based on Stream Cipher

Research on Ultra-Lightweight RFID Mutual Authentication Protocol Based on Stream Cipher

A scalable and secure RFID mutual authentication protocol using ECC for Internet of Things

SummaryVery recently, Alamr et al (J. Supercomput 1‐14 doi: 10.1007/s11227‐016‐1861‐1) presented a radio frequency identifier (RFID) authentication protocol for the Internet of Things (IoT) through elliptic curve cryptography (ECC). They claimed the protocol to achieve several security properties and thwart all known attacks. However, this paper shows that their scheme is having correctness and scalability issues. The reader in their protocol can accommodate only one tag, which is not desirable in the IoT environments. The paper finally suggests an improvement to cater the correctness and scalability issues.

Exploring relationship between indistinguishability-based and unpredictability-based RFID privacy models

A comprehensive privacy model plays a vital role in the design of privacy-preserving RFID authentication protocols. Among various existing RFID privacy models, indistinguishability-based (ind-privacy) and unpredictability-based (unp-privacy) privacy models are the two main categories. Unp∗-privacy, a variant of unp-privacy has been claimed to be stronger than ind-privacy. In this paper, we focus on studying RFID privacy models and have three-fold contributions. We start with revisiting unp∗-privacy model and figure out a limitation of it by giving a new practical traceability attack which can be proved secure under unp∗-privacy model. To capture this kind of attack, we improve unp∗-privacy model to a stronger one denoted as unpτ-privacy. Moreover, we prove that our proposed privacy model is stronger than ind-privacy model. Then, we explore the relationship between unp∗-privacy and ind-privacy, and demonstrate that they are actually not comparable, which is in contrast to the previous belief. Next, we present a new RFID mutual authentication protocol and prove that it is secure under unpτ-privacy model. Finally, we construct a RFID mutual authentication model denoted as MA model, and show that unpτ-privacy implies MA, which gives a reference to design a privacy-preserving RFID mutual authentication protocol. That is, if we propose a scheme that satisfies unpτ-privacy, then it also supports mutual authentication.

A new lightweight RFID mutual authentication protocol based on CRC code

A new lightweight RFID mutual authentication protocol based on CRC code

A new lightweight RFID mutual authentication protocol based on CRC code

A new lightweight RFID mutual authentication protocol which the security keys updated dynamically is presented by using cyclic redundancy check code (CRC code) operations and some simple logic operations. GNY logic proof and security analysis show that the protocol not only achieve the mutual authentication requirements effectively between the readers and the tags, but also prevent many security privacy problems such as eavesdropping attack, replay attack, replication attack, the problem of tag tracking on the basis of without increasing computation and communication traffic of the RFID system. Especially, the new protocol meets the EPC Class1 Gen2 standard, compared with the same safety degree of other existing protocols, the new protocol is low complexity in the aspect of hardware implementation which consumes only 18.75% of the reserved space in terms of label storage and it is suitable for low-cost RFID system. Hence, the new protocol can realise the combination of high security and low tag cost.

Design and Implementation of RFID Active Tags and Mutual Authentication Protocol with Ownership Transfer Stage

Design and Implementation of RFID Active Tags and Mutual Authentication Protocol with Ownership Transfer Stage

Secure ultra-lightweight RFID mutual authentication protocol based on transparent computing for IoV

Transparent Computing (TC) has become a promising paradigm in the network computing era, the appearance of Transparent Computing have a real impact on the industry. A growing number of cars on the road, in order to reduce road congestion, improve efficiency, and increase travelers satisfaction, IoV (Internet of Vehicles) arises at the proper time. RFID as an excellent sensing equipment is widely used in the IoV. Tags can collect information separately. The surrounding readers transmit the information to the central processing unit by using the Transparent Computing technique. Data sharing is the premise of IoV, drivers can share their information, in the meantime, they do not want to expose their own privacy information, so anonymity and untraceability is very important. Unfortunately, current applicable or proposed protocols fail to satisfy the security, efficiency and usability. In this paper, we propose a mutual authentication protocol to protect driver’s privacy, TC is used in our protocol, so we can make full use of client hardware, improve the quality of user experience. The last but not least, because the existence of OS-level monitoring and attack tracing, system security increase greatly.

An ultralightweight RFID authentication protocol based on Feistel cipher structure

AbstractRadio‐frequency identification (RFID) is a technology for automated identification of objects and people. RFID raises two main concerns: security and privacy. RFID tags are likely to proliferate into billions, and nowadays, security and privacy of RFID systems are to be continuously improved. In this context, we propose a new ultralightweight RFID mutual authentication protocol based on the Feistel cipher structure. This structure is based on substitutions and random permutations which create confusion and diffusion in the transmitted messages. The main contribution of this work is the application of Feistel cipher structure to design a low‐cost authentication protocol for RFID tags involving simple lightweight operations in the tag. Security analysis shows that the proposed protocol achieves the functionalities of mutual authentication, resists to various attacks, and presents a scalable security level. Copyright © 2017 John Wiley & Sons, Ltd.

SLAP: Succinct and Lightweight Authentication Protocol for low-cost RFID system

Data security is crucial for a RFID system. Since the existing RFID mutual authentication protocols encounter the challenges such as security risks, poor performance, an ultra-lightweight authentication protocol named Succinct and Lightweight Authentication Protocol (SLAP) is proposed. SLAP is only composed of bitwise operations like XOR, left rotation and conversion which is easy to implement on a passive tag. The proposed conversion operation as the main security component guarantees the security of RFID system with the properties such as irreversibility, sensibility, full confusion and low complexity, which better performed or even absent in other previous protocols. Security analysis shows that SLAP guarantees the functionalities of mutual authentication as well as resistance to various attacks such as de-synchronization attack, replay attack and traceability attack, etc. Furthermore, performance evaluation also indicates that the proposed scheme outperforms the existing protocols in terms of less computation requirement and fewer communication messages during authentication process.

A New Ultralightweight RFID Mutual Authentication Protocol: SASI Using Recursive Hash

RFID is one of the most prominent identification schemes in the field of pervasive systems. Nonline of sight capability makes RFID systems much better choice than its contended systems (such as barcode, magnetic tape, etc.). Since the RFID uses wireless channel for communication with its associated devices, there should be some optimal encryption methods to secure the communicating data from adversaries. Several researchers have proposed ultralightweight mutual authentication protocols (UMAPs) to secure the RFID systems in cost effective manner. Unfortunately most of the previously proposed UMAPs are later found to be vulnerable against various desynchronization, Denial of Service (DoS), traceability, and full disclosure attacks. In this paper, we present a more sophisticated UMAP to provide Strong Authentication and Strong Integrity (SASI) using recursive hash function. The proposed protocol incorporates only simple bitwise logical operators XOR, Rot, and nontriangular function (recursive hash) in its design, which can be efficiently implemented with a low cost passive RFID tag. The performance analysis of the protocol proves the conformation of the proposed protocol with EPC-C1G2 passive tags. In addition to privacy and security, small chip area (miniaturization) is another design constraint (which is mandatory requirement for a protocol to be considered as ultralightweight authentication protocol). We have also proposed and implemented the efficient hardware design of the proposed protocol for EPC-C1G2 tags. Both the FPGA and ASIC implementation flows have been adopted. The FPGA flow is primarily used to validate the functionality of the proposed hardware design whereas ASIC flow (using TSMC 0.35 μm library) is used to validate the gate count. To the best of our knowledge, this is the first FPGA and ASIC implementation of any ultralightweight RFID authentication protocol.

Lightweight and ultralightweight RFID mutual authentication protocol with cache in the reader for IoT in 5G

As one of the core techniques in 5G, the Internet of Things is more interested than ever. Furthermore, radio frequency identification RFID plays a crucial role in Internet of Things development. Although the low-cost RFID system has wide prospect, it has to face with huge challenges because of potential security risks, privacy problems, and efficiency because of its restrictions on processing, storage, and power in RFID tags. One of the possible solutions in secure authentication of the low-cost RFID system is the lightweight RFID authentication protocol. A lightweight RFID mutual authentication protocol with cache in the reader is proposed in this paper, named LRMAPC. The LRMAPC can greatly reduce the computational and transmission cost. Especially, it can reduce computational costs greatly when a large number of tags want to be authenticated. We prove the correctness of LRMAPC using GNY logic. Compared with some existing works, LRMAPC achieves higher efficiency and stronger security. Furthermore, we developed LRMAPC into ULRMAPC, an ultralightweight RFID mutual authentication protocol with cache in the reader. Compared with SASI and Gossamer protocols, ULRMAPC also achieves higher efficiency and stronger security in storage and computation cost. Copyright © 2015 John Wiley & Sons, Ltd.

Universally Composable RFID Mutual Authentication

Universally Composable (UC) framework provides the strongest security notion for designing fully trusted cryptographic protocols, and it is very challenging on applying UC security in the design of RFID mutual authentication protocols. In this paper, we formulate the necessary conditions for achieving UC secure RFID mutual authentication protocols which can be fully trusted in arbitrary environment, and indicate the inadequacy of some existing schemes under the UC framework. We define the ideal functionality for RFID mutual authentication and propose the first UC secure RFID mutual authentication protocol based on public key encryption and certain trusted third parties which can be modeled as functionalities. We prove the security of our protocol under the strongest adversary model assuming both the tags' and readers' corruptions. We also present two (public) key update protocols for the cases of multiple readers: one uses Message Authentication Code (MAC) and the other uses trusted certificates in Public Key Infrastructure (PKI). Furthermore, we address the relations between our UC framework and the zero-knowledge privacy model proposed by Deng et al. [1].

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

An Approach towards Efficient and Secure RFID Mutual Authentication Protocol

The widespread distribution of RFID technologies may generate new threats to user privacy and security. The International Standards Organization (ISO) has incorporated the Electronic Product Code Class-1 Generation-2 (EPC C1G2) ultrahigh frequency (UHF) standard into its ISO/IEC 18000-6 as type C on UHF RFID for item management, and contributes using only very basic security tools using pseudorandom number generator (PRNG) and cyclic redundancy code (CRC). An authentication scheme was originally included as part of the EPC C1G2 industrial standard to secure RFID transactions. However, the EPC C1G2 specifications do not fully support privacy incursion and data security issues. The weakness can be alleviated by including a RFID tag-reader mutual authentication scheme. Here, a simple, cost-effective, light-weight RFID tag-reader mutual authentication scheme is proposed. Most importantly the proposed scheme does not demand the implementation of any cryptographic hash functions / keys with the tag and a center server / database, which in turn requires synchronization for security of key/hash values. The scheme utilizes only XOR operation, and tag‘s access password for achieving tag-reader mutual authentication. A specially designed pad generation (PadGen) function is employed to enhance security. The function PadGen is used to develop a cover-coding pad to mask the transponder‘s access password before data is transmitted. Therefore, in this proposed scheme, data between the tag and the reader is never exposed even to the stockholder‘s reader, and yet accomplish tag-reader mutual authentication. The proposed scheme based on XOR operation to generate PadGen function is an improvement over the weak one-way reader-to-tag authentication scheme proposed by the ISO 18000-6C protocol.