Coexistence Proof Using Chain of Timestamps for Multiple RFID Tags
How can a RFID (Radio Frequency Identification Devices) system prove that two or more RFID tags are in the same location? Previous researchers have proposed yoking-proof and grouping-proof techniques to address this problem – and when these turned out to be vulnerable to replay attacks, a new existence-proof technique was proposed. We critique this class of existence-proofs and show it has three problems: (a) a race condition when multiple readers are present; (b) a race condition when multiple tags are present; and (c) a problem determining the number of tags. We present two new proof techniques, a secure timestamp proof (secTS-proof) and a timestamp-chaining proof (chaining-proof) that avoid replay attacks and solve problems in previously proposed techniques.
KeywordsRFID coexistence proof timestamp computer security cryptographic protocol race condition
Unable to display preview. Download preview PDF.
- 1.Shepard, S.: RFID: Radio Frequency Identification. McGraw-Hill, New York (2005)Google Scholar
- 2.Juels, A.: Strengthening EPC tags against cloning. In: Proceedings of the 4th ACM Workshop on Wireless Wecurity, pp. 67–76 ( 2005)Google Scholar
- 3.Juels, A.: Yoking-proofs for RFID tags. In: Proceedings of the Second IEEE Annual Conference on Pervasive Computing and Communications Workshops. 2004, pp. 138–143 (2004)Google Scholar
- 4.Saito, J., Sakurai, K.: Grouping proof for RFID tags. In: Proceedings of the 19th IEEE International Conference on Advanced Information Networking and Applications, pp. 621–624 ( 2005)Google Scholar
- 5.Piramuthu, S.: On existence proofs for multiple RFID tags. In: Proceedings of the ACS/IEEE International Conference on Pervasive Services, pp. 317–320 ( 2006)Google Scholar