Abstract
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Ɣn 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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Avoine, G., ButtyĆ”n, L., Holczer, T., Vajda, I.: Group-based private authentication. In: IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, pp. 1ā6 (2007)
Avoine, G., Oechslin, P.: A Scalable and Provably Secure Hash Based RFID Protocol. In: International Workshop on Pervasive Computing and Communication Security ā PerSec 2005, pp. 110ā114. IEEE, IEEE Computer Society, Kauai Island (2005)
Beye, M., Veugen, T.: Anonymity for Key-trees with Adaptive Adversaries. In: Rajarajan, M., Piper, F., Wang, H., Kesidis, G. (eds.) SecureComm 2011. LNICST, vol. 96, Springer, Heidelberg (2012)
ButtyĆ”n, L., Holczer, T., Vajda, I.: Optimal Key-Trees for Tree-Based Private Authentication. In: Danezis, G., Golle, P. (eds.) PET 2006. LNCS, vol. 4258, pp. 332ā350. Springer, Heidelberg (2006)
DamgĆ„rd, I., Pedersen, M.Ć.: RFID Security: Tradeoffs between Security and Efficiency. In: Malkin, T. (ed.) CT-RSA 2008. LNCS, vol. 4964, pp. 318ā332. Springer, Heidelberg (2008)
DĆaz, C.: Anonymity Metrics Revisited. In: Dolev, S., Ostrovsky, R., Pfitzmann, A. (eds.) Anonymous Communication and its Applications. Dagstuhl Seminar Proceedings, vol. 05411. Internationales Begegnungs-und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany (2006)
Hellman, M.: A cryptanalytic time-memory trade-off. IEEE Transactions on Information Theory 26, 401ā406 (1980)
Juels, A., Weis, S.A.: Defining Strong Privacy for RFID. In: PERCOMW 2007: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops, pp. 342ā347. IEEE Computer Society, Washington, DC (2007)
Molnar, D., Wagner, D.: Privacy and security in library RFID: issues, practices, and architectures. In: CCS 2004: Proceedings of the 11th ACM Conference on Computer and Communications Security, pp. 210ā219. ACM, New York (2004)
Nohara, Y., Nakamura, T., Baba, K., Inoue, S., Yasuura, H.: Unlinkable identification for large-scale rfid systems. Information and Media Technologies 1(2), 1182ā1190 (2006)
Nohl, K., Evans, D.: Quantifying Information Leakage in Tree-Based Hash Protocols (Short Paper). In: Ning, P., Qing, S., Li, N. (eds.) ICICS 2006. LNCS, vol. 4307, pp. 228ā237. Springer, Heidelberg (2006)
Nohl, K., Evans, D.: Hiding in groups: On the expressiveness of privacy distributions. In: 23rd International Information Security Conference (SEC 2008), Milan (September 2008)
Ohkubo, M., Suzuki, K., Kinoshita, S.: Cryptographic Approach to āPrivacy-Friendlyā Tags. In: RFID Privacy Workshop. MIT, MA (2003)
Pfitzmann, A., Kƶhntopp, M.: Anonymity, Unobservability, and Pseudonymity - A Proposal for Terminology. In: Federrath, H. (ed.) Anonymity 2000. LNCS, vol. 2009, pp. 1ā9. Springer, Heidelberg (2001)
Samarati, P., Sweeney, L.: Generalizing data to provide anonymity when disclosing information. In: Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), Seattle, WA, USA, p. 188 (1998)
Veugen, T., Beye, M.: Matlab code for āimproved anonimity of key-treesā. In: RFIDsec (2012), http://isplab.tudelft.nl/content/improved-anonimity-key-trees
Weis, S.A., Sarma, S.E., Rivest, R.L., Engels, D.W.: Security and Privacy Aspects of Low-Cost Radio Frequency Identification Systems. In: Hutter, D., MĆ¼ller, G., Stephan, W., Ullmann, M. (eds.) Security in Pervasive Computing 2003. LNCS, vol. 2802, pp. 201ā212. Springer, Heidelberg (2004)
Yeo, S.-S., Kim, S.K.: Scalable and Flexible Privacy Protection Scheme for RFID Systems. In: Molva, R., Tsudik, G., Westhoff, D. (eds.) ESAS 2005. LNCS, vol. 3813, pp. 153ā163. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Veugen, T., Beye, M. (2013). Improved Anonymity for Key-Trees. In: Hoepman, JH., Verbauwhede, I. (eds) Radio Frequency Identification. Security and Privacy Issues. RFIDSec 2012. Lecture Notes in Computer Science, vol 7739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36140-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-36140-1_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36139-5
Online ISBN: 978-3-642-36140-1
eBook Packages: Computer ScienceComputer Science (R0)