Unlinkable Identification for Large-scale RFID Systems

Nohara Yasunobu, Nakamura Toru, Baba Kensuke, Inoue Sozo, Yasuura Hiroto

doi:10.2197/ipsjdc.2.489

Unlinkable Identification for Large-scale RFID Systems

DOI Web Site 参考文献1件オープンアクセス

Nohara Yasunobu

Kyushu University
Nakamura Toru

Kyushu University
Baba Kensuke

Kyushu University
Inoue Sozo

Kyushu University
Yasuura Hiroto

Kyushu University

書誌事項

公開日: 2006

DOI

10.2197/ipsjdc.2.489

公開者: 一般社団法人情報処理学会

この論文をさがす

CiNii Books

説明

Unlinkability, the property that prevents an adversary recognizing whether outputs are from the same user, is an important concept in RFID. Although hash-based schemes can provide unlinkability by using a low-cost hash function, existing schemes are not scalable since the server needs O(N) hash calculations for every ID matching, where N is the number of RFID devices. Our solution is the K-steps ID matching scheme, which can reduce the number of hash calculations on the server to O(logN). In this paper, we explain the protocol, describe a test implementation, and discuss the application of this scheme to practical RFID systems. We also compare the scheme with other hash-based schemes from various viewpoints.