查询分割的用户协作隐私保护方法  

A user collaborative privacy protection scheme based on query division

作　　者：王斌 张国印[1] 张磊[2] WANG Bin;ZHANG Guoyin;ZHANG Lei(College of Computer Science and Technology,Harbin Engineering University,Harbin 150001,China;College of Information and Electronic Technology,Jiamusi University,Jiamusi 154007,China)

机构地区：[1]哈尔滨工程大学计算机科学与技术学院,黑龙江哈尔滨150001 [2]佳木斯大学信息电子技术学院,黑龙江佳木斯154007

出　　处：《哈尔滨工程大学学报》2020年第4期569-576,共8页Journal of Harbin Engineering University

基　　金：中国博士后基金项目(2019M661260);黑龙江省自然科学基金优秀青年项目(YQ2019F018);黑龙江省普通本科高等学校青年创新人才培养计划项目(UNPYSCT-2017149);黑龙江省普通本科高等学校基本科研业务费科研项目(2018-KYYWF-0937);佳木斯大学优秀学科团队项目(JDXKTD-2019008).

摘　　要：针对用户协作隐私保护方法忽略个性化隐私且无法有效的应对连续查询的问题,本文提出了一种用户协作的隐私保护方法。该方法采用用户查询信息进行分割随机交换,同时对查询结果缓存来提供连续服务结果的隐私保护。该方法一方面能够为用户提供快照和连续查询下的基于位置服务的隐私保护;另一方面能够同时提供个性化的隐私保护服务,最大程度的保障了所有协作用户对于隐私保护和服务质量的平衡要求。本文通过安全性分析验证了所提出的算法的隐私保护能力,并通过实验验证进一步证明了该方法在提供高于其他同类算法隐私保护能力基础上,具有更好的算法执行效率。In order to cope with the defects existed in the scheme of user collaboration,such as ignoring personal privacy,not able to respond to continuous query effectively,this paper provides a user collaborative privacy protection scheme,which adopts user query information for segmentation and random exchange,and caches the query results for providing privacy protection of continual service results.On the one hand,it can provide location-based privacy protection for users in the case of snapshot and continual query;and on the other hand,it can provide individualized privacy protection service,so as to assusre the balance requirements of all collaborative users for privacy protection and service quality as much as possible.Through security analysis,the ability of privacy protection of the proposed method is verified,and further,through experiments,it verifies that the method has a better performance efficacy on the basis of providing a higher privacy protection ability than other similar algorithms.

关 键 词：基于位置服务 隐私保护 用户协作 查询分割 快照和连续查询 个性化隐私 缓存 服务质量平衡 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]