skip to main content
10.1145/1102199.1102212acmconferencesArticle/Chapter ViewAbstractPublication PagesccsConference Proceedingsconference-collections
Article

Quantitative evaluation of unlinkable ID matching schemes

Published: 07 November 2005 Publication History

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.

References

[1]
Stephan A. Weis, Sanjay E. Sarma, Ronald L. Rivest, and Daniel W. Engels, "Security and Privacy Aspects of Low-Cost Radio Frequency Identification Systems", International Conference on Security in Pervasive Computing 2003, LNCS 2802, pp.201--212, 2004.]]
[2]
Miyako Ohkubo, Koutarou Suzuki and Shingo Kinoshita, "Cryptographic Approach to a Privacy Friendly Tag", RFID Privacy Workshop@MIT, 2003.]]
[3]
Miyako Ohkubo, Koutarou Suzuki, Shingo Kinoshita, "Hash-Chain Based Forward-Secure Privacy Protection Scheme for Low-Cost RFID", Proc. of the 2004 Symposium on Cryptography and Information Security(SCIS2004), Vol.1, pp.719--724, Jan. 2004.]]
[4]
Gildas Avoine and Philippe Oechslin, "A Scalable and Provably Secure Hash-Based RFID Protocol", 2nd International Workshop on Pervasive Computing and Communications Security(PerSec2005), pp.110--114, Mar. 2005.]]
[5]
Andreas Pfitzmann and Marit Köhntopp, "Anonymity, Unobservability, and Pseudonymity - A Proposal for Terminology", International Workshop on Design Issues in Anonymity and Unobservability, LNCS2009, pp.1--9, 2000.]]
[6]
Claudia Díaz, Stefaan Seys, Joris Claessens, and Bart Preneel, "Towards measuring anonymity", Workshop on Privacy Enhancing Technologies 2002, LNCS 2482, pp. 54--68, 2002.]]
[7]
Andrei Serjantov and George Danezis, "Towards an Information Theoretic Metric for Anonymity", Workshop on Privacy Enhancing Technologies 2002, LNCS 2482, pp. 41--53, 2002.]]
[8]
Claudia Díaz, Joris Claessens, Stefaan Seys, and Bart Preneel, "Information Theory and Anonymity", Proceedings of the 23rd Symposium on Information Theory, pp. 179--186, May. 2002.]]
[9]
Sandra Steinbrecher and Stefan Köpsell, "Modelling unlinkability", Workshop on Privacy Enhancing Technologies 2003, LNCS2760, pp. 32--47, 2003.]]
[10]
Yasunobu Nohara, Sozo Inoue, Kensuke Baba, and Hiroto Yasuura, "Unlinkable ID Matching Protocol for Large-scale RFID Systems", Proc. of the 2005 Symposium on Cryptography and Information Security (SCIS2005), Vol.3, pp.1567--1572, Jan. 2005. (in Japanese)]]
[11]
David Molnar and David Wagner, "Privacy and Security in Library: RFID Issues, Practices, and Architectures", Proc. of Computer and Communication Security 2004, pp.210--219, Oct. 2004.]]

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
WPES '05: Proceedings of the 2005 ACM workshop on Privacy in the electronic society
November 2005
116 pages
ISBN:1595932283
DOI:10.1145/1102199
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 November 2005

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. RFID security
  2. degree of unlinkability
  3. k-steps ID matching
  4. privacy

Qualifiers

  • Article

Conference

CCS05
Sponsor:

Acceptance Rates

Overall Acceptance Rate 106 of 355 submissions, 30%

Upcoming Conference

CCS '25

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 24 Dec 2024

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media