Optimal key-trees for tree-based private authentication

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4258 LNCS, Issue , 2006, Pages 332-350

  Buttyán, Levente ^a   Holczer, Tamás ^a   Vajda, István ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION DELAYS; LOWER BOUNDS; PRIVATE AUTHENTICATION; PROBLEM OF PRIVACY; SIMULATION RESULT; SYMMETRIC KEY CRYPTOGRAPHY; SYSTEM DESIGNERS; TREE-BASED; TREE-BASED APPROACH;

DATA PRIVACY;

AUTHENTICATION;

EID: 52449113611     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11957454_19     Document Type: Conference Paper

References (14)

1. G. Avoine, E. Dysli, and P. Oechslin. Reducing time complexity in RFID systems. In Proceedings of the 12th Annual Workshop on Selected Areas in Cryptography (SAC'05), 2005.
2. C. Boyd, A. Mathuria. Protocols for Authentication and Key Establishment. Springer-Verlag, 2003
3. J. Camenisch, A. Lysyanskaya. A Efficient Non-transferable Anonymous Multishow Credential System with Optional Anonymity Revocation. In Advances in Cryptography - EUROCRYPT 2001. Springer, 2001.
4. D. Chaum. The Dining Cryptographers Problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1(1):65-75, 1988.
5. C. Díaz, S. Seys, J. Claessens, and B. Preneel. Towards measuring anonymity. In Dingledine and Syverson (Eds.), Designing Privacy Enhancing Technologies, Springer LNCS 2482, pp. 54-68, 2002.
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. A. Juels. RFID security and privacy: a research survey. Manuscript, condensed version will appear in the IEEE Journal on Selected Areas in Communication, September 2005.
10. Kerberos. RFC 1510, http://www.ietf.org/rfc/rfc1510.txt
11. D. Molnar and D. Wagner. Privacy and security in library RFID: issues, practices, and architectures. In Proceedings of the ACM Conference on Computer and Communications Security, 2004.
12. Y. Nohara, S. Inoue, K. Baba, H. Yasuura. Quantitative Evaluation of Unlinkable ID Matching Schemes. In Workshop on Privacy in the Electronic Society, WPES, 2005.
13. A. Pfitzmann and M. Khntopp. Anonymity, unobservability and pseudonymity - a proposal for terminology. In Proceedings of the Privacy Enhancing Technologies (PET) Workshop, Springer LNCS 2009, pp. 1-9, 2001.
14. A. Serjantov and G. Danezis. Towards an information theoretic metric for anonymity. In Proceedings of the Privacy Enhancing Technologies (PET) Workshop, Springer LNCS, 2002.