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. © 2012 Springer-Verlag.
CITATION STYLE
Lee, K., Boyd, C., & González-Nieto, J. M. (2012). Minimizing information leakage of tree-based RFID authentication protocols using alternate tree-walking. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7372 LNCS, pp. 434–441). https://doi.org/10.1007/978-3-642-31448-3_33
Mendeley helps you to discover research relevant for your work.