S2SI: A Practical Pseudonym Changing Strategy for Location Privacy in VANETs
Authors:
- Abdelwahab BoualouacheABAbdelwahab Boualouache
- Samira MoussaouiSMSamira Moussaoui
- 1 June 2014
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 70-75
Abstract
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.Keywords
This publication has 14 references indexed in Scilit:
- SlotSwap: strong and affordable location privacy in intelligent transportation systemsIEEE Communications Magazine, 2011
- Pseudonym Changing at Social Spots: An Effective Strategy for Location Privacy in VANETsIEEE Transactions on Vehicular Technology, 2011
- Research challenges in intervehicular communication: lessons of the 2010 Dagstuhl SeminarIEEE Communications Magazine, 2011
- Bidirectionally Coupled Network and Road Traffic Simulation for Improved IVC AnalysisIEEE Transactions on Mobile Computing, 2010
- On the Effectiveness of Changing Pseudonyms to Provide Location Privacy in VANETs2007
- Privacy in VANETs using Changing Pseudonyms - Ideal and Real2007 IEEE 65th Vehicular Technology Conference - VTC2007-Spring, 2007
- Securing vehicular ad hoc networksJournal of Computer Security, 2007
- Swing & swap2006
- Location privacy in pervasive computingIEEE Pervasive Computing, 2003
- The dining cryptographers problem: Unconditional sender and recipient untraceabilityJournal of Cryptology, 1988