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.
Unable to display preview. Download preview PDF.
- 1.Avoine, G., Buttyán, L., Holczer, T., Vajda, I.: Group-based private authentication. In: IEEE International Workshop on Trust, Security, and Privacy for Ubiquitous Computing – TSPUC, Helsinki, Finland, pp. 1–6. IEEE Computer Society Press (June 2007)Google Scholar
- 4.Huang, X.: Quantifying information leakage in RFID systems. In: 10th International Conference on Advanced Communication Technology, vol. 1, pp. 84–89 (February 2008)Google Scholar
- 5.Lee, K., Nieto, J.G., Boyd, C.: Minimizing information leakage of tree-based RFID authentication protocols using alternate tree-walking (2012), http://eprints.qut.edu.au/49883/