Literature Database Entry

eckhoff2011slotswap

David Eckhoff, Christoph Sommer, Tobias Gansen, Reinhard German and Falko Dressler, "SlotSwap: Strong and Affordable Location Privacy in Intelligent Transportation Systems," IEEE Communications Magazine, vol. 49 (11), pp. 126–133, November 2011.

Abstract

Public acceptance, and thus the economical success of an Intelligent Transportation System (ITS), is highly dependent on the quality of deployed privacy mechanisms. In general, neither users nor operators should be able to track a given individual. One approach to facilitate this is the usage of pseudonym pools, which allow vehicles to autonomously switch between different identities. We extend this scheme with that of a time-slotted pseudonym pool of static size, reducing the storage and computation needs of the envisioned ITS while further improving users' privacy. In addition, we allow the exchange of pseudonyms between vehicles, eliminating the mapping between vehicles and pseudonyms even for the ITS operator. We support the exchange of both current and future pseudonyms, further enhancing users' privacy. We evaluate the feasibility of our approach and back up privacy claims by performing a simulative study of the system using the entropy of nodes' anonymity sets as the primary metric.

Quick access

Original Version DOI (at publishers web site)
Authors' Version PDF (PDF on this web site)
BibTeX BibTeX

Contact

David Eckhoff
Christoph Sommer
Tobias Gansen
Reinhard German
Falko Dressler

BibTeX reference

@article{eckhoff2011slotswap,
    author = {Eckhoff, David and Sommer, Christoph and Gansen, Tobias and German, Reinhard and Dressler, Falko},
    doi = {10.1109/MCOM.2011.6069719},
    title = {{SlotSwap: Strong and Affordable Location Privacy in Intelligent Transportation Systems}},
    pages = {126--133},
    journal = {IEEE Communications Magazine},
    issn = {0163-6804},
    publisher = {IEEE},
    month = {11},
    number = {11},
    volume = {49},
    year = {2011},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.

Last modified: 2024-04-18