基于预测和滑动窗口的轨迹差分隐私保护机制

doi:10.11959/j.issn.1000-436x.2020049

Abstract

Abstract:

To address the issues of privacy budget and quality of service in trajectory differential privacy protection,a trajectory differential privacy mechanism integrating prediction disturbance was proposed.Firstly,Markov chain and exponential perturbation method were used to predict the location which satisfies the differential privacy and temporal and spatial security,and service similarity map was introduced to detect the availability of the location.If the prediction was successful,the prediction location was directly used to replace the location of differential disturbance,to reduce the privacy cost of continuous query and improve the quality of service.Based on this,the trajectory privacy budget allocation mechanism based on w sliding window was designed to ensure that any continuous w queries in the trajectory meet the ε-differential privacy and solve the trajectory privacy problem of continuous queries.In addition,a privacy customization strategy was designed based on the sensitivity map.By customizing the privacy sensitivity of semantic location,the privacy budget could be customized to improve its utilization.Finally,the validity of the scheme was verified by real data set experiment.The results illustrate that it offers the better privacy and quality of service.

Key words: location privacy, trajectory privacy, differential privacy, privacy accumulation

CLC Number:

TP309.2

Ayong YE,Lingyu MENG,Ziwen ZHAO,Yiqing DIAO,Jiaomei ZHANG. Trajectory differential privacy protection mechanism based on prediction and sliding window[J]. Journal on Communications, 2020, 41(4): 123-133.

Figures/Tables 8

References 17

[1]	MADDEN M , LENHART A , CORTESI S ,et al. Pew internet and american life project[J]. Washington,DC:Pew Research Center, 2010
[2]	DOBSON J E , FISHER P . Geoslavery[J]. Technology and Society Magazine, 2003,22(1): 47-52.
[3]	ANDRéS M E , BORDENABE N E , CHATZIKOKOLAKIS K . Geo-indistinguishability:differential privacy for location-based systems[C]// Proceedings of the 2013 ACM SIGSAC Conference on Computer ＆ Communications Security. New York:ACM Press, 2013: 901-914.
[4]	DWORK C , MCSHERRY F , NISSIM K . Calibrating noise to sensitivity in private data analysis[C]// Theory of Cryptography Conference. Berlin:Springer, 2006: 265-284.
[5]	GRUTESER M , GRUNWALD D . Anonymous usage of location-based services through spatial and temporal cloaking[C]// Proceedings of the 1st International Conference on Mobile Systems,Applications And Services. New York:ACM Press, 2003: 31-42.
[6]	NIU B , LI Q , ZHU X ,et al. Achieving k-anonymity in privacy-aware location-based services[C]// The 33rd Annual IEEE International Conference on Computer Communications. Piscataway:IEEE Press, 2014: 754-762.
[7]	HWANG R H , HSUEH Y L , CHUNG H W . A novel time-obfuscated algorithm for trajectory privacy protection[J]. IEEE Transactions on Services Computing, 2013,7(2): 126-139.
[8]	WANG J , LI Y , YANG D ,et al. Achieving effective k-anonymity for query privacy in location-based services[J]. IEEE Access, 2017(5): 24580-24592.
[9]	KIDO H , YANAGISAWA Y , SATOH T . Protection of location privacy using dummies for location-based services[C]// 21st International Conference on Data Engineering Workshops. Piscataway:IEEE Press, 2005: 1248-1248.
[10]	ANDRéS M E , BORDENABE N E , CHATZIKOKOLAKIS K . Geo-indistinguishability:differential privacy for location-based systems[C]// Proceedings of the 2013 ACM SIGSAC conference on Computer ＆ communications security. New York:ACM Press, 2013: 901-914.
[11]	XIAO Y , XIONG L . Protecting locations with differential privacy under temporal correlations[C]// ACM Sigsac Conference on Computer and Communications Security. New York:ACM Press, 2015: 1298-1309.
[12]	HUA J , TONG W , XU F . A geo-indistinguishable location perturbation mechanism for location-based services supporting frequent queries[J]. IEEE Transactions on Information Forensics and Security, 2017,13(5): 1155-1168.
[13]	吴云乘, 陈红, 赵素云 . 一种基于时空相关性的差分隐私轨迹保护机制[J]. 计算机学报, 2018,41(2): 309-322.
	WU Y C , CHEN H , ZHAO S Y . Differentially privacy trajectory protection based on spatial and temporal correlation[J]. Chinese Journal of Computers, 2018,41(2): 309-322.
