DeepAI AI Chat
Log In Sign Up

On the Complexity of Two-Party Differential Privacy

by   Iftach Haitner, et al.

In distributed differential privacy, the parties perform analysis over their joint data while preserving the privacy for both datasets. Interestingly, for a few fundamental two-party functions such as inner product and Hamming distance, the accuracy of the distributed solution lags way behind what is achievable in the client-server setting. McGregor, Mironov, Pitassi, Reingold, Talwar, and Vadhan [FOCS '10] proved that this gap is inherent, showing upper bounds on the accuracy of (any) distributed solution for these functions. These limitations can be bypassed when settling for computational differential privacy, where the data is differentially private only in the eyes of a computationally bounded observer, using public-key cryptography primitives. We prove that the use of public-key cryptography is necessary for bypassing the limitation of McGregor et al., showing that a non-trivial solution for the inner-product, or the Hamming distance, implies the existence of a key-agreement protocol. Our bound implies a combinatorial proof for the fact that non-Boolean inner product of independent (strong) Santha-Vazirani sources is a good condenser. We obtain our main result by showing that the inner-product of a (single, strong) SV source with a uniformly random seed is a good condenser, even when the seed and source are dependent.


page 1

page 2

page 3

page 4


Separating Key Agreement and Computational Differential Privacy

Two party differential privacy allows two parties who do not trust each ...

Randori: Local Differential Privacy for All

Polls are a common way of collecting data, including product reviews and...

Preserving Differential Privacy Between Features in Distributed Estimation

Privacy is crucial in many applications of machine learning. Legal, ethi...

Differentially Private Distributed Data Summarization under Covariate Shift

We envision AI marketplaces to be platforms where consumers, with very l...

Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation

Consider a PPT two-party protocol π=(A,B) in which the parties get no pr...

Comment on "Quantum key agreement protocol"

The first two party Quantum Key Agreement (QKA) protocol, based on quant...

New Secure Sparse Inner Product with Applications to Machine Learning

Sparse inner product (SIP) has the attractive property of overhead being...