A Locally Differential Private Coding-Assisted Succinct Histogram Protocol
Hsuan-Po Liu, Hessam Mahdavifar

TL;DR
This paper introduces a practical local differential privacy protocol for succinct histograms using error-correcting codes, specifically polar codes with Gaussian perturbations, improving accuracy for low-frequency items.
Contribution
It is the first to apply polar codes with Gaussian perturbations in an LDP setting for succinct histograms, enhancing data utility and accuracy.
Findings
Outperforms prior methods in low-frequency item accuracy
Maintains similar overall frequency estimation accuracy
Uses polar codes with Gaussian-based perturbations for efficient soft decoding
Abstract
A succinct histogram captures frequent items and their frequencies across clients and has become increasingly important for large-scale, privacy-sensitive machine learning applications. To develop a rigorous framework to guarantee privacy for the succinct histogram problem, local differential privacy (LDP) has been utilized and shown promising results. To preserve data utility under LDP, which essentially works by intentionally adding noise to data, error-correcting codes naturally emerge as a promising tool for reliable information collection. This work presents the first practical -LDP protocol for constructing succinct histograms using error-correcting codes. To this end, polar codes and their successive-cancellation list (SCL) decoding algorithms are leveraged as the underlying coding scheme. More specifically, our protocol introduces Gaussian-based perturbations…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