[14]	CHATZIKOKOLAKIS K , PALAMIDESSI C , STRONATI M . A predictive differentially-private mechanism for mobility traces[M]// Privacy Enhancing Technologies. Berlin:Springer International Publishing, 2014.
[15]	叶阿勇, 李亚成, 马建峰 ,等. 基于服务相似性的 k-匿名位置隐私保护方法[J]. 通信学报, 2014,35(11): 162-169.
	YE A Y , LI Y C , MA J F ,et al. Location privacy-preserving method of k-anonymous based on service similarity[J]. Journal on Communications, 2014,35(11): 162-169.
[16]	ZHENG Y , XIE X , MA W Y . GeoLife:a collaborative social networking service among user,location and trajectory[J]. IEEE Data Engineering Bulletin, 2010,33(2): 32-39.
[17]	CHO E , MYERS S A , LESKOVEC J . Friendship and mobility:user movement in location-based social networks[C]// Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining. New York:ACM Press, 2011: 1082-1090.

Metrics

Recommended 0

No Suggested Reading articles found!

Trajectory differential privacy protection mechanism based on prediction and sliding window

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 8

References 17

Related Articles 15

Metrics

Recommended 0

[1]	Tao FENG, Liqiu CHEN, Junli FANG, Jianming SHI. Blockchain data sharing scheme based on localized difference privacy and attribute-based searchable encryption [J]. Journal on Communications, 2023, 44(5): 224-233.
[2]	Shengxing YU, Zekai CHEN, Zhong CHEN, Ximeng LIU. DAGUARD: distributed backdoor attack defense scheme under federated learning [J]. Journal on Communications, 2023, 44(5): 110-122.
[3]	Shufen ZHANG, Yanling DONG, Jingcheng XU, Haoshi WANG. AdaBoost algorithm based on target perturbation [J]. Journal on Communications, 2023, 44(2): 198-209.
[4]	Lingtao TANG, Di WANG, Shengyun LIU. Data augmentation scheme for federated learning with non-IID data [J]. Journal on Communications, 2023, 44(1): 164-176.
[5]	Chengsheng YUAN, Qiang GUO, Zhangjie FU. Copyright protection algorithm based on differential privacy deep fake fingerprint detection model [J]. Journal on Communications, 2022, 43(9): 181-193.
[6]	Hanyi WANG, Xiaoguang LI, Wenqing BI, Yahong CHEN, Fenghua LI, Ben NIU. Multi-level local differential privacy algorithm recommendation framework [J]. Journal on Communications, 2022, 43(8): 52-64.
[7]	Yong ZHANG, Dandan LI, Lu HAN, Xiaohong HUANG. Privacy-protected crowd-sensed data trading algorithm [J]. Journal on Communications, 2022, 43(5): 1-13.
[8]	Haiyan KANG, Yuanrui JI. Research on federated learning approach based on local differential privacy [J]. Journal on Communications, 2022, 43(10): 94-105.
[9]	Yan YAN, Yiming CONG, Mahmood Adnan, Quanzheng SHENG. Statistics release and privacy protection method of location big data based on deep learning [J]. Journal on Communications, 2022, 43(1): 203-216.
[10]	Si CHEN, Anmin FU, Mang SU, Huaijiang SUN. Trajectory privacy protection scheme based on differential privacy [J]. Journal on Communications, 2021, 42(9): 54-64.
[11]	Hongtao LI, Xiaoyu REN, Jie WANG, Jianfeng MA. Continuous location privacy protection mechanism based on differential privacy [J]. Journal on Communications, 2021, 42(8): 164-175.
[12]	Jianping CAI, Ximeng LIU, Jinbo XIONG, Zuobin YING, Yingjie WU. Approximation method of multiple consistency constraint under differential privacy [J]. Journal on Communications, 2021, 42(6): 107-117.
[13]	Suxia ZHU, Shulun LIU, Guanglu SUN. Shape similarity differential privacy trajectory protection mechanism based on relative entropy and K-means [J]. Journal on Communications, 2021, 42(2): 113-123.
[14]	Yang LIU, Jun LI, Wenyun CHEN, Mugen PENG. Research on endogenous security data sharing mechanism of F-RAN for 6G [J]. Journal on Communications, 2021, 42(1): 67-78.
[15]	Jie WANG,Chunru WANG,Jianfeng MA,Hongtao LI. Dummy location selection algorithm based on location semantics and query probability [J]. Journal on Communications, 2020, 41(3): 53-61.