Minimizing Information Leakage of Tree-Based RFID Authentication Protocols Using Alternate Tree-Walking

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.

[1]  David A. Wagner,et al.  Privacy and security in library RFID: issues, practices, and architectures , 2004, CCS '04.

[2]  Jianying Zhou,et al.  Information and Communications Security , 2013, Lecture Notes in Computer Science.

[3]  David Evans,et al.  Quantifying Information Leakage in Tree-Based Hash Protocols (Short Paper) , 2006, ICICS.

[4]  Philippe Oechslin,et al.  Reducing Time Complexity in RFID Systems , 2005, Selected Areas in Cryptography.

[5]  Xu Huang,et al.  Quantifying Information Leakage in RFID Systems , 2008, 2008 10th International Conference on Advanced Communication Technology.

[6]  Aggelos Kiayias,et al.  Polynomial Reconstruction Based Cryptography , 2001, Selected Areas in Cryptography.

[7]  Levente Buttyán,et al.  Optimal Key-Trees for Tree-Based Private Authentication , 2006, Privacy Enhancing Technologies.

[8]  Levente Buttyán,et al.  Group-Based Private Authentication , 2007, 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.