A k-anonymous location privacy protection method of dummy based on approximate matching

doi:10.13195/j.kzyjc.2018.0783

	A k-anonymous location privacy protection method of dummy based on approximate matching
	Zhang, Yong-Bing 1,2; Zhang, Qiu-Yu 1; Li, Zong-Yi 2; Duan, Hong-Xiang 1; Zhang, Mo-Yi 1
刊名	Kongzhi yu Juece/Control and Decision
	2020
卷号	35 期号:1 页码:65-73
关键词	Data privacy Efficiency Location Quality of service Semantics Telecommunication services Approximate matching Candidate sets Dummy Location privacy protection Physical dispersion Privacy protection Semantic features Semantic similarity
ISSN号	10010920
DOI	10.13195/j.kzyjc.2018.0783
英文摘要	In order to improve the efficiency of dummy generation and the query service quality in the k-anonymous location privacy protection method of dummy, and to solve the problem of that the preprocessing is complex and the geographic semantic features are not fully considered in dummy location generation, a k-anonymous location privacy protection method of dummy based on approximate matching is proposed. Firstly, the area is divided into several square grids, and the coordinates of each location are converted to Morton code. Then, through the approximate matching between the Morton codes of different locations, a candidate set of dummies is generated, and the locations in it are non adjacent to each other and distributed in different grids. Finally, by matching approximately geographic names information of locations, the semantic similarity between any two locations in the candidate set is obtained, and k-1 locations with the minimum semantic similarity are selected as dummies. Experimental results show that the method can ensure the physical dispersion and semantic diversity, and can improve the efficiency of dummy generation. At the same time, the balance between privacy protection security and query service quality is achieved. © 2020, Editorial Office of Control and Decision. All right reserved.
语种	中文
出版者	Northeast University
内容类型	期刊论文
源URL	[http://ir.lut.edu.cn/handle/2XXMBERH/115269]
专题	计算机与通信学院
作者单位	1.School of Computer and Communication, Lanzhou University of Technology, Lanzhou; 730050, China; 2.Department of Electrical Engineering, Gansu Institute of Mechanical & Electrical Engineering, Tianshui; 741001, China
推荐引用方式 GB/T 7714	Zhang, Yong-Bing,Zhang, Qiu-Yu,Li, Zong-Yi,et al. A k-anonymous location privacy protection method of dummy based on approximate matching[J]. Kongzhi yu Juece/Control and Decision,2020,35(1):65-73.
APA	Zhang, Yong-Bing,Zhang, Qiu-Yu,Li, Zong-Yi,Duan, Hong-Xiang,&Zhang, Mo-Yi.(2020).A k-anonymous location privacy protection method of dummy based on approximate matching.Kongzhi yu Juece/Control and Decision,35(1),65-73.
MLA	Zhang, Yong-Bing,et al."A k-anonymous location privacy protection method of dummy based on approximate matching".Kongzhi yu Juece/Control and Decision 35.1(2020):65-73.