RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification
RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification
ALOHA packet system with and without slots and capture
ACM SIGCOMM Computer Communication Review
Strengthening EPC tags against cloning
Proceedings of the 4th ACM workshop on Wireless security
A Lightweight RFID Protocol to protect against Traceability and Cloning attacks
SECURECOMM '05 Proceedings of the First International Conference on Security and Privacy for Emerging Areas in Communications Networks
Fast and reliable estimation schemes in RFID systems
Proceedings of the 12th annual international conference on Mobile computing and networking
Physically Unclonable Function-Based Security and Privacy in RFID Systems
PERCOM '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications
RFID-based supply chain partner authentication and key agreement
Proceedings of the second ACM conference on Wireless network security
Securing RFID Systems by Detecting Tag Cloning
Pervasive '09 Proceedings of the 7th International Conference on Pervasive Computing
EPC RFID tag security weaknesses and defenses: passport cards, enhanced drivers licenses, and beyond
Proceedings of the 16th ACM conference on Computer and communications security
Identifying the missing tags in a large RFID system
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
RFID security and privacy: a research survey
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Tag cloning attacks threaten a variety of Radio Frequency Identification (RFID) applications but are hard to prevent. To secure RFID applications that confine tagged objects in the same RFID system, this paper studies the cloned-tag identification problem. Although limited existing work has shed some light on the problem, designing fast cloned-tag identification protocols for applications in large-scale RFID systems is yet not thoroughly investigated. To this end, we propose leveraging broadcast and collisions to identify cloned tags. This approach relieves us from resorting to complex cryptography techniques and time-consuming transmission of tag IDs. Based on this approach, we derive a time lower bound on cloned-tag identification and propose a suite of time-efficient protocols toward approaching the time lower bound. The execution time of our protocol is only 1.4 times the value of the time lower bound, being up to 91% less than that of the existing protocol. The proposed protocols may benefit also RFID applications that distribute tagged objects across multiple places.