Re-identifying Anonymous Nodes

  • Stefan Schlott
  • Frank Kargl
  • Michael Weber
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3987)


In mobile scenarios, privacy is an aspect of growing importance. In order to avoid the creation of movement profiles, participating nodes change their identifying properties on a regular basis in order to hide their identities and stay anonymous. The drawback of this action is that nodes which previously had a connection have no means to recognise this fact. A complete re-authentication would be necessary – if possible at all.

This paper discusses this new problem and proposes two possible solutions for re-identification of anonymous nodes, one based on symmetric encryption and one based on secure hashes.


Ubiquitous Computing Communication Partner Pervasive Computing Location Privacy Naive Approach 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Langheinrich, M.: Privacy by design - principles of privacy-aware ubiquitous systems. In: Abowd, G.D., Brumitt, B., Shafer, S. (eds.) UbiComp 2001. LNCS, vol. 2201, pp. 273–291. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  2. 2.
    Beresford, A.R., Stajano, F.: Location privacy in pervasive computing. IEEE Pervasive Computing 2, 46–55 (2003)CrossRefGoogle Scholar
  3. 3.
    Görlach, A., Heinemann, A., Terpstra, W.W.: Survey on location privacy in pervasive computing. In: Robinson, P., Vogt, H., Wagealla, W. (eds.) Privacy, Security and Trust within the Context of Pervasive Computing. The Kluwer International Series in Engineering and Computer Science, pp. 23–34. Kluwer Academic Publishers, Dordrecht (2005)CrossRefGoogle Scholar
  4. 4.
    Al-Muhtadi, J., Campbell, R., Kapadia, A., Mickunas, M.D., Yi, S.: Routing through the mist: Privacy preserving communication in ubiquitous computing environments. In: ICDCS 2002: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS 2002), p. 74. IEEE Computer Society, Los Alamitos (2002)Google Scholar
  5. 5.
    Perkins, C.: IP Mobility Support for IPv4. Internet Engineering Task Force: RFC 3220 (2002)Google Scholar
  6. 6.
    Crossbow: Mica motes (2005),
  7. 7.
    Gupta, V., Millard, M., Fung, S., Zhu, Y., Gura, N., Eberle, H., Shantz, S.C.: Sizzle: A standards-based end-to-end security architecture for the embedded internet (best paper). In: PerCom, pp. 247–256. IEEE Computer Society Press, Los Alamitos (2005)Google Scholar
  8. 8.
    Pfitzmann, A., Köhntopp, M.: Anonymity, Unobservability, and Pseudonymity - A Proposal for Terminology. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 1–9. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  9. 9.
    Pfitzmann, A., Köhntopp, M.: Anonymity, unlinkability, unobservability, pseudonymity, and identity management - a consolidated proposal for terminology (2005),
  10. 10.
    Schlott, S., Kargl, F., Weber, M.: Random IDs for preserving location privacy. In: SecureComm, pp. 415–417 (2005)Google Scholar
  11. 11.
    Dolev, D., Yao, A.C.C.: On the security of public key protocols. IEEE Transactions on Information Theory 29, 198–207 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Stajano, F.: Security for ubiquitous computing. Wiley, Chichester (2002)CrossRefGoogle Scholar
  13. 13.
    Stajano, F.: Security for whom? the shifting security assumptions of pervasive computing. In: Okada, M., Pierce, B.C., Scedrov, A., Tokuda, H., Yonezawa, A. (eds.) ISSS 2002. LNCS, vol. 2609, pp. 16–27. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  14. 14.
    Stinson, D.R.: Cryptography: Theory and Practice. CRC Press, Inc., Boca Raton (1995)zbMATHGoogle Scholar
  15. 15.
    Schnorr, C.P.: Efficient signature generation by smart cards. J. Cryptology 4, 161–174 (1991)CrossRefzbMATHGoogle Scholar
  16. 16.
    Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. J-CACM 24, 84–88 (1981)CrossRefGoogle Scholar
  17. 17.
    Kölsch, T., Fritsch, L., Kohlweiss, M., Kesdogan, D.: Privacy for profitable location based services. In: [28], pp. 164–178Google Scholar
  18. 18.
    Wishart, R., Henricksen, K., Indulska, J.: Context Obfuscation for Privacy via Ontological Descriptions. In: Strang, T., Linnhoff-Popien, C. (eds.) LoCA 2005. LNCS, vol. 3479, pp. 276–288. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  19. 19.
    Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18, 186–208 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Goldreich, O.: Zero-knowledge twenty years after its invention. Technical report, Weizmann Institute of Science, Israel (2002) (updated 2004)Google Scholar
  21. 21.
    Balfanz, D., Durfee, G., Shankar, N., Smetters, D., Staddon, J., Wong, H.C.: Secret handshakes from pairing-based key agreements. In: SP 2003: Proceedings of the 2003 IEEE Symposium on Security and Privacy, p. 180. IEEE Computer Society, Washington (2003)CrossRefGoogle Scholar
  22. 22.
    Abadi, M., Fournet, C.: Private authentication. Theor. Comput. Sci. 322, 427–476 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Sarma, S., Weis, S., Engels, D.: RFID Systems and Security and Privacy Implications. In: Kaliski Jr., B.S., Koç, Ç.K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 454–469. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  24. 24.
    Molnar, D., Wagner, D.: Privacy and security in library RFID: Issues, practices, and architectures. In: Pfitzmann, B., Liu, P. (eds.) Conference on Computer and Communications Security – ACM CCS, Washington, DC, USA, pp. 210–219. ACM Press, New York (2004)Google Scholar
  25. 25.
    Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory IT-22, 644–654 (1976)MathSciNetCrossRefzbMATHGoogle Scholar
  26. 26.
    Stajano, F., Anderson, R.: The resurrecting duckling: Security issues for ad-hoc wireless networks. In: Christianson, B., Crispo, B., Roe, M. (eds.) Security Protocols, 7th International Workshop Proceedings, pp. 172–194 (1999)Google Scholar
  27. 27.
    Hoepman, J.H.: Ephemeral pairing on anonymous networks. In: [28], pp. 101–116Google Scholar
  28. 28.
    Hutter, D., Ullmann, M. (eds.): SPC 2005. LNCS, vol. 3450. Springer, Heidelberg (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Stefan Schlott
    • 1
  • Frank Kargl
    • 1
  • Michael Weber
    • 1
  1. 1.Dept. of Media InformaticsUniversity of UlmGermany

Personalised recommendations