Re-identifying anonymous nodes

  • Authors:
  • Stefan Schlott;Frank Kargl;Michael Weber

  • Affiliations:
  • Dept. of Media Informatics, University of Ulm;Dept. of Media Informatics, University of Ulm;Dept. of Media Informatics, University of Ulm

  • Venue:
  • LoCA'06 Proceedings of the Second international conference on Location- and Context-Awareness
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.