CLPS: context-based location privacy scheme for VANETs
by Ines Khacheba; Mohamed B. Yagoubi; Nasreddine Lagraa; Abderrahmane Lakas
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 29, No. 1/2, 2018

Abstract: Location privacy preservation is considered as a challenge for deploying vehicular ad hoc networks (VANETs). In fact, the continuous periodical broadcast of spatiotemporal information in beacons allows a global passive adversary (GPA) to link pseudonyms and reconstruct vehicle traces. Consequently, it is imperative that a vehicle selects the right context to change pseudonym to confuse the adversary and ensure pseudonyms unlinkability. In this paper, we propose a context-based location privacy scheme (CLPS) that makes the following contributions: i) a pseudonym changing strategy that allows a vehicle to change pseudonyms based on its context; ii) a linkability threat, called cheating attack that negatively affects the proposed pseudonym changing strategy. A cheating detection mechanism is developed to allow a vehicle to detect misbehaving vehicles that launch the cheating attack, and assess the success of the pseudonym change. Finally, we evaluate CLPS against GPA by simulations using privacy extension, PREXT, in Veins, and we compare it against different existing privacy schemes.

Online publication date: Wed, 29-Aug-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email