Local Differential Private Data Aggregation for Discrete Distribution Estimation

• Published in: IEEE transactions on parallel and distributed systems Vol. 30; no. 9; pp. 2046 - 2059
• Main Authors: Wang, Shaowei, Huang, Liusheng, Nie, Yiwen, Zhang, Xinyuan, Wang, Pengzhan, Xu, Hongli, Yang, Wei
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.09.2019; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: crowdsourcing; data aggregation; Data management; Data models; Data privacy; Differential privacy; distribution estimation; Estimation; Mobile communication systems; Mutual information; Optimization; Privacy; Qualitative analysis; Servers
• ISSN: 1045-9219; 1558-2183
• DOI: 10.1109/TPDS.2019.2899097

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 kk-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 kk-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.