Chapter

Advances in Web and Network Technologies, and Information Management

Volume 4537 of the series Lecture Notes in Computer Science pp 634-643

Coexistence Proof Using Chain of Timestamps for Multiple RFID Tags

  • Chih-Chung LinAffiliated withDepartment of Information Management, National Taiwan University of Science and Technology
  • , Yuan-Cheng LaiAffiliated withDepartment of Information Management, National Taiwan University of Science and Technology
  • , J. D. TygarAffiliated withUniversity of California, Berkeley
  • , Chuan-Kai YangAffiliated withDepartment of Information Management, National Taiwan University of Science and Technology
  • , Chi-Lung ChiangAffiliated withDepartment of Information Management, National Taiwan University of Science and Technology

* Final gross prices may vary according to local VAT.

Get Access

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