WEKO3
アイテム
Unlinkable Identification for Large-scale RFID Systems
https://ipsj.ixsq.nii.ac.jp/records/67730
https://ipsj.ixsq.nii.ac.jp/records/67730b0c8d09e-7caa-442a-91a2-7612a57d7c4b
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL4708004.pdf (289.6 kB)
|
Copyright (c) 2009 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2006-08-15 | |||||||
| タイトル | ||||||||
| タイトル | Unlinkable Identification for Large-scale RFID Systems | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | Unlinkable Identification for Large-scale RFID Systems | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | 特集：ユビキタス社会を支えるコンピュータセキュリティ技術 | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| 著者所属 | ||||||||
| Kyushu University | ||||||||
| 著者所属 | ||||||||
| Kyushu University | ||||||||
| 著者所属 | ||||||||
| Kyushu University | ||||||||
| 著者所属 | ||||||||
| Kyushu University | ||||||||
| 著者所属 | ||||||||
| Kyushu University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Kyushu University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Kyushu University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Kyushu University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Kyushu University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Kyushu University | ||||||||
| 著者名 |
Yasunobu, Nohara
× Yasunobu, Nohara
|
|||||||
| 著者名(英) |
Yasunobu, Nohara
× Yasunobu, Nohara
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | Unlinkability, the property that prevents an adversary recognizing whether outputs are fromthe same user, is an important concept in RFID. Although hash-based schemes can provideunlinkability by using a low-cost hash function, existing schemes are not scalable since theserver needs O(N) hash calculations for every ID matching, where N is the number of RFIDdevices. Our solution is the K-steps ID matching scheme, which can reduce the number ofhash calculations on the server to O(logN). In this paper, we explain the protocol, describea 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. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 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. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AN00116647 | |||||||
| 書誌情報 |
情報処理学会論文誌 巻 47, 号 8, p. 2362-2370, 発行日 2006-08-15 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-7764 | |||||||
