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 timestampchaining prao/(chaining-proof) that avoid replay attacks and solve problems in previously proposed techniques. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Lin, C. C., Lai, Y. C., Tygar, J. D., Yang, C. K., & Chiang, C. L. (2007). Coexistence proof using chain of timestamps for multiple RFID tags. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4537 LNCS, pp. 634–643). Springer Verlag. https://doi.org/10.1007/978-3-540-72909-9_70
Mendeley helps you to discover research relevant for your work.