Quantitative evaluation of unlinkable ID matching schemes

Yasunobu Nohara, Sozo Inoue, Kensuke Baba, Hiroto Yasuura

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

21 Citations (Scopus)

Abstract

As pervasive computing environments become popular, RFID devices, such as contactless smart cards and RFID tags, are introduced into our daily life. However, there exists a privacy problem that a third party can trace user's behavior by linking device's ID. The concept of unlinkability, that a third party cannot recognize whether some outputs are from the same user, is important to solve the privacy problem. A scheme using hash function satisfies unlinkability against a third party by changing the outputs of RFID devices every time. However, the schemes are not scalable since the server needs O(N) hash calculations for every ID matching, where N is the number of RFID devices. In this paper, we propose the K-steps ID matching scheme, which can reduce the number of the hash calculations on the server to O(log N). Secondly, we propose a quantification of unlinkability using conditional entropy and mutual information. Finally, we analyze the K-steps ID matching scheme using the proposed quantification, and show the relation between the time complexity and unlinkability.

Original languageEnglish
Title of host publicationWPES'05
Subtitle of host publicationProceedings of the 2005 ACM Workshop on Privacy in the Electronic Society
Pages55-60
Number of pages6
Publication statusPublished - Dec 1 2005
EventWPES'05: 2005 ACM Workshop on Privacy in the Electronic Society - Alexandria, VA, United States
Duration: Nov 7 2005Nov 7 2005

Publication series

NameWPES'05: Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society

Other

OtherWPES'05: 2005 ACM Workshop on Privacy in the Electronic Society
CountryUnited States
CityAlexandria, VA
Period11/7/0511/7/05

Fingerprint

Radio frequency identification (RFID)
Servers
Smart cards
Hash functions
Ubiquitous computing
Entropy

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Nohara, Y., Inoue, S., Baba, K., & Yasuura, H. (2005). Quantitative evaluation of unlinkable ID matching schemes. In WPES'05: Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society (pp. 55-60). (WPES'05: Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society).

Quantitative evaluation of unlinkable ID matching schemes. / Nohara, Yasunobu; Inoue, Sozo; Baba, Kensuke; Yasuura, Hiroto.

WPES'05: Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society. 2005. p. 55-60 (WPES'05: Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society).

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

Nohara, Y, Inoue, S, Baba, K & Yasuura, H 2005, Quantitative evaluation of unlinkable ID matching schemes. in WPES'05: Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society. WPES'05: Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society, pp. 55-60, WPES'05: 2005 ACM Workshop on Privacy in the Electronic Society, Alexandria, VA, United States, 11/7/05.
Nohara Y, Inoue S, Baba K, Yasuura H. Quantitative evaluation of unlinkable ID matching schemes. In WPES'05: Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society. 2005. p. 55-60. (WPES'05: Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society).
Nohara, Yasunobu ; Inoue, Sozo ; Baba, Kensuke ; Yasuura, Hiroto. / Quantitative evaluation of unlinkable ID matching schemes. WPES'05: Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society. 2005. pp. 55-60 (WPES'05: Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society).
@inproceedings{6980c00605144de48b8ca167fc91a535,
title = "Quantitative evaluation of unlinkable ID matching schemes",
abstract = "As pervasive computing environments become popular, RFID devices, such as contactless smart cards and RFID tags, are introduced into our daily life. However, there exists a privacy problem that a third party can trace user's behavior by linking device's ID. The concept of unlinkability, that a third party cannot recognize whether some outputs are from the same user, is important to solve the privacy problem. A scheme using hash function satisfies unlinkability against a third party by changing the outputs of RFID devices every time. However, the schemes are not scalable since the server needs O(N) hash calculations for every ID matching, where N is the number of RFID devices. In this paper, we propose the K-steps ID matching scheme, which can reduce the number of the hash calculations on the server to O(log N). Secondly, we propose a quantification of unlinkability using conditional entropy and mutual information. Finally, we analyze the K-steps ID matching scheme using the proposed quantification, and show the relation between the time complexity and unlinkability.",
author = "Yasunobu Nohara and Sozo Inoue and Kensuke Baba and Hiroto Yasuura",
year = "2005",
month = "12",
day = "1",
language = "English",
isbn = "1595932283",
series = "WPES'05: Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society",
pages = "55--60",
booktitle = "WPES'05",

}

TY - GEN

T1 - Quantitative evaluation of unlinkable ID matching schemes

AU - Nohara, Yasunobu

AU - Inoue, Sozo

AU - Baba, Kensuke

AU - Yasuura, Hiroto

PY - 2005/12/1

Y1 - 2005/12/1

N2 - As pervasive computing environments become popular, RFID devices, such as contactless smart cards and RFID tags, are introduced into our daily life. However, there exists a privacy problem that a third party can trace user's behavior by linking device's ID. The concept of unlinkability, that a third party cannot recognize whether some outputs are from the same user, is important to solve the privacy problem. A scheme using hash function satisfies unlinkability against a third party by changing the outputs of RFID devices every time. However, the schemes are not scalable since the server needs O(N) hash calculations for every ID matching, where N is the number of RFID devices. In this paper, we propose the K-steps ID matching scheme, which can reduce the number of the hash calculations on the server to O(log N). Secondly, we propose a quantification of unlinkability using conditional entropy and mutual information. Finally, we analyze the K-steps ID matching scheme using the proposed quantification, and show the relation between the time complexity and unlinkability.

AB - As pervasive computing environments become popular, RFID devices, such as contactless smart cards and RFID tags, are introduced into our daily life. However, there exists a privacy problem that a third party can trace user's behavior by linking device's ID. The concept of unlinkability, that a third party cannot recognize whether some outputs are from the same user, is important to solve the privacy problem. A scheme using hash function satisfies unlinkability against a third party by changing the outputs of RFID devices every time. However, the schemes are not scalable since the server needs O(N) hash calculations for every ID matching, where N is the number of RFID devices. In this paper, we propose the K-steps ID matching scheme, which can reduce the number of the hash calculations on the server to O(log N). Secondly, we propose a quantification of unlinkability using conditional entropy and mutual information. Finally, we analyze the K-steps ID matching scheme using the proposed quantification, and show the relation between the time complexity and unlinkability.

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

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

M3 - Conference contribution

AN - SCOPUS:33749005411

SN - 1595932283

SN - 9781595932280

T3 - WPES'05: Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society

SP - 55

EP - 60

BT - WPES'05

ER -