计算机应用研究2017，Vol.34Issue(2)：532-535,4.DOI:10.3969/j.issn.1001-3695.2017.02.047
基于连续近邻服务请求的位置匿名方法的研究
Research on dummy-based location privacy protection for continuous proximity requests
摘要
Abstract
Due to user's privacy threat increased in location based services (LBSs),various location privacy-preserving Mechanisms have been proposed in the literature to address the privacy risks derived from the exposure of user locations through the use of LBSs.One of typical anonymization methods is dummy-based approach.However,previous approaches have the slow server processing and long delay.This paper proposed an improved algorithm based on temporal locality for continuous proximity requests,instead of updating proximity relationship with repetitive computation.It could effectively improve the processing speed,reduce the response delay.An empirical study shows that the new algorithm has obvious advantages in efficiency compared with traditional dummy-based approach for continuous location-based proximity query requests.关键词
位置信息服务/冗余查询/隐私保护/服务质量Key words
location-based services/dummy-based approach/privacy protection/service quality分类
信息技术与安全科学引用本文复制引用
赵欢,万交龙,陈佐..基于连续近邻服务请求的位置匿名方法的研究[J].计算机应用研究,2017,34(2):532-535,4.基金项目
湖南省科技厅科学研究计划资助项目(2014FJ4161) （2014FJ4161）
长沙市科技厅科研计划资助项目(k1403027-11) （k1403027-11）
