|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
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
| ASCII Text | x | ||
| Yasunobu Nohara, Sozo Inoue, Hiroto Yasuura, "A Secure High-Speed Identification Scheme for RFID Using Bloom Filters," 2012 Seventh International Conference on Availability, Reliability and Security, pp. 717-722, 2008 Third International Conference on Availability, Reliability and Security, 2008. | |||
| BibTex | x | ||
| @article{ 10.1109/ARES.2008.83, author = {Yasunobu Nohara and Sozo Inoue and Hiroto Yasuura}, title = {A Secure High-Speed Identification Scheme for RFID Using Bloom Filters}, journal ={2012 Seventh International Conference on Availability, Reliability and Security}, volume = {0}, year = {2008}, isbn = {978-0-7695-3102-1}, pages = {717-722}, doi = {http://doi.ieeecomputersociety.org/10.1109/ARES.2008.83}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2012 Seventh International Conference on Availability, Reliability and Security TI - A Secure High-Speed Identification Scheme for RFID Using Bloom Filters SN - 978-0-7695-3102-1 SP717 EP722 A1 - Yasunobu Nohara, A1 - Sozo Inoue, A1 - Hiroto Yasuura, PY - 2008 KW - RFID KW - Hash-chain scheme KW - Bloom filter KW - High-speed identification KW - Bloom pre-computation scheme VL - 0 JA - 2012 Seventh International Conference on Availability, Reliability and Security ER - | |||
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.