A Secure and Practical RFID Ownership Transfer Protocol Based on Chebyshev Polynomials

Shen, Zuming; Zeng, Peng; Qian, Yuyin; Choo, Kim‐Kwang Raymond

doi:10.1109/access.2018.2809480

Cited by 11 publications

(7 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When the reader abruptly decodes 16‐bit data, it generates a response with ACK message and informs tag to transfer the ID of corresponding transmission. Otherwise, the reader needs to initiate the successive slot, as multiple available tags are available for transmitting 39–41 . There are two diverse kinds of responses: (1) tag responds to Query REQUEST and Query RESPONSE command, and (2) tag responds to ACK command.…”

Section: Feature Analysesmentioning

confidence: 99%

“…Otherwise, the reader needs to initiate the successive slot, as multiple available tags are available for transmitting. [39][40][41] There are two diverse kinds of responses: (1) tag responds to Query REQUEST and Query RESPONSE command, and (2) tag responds to ACK command. The reader has to provide continuous wave for every tag underuse during tag response process.…”

Section: Tag Responsementioning

confidence: 99%

See 1 more Smart Citation

A constructive Steiner graph matching for Radio frequency identification device tag detection in wireless and internet of things environment

Sathishkumar,

Rajan,

Geetha

2024

Int J Communication

View full text Add to dashboard Cite

SummaryRadio frequency identification device (RFID) has emerged as one of the most potential building blocks for future IoT‐enabled technologies. Various applications like logistic monitoring use the RFID system to deal with the tagged objects. RFID‐based tracking approach is extremely solicited for appropriate logistic distribution because of the frequent tagged‐objects rearrangements. Nevertheless, with an RFID system, one of the most significant issues is resolving collisions between tags as they transfer data to the reader at the same time. This work investigates the core issue of locating all lost tags in RFID systems. The most significant factor in missing tag recognition is to reduce the time required for execution. A problem needs to be formulated to differentiate the tagged objects' motion state, that is, static or dynamic, to handle this issue. It tracks the moving objects with various existing localization approaches. Finally, a tag detection known as constructive Steiner graph matching (CSGM) detection is proposed to achieve time efficiency by utilizing RFID collision signals. Specifically, the physical‐layer features are considered for differentiating the positions. Experimental outcomes demonstrate that the anticipated model can attain better prediction accuracy by reducing inventory time compared to other approaches. Simulation findings show that the suggested approach performs exceptionally well in giving a significant performance boost in an RFID system. It minimizes the complexity of tracking the objects. The simulation outcomes illustrate that the algorithm's identification speed is substantially enhanced and ensuring high system efficiency. The simulation results of the proposed algorithm have been improved in terms of system efficiency (9.5%), success rate (6.3%), and identification speed (4%) compared to the conventional algorithm. The suggested CSGM technique's average waiting time is decreased by more than 45.372%, and its detection speed is increased by at least 38.219% compared to other existing algorithms.

show abstract

Section: Feature Analysesmentioning

confidence: 99%

Section: Tag Responsementioning

confidence: 99%

A constructive Steiner graph matching for Radio frequency identification device tag detection in wireless and internet of things environment

Sathishkumar,

Rajan,

Geetha

2024

Int J Communication

View full text Add to dashboard Cite

show abstract

“…S r = T g c−Rr (ω) mod p (18) This certificate has three basic components:{B, R r , S r }. The first component B is the RSU public key after ensuring that its value is not changed during the transmission from the RSU to the TA.…”

Section: Registration Phasementioning

confidence: 99%

Secure VANET Authentication Protocol (SVAP) Using Chebyshev Chaotic Maps for Emergency Conditions

2022

View full text Add to dashboard Cite

It is crucial to support emergency applications provided by vehicular adhoc network (VANET) through enabling vehicles to quickly access to the infrastructure and consequently request rescue services. Additionally, the communication channels between vehicles and the infrastructure lack various security features due to the inferior wireless characteristics of their environment. However, most of the existing authentication schemes which are used to fix the security drawbacks lead to heavy computations and large storage burdens on the vehicle onboard unit (OBU). These schemes utilize secure channels while distributing the network parameters between the various participants. Yet, it is not efficient to establish secure channels during the interactions between entities. Furthermore, lightweight cryptography is an efficient security solution which is adequate for OBU to maintain a reasonable efficiency with low computational and communication costs. Two basic demerits for lightweight authentication protocols are highlighted as follows: Firstly, symmetric key-based authentication protocols dismiss achieving non-repudiation feature, leading to several security attacks in VANET. Secondly, public key-based authentication schemes are relied on elliptic curve cryptography (ECC) which makes the protocol implementation more difficult. Hence, this paper introduces a novel authentication protocol that utilizes Chebyshev chaotic maps to secure connectivity between the vehicles and infrastructure without using secure channels to distribute the network parameters. The new protocol combines the concept of the symmetric key cryptography with the public key signature to satisfy both the lightweight property and non-repudiation feature. Thus, this protocol introduces a novel network model which is the lowest hardware complexity, compared with others. The performance analysis is performed by Wolfram Mathematica, proving that the proposed protocol is superior in terms of security and performance aspects; its computation and storage costs of OBU are enhanced with 24.09% and 16.99%, respectively, compared to the most competing scheme. Besides, the Scyther simulation confirms the security of the protocol.

show abstract

“…is study conducted simulation based on the arrival rates in these two cases. Obviously, these two cases cover the traditional applications of RFID, such as goods manufacturing line [5], tracking of animals and ranch inventory [33], smart warehouses, and commodity classification. e simulation results are shown in Section 5.…”

Section: Tag Arrival Rate Modelmentioning

confidence: 99%

A Fast RFID Tag Anticollision Algorithm for Dynamic Arrival Scenarios Based on First-Come-First-Serve

Zhang

Tao

et al. 2019

Mobile Information Systems

View full text Add to dashboard Cite

Radio-frequency identification (RFID) tag anticollision algorithm is a key technology that affects the performance of RFID systems. In dynamic arrival scenarios, when the tags arrive the reader’s interrogation zone, they cannot participate in the ongoing identification immediately, resulting in longer waiting time and tag miss. Focusing on solving this problem, based on blocking technology, dynamic frame-slotted ALOHA (DFSA) algorithm, and the first-come-first-serve (FCFS) idea, a fast RFID tag anticollision algorithm for dynamic arrival scenarios is proposed, named as “DAS-DFSA algorithm”. By optimizing the instruction structure and identification process, the DAS-DFSA allows the new arrival tag to immediately participate in the ongoing identification process, the tag’s waiting time is shortened, and the miss rate is reduced. DAS-DFSA not only adopts blocking technology to prevent the collision between the arrival tag and waiting tag but also uses unequal-length slots to reduce the communication time overhead. Simulation results show that the identification speed of the algorithm is significantly improved and high system efficiency is guaranteed. Under the same operating conditions, compared with similar algorithms, the waiting time is shortened by more than 44.548% and the identification speed is improved by at least 39.053%. More importantly, it can provide the instant-on-service for dynamic arrival tags and can fully meet the requirements of fast identification of tags in different dynamic arrival scenarios.

show abstract

A Secure and Practical RFID Ownership Transfer Protocol Based on Chebyshev Polynomials

Cited by 11 publications

References 17 publications

A constructive Steiner graph matching for Radio frequency identification device tag detection in wireless and internet of things environment

A constructive Steiner graph matching for Radio frequency identification device tag detection in wireless and internet of things environment

Secure VANET Authentication Protocol (SVAP) Using Chebyshev Chaotic Maps for Emergency Conditions

A Fast RFID Tag Anticollision Algorithm for Dynamic Arrival Scenarios Based on First-Come-First-Serve

Contact Info

Product

Resources

About