Local Differential Private Data Aggregation for Discrete Distribution Estimation

By Shaowei Wang, Liusheng Huang, Yiwen Nie, Xinyuan Zhang, Pengzhan Wang, Hongli Xu, Wei Yang. 2019

81 citations recorded by the source corpus.

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$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$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 (-\frac{\epsilon }{2})$exp(-ε2) error for distribution estimation when compared to existing approaches.

Subfields: Artificial Intelligence, Computer Science Applications, Statistics and Probability, Privacy & Security

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. H. Vincent Poor
  2. Ming Ding
  3. Jun Zhao
  4. Chuan Ma
  5. Jun Li
  6. Shi Jin
  7. Tony Q. S. Quek
  8. Teng Wang

In Computer Science Applications

  1. Jun Zhao
  2. H. Vincent Poor
  3. Teng Wang
  4. Xuebin Ren
  5. Xinyu Yang

In Statistics and Probability

  1. Jun Zhao
  2. Ming Ding
  3. H. Vincent Poor
  4. Tony Q. S. Quek
  5. Teng Wang
  6. Xuebin Ren
  7. Xinyu Yang
  8. Howard H. Yang

In Privacy & Security

  1. Jun Zhao
  2. Chuan Ma
  3. Jun Li
  4. Ming Ding
  5. H. Vincent Poor
  6. Tony Q. S. Quek
  7. Teng Wang
  8. Xuebin Ren

Citations in the corpus