A secure high-speed identification scheme for RFID using Bloom filters

Yasunobu Nohara, Sozo Inoue, Hiroto Yasuura

研究成果: 書籍/レポート タイプへの寄稿会議への寄与

8 被引用数 (Scopus)

抄録

As pervasive computing environments become popular, RFID tags are introduced into our daily life. However, there exists a privacy problem that an adversary can trace users' behavior by linking the tag's ID. Although a hash-chain scheme can solve this privacy problem, the scheme needs a long identification time or a large amount of memory. In this paper, we propose an efficient identification scheme using Bloom filters, which are space-efficient probabilistic data structures. Our Bloom pre-calculation scheme provides a high-speed identification with a small amount of memory by storing pre-calculated outputs of the tags in Bloom filters.

本文言語英語
ホスト出版物のタイトルARES 2008 - 3rd International Conference on Availability, Security, and Reliability, Proceedings
ページ717-722
ページ数6
DOI
出版ステータス出版済み - 2008
イベント3rd International Conference on Availability, Security, and Reliability, ARES 2008 - Barcelona, スペイン
継続期間: 3月 4 20083月 7 2008

出版物シリーズ

名前ARES 2008 - 3rd International Conference on Availability, Security, and Reliability, Proceedings

その他

その他3rd International Conference on Availability, Security, and Reliability, ARES 2008
国/地域スペイン
CityBarcelona
Period3/4/083/7/08

!!!All Science Journal Classification (ASJC) codes

  • コンピュータ サイエンス(全般)
  • 安全性、リスク、信頼性、品質管理

フィンガープリント

「A secure high-speed identification scheme for RFID using Bloom filters」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル