Grouping proof for RFID tags

An RFID tag is a small and cheap device which is combined in IC chip and an antenna for radio communications. The tag is used for management of goods and its distribution. Moreover it reduces the cost of managements of goods. However, an RFID system has some security problems. Juels proposed a "yoking-proof" which guarantees the existence of two tags (Juels, 2004). But we point out that this scheme is not secure against a replay attack. In this paper, we propose a scheme which deals with the problem by using time stamp. Moreover, we propose a scheme which guarantees the existence of a group of RFID tags.

[1]  Jaecheol Ryou,et al.  Enhancing Privacy of Universal Re-encryption Scheme for RFID Tags , 2004, EUC.

[2]  Ronald L. Rivest,et al.  The blocker tag: selective blocking of RFID tags for consumer privacy , 2003, CCS '03.

[3]  Ari Juels,et al.  "Yoking-proofs" for RFID tags , 2004, IEEE Annual Conference on Pervasive Computing and Communications Workshops, 2004. Proceedings of the Second.

[4]  Ari Juels,et al.  Squealing Euros: Privacy Protection in RFID-Enabled Banknotes , 2003, Financial Cryptography.