A distributed model where a public linear sketch is computed securely over client-side noise achieves central-model-like utility for private low-rank approximation and ridge regression, with error independent of the number of clients.
Multi-Central Differential Privacy
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Differential privacy is typically studied in the central model where a trusted "aggregator" holds the sensitive data of all the individuals and is responsible for protecting their privacy. A popular alternative is the local model in which the aggregator is untrusted and instead each individual is responsible for their own privacy. The decentralized privacy guarantee of the local model comes at a high price in statistical utility or computational complexity. Thus intermediate models such as the shuffled model and pan privacy have been studied in an attempt to attain the best of both worlds. In this note, we propose an intermediate trust model for differential privacy, which we call the multi-central model. Here there are multiple aggregators and we only assume that they do not collude nefariously. This model relaxes the trust requirements of the central model while avoiding the price of the local model. We motivate this model and provide some simple and efficient algorithms for it. We argue that this model is a promising direction for further research.
citation-role summary
citation-polarity summary
fields
cs.CR 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Distributed Differentially Private Data Analytics via Secure Sketching
A distributed model where a public linear sketch is computed securely over client-side noise achieves central-model-like utility for private low-rank approximation and ridge regression, with error independent of the number of clients.