Anonymity for key-trees with adaptive adversaries
conference paper
Hash-lock authentication protocols for Radio Frequency IDentification (RFID) tags incur heavy search on the server. Key-trees have been proposed as a way to reduce search times, but because partial keys in such trees are shared, key compromise affects several tags. Buttyán [4] and Beye and Veugen [3] devised trees to withstand such attacks, but assumed adversaries to be non-adaptive, without access to side-channel information. We illustrate how in practice, side-channel information can be used to attack the system. We also describe adaptive attacks that are easy to mount and will significantly reduce tag anonymity. Theoretical analysis of the implications on anonymity in key-trees leads to new requirements and a new tree construction. Simulation is used to test its performance, the results showing an improved resistance to adaptive attacks. © 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering.
Topics
TNO Identifier
466451
Publisher
Springer
Source title
7th International ICST Conference on Security and Privacy in Communication Networks, SecureComm 2011, 7-9 September 2011, London, UK
Pages
409-425
Files
To receive the publication files, please send an e-mail request to TNO Repository.