2008 Third International Conference on Availability, Reliability and Security A Secure High-Speed Identification Scheme for RFID Using Bloom Filters March 04-March 07 ISBN: 978-0-7695-3102-1
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ARES.2008.83
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, pp.717-722, 2008 Third International Conference on Availability, Reliability and Security, 2008 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb