Literature Database Entry


Ikjot Saini, Sherif Saad and Arunita Jaekel, "Evaluating the effectiveness of pseudonym changing strategies for location privacy in vehicular ad-hoc network," Wiley Security and Privacy, 2019.


In a vehicular ad-hoc network, vehicles periodically broadcast safety messages to neighboring vehicles containing information about their identity, location, speed, and other relevant information. The time-critical nature of these messages means they are typically sent without encryption, which can compromise the privacy of the vehicle/driver. The use of pseudonyms, rather than the actual identity, has been suggested as a way to implement location privacy for drivers. However, such pseudonyms need to change frequently in order to prevent vehicle tracking. A pseudonym changing strategy (PCS) determines how frequently and under which conditions a vehicle should change its pseudonym. Many different PCS have been proposed in the literature over the last decade. However, there is a lack of a systematic analysis of the performance of these techniques, using a set of well-defined privacy metrics. In this article, we provide a thorough comparison of four main types of PCS, in terms of standard privacy metrics, and identify the advantages and limitations of each approach under different traffic conditions and attacker capabilities. The ultimate aim of this study is to help in the determination of the best PCS to use in different situations, to maximize the location privacy.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX


Ikjot Saini
Sherif Saad
Arunita Jaekel

BibTeX reference

    author = {Saini, Ikjot and Saad, Sherif and Jaekel, Arunita},
    doi = {10.1002/spy2.68},
    issn = {2475-6725},
    journal = {Wiley Security and Privacy},
    number = {0},
    publisher = {John Wiley \& Sons},
    title = {{Evaluating the effectiveness of pseudonym changing strategies for location privacy in vehicular ad-hoc network}},
    volume = {0},
    year = {2019},

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

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

This page was automatically generated using BibDB and bib2web.