Privacy-Preserving Compressive Sensing for Crowdsensing based Trajectory Recovery

被引:57
作者
Kong, Linghe [1 ,3 ]
He, Liang [2 ]
Liu, Xiao-Yang [3 ]
Gu, Yu [4 ]
Wu, Min-You [3 ]
Liu, Xue [1 ]
机构
[1] McGill Univ, Montreal, PQ H3A 2T5, Canada
[2] Univ Michigan, Ann Arbor, MI 48109 USA
[3] Shanghai Jiao Tong Univ, Shanghai 200030, Peoples R China
[4] IBM Res Austin, Austin, TX USA
来源
2015 IEEE 35TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS | 2015年
关键词
D O I
10.1109/ICDCS.2015.12
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Location based services have experienced an explosive growth and evolved from utilizing a single location to the whole trajectory. Due to the hardware and energy constraints, there are usually many missing data within a trajectory. In order to accurately recover the complete trajectory, crowdsensing provides a promising method. This method resorts to the correlation among multiple users' trajectories and the advanced compressive sensing technique, which significantly outperforms conventional interpolation methods on accuracy. However, as trajectories exposes users' daily activities, the privacy issue is a major concern in crowdsensing. While existing solutions independently tackle the accurate trajectory recovery and privacy issues, yet no single design is able to address these two challenges simultaneously. Therefore in this paper, we propose a novel Privacy Preserving Compressive Sensing (PPCS) scheme, which encrypts a trajectory with several other trajectories while maintaining the homomorphic obfuscation property for compressive sensing. Under PPCS, adversaries can only capture the encrypted data, so the user privacy is preserved. Furthermore, the homomorphic obfuscation property guarantees that the recovery accuracy of PPCS is comparable to the state-of-the-art compressive sensing design. Based on two publicly available traces with numerous users and long durations, we conduct extensive simulations to evaluate PPCS. The results demonstrate that PPCS achieves a high accuracy of <53 m and a large distortion between the encrypted and the original trajectories (a commonly adopted metric of privacy strength) of >9,000 m even when up to 50% original data are missing.
引用
收藏
页码:31 / 40
页数:10
相关论文
共 36 条
[1]   DISTRIBUTION OF DISTANCE BETWEEN RANDOM POINTS [J].
ALAGAR, VS .
JOURNAL OF APPLIED PROBABILITY, 1976, 13 (03) :558-566
[2]   Matrix Completion With Noise [J].
Candes, Emmanuel J. ;
Plan, Yaniv .
PROCEEDINGS OF THE IEEE, 2010, 98 (06) :925-936
[3]   Casper: Query Processing for Location Services without Compromising Privacy [J].
Chow, Chi-Yin ;
Mokbel, Mohamed F. ;
Aref, Walid G. .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 2009, 34 (04)
[4]   IMPROVED ERROR-BOUNDS FOR UNDERDETERMINED SYSTEM SOLVERS [J].
DEMMEL, JW ;
HIGHAM, NJ .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1993, 14 (01) :1-14
[5]   Compressed sensing [J].
Donoho, DL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (04) :1289-1306
[6]  
Feng ZN, 2014, IEEE INFOCOM SER, P1231, DOI 10.1109/INFOCOM.2014.6848055
[7]   Mobile Crowdsensing: Current State and Future Challenges [J].
Ganti, Raghu K. ;
Ye, Fan ;
Lei, Hui .
IEEE COMMUNICATIONS MAGAZINE, 2011, 49 (11) :32-39
[8]  
Ghinita G., 2008, ACM SIGMOD
[9]   Anonymous usage of location-based services through spatial and temporal cloaking [J].
Gruteser, M ;
Grunwald, D .
PROCEEDINGS OF MOBISYS 2003, 2003, :31-42
[10]  
Hegde C., 2014, ACM SIAM SODA