期刊
IEEE TRANSACTIONS ON MOBILE COMPUTING
卷 20, 期 10, 页码 3006-3019出版社
IEEE COMPUTER SOC
DOI: 10.1109/TMC.2020.2993599
关键词
k-anonymity; spatio-temporal trajectories; location-based services; privacy preservation
资金
- National Key RD Program [2018YFB1004800]
- National Natural Science Foundation of China [61727802, 61872184]
In recent years, there has been a growing demand for location-based services in daily life, leading to concerns about user location privacy. To address this, researchers have developed dummy-based algorithms to protect user privacy. This paper introduces a new attack model and evaluation metric, followed by the development of a robust defense algorithm against the attack.
Recent years have seen rising needs for location-based services in our everyday life. Aside from the many advantages provided by these services, they have caused serious concerns regarding the location privacy of users. Adversaries can monitor the queried locations by users to infer sensitive information, such as home addresses and shopping habits. To address this issue, dummy-based algorithms have been developed to increase the anonymity of users, and thus, protecting their privacy. Unfortunately, the existing algorithms only assume a limited amount of side information known by adversaries, which may face more severe challenges in practice. In this paper, we develop an attack model termed as Viterbi attack, which represents a realistic privacy threat on user trajectories. Moreover, we propose a metric called transition entropy that enables the evaluation of dummy-based algorithms, followed by developing a robust algorithm that can defend users against the Viterbi attack while maintaining significantly high performance in terms of the traditional metrics. We compare and evaluate our proposed algorithm and metric on a publicly available dataset published by Microsoft, i.e., Geolife dataset.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据