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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Schlott, S., Kargl, F., & Weber, M. (2006). Re-identifying anonymous nodes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3987 LNCS, pp. 103–115). Springer Verlag. https://doi.org/10.1007/11752967_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
