Optimal Key-Trees for Tree-Based Private Authentication
Key-tree based private authentication has been proposed by Molnar and Wagner as a neat way to efficiently solve the problem of privacy preserving authentication based on symmetric key cryptography. However, in the key-tree based approach, the level of privacy provided by the system to its members may decrease considerably if some members are compromised. In this paper, we analyze this problem, and show that careful design of the tree can help to minimize this loss of privacy. First, we introduce a benchmark metric for measuring the resistance of the system to a single compromised member. This metric is based on the well-known concept of anonymity sets. Then, we show how the parameters of the key-tree should be chosen in order to maximize the system’s resistance to single member compromise under some constraints on the authentication delay. In the general case, when any member can be compromised, we give a lower bound on the level of privacy provided by the system. We also present some simulation results that show that this lower bound is quite sharp. The results of this paper can be directly used by system designers to construct optimal key-trees in practice; indeed, we consider this as the main contribution of our work.
KeywordsSpringer LNCS Authentication Delay Privacy Enhance Technology Automate Fare Collection Potential Prover
Unable to display preview. Download preview PDF.
- 2.Boyd, C., Mathuria, A.: Protocols for Authentication and Key Establishment. Springer, Heidelberg (2003)Google Scholar
- 6.Elektra Hungaria (In Hungarian), http://www.gkm.gov.hu/data/357863/kovetelmeny1215.pdf
- 7.IKE, The Internet Key Exchange, RFC 2409, http://www.ietf.org/rfc/rfc2409.txt
- 8.ISO 9798-2. Mechanisms using symmetric encipherment algorithms, http://www.iso.org
- 9.Juels, A.: RFID security and privacy: a research survey. manuscript, condensed version will appear in the IEEE Journal on Selected Areas in Communication (September 2005)Google Scholar
- 10.Kerberos. RFC 1510, http://www.ietf.org/rfc/rfc1510.txt
- 11.Molnar, D., Wagner, D.: Privacy and security in library RFID: issues, practices, and architectures. In: Proceedings of the ACM Conference on Computer and Communications Security (2004)Google Scholar
- 12.Nohara, Y., Inoue, S., Baba, K., Yasuura, H.: Quantitative Evaluation of Unlinkable ID Matching Schemes. In: Workshop on Privacy in the Electronic Society, WPES (2005)Google Scholar
- 14.Serjantov, A., Danezis, G.: Towards an information theoretic metric for anonymity. In: Proceedings of the Privacy Enhancing Technologies (PET) Workshop. LNCS, Springer, Heidelberg (2002)Google Scholar