How to protect privacy in floating car data systems

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.

[1]  Dipl.-Ing. Frank Gössel Informationsentropische, spektrale und statistische Untersuchungen fahrzeuggenerierter Verkehrsdaten unter besonderer Berücksichtigung der Auswertung und Dimensionierung von FCD-Systemen , 2004 .

[2]  Maxim Raya,et al.  The security of vehicular ad hoc networks , 2005, SASN '05.

[3]  S. Eichler Anonymous and Authenticated Data Provisioning for Floating Car Data Systems , 2006, 2006 10th IEEE Singapore International Conference on Communication Systems.

[4]  Panagiotis Papadimitratos,et al.  Securing Vehicular Communications - Assumptions, Requirements, and Principles , 2006 .

[5]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[6]  Levente Buttyán,et al.  On the Effectiveness of Changing Pseudonyms to Provide Location Privacy in VANETs , 2007, ESAS.

[7]  R. Poovendran,et al.  CARAVAN: Providing Location Privacy for VANET , 2005 .

[8]  David Chaum,et al.  Wallet Databases with Observers , 1992, CRYPTO.

[9]  Amos Fiat,et al.  How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.

[10]  Peter Schartner,et al.  Universally Unique Identifiers: How To Ensure Uniqueness While Protecting The Issuer's Privacy , 2007, Security and Management.

[11]  Dan Boneh,et al.  The Decision Diffie-Hellman Problem , 1998, ANTS.

[12]  Ronald Cramer,et al.  Modular Design of Secure yet Practical Cryptographic Protocols , 1997 .

[13]  C. P. Schnorr,et al.  Efficient Identification and Signatures for Smart Cards (Abstract) , 1989, EUROCRYPT.

[14]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[15]  Silvio Micali,et al.  How to construct random functions , 1986, JACM.

[16]  Tibor Juhas The use of elliptic curves in cryptography , 2007 .

[17]  Peng Ning,et al.  Privacy-Preserving Detection of Sybil Attacks in Vehicular Ad Hoc Networks , 2007, 2007 Fourth Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services (MobiQuitous).