Literature Database Entry


A. Boualouache and S. Moussaoui, "S2SI: A Practical Pseudonym Changing Strategy for Location Privacy in VANETs," Proceedings of International Conference on Advanced Networking Distributed Systems and Applications (INDS 2014), Bejaia, June 2014, pp. 70-75.


Location privacy remains an open issue in VANETs. Although, frequently pseudonym changing is commonly accepted as solution to protect privacy in VANETs, many studies have been shown its weakness to provide the required level of privacy protection. In this paper, we propose a practical pseudonym changing strategy, called Silence & Swap at Signalized Intersection (S2SI). S2SI consists of two protocols, one for creating of safe silent mix zones and another for exchanging pseudonyms between vehicles under the control of RSUs within these zones. We evaluate the provided privacy protection of our strategy by developing anonymity set analytic model and by performing a simulative study of the strategy using the entropy of vehicles' anonymity set as the primary metric.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX


A. Boualouache
S. Moussaoui

BibTeX reference

    author = {Boualouache, A. and Moussaoui, S.},
    title = {{S2SI: A Practical Pseudonym Changing Strategy for Location Privacy in VANETs}},
    booktitle = {International Conference on Advanced Networking Distributed Systems and Applications (INDS 2014)},
    pages = {70-75},
    keywords = {data privacy;mobility management (mobile radio);protocols;telecommunication security;vehicular ad hoc networks;RSU;S2SI;VANET;anonymity set analytic model;location privacy;privacy protection;protocols;pseudonym changing strategy;roadside units;silence {\&} swap at signalized intersection;vehicle anonymity set;vehicular ad hoc networks;Entropy;Privacy;Protocols;Roads;Safety;Vehicles;Vehicular ad hoc networks;Privacy;Pseudonym Changing;Security;VANETs},
    year = {2014},
    month = {June},
    address = {Bejaia},
    publisher = {IEEE},
    doi = {10.1109/INDS.2014.20},

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.