Quantitative evaluation of unlinkable ID matching schemes

Yasunobu Nohara, Sozo Inoue, Kensuke Baba, Hiroto Yasuura

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

19 被引用数 (Scopus)

抄録

As pervasive computing environments become popular, RFID devices, such as contactless smart cards and RFID tags, are introduced into our daily life. However, there exists a privacy problem that a third party can trace user's behavior by linking device's ID. The concept of unlinkability, that a third party cannot recognize whether some outputs are from the same user, is important to solve the privacy problem. A scheme using hash function satisfies unlinkability against a third party by changing the outputs of RFID devices every time. However, the schemes are not scalable since the server needs O(N) hash calculations for every ID matching, where N is the number of RFID devices. In this paper, we propose the K-steps ID matching scheme, which can reduce the number of the hash calculations on the server to O(log N). Secondly, we propose a quantification of unlinkability using conditional entropy and mutual information. Finally, we analyze the K-steps ID matching scheme using the proposed quantification, and show the relation between the time complexity and unlinkability.

本文言語英語
ホスト出版物のタイトルWPES'05
ホスト出版物のサブタイトルProceedings of the 2005 ACM Workshop on Privacy in the Electronic Society
出版社Association for Computing Machinery (ACM)
ページ55-60
ページ数6
ISBN(印刷版)1595932283, 9781595932280
DOI
出版ステータス出版済み - 2005
イベントWPES'05: 2005 ACM Workshop on Privacy in the Electronic Society - Alexandria, VA, 米国
継続期間: 11 7 200511 7 2005

出版物シリーズ

名前WPES'05: Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society

その他

その他WPES'05: 2005 ACM Workshop on Privacy in the Electronic Society
国/地域米国
CityAlexandria, VA
Period11/7/0511/7/05

All Science Journal Classification (ASJC) codes

  • 工学(全般)

フィンガープリント

「Quantitative evaluation of unlinkable ID matching schemes」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル