Practical Locally Private Heavy Hitters

Abstract

We present new practical local differentially private heavy hitters algorithms achieving optimal or near-optimal worst-case error and running time -- TreeHist and Bitstogram. In both algorithms, server running time is $\tilde{O}(n)$ and user running time is $\tilde{O}(1)$, hence improving on the prior state-of-the-art result of Bassily and Smith [STOC 2015] requiring $O(n^{5/2})$ server time and $O(n^{3/2})$ user time. With a typically large number of participants in local algorithms ($n$ in the millions), this reduction in time complexity, in particular at the user side, is crucial for making locally private heavy hitters algorithms usable in practice. We implemented Algorithm TreeHist to verify our theoretical analysis and compared its performance with the performance of Google's RAPPOR code.

Cited by in corpus (12)

• Collecting Telemetry Data Privately
• A Comprehensive Survey on Local Differential Privacy Toward Data Statistics and Analysis
• Local Differential Privacy: a tutorial
• Improving the utility of locally differentially private protocols for longitudinal and multidimensional frequency estimates
• Differentially Private k-Means with Constant Multiplicative Error
• Differentially-Private "Draw and Discard" Machine Learning
• Random Sampling Plus Fake Data: Multidimensional Frequency Estimates With Local Differential Privacy
• Locally Differentially Private Heavy Hitter Identification
• PriPeARL: A Framework for Privacy-Preserving Analytics and Reporting at LinkedIn
• Conditional Analysis for Key-Value Data with Local Differential Privacy
• Context-aware Data Aggregation with Localized Information Privacy
• Optimal Compression of Locally Differentially Private Mechanisms