Privacy Threats in RFID Group Proof Schemes

RFID tag is a small and inexpensive microchip which is capable of transmitting unique identifier through wireless network in a short distance. If a group of RFID tags can be scanned simultaneously by one reader, RFID Group proof could be generated. Group proof can be used in various applications, such as good management which is usually achieved using barcode system. A lot of RFID group proof schemes have been proposed by many researchers. In this paper, we introduce some existing group proof schemes and then analyze their vulnerabilities to the privacy. Moreover, we propose a new attack model, which threats the privacy of user by tracking tags in a group.




References:
[1] A. Juels, "Yoking - Proofs for RFID tags," First International Workshop
on pervasive Computing and Communication Security, 2004.
[2] J. Saito and K. Sakurai, "Grouping proof for RFID tags," In 19th
International Conference on Advanced Information Networking and
Applications 2005, volume 2, pages 621-624, March 2005.
[3] S. Piramuthu, "On Existence Proofs for Multiple RFID Tags," IEEE
International Conference on Pervasive Services (ICPS-06), June 2006.
[4] P. Peris-Lopez, J.C. Hernandez-Castro, J.M. Estevez-Tapiador, and A.
Ribagorda, "Solving the simultaneous scanning problem anonymously:
clumping proofs for RFID tags," In Third International Workshop on
Security, Privacy and Trust in Pervasive and Ubiquitous Computing,
SecPerl07, Istambul, Turkey, 2007.
[5] L. Bolotnyy and G. Robins, "Generalized Yoking Proofs for a Group of
RFID Tags," International Conference on Mobile and Ubiquitous
Systems, July 2006.
[6] Yuanhung Lien, Xuefei Leng, Mayes, K. Jung-Hui Chiu, "Reading order
independent grouping proof for RFID tags," Intelligence and Security
Informatics, 2008. ISI 2008. pp.128-136, 17-20 June 2008.
[7] Sangjin KIM, Jihwan LIM, Jaehong HAN, Heekuck OH, "Efficient
RFID Search Protocols Using Counters," IEICE TRANSACTIONS on
Communications, Vol.E91-B , No.11, pp.3552-3559, November 2008