摘要
针对当前已有的基于位置服务隐私保护技术在用户较少的情况下很难保障用户隐私保护级别的情况,借鉴网格计算和密码学理论,提出了一种改进的位置隐匿方法。该方法利用随机变化的网格区域,在移动节点之间进行简单位置计算并实时进行用户位置更新,通过移动终端和匿名服务器之间的协同计算完成位置隐匿。最后,通过理论分析阐述了该方法所具有轨迹不可追踪性和身份不可关联性等特点。同时,仿真实验进一步表明该方法的计算复杂度和通信复杂度满足位置服务中的即时通信的要求。
In order to cope with the problem of privacy reduction with the decrease of the number of users in the vicinity, an improved location anonymity method based on the concept of grid computing and theory of cryp- tograph is proposed. In this method, a random mesh is used to generalize the location of the user, and the loca- tion updating is obtained by simple calculation between mobile nodes and the location cloak server, and then lo- cation k-anonymity is realized by the collaborative computing between the mobile terminal and the anonymous server. Finally, a theoretical analysis is proposed to illustrate that the method has the following characteristics： trajectory untraceability and identification unlinkability. At the same time, simulation results show that the computational complexity and communication complexity of the proposed method can meet the requirements of real-time communication in location services.
出处
《系统工程与电子技术》
EI
CSCD
北大核心
2018年第2期422-426,共5页
Systems Engineering and Electronics
基金
国家自然科学基金(61472097)
黑龙江省自然科学基金(F2015022)
黑龙江省博士后基金(3236310370)
佳木斯大学骨干人才支持计划项目(JMSURCGG2016-003)资助课题
关键词
隐私保护
基于位置服务
位置匿名
随机网格
privacy protection
location-based service
location anonymous
random mesh
