Name
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1002/cpe.4931 | CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE |
Keywords | DocType | Volume |
authentication,one-round,provable security,RFID,timestamp,yoking-proof | Journal | 31.0 |
Issue | ISSN | Citations |
SP23.0 | 1532-0626 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Da-Zhi Sun | 1 | 1 | 1.37 |
| Ze-Guang Zhu | 2 | 0 | 0.34 |
| Guangquan Xu | 3 | 171 | 33.20 |
| Wei Guo | 4 | 442 | 146.38 |