Abstract

A Radio Frequency Identification (RFID) grouping-proof protocol is to generate an evidence of the simultaneous existence of a group of tags and it has been applied to many different fields. For current grouping-proof protocols, there still exist some flaws such as low grouping-proof efficiency, being vulnerable to trace attack and information leakage. To improve the secure performance and efficiency, we propose a lightweight RFID grouping-proof protocol based on parallel mode and DHCP (Dynamic Host Configuration Protocol) mechanism. Our protocol involves multiple readers and multiple tag groups. During the grouping-proof period, one reader and one tag group are chosen by the verifier by means of DHCP mechanism. When only a part of the tags of the chosen group exist, the protocol can also give the evidence of their co-existence. Our protocol utilizes parallel communication mode between reader and tags so as to ensure its grouping-proof efficiency. It only uses Hash function to complete the mutual authentication among verifier, readers and tags. It can preserve the privacy of the RFID system and resist the attacks such as eavesdropping, replay, trace and impersonation. Therefore the protocol is secure, flexible and efficient. It only uses some lightweight operations such as Hash function and a pseudorandom number generator. Therefore it is very suitable to some low-cost RFID systems.

Highlights

  • With the wide application of Internet of Things (IoTs), Radio Frequency Identification (RFID)technique gets the broad attention

  • One RFID tag might be embedded in the container for the medication, while another is embedded in the accompanying leaflet

  • We found that for each grouping-proof protocol proposed by Yi-Chung Yen et al, if the inpatient and unit-dose tags receive the challenge {request, rb } from the nurse’s Personal Digital Assistant (PDA) many times, the inpatient will return the same response messages pseudorandom number generator (PRNG) id pi ⊕ rb ⊕ K pi, and the unit-dose tags will return the same messages PRNG iduj ⊕ rb and PRNG Kuj ⊕ rb to the nurse’s PDA

Read more

Summary

Introduction

With the wide application of Internet of Things (IoTs), Radio Frequency Identification (RFID). For an object with large size, multiple tags are usually attached to different position of the object to ensure the object can be detected Under these cases, it is necessary for a reader to read several tags simultaneously and to prove the co-existences of these tags, which is called grouping proof for RFID systems. A grouping proof will provide evidence that each container of the medication is dispensed with a leaflet Another example is that a manufacturer of aircraft equipment wishes to certify that a certain part always leaves its factories with a safety cap. In order to prove the co-existence of multiple tags, many grouping proof protocols have been proposed.

The Related Grouping-Proof Protocols for RFID Systems
The RFID System Under Grouping Proof and Its Secure Model
The Efficient and Secure Analysis of the Proposed Protocol
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.