|
|
- 2018
基于缓存候选结果集的轨迹隐私保护方法
|
Abstract:
在基于位置服务的连续范围查询过程中，针对相交区域需要重复查询的问题，提出一种基于缓存候选结果集的轨迹隐私保护方法。该方法采用二级缓存机制，分别在用户端和匿名器中缓存用户查询得到的候选结果集，供用户移动轨迹上的后续查询点使用，以减少用户与服务器之间的交互，降低用户信息暴露给服务器的风险。同时通过基于Markov模型的移动位置预测方法进行k-匿名，提高缓存的命中率。安全分析表明该方法能有效保护用户的轨迹隐私。实验结果显示该方法能减小服务器的计算和通信开销。
| [1] | PRIMAULT V, BOUTET A, MOKHTAR S B, et al. Adaptive location privacy with ALP[C]//Proceedings of the 35th Symposium on Reliable Distributed Systems (SRDS). New Jersey, USA:IEEE, 2016:269-278. |
| [2] | YI X, PAULET R, BERTINO E, et al. Practical approximate k nearest neighbor queries with location and query privacy[J]. IEEE Transactions on Knowledge and Data Engineering, 2016, 28(6):1546-1559. |
| [3] | 张少波, 刘琴, 王国军. 基于网格标识匹配的位置隐私保护方法[J]. 电子与信息学报, 2016, 38(9):2173-2179. ZHANG Shao-bo, LIU Qin, WANG Guo-jun. The method of location privacy protection based on grid identifier matching[J]. Journal of Electronics & Information Technology, 2016, 38(9):2173-2179. |
| [4] | SHOKRI R, THEODORAKOPOULOS G, PAPADIMITRATOS P, et al. Hiding in the mobile crowd:Location privacy through collaboration[J]. IEEE transactions on Dependable and Secure Computing, 2014, 11(3):266-279. |
| [5] | CORSER G P, FU H R, BANIHANI A. Evaluating location privacy in vehicular communications and applications[J]. IEEE Transactions on Intelligent Transportation Systems, 2016, 17(9):2658-2667. |
| [6] | ZHENG V, ZHENG Y, XIE X, et al. Collaborative location and activity recommendations with GPS history data[C]//Proceeding of the 19th International Conference on World Wide Web. New York, USA:ACM, 2010:1029-1038. |
| [7] | 周长利, 马春光, 杨松涛. 路网环境下保护LBS位置隐私的连续KNN查询方法[J]. 计算机研究与发展, 2015, 52(11):2628-2644. ZHOU Chang-li, MA Chun-guang, YANG Song-tao. Location privacy-preserving method for LBS continuous KNN query in road networks[J]. Journal of Computer Research and Development, 2015, 52(11):2628-2644. |
| [8] | ZHANG Y, TONG W, ZHONG S. On designing satisfaction-ratio-aware truthful incentive mechanisms for k-anonymity location privacy[J]. IEEE Transactions on Information Forensics and Security, 2016, 11(11):2528-2541. |
| [9] | NIU B, LI Q, ZHU X, et al. Enhancing privacy through caching in location-based services[C]//Proceeding of the IEEE INFOCOM 2015. New Jersey, USA:IEEE, 2015:1017-1025. |
| [10] | XIAO C, CHEN Z, WANG X, et al. DeCache:a decentralized two-level cache for mobile location privacy protection[C]//Proceedings of the Sixth International Conference on Ubiquitous and Future Networks(ICUFN). New Jersey, USA:IEEE, 2014:81-86. |
| [11] | CHEN M, LIU Y, YU X. NLPMM:a next location predictor with Markov modeling[C]//Proceeding of the 18th Pacific-Asia Conference on Knowledge Discovery and Data Mining. New York, USA:Springer, 2014:186-197. |
| [12] | 李雯, 夏士雄, 刘峰, 等. 基于运动趋势的移动对象位置预测[J]. 通信学报, 2014, 35(2):46-53. LI Wen, XIA Shi-xiong, LIU Feng, et al. Location prediction algorithm based on movement tendency[J]. Journal of Communications, 2014, 35(2):46-53. |
| [13] | 张学军, 桂小林, 伍忠东. 位置服务隐私保护研究综述[J]. 软件学报, 2015, 26(9):2373-2395. ZHANG Xue-jun, GUI Xiao-lin, WU Zhong-dong. Privacy preservation for location-based services:a survey[J]. Journal of Software, 2015, 26(9):2373-2395. |
| [14] | CHOW C Y, MOKBEL M F, LIU Xuan. A peer-to-peer spatial cloaking algorithm for anonymous location-based service[C]//Proceedings of the 14th Annual ACM International Symposium on Advances in Geographic Information Systems. New York, USA:ACM, 2006:171-178. |
| [15] | GEDIK B, LIU L. Protecting location privacy with personalized k-anonymous:Architecture and algorithms[J]. IEEE Transaction on Mobile Computing, 2008, 7(1):1-18. |
| [16] | 霍峥, 孟小峰, 黄毅. PrivateChechIn:一种移动社交网络中的轨迹隐私保护方法与进展[J]. 计算机学报, 2013, 36(4):716-726. HUO Zheng, MENG Xiao-feng, Huang Yi. PrivateChechIn:Trajectory privacy-preserving for chech-in services in MSNS[J]. Chinese journal of computers, 2013, 36(4):716-726. |
| [17] | HWANG R H, HSUEH Y L, CHUNG H W. A novel time-obfuscated algorithm for trajectory privacy protection[J]. IEEE Transactions on Services Computing, 2014, 7(2):126-139. |
| [18] | BRINKHOFF T. Generating traffic data[J]. Bulletin of the Technical Committee Data Engineering, 2003, 26(2):19-25. |
