The Community for Technology Leaders
RSS Icon
Subscribe
Mar. 4, 2008 to Mar. 7, 2008
ISBN: 978-0-7695-3102-1
pp: 717-722
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.
INDEX TERMS
RFID, Hash-chain scheme, Bloom filter, High-speed identification, Bloom pre-computation scheme
CITATION
Yasunobu Nohara, Sozo Inoue, Hiroto Yasuura, "A Secure High-Speed Identification Scheme for RFID Using Bloom Filters", ARES, 2008, 2012 Seventh International Conference on Availability, Reliability and Security, 2012 Seventh International Conference on Availability, Reliability and Security 2008, pp. 717-722, doi:10.1109/ARES.2008.83
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool