Trajectory privacy-preserving method based on information entropy suppression

doi:10.11772/j.issn.1001-9081.2018040861

Journal of Computer Applications ›› 2018, Vol. 38 ›› Issue (11): 3252-3257.DOI: 10.11772/j.issn.1001-9081.2018040861

Previous Articles Next Articles

Trajectory privacy-preserving method based on information entropy suppression

WANG Yifei^1,2, LUO Yonglong^1,2, YU Qingying^1,2, LIU Qingqing^1,2, CHEN Wen^1,2

1. School of Computer and Information, Anhui Normal University, Wuhu Anhui 241003, China;
2. Anhui Provincial Key Laboratory of Network and Information Security, Anhui Normal University, Wuhu Anhui 241003, China

Received:2018-04-25 Revised:2018-07-12 Online:2018-11-10 Published:2018-11-10
Supported by:
This work is partially supported by the National Natural Science Foundation of China (61672039, 61702010), the Natural Science Foundation of Anhui Province (1808085MF172), the University Natural Science Research Program of Anhui Province (KJ2017A327), the Science and Technology Project of Wuhu City (2016cxy04).

基于信息熵抑制的轨迹隐私保护方法

汪逸飞^1,2, 罗永龙^1,2, 俞庆英^1,2, 刘晴晴^1,2, 陈文^1,2

1. 安徽师范大学计算机与信息学院, 安徽芜湖 241003;
2. 安徽师范大学网络与信息安全安徽省重点实验室, 安徽芜湖 241003

通讯作者: 汪逸飞
作者简介:汪逸飞(1993-),男,安徽潜山人,硕士研究生,主要研究方向:信息安全、隐私保护;罗永龙(1972-),男,安徽太湖人,教授,博士生导师,博士,CCF会员,主要研究方向:信息安全、空间数据处理;俞庆英(1980-),女,安徽黄山人,副教授,博士研究生,主要研究方向:空间数据处理、信息安全;刘晴晴(1994-),安徽宿州人,硕士研究生,主要研究方向:信息安全、隐私保护;陈文(1979-),男,安徽铜陵人,教授,博士研究生,主要研究方向:空间数据处理、信息安全。
基金资助:
国家自然科学基金资助项目（61672039，61702010）；安徽省自然科学基金面上项目（1808085MF172）；安徽高校自然科学研究重点项目（KJ2017A327）；芜湖市科技计划项目（2016cxy04）。

Abstract

Abstract: Aiming at the problem of poor data anonymity and large data loss caused by excessive suppression of traditional high-dimensional trajectory privacy protection model, a new trajectory-privacy method based on information entropy suppression was proposed. A flowgraph based on entropy was generated for the trajectory dataset, a reasonable cost function according to the information entropy of spatio-temproal points was designed, and the privacy was preserved by local suppression of spatio-temproal points. Meanwhile, an improved algorithm for comparing the similarity of flowgraphs before and after suppression was proposed, and a function for evaluating the privacy gains was introduced.Finally, the proposed method was compared with the LK-Local (Length K-anonymity based on Local suppression) approach in trajectory privacy and data practicability. The experimental results on a synthetic subway transportation system dataset show that, with the same anonymous parameter value the proposed method increases the similarity measure by about 27%, reduces the data loss by about 25%, and increases the privacy gain by about 21%.

Key words: privacy-preserving, trajectory suppression, spatio-temproal point, flowgraph, information entropy

摘要： 针对传统高维轨迹隐私保护模型抑制点数过多而导致的数据匿名性差及数据损失大的问题，提出了一种基于信息熵抑制的轨迹隐私保护方法。通过为轨迹数据建立基于熵的流量图，根据轨迹时空点信息熵大小设计合理的花费代价函数，局部抑制时空点以达到隐私保护的目的；同时改进了一种比较抑制前后流量图相似性的算法，并提出了一个衡量隐私收益的函数；最后，与LK-Local方法进行了轨迹隐私度与数据实用性的比较。在模拟地铁交通运输系统数据集上的实验结果表明，与LK-Local方法相比，在相同的匿名参数取值下，所提方法在相似性度量上提高了约27%，在数据损失度量上降低了约25%，在隐私收益上提高了约21%。

关键词: 隐私保护, 轨迹抑制, 时空点, 流量图, 信息熵

CLC Number:

TP309.2

WANG Yifei, LUO Yonglong, YU Qingying, LIU Qingqing, CHEN Wen. Trajectory privacy-preserving method based on information entropy suppression[J]. Journal of Computer Applications, 2018, 38(11): 3252-3257.

汪逸飞, 罗永龙, 俞庆英, 刘晴晴, 陈文. 基于信息熵抑制的轨迹隐私保护方法[J]. 计算机应用, 2018, 38(11): 3252-3257.

References

[1] TERROVITIS M, POULIS G, MAMOULIS N, et al. Local suppression and splitting techniques for privacy-preserving publication of trajectories[J]. IEEE Transactions on Knowledge & Data Engineering, 2017, 29(7):1466-1479.
[2] XIN Y, XIE Z Q, YANG J. The privacy-preserving method for dynamic trajectory releasing based on adaptive clustering[J]. Information Sciences, 2017, 378(C):131-143.
[3] 霍峥, 孟小峰. 轨迹隐私保护技术研究[J]. 计算机学报, 2011, 34(10):1820-1830.(HUO Z, MENG X F. A survey of trajectory privacy-preserving techniques[J]. Chinese Journal of Computers, 2011, 34(10):1820-1830.)
[4] TERROVITIS M, MAMOULIS N. Privacy preservation in the publication of trajectories[C]//Proceedings of the 9th International Conference on Mobile Data Management. Piscataway, NJ:IEEE, 2008:65-72.
[5] CHEN R, FUNG B C M, MOHAMMED N, et al. Privacy-preserving trajectory data publishing by local suppression[J].Information Sciences, 2013, 231(1):83-97.
[6] KOMISHANI E G, ABADI M, DELDAR F. PPTD:Preserving personalized privacy in trajectory data publishing by sensitive attribute generalization and trajectory local suppression[J]. Knowledge-Based Systems, 2016, 94:43-59.
[7] 赵婧, 张渊, 李兴华,等. 基于轨迹频率抑制的轨迹隐私保护方法[J]. 计算机学报, 2014, 37(10):2096-2106.(ZHAO J, ZHANG Y, LI X H, et al. A trajectory privacy protection approach via trajectory frequency suppression[J]. Chinese Journal of Computers, 2014, 37(10):2096-2106.)
[8] GHASEMZADEH M, FUNG B C M, CHEN R, et al. Anonymizing trajectory data for passenger flow analysis[J]. Transportation Research Part C:Emerging Technologies, 2014, 39(2):63-79.
[9] SHANNON C E. A mathematical theory of communication[J]. ACM SIGMOBILE Mobile Computing and Communications Review, 2001, 5(1):3-55.
[10] 王彩梅,郭亚军,郭艳华.位置服务中用户轨迹的隐私度量[J]. 软件学报, 2012, 23(2):352-360.(WANG C M, GUO Y J, GUO Y H. Privacy metric for user's trajectory in location-based services[J]. Journal of Software, 2012, 23(2):352-360.)
[11] ABUL O, BONCHI F, NANNI M. Never walk alone:Uncertainty for anonymity in moving objects databases[C]//Proceedings of the 2008 International Conference on Data Engineering. Washington, DC:IEEE Computer Society, 2008:376-385.
[12] ATZORI M, SAYGIN Y. Towards trajectory anonymization:a generalization-based approach[C]//Proceedings of the SIGSPATIAL ACM GIS 2008 International Workshop on Security and Privacy in GIS and LBS. New York:ACM,2008:52-61.
[13] HUO Z, MENG X, HU H, et al. You can walk alone:trajectory privacy-preserving through significant stays protection[C]//Proceedings of the 17th International Conference on Database Systems for Advanced Applications. Berlin:Springer-Verlag,2012:351-366.
[14] AROVOY R, BONCHI F, LAKSHMANAN L V S, et al. Anonymizing moving objects:how to hide a MOB in a crowd?[C]//Proceedings of the 12th International Conference on Extending Database Technology:Advances in Database Technology. New York:ACM,2009:72-83.
[15] MOHAMMED N, FUNG B C M, HUNG P C K, et al. Anonymizing healthcare data:a case study on the blood transfusion service[C]//Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York:ACM,2009:1285-1294.
[16] LIN S, LIAO M. Towards publishing set-valued data with high utility[J]. Journal of Computational Information Systems, 2014, 10(22):9487-9501.
[17] AGHDAM M R S, SONEHARA N. Achieving high data utility k-anonymization using similarity-based clustering model[J]. IEICE Transactions on Information and Systems, 2016,99(8):2069-2078.
[18] HUDA M N, YAMADA S, SONEHARA N. On enhancing utility in k-anonymization[J]. International Journal of Computer Theory and Engineering, 2012, 4(4):527-532.

Trajectory privacy-preserving method based on information entropy suppression

基于信息熵抑制的轨迹隐私保护方法

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics

[1]	WANG Zhihe, CHANG Xiaoqing, DU Hui. Adaptive affinity propagation clustering algorithm based on universal gravitation [J]. Journal of Computer Applications, 2021, 41(5): 1337-1342.
[2]	ZHANG En, LI Huimin, CHANG Jian. Verifiable k-means clustering scheme with privacy-preserving [J]. Journal of Computer Applications, 2021, 41(2): 413-421.
[3]	YUAN Yuan, WU Wen, WAN Yi. Single image shadow detection method based on entropy driven domain adaptive learning [J]. Journal of Computer Applications, 2020, 40(7): 2131-2136.
[4]	ZHANG Wu, CHEN Hongmei. Hyperspectral band selection based on multi-kernelized fuzzy rough set and grasshopper optimization algorithm [J]. Journal of Computer Applications, 2020, 40(5): 1425-1430.
[5]	CHEN Chengjun, MAO Yingchi, WANG Yichao. CNN model compression based on activation-entropy based layer-wise iterative pruning strategy [J]. Journal of Computer Applications, 2020, 40(5): 1260-1265.
[6]	TONG Yuzhen, WANG Yingming. Multi-attribute group decision making method for probabilistic linguistic term set based on regret theory and distance from average solution method [J]. Journal of Computer Applications, 2020, 40(11): 3152-3158.
[7]	ZHANG Wu, CHEN Hongmei. Hyperspectral band selection algorithm based on kernelized fuzzy rough set [J]. Journal of Computer Applications, 2020, 40(1): 258-263.
[8]	LI Zhen, YAO Hanbing, MU Yicheng. Secure ranked search scheme based on Simhash over encrypted data [J]. Journal of Computer Applications, 2019, 39(9): 2623-2628.
[9]	DING Lianjing, LIU Guangshuai, LI Xurui, CHEN Xiaowen. Face recognition combining weighted information entropy with enhanced local binary pattern [J]. Journal of Computer Applications, 2019, 39(8): 2210-2216.
[10]	MAO Yingchi, CAO Hai, PING Ping, LI Xiaofang. Feature selection based on maximum conditional and joint mutual information [J]. Journal of Computer Applications, 2019, 39(3): 734-741.
[11]	NING Xueli, LUO Yonglong, XING Kai, ZHENG Xiaoyao. Frequent location privacy-preserving algorithm based on geosocial network [J]. Journal of Computer Applications, 2018, 38(3): 688-692.
[12]	DING Feifei, YANG Wenyuan. Video object segmentation via information entropy constraint [J]. Journal of Computer Applications, 2018, 38(10): 2782-2787.
[13]	ZHANG Yaling, WANG Ting, WANG Shangping. Incremental frequent pattern mining algorithm for privacy-preserving [J]. Journal of Computer Applications, 2018, 38(1): 176-181.
[14]	HUO Zheng, CUI Honglei, HE Ping. k-CS algorithm: trajectory data privacy-preserving based on semantic location protection [J]. Journal of Computer Applications, 2018, 38(1): 182-187.
[15]	HUO Zheng, WANG Weihong, CAO Yuhui. PTDC:privacy-aware trajectory data collection technology under road network constraint [J]. Journal of Computer Applications, 2017, 37(9): 2567-2571.