Minimizing information leakage of tree-based RFID authentication protocols using alternate tree-walking

Authors:
Kaleb Lee;Colin Boyd;Juan Manule González-Nieto
Affiliations:
Information Security Institute, Queensland University of Technology, Brisbane, Queensland, Australia;Information Security Institute, Queensland University of Technology, Brisbane, Queensland, Australia;Information Security Institute, Queensland University of Technology, Brisbane, Queensland, Australia
Venue:
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Year:
2012

Citing 4
Cited 0

Privacy and security in library RFID: issues, practices, and architectures

Proceedings of the 11th ACM conference on Computer and communications security
Quantifying information leakage in tree-based hash protocols (short paper)

ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
Optimal key-trees for tree-based private authentication

PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
Reducing time complexity in RFID systems

SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

The privacy of efficient tree-based RFID authentication protocols is heavily dependent on the branching factor at the top layer. Indefinitely increasing the branching factor, however, is not a practical option. This paper proposes an alternate tree-walking scheme as well as two protocols to circumvent this problem. The privacy of the resulting protocols is shown to be comparable to that of linear-time protocols, where there is no leakage of information, whilst reducing the computational load of the database by one-third of what is required of tree-based protocols during authentication. We also identify and address a limitation in quantifying privacy in RFID protocols.