Skip to yearly menu bar Skip to main content


Differentially Private Linear Sketches: Efficient Implementations and Applications

Fuheng Zhao · Dan Qiao · Rachel Redberg · Divyakant Agrawal · Amr El Abbadi · Yu-Xiang Wang

Hall J (level 1) #932

Keywords: [ Heavy Hitter ] [ differential privacy ] [ Frequent Items ] [ Streaming Algorithm ] [ Top K ] [ frequency ] [ Quantile ] [ Linear Sketch ]


Linear sketches have been widely adopted to process fast data streams, and they can be used to accurately answer frequency estimation, approximate top K items, and summarize data distributions. When data are sensitive, it is desirable to provide privacy guarantees for linear sketches to preserve private information while delivering useful results with theoretical bounds. We show that linear sketches can ensure privacy and maintain their unique properties with a small amount of noise added at initialization. From the differentially private linear sketches, we showcase that the state-of-the-art quantile sketch in the turnstile model can also be private and maintain high performance. Experiments further demonstrate that our proposed differentially private sketches are quantitatively and qualitatively similar to noise-free sketches with high utilization on synthetic and real datasets.

Chat is not available.