Unlinkable Identification for Large-scale RFID Systems
-
- Nohara Yasunobu
- Kyushu University
-
- Nakamura Toru
- Kyushu University
-
- Baba Kensuke
- Kyushu University
-
- Inoue Sozo
- Kyushu University
-
- Yasuura Hiroto
- Kyushu University
この論文をさがす
説明
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.
収録刊行物
-
- Information and Media Technologies
-
Information and Media Technologies 1 (2), 1182-1190, 2006
Information and Media Technologies 編集運営会議
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390282680241641344
-
- NII論文ID
- 110004761970
- 130000058385
-
- NII書誌ID
- AN00116647
-
- ISSN
- 18827764
- 03875806
- 18810896
-
- HANDLE
- 10228/4531
-
- NDL書誌ID
- 8065812
-
- 本文言語コード
- en
-
- データソース種別
-
- JaLC
- IRDB
- NDL
- CiNii Articles
- KAKEN
-
- 抄録ライセンスフラグ
- 使用不可
