eckhoff2018readjusting
David Eckhoff and Christoph Sommer, "Readjusting the Privacy Goals in Vehicular Ad-hoc Networks: A Safety-preserving Solution Using Non-Overlapping Time-slotted Pseudonym Pools," Elsevier Computer Communications, vol. 122, pp. 118–128, June 2018.
Abstract
Current proposals for privacy measures in vehicular networking commonly suffer from either of three limitations: Many are so drastic that they compromise road traffic safety, a primary goal of vehicular networks. Others are more compliant, but (despite adding substantial overhead) are ineffective at protecting users’ privacy against state-of-the-art attackers. The last group suffers from neither limitation, but undermine accountability and are thus in conflict with the requirements of future vehicular networks. As a consequence, workable privacy protection is often thought unattainable and privacy protection simply disregarded in the many field experiments, proposals, and standardization documents to date. In this work, we start fresh with a readjusted view on privacy goals and the capacities of a state-of-the-art attacker in mind, taking a structured approach to deriving a holistic solution for location privacy protection in Vehicular Ad-Hoc Networks (VANETs): We show that local privacy protection cannot be attained without compromising road traffic safety - nor does it have to be. Our approach is based on synchronized time-slotted pseudonym pools and the local announcing of pseudonym changes. By this, we overcome the privacy–safety problem while at the same time increasing privacy for all users. Our system is fully compatible with the requirements of vehicular networks and current standardization efforts.
Quick access
- Original Version
(at publishers web site) - Authors' Version
(PDF on this web site) - BibTeX
Contact
BibTeX reference
@article{eckhoff2018readjusting,
author = {Eckhoff, David and Sommer, Christoph},
title = {{Readjusting the Privacy Goals in Vehicular Ad-hoc Networks: A Safety-preserving Solution Using Non-Overlapping Time-slotted Pseudonym Pools}},
journal = {Elsevier Computer Communications},
doi = {10.1016/j.comcom.2018.03.006},
issn = {0140-3664},
month = {June},
pages = {118--128},
publisher = {Elsevier},
volume = {122},
year = {2018},
}
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.
The following applies to all papers listed above that have IFIP copyrights: © IFIP, (YEAR). This is the author's version of the work. It is posted here by permission of IFIP for your personal use. Not for redistribution. The definitive version was published in PUBLICATION, {VOL#, ISS#, (DATE)}, http://IFIP DL URL.