Title

One-round provably secure yoking-proof for RFID applications

RIS ID

130327

Publication Details

Sun, D., Zhu, Z., Xu, G. & Guo, W. (2018). One-round provably secure yoking-proof for RFID applications. Concurrency Computation, Online First e4931-1-e4931-9.

Abstract

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.

Please refer to publisher version or contact your library.

Share

COinS
 

Link to publisher version (DOI)

http://dx.doi.org/10.1002/cpe.4931