Pan-Private Uniformity Testing
Kareem Amin, Matthew Joseph, and Jieming Mao

TL;DR
This paper introduces and analyzes the concept of pan-privacy, a model that balances between local and central differential privacy, and applies it to uniformity testing over a domain, revealing new sample complexity bounds.
Contribution
The paper formalizes pan-privacy, establishes its equivalence to sequentially interactive local privacy under multiple intrusions, and determines the sample complexity for uniformity testing in this model.
Findings
Pure pan-privacy against multiple intrusions equals sequentially interactive local privacy.
Sample complexity for pan-private uniformity testing is Θ(k^{2/3}).
Lower bound of Ω(k) for sequentially interactive setting separates it from pan-privacy.
Abstract
A centrally differentially private algorithm maps raw data to differentially private outputs. In contrast, a locally differentially private algorithm may only access data through public interaction with data holders, and this interaction must be a differentially private function of the data. We study the intermediate model of pan-privacy. Unlike a locally private algorithm, a pan-private algorithm receives data in the clear. Unlike a centrally private algorithm, the algorithm receives data one element at a time and must maintain a differentially private internal state while processing this stream. First, we show that pure pan-privacy against multiple intrusions on the internal state is equivalent to sequentially interactive local privacy. Next, we contextualize pan-privacy against a single intrusion by analyzing the sample complexity of uniformity testing over domain . Focusing…
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.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Cryptography and Data Security · Complexity and Algorithms in Graphs
