Privacy Protection Method for Vehicle Trajectory Based on VLPR Data

With the rapid development of data acquisition technology, data acquisition departments can collect increasingly more data. Various data from government agencies are gradually becoming available to the public, including license plate recognition (VLPR) data. As a result, privacy protection is becomi...

Full description

Saved in:
Bibliographic Details
Main Authors: Hua Chen, Chen Xiong, Jia-meng Xie, Ming Cai
Format: Article
Language:English
Published: Wiley 2020-01-01
Series:Journal of Advanced Transportation
Online Access:http://dx.doi.org/10.1155/2020/6026140
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:With the rapid development of data acquisition technology, data acquisition departments can collect increasingly more data. Various data from government agencies are gradually becoming available to the public, including license plate recognition (VLPR) data. As a result, privacy protection is becoming increasingly significant. In this paper, an adversary model based on passing time, color, type, and brand of VLPR data is proposed. Through experimental analysis, the tracking probability of a vehicle’s trajectory can be more than 94% if utilizing the original data. To decrease the tracking probability, a novel approach called the (m, n)-bucket model based on time series is proposed since previous works, such as those using generalization and bucketization models, cannot deal with data with multiple sensitive attributes (SAs) or data with time correlations. Meanwhile, a mathematical model is established to expound the privacy protection principle of the (m, n)-bucket model. By comparing the average calculated linking probability of all individuals and the actual linking probability, it is shown that the mathematical model that is proposed can well expound the privacy protection principle of the (m, n)-bucket model. Extensive experiments confirm that our technique can effectively prevent trajectory privacy disclosures.
ISSN:0197-6729
2042-3195