Coexistence Proof Using Chain of Timestamps for Multiple RFID Tags

Abstract

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 timestampchaining proof (chaining-proof) that avoid replay attacks and solve problems in previously proposed techniques.

A Forward-secure Grouping-proof Protocol for Multiple RFID Tags

“…Lin et al 7 pointed out that Piramuthu's protocol 3 suffers from interference problem when multiple readers are represented. To counter the problem, Lin et al proposed both online and offline grouping-proof protocols 7 which are variants of timestamp-based yoking proof to avoid race conditions. In both schemes tag anonymity and forward security cannot be guaranteed and they cannot defend against DOP attack.…”

“…In the previous section, we show the analysis to recent schemes [1][2][3][4][5][6][7][8] . Then we summarize the common weakness of those schemes as follows.…”

“…Then he e xtended this notion and envisioned the concept of grouping-proofs [2][3][4] , which allows multiple RFID tags to provide evidence that they are scanned simultaneously in an i dentification session by one or more readers within its broadcast range. Other improved variants of yoking-proof were also proposed in 3,6,7 . As Juels 1 already pointed out, t here are several practical scenarios where grouping-proofs could significantly expand the capabilities of RFID-based systems, such as manufacturing, supply chains, access control, e-ticketing and counterfeit prevention, etc.…”

“…In this paper we first evaluate these proposed grouping-proofs [1][2][3][4][5][6][7][8] recently to observe security demand and a nalyze security wea kness. Then we propose a lightweight forward-secure groupingproof protocol based on Shamir's (n, n) secret sharing to improve scalability, robustness, especially orderindependence by avoiding relaying message.…”

On the Security of RFID Group Scanning Protocols

“…The attacker starts to intervene in step P3 as follows: [4]. The main idea of Lin et al's protocol is to encrypt the timestamp before sending to the reader so that attackers cannot collect MAC on different timestamp values from tags.…”