How to protect privacy in floating car data systems
- 15 September 2008
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
Floating Car Data (FCD) is a valuable source of up-to-date traffic information, with a wide range of applications. Active floating car data techniques require drivers to have their vehicles equipped with on-board units regularly transmitting position and velocity information to a central server. Many potential participants are hence reluctant to join FCD projects because of violations of their privacy due to permanent traceability or possible liability in case of speed limit violations. We present a general method for anonymization of floating car data by deriving pseudonyms for trips and samples with the optional ability of relating samples to trips and trips to each other, whilst hiding the identity of a driver, hence protecting his privacy. The resulting concepts are easy to implement and can be used as building blocks for any FCD system with stringent security constraints. The main advantage of our approach is the guaranteed uniqueness of pseudonyms that can be achieved efficiently, i.e. without any communication between vehicles.Keywords
This publication has 10 references indexed in Scilit:
- Privacy-Preserving Detection of Sybil Attacks in Vehicular Ad Hoc NetworksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- Anonymous and Authenticated Data Provisioning for Floating Car Data SystemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- The security of vehicular ad hoc networksPublished by Association for Computing Machinery (ACM) ,2005
- Wallet Databases with ObserversPublished by Springer Science and Business Media LLC ,2001
- How To Prove Yourself: Practical Solutions to Identification and Signature ProblemsPublished by Springer Science and Business Media LLC ,2000
- Use of Elliptic Curves in CryptographyPublished by Springer Science and Business Media LLC ,2000
- The Decision Diffie-Hellman problemPublished by Springer Science and Business Media LLC ,1998
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- How to construct random functionsJournal of the ACM, 1986
- New directions in cryptographyIEEE Transactions on Information Theory, 1976