Collaborative trajectory privacy preserving scheme in location-based services
Collaborative trajectory privacy preserving scheme in location-based services
复制标题
位置服务中的协作轨迹隐私保护方案
DOI：
10.1016/j.ins.2016.08.010
复制
发表时间：
2017-05-01
影响因子：
8.1
通讯作者：
Wang, Guojun
中科院分区：
文献类型：
--
作者：
Peng, Tao;Liu, Qin;Wang, Guojun
基于位置的服务（lbs）越来越受欢迎，并且正在成为人们在日常生活中使用的增长最快的活动相关服务。虽然用户受益于lbs，但对参与者位置数据和轨迹信息的收集和分析可能会危及他们的隐私。现有的建议主要集中于快照查询。然而，连续lbs中的隐私保护比快照查询更具挑战性，因为攻击者可以使用用户轨迹上的空间和时间相关性来推断用户的隐私信息。本文提出了连续查询的协同轨迹隐私保护（CTPP）方案，该方案通过用户之间的缓存感知协作来保证轨迹隐私，而不需要任何完全可信的实体。我们方案的主要思想是通过发出虚假查询来混淆LBS对手，从而混淆用户的实际轨迹。首先提出了一种基于协同缓存的多跳缓存感知隐身算法，用于从多跳对等体收集有价值的信息。然后，我们描述了一种协作隐私保护查询算法，该算法发出假查询以混淆位置服务提供商（LSP）。大量的实验结果验证了该方案在处理时间和通信成本方面的有效性和效率。(C) 2016 Elsevier Inc.版权所有。
Location-based services (LBSs) have been gaining considerable popularity and are becoming the fastest growing activity-related services that people use in their daily life. While users benefit from LBSs, the collection and analysis of participators' location data and trajectory information may jeopardize their privacy. Existing proposals focus mostly on snapshot queries. However, privacy preservation in continuous LBSs is more challenging than in snapshot queries because adversaries could use the spatial and temporal correlations on the user trajectory to infer the user's private information. In this paper, we propose the collaborative trajectory privacy preserving (CTPP) scheme for continuous queries, in which trajectory privacy is guaranteed by caching-aware collaboration between users, without the need for any fully trusted entities. The main idea of our scheme is to obfuscate the actual trajectory of a user by issuing fake queries to confuse the LBS adversary. We first present a multi-hop caching-aware cloaking algorithm to collect valuable information from multi hop peers based on collaborative caching. Then, we describe a collaborative privacy preserving querying algorithm that issues a fake query to confuse the location service provider (LSP). Extensive experimental results verify the effectiveness and efficiency of our scheme in terms of processing time and communication cost. (C) 2016 Elsevier Inc. All rights reserved.