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

Yasunobu Nohara, Sozo Inoue, Hiroto Yasuura

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationARES 2008 - 3rd International Conference on Availability, Security, and Reliability, Proceedings
Pages717-722
Number of pages6
DOIs
Publication statusPublished - 2008
Event3rd International Conference on Availability, Security, and Reliability, ARES 2008 - Barcelona, Spain
Duration: Mar 4 2008Mar 7 2008

Publication series

NameARES 2008 - 3rd International Conference on Availability, Security, and Reliability, Proceedings

Other

Other3rd International Conference on Availability, Security, and Reliability, ARES 2008
Country/TerritorySpain
CityBarcelona
Period3/4/083/7/08

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Safety, Risk, Reliability and Quality

Fingerprint

Dive into the research topics of 'A secure high-speed identification scheme for RFID using Bloom filters'. Together they form a unique fingerprint.

Cite this