Review: Privacy versus scalability in radio frequency identification systems

  • Authors:
  • Basel Alomair;Radha Poovendran

  • Affiliations:
  • Network Security Lab, University of Washington, Campus Box 352500, Seattle, WA 98195-2500, USA and Center of Excellence in Information Assurance (CoEIA), King Saud University, Riyadh, Saudi Arabia;Network Security Lab, University of Washington, Campus Box 352500, Seattle, WA 98195-2500, USA

  • Venue:
  • Computer Communications
  • Year:
  • 2010

Quantified Score

Hi-index 0.24

Visualization

Abstract

Embedding a Radio Frequency Identification (RFID) tag into individual items enables the unique identification of such items over the wireless medium, without the need for a line-of-sight path. One of the main challenges for the successful commercialization of the RFID technology is the efficient, yet private, identification of low-cost tags in the presence of adversaries attempting to illegally track users via tags in their possession. An RFID system consists of two functional components, namely, the interactive protocol between RFID reader-tag pairs and the reader-database information retrieval mechanism. Because of the large number of tags in a typical RFID system, the private identification of tags can be a challenging problem. In this paper, we investigate privacy-preserving RFID systems and classify them based on the computational efficiency of tag identification. We show the close relation between the degree of privacy achieved by the reader-tag interaction and the reader-database information retrieval complexity.