One‐round provably secure yoking‐proof for RFID applications. (16th September 2018)

• Record Type: Journal Article
• Authors: Sun, Da‐Zhi; Zhu, Ze‐Guang; Xu, Guang‐Quan; Guo, Wei
• Other Names: Chen Jinjun guestEditor.; Zheng Xianghan guestEditor.; Rong Chunming guestEditor.; Badarch Tuyatsetseg guestEditor.; Nanda Priyadarsi guestEditor.; Puthal Deepak guestEditor.; Mohanty Saraju P. guestEditor.
• Is Part Of: Concurrency and computation. Volume 31:Number 23(2019)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2018-09-16
• Subjects: authentication -- one‐round -- provable security -- RFID -- timestamp -- yoking‐proof; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.4931
• Languages: English
• ISSNs: 1532-0626

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.