期刊
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
卷 30, 期 9, 页码 2046-2059出版社
IEEE COMPUTER SOC
DOI: 10.1109/TPDS.2019.2899097
关键词
Data privacy; data aggregation; distribution estimation; crowdsourcing; mutual information
资金
- National Natural Science Foundation of China [U1709217, 61822210, 61472383, 61728207, 61472385, AHY150300, INFOCOM2017]
For the purpose of improving the quality of services, softwares or online services are collecting various of user data, such as personal information and locations. Such data facilitates mining statistical knowledge of users, but threatens users' privacy as it may reveal sensitive information (e.g., identities and activities) about individuals. This work considers distribution estimation over user contributed data meanwhile providing rigid protection of their data with local epsilon-differential privacy (epsilon-LDP), which sanitizes each user's data on the client's side (e.g, on the user's mobile device). Our privacy protection covers both qualitative data (e.g., categorical data) and discrete quantitative data (e.g., location data). Specifically, for categorical data, we derive an optimal epsilon-LDP mechanism (termed as k-subset mechanism) from mutual information perspective, and further show its optimality over existing approaches within the context of discrete distribution estimation; for discrete quantitative data that have arbitrary distance metric, we provide an efficient extension of k-subset mechanism by proposing a variant of the popular Exponential Mechanism (EM) to tackle the asymmetry issue on the data domain. Experiments on real-world datasets and simulated scenarios show that our mechanism is highly efficient and reduces nearly a fraction of exp (-epsilon/2) error for distribution estimation when compared to existing approaches.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据