Exponential Separations in Local Differential Privacy Through Communication Complexity

by   Matthew Joseph, et al.

We prove a general connection between the communication complexity of two-player games and the sample complexity of their multi-player locally private analogues. We use this connection to prove sample complexity lower bounds for locally differentially private protocols as straightforward corollaries of results from communication complexity. In particular, we 1) use a communication lower bound for the hidden layers problem to prove an exponential sample complexity separation between sequentially and fully interactive locally private protocols, and 2) use a communication lower bound for the pointer chasing problem to prove an exponential sample complexity separation between k round and k+1 round sequentially interactive locally private protocols, for every k.


page 1

page 2

page 3

page 4


Pan-Private Uniformity Testing

A centrally differentially private algorithm maps raw data to differenti...

Tight Lower Bounds for Locally Differentially Private Selection

We prove a tight lower bound (up to constant factors) on the sample comp...

Locally Private Gaussian Estimation

We study a basic private estimation problem: each of n users draws a sin...

The Role of Interactivity in Local Differential Privacy

We study the power of interactivity in local differential privacy. First...

Connecting Robust Shuffle Privacy and Pan-Privacy

In the shuffle model of differential privacy, data-holding users send ra...

A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Privacy

We prove a general structural theorem for a wide family of local algorit...