一种连续LBS请求下的位置匿名方法

摘要

为避免不同时刻来自同一用户的连续位置服务(LBS)请求之间的相关攻击,提出一种改进的k-匿名模型,设计一种连续LBS请求下的位置匿名方法.在满足用户隐私要求的前提下,利用位置采样寻找最优的匿名集,使用户平均匿名区域最小.分析结果表明,该方法能合理利用系统计算资源,提高在多用户请求下系统的响应速度.%Location cloaking in terms of continuous Location-Based Services(LBS) request need to consider how to avoid the attack by correlating anonymity areas of different requests from the same user. In term of this privacy problem, this paper proposes an improved k-anonymity model on basis of the traditional k-anonymity model, and designs a state-of-art location anonymity framework and algorithms for continuous LBS requests.This framework guarantees the best Quality of Service(QoS) and good response time of system as well as meeting the privacy requirement. Analysis results show that the method can make better use of the system resources and thus decrease the response time of user's requests.