Improved Anonymity for Key-trees
bookPart
Randomized hash-lock protocols for Radio Frequency IDentification (RFID) tags offer forward untraceability, but 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´an et al. have defined measures for the resulting loss of anonymity in the system, and approximated their measures by means of simulations. We will further improve upon their trees, and provide a proof of optimality. Finally, an efficient recursive algorithm is presented to compute the anonymity measures.
TNO Identifier
463785
Publisher
Springer
Source title
Radio Frequency Identification. Security and Privacy Issues. 8th International Workshop, RFIDSec 2012, Nijmegen, The Netherlands, July 2-3, 2012, Revised Selected Papers
Editor(s)
Hoepman, J.H.
et al
et al
Place of publication
Berlin : [etc]
Pages
31-43