Coexistence Proof Using Chain of Timestamps for Multiple RFID Tags

  • Chih-Chung Lin
  • Yuan-Cheng Lai
  • J. D. Tygar
  • Chuan-Kai Yang
  • Chi-Lung Chiang
Conference paper

DOI: 10.1007/978-3-540-72909-9_70

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4537)
Cite this paper as:
Lin CC., Lai YC., Tygar J.D., Yang CK., Chiang CL. (2007) Coexistence Proof Using Chain of Timestamps for Multiple RFID Tags. In: Chang K.CC. et al. (eds) Advances in Web and Network Technologies, and Information Management. Lecture Notes in Computer Science, vol 4537. Springer, Berlin, Heidelberg

Abstract

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.

Keywords

RFID coexistence proof timestamp computer security cryptographic protocol race condition 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Chih-Chung Lin
    • 1
  • Yuan-Cheng Lai
    • 1
  • J. D. Tygar
    • 2
  • Chuan-Kai Yang
    • 1
  • Chi-Lung Chiang
    • 1
  1. 1.Department of Information Management, National Taiwan University of Science and Technology 
  2. 2.University of California, Berkeley 

Personalised recommendations