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

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 - Aug 14 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
CountrySpain
CityBarcelona
Period3/4/083/7/08

Fingerprint

Radio frequency identification (RFID)
Identification (control systems)
Data storage equipment
Ubiquitous computing
Data structures

All Science Journal Classification (ASJC) codes

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

Cite this

Nohara, Y., Inoue, S., & Yasuura, H. (2008). A secure high-speed identification scheme for RFID using Bloom filters. In ARES 2008 - 3rd International Conference on Availability, Security, and Reliability, Proceedings (pp. 717-722). [4529413] (ARES 2008 - 3rd International Conference on Availability, Security, and Reliability, Proceedings). https://doi.org/10.1109/ARES.2008.83

A secure high-speed identification scheme for RFID using Bloom filters. / Nohara, Yasunobu; Inoue, Sozo; Yasuura, Hiroto.

ARES 2008 - 3rd International Conference on Availability, Security, and Reliability, Proceedings. 2008. p. 717-722 4529413 (ARES 2008 - 3rd International Conference on Availability, Security, and Reliability, Proceedings).

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

Nohara, Y, Inoue, S & Yasuura, H 2008, A secure high-speed identification scheme for RFID using Bloom filters. in ARES 2008 - 3rd International Conference on Availability, Security, and Reliability, Proceedings., 4529413, ARES 2008 - 3rd International Conference on Availability, Security, and Reliability, Proceedings, pp. 717-722, 3rd International Conference on Availability, Security, and Reliability, ARES 2008, Barcelona, Spain, 3/4/08. https://doi.org/10.1109/ARES.2008.83
Nohara Y, Inoue S, Yasuura H. A secure high-speed identification scheme for RFID using Bloom filters. In ARES 2008 - 3rd International Conference on Availability, Security, and Reliability, Proceedings. 2008. p. 717-722. 4529413. (ARES 2008 - 3rd International Conference on Availability, Security, and Reliability, Proceedings). https://doi.org/10.1109/ARES.2008.83
Nohara, Yasunobu ; Inoue, Sozo ; Yasuura, Hiroto. / A secure high-speed identification scheme for RFID using Bloom filters. ARES 2008 - 3rd International Conference on Availability, Security, and Reliability, Proceedings. 2008. pp. 717-722 (ARES 2008 - 3rd International Conference on Availability, Security, and Reliability, Proceedings).
@inproceedings{af93a9a1a8574c15856412952c1a7fdb,
title = "A secure high-speed identification scheme for RFID using Bloom filters",
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.",
author = "Yasunobu Nohara and Sozo Inoue and Hiroto Yasuura",
year = "2008",
month = "8",
day = "14",
doi = "10.1109/ARES.2008.83",
language = "English",
isbn = "0769531024",
series = "ARES 2008 - 3rd International Conference on Availability, Security, and Reliability, Proceedings",
pages = "717--722",
booktitle = "ARES 2008 - 3rd International Conference on Availability, Security, and Reliability, Proceedings",

}

TY - GEN

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

AU - Nohara, Yasunobu

AU - Inoue, Sozo

AU - Yasuura, Hiroto

PY - 2008/8/14

Y1 - 2008/8/14

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=49049102767&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=49049102767&partnerID=8YFLogxK

U2 - 10.1109/ARES.2008.83

DO - 10.1109/ARES.2008.83

M3 - Conference contribution

SN - 0769531024

SN - 9780769531021

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

SP - 717

EP - 722

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

ER -