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

Authors: Xuefei Leng, Yuan-Hung Lien, Keith Mayes, Konstantinos Markantonakis

Addresses: 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

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.

Keywords: RFID tags; radio frequency identification; anti-collision algorithms; grouping proof; subgroup division; dynamic binary tree; failure rates.

DOI: 10.1504/IJSN.2010.032206

International Journal of Security and Networks, 2010 Vol.5 No.2/3, pp.79 - 86

Available online: 17 Mar 2010 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article