One‐round provably secure yoking‐proof for RFID applications

Abstract

Summary The yoking‐proof is the evidence that two or more RFID (Radio Frequency Identification) tags have been scanned simultaneously. Thanks to the IoT (Internet of Things), the yoking‐proof scheme becomes a very useful mechanism in many application areas such as health care and supply chain. However, the existing yoking‐proof schemes require two or more rounds of communication to generate the yoking‐proof. Following our idea presented in IEEE TrustCom 2017, we further investigate how to design the one‐round yoking‐proof scheme with efficiency advantage. Our contributions are threefold: (1) we propose a new timestamp‐based scheme for the RFID tag pair; (2) we prove the security and privacy of the proposed scheme under our models; (3) the proposed scheme is extended for the m > 2 RFID tags. In addition, the extended scheme still maintains one‐round of communication to generate the yoking‐proof.

Editorial to the Special Issue on Recent Advances on Trust, Security and Privacy in Computing and Communications

“…However, existing yoking‐proof scheme requires two or more rounds of communication to generate the yoking‐proof. Sun et al investigate how to design the one‐round yoking‐proof scheme with computational efficiency. The scheme is designed with a new timestamp‐based scheme for the RFID tag pair.…”