一种新型基于位置服务的隐私保护方案

A NOVEL PRIVACY PROTECTION SCHEME BASED ON LOCATION SERVICE

基于位置服务的移动社交网络迅速发展,为用户提供了诸多便利。使用这种增值服务时,用户必须向位置服务提供商提供当前位置信息与请求内容,这一过程难免会造成隐私信息泄露,给用户的人身和财产安全造成威胁。因此提出一种新型基于位置服务的隐私保护方案,利用基于球树的匿名区域构造算法构造匿名区域,根据距离与请求内容的权重计算方法,选择熵最大的用户组,保证区域内用户分布均匀性和请求内容多样性。实验结果表明,该算法构造的匿名区域面积与类四叉树算法相比减少30%,能有效保护用户的隐私安全,降低LBS服务器的开销。

The rapid development of mobile social networks based on location services provides great convenience to users. When using this value-added service, users must provide location information and requested content to the location service provider. This process will inevitably cause the leakage of private information and threaten the safety of users’ personal and property. Therefore, this paper proposes a novel privacy protection scheme based on location service. It used an anonymous area construction algorithm based on a ball tree to build an anonymous area. According to the distance and requested weight calculation method, the user group with the largest entropy was selected to ensure uniform distribution of users in the area and ensure the diverse request content. The experimental results show that compared with the Quadtree-like algorithm, the anonymous area constructed by this algorithm is reduced by 30%, which can effectively protect the privacy of users and reduce the overhead of LBS server.