Security analysis and complexity comparison of some recent lightweight RFID protocols

  • Authors:
  • Ehsan Vahedi;Rabab K. Ward;Ian F. Blake

  • Affiliations:
  • Department of Electrical and Computer Engineering, The University of British Columbia, Vancouver, Canada;Department of Electrical and Computer Engineering, The University of British Columbia, Vancouver, Canada;Department of Electrical and Computer Engineering, The University of British Columbia, Vancouver, Canada

  • Venue:
  • CISIS'11 Proceedings of the 4th international conference on Computational intelligence in security for information systems
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Using RFID tags can simplify many applications and provide many benefits, but the privacy of the customers should be taken into account. A potential threat for the privacy of a user is that anonymous readers can obtain information about the tags in the system. In order to address the security issues of RFID systems, various schemes have been proposed. Among the various solutions, lightweight protocols have attracted much attention as they are more appropriate for the limited architecture of RFID tags. In this paper, we perform the security analysis of five lightweight protocols proposed in [1-4] and discuss their advantages and security issues. The computational complexity of these lightweight protocols are also compared in this work.