An RFID grouping proof protocol exploiting anti-collision algorithm for subgroup dividing

Authors:
Xuefei Leng;Yuan-Hung Lien;Keith Mayes;Konstantinos Markantonakis
Affiliations:
Smart Card Centre, Information Security Group, Royal Holloway, University of London, TW20 0ER, UK.;Department of Electronic Engineering, National Taiwan University of Science and Technology, Taipei, Taiwan 02-2733-3141, ROC.;Smart Card Centre, Information Security Group, Royal Holloway, University of London, TW20 0ER, UK.;Smart Card Centre, Information Security Group, Royal Holloway, University of London, TW20 0ER, UK
Venue:
International Journal of Security and Networks
Year:
2010

Citing 8
Cited 3

"Yoking-Proofs" for RFID Tags

PERCOMW '04 Proceedings of the Second IEEE Annual Conference on Pervasive Computing and Communications Workshops
Grouping Proof for RFID Tags

AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2
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
Severless Search and Authentication Protocols for RFID

PERCOM '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications
On Existence Proofs for Multiple RFID Tags

PERSER '06 Proceedings of the 2006 ACS/IEEE International Conference on Pervasive Services
Select-Response Grouping Proof for RFID Tags

ACIIDS '09 Proceedings of the 2009 First Asian Conference on Intelligent Information and Database Systems
Short survey: Taxonomy and survey of RFID anti-collision protocols

Computer Communications
RFID security and privacy: a research survey

IEEE Journal on Selected Areas in Communications

Wireless telemedicine and m-health: technologies, applications and research issues

International Journal of Sensor Networks
A survey of security visualization for computer network logs

Security and Communication Networks
A survey of cyber crimes

Security and Communication Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Verifying that several RFID tags are all present in a group poses specific challenges that have generated great interest in the academic community. As the number of tags becomes large, the unreliability of radio wave communication could potentially cause possible high failure rates to the existing grouping proof. In this paper, we propose a way of grouping proof, which uses the dynamic binary tree anti-collision algorithm to subgroup the tags. This paper combines the 'Yoking Proof' idea and the 'Select-Response' mode from previous publications. The 'Yoking Proof' is generated between subgroups and within each subgroup, and as a result, the failure rates are greatly reduced. The 'Select-Response' mode is used for subgroup verification.