Cryptology ePrint Archive: Report 2014/957

Black Box Separations for Differentially Private Protocols

Dakshita Khurana and Hemanta K. Maji and Amit Sahai

Abstract: We study the maximal achievable accuracy of distributed differentially private protocols for a large natural class of boolean functions, in the computational setting.

In the information theoretic model, McGregor et al. [FOCS 2010] and Goyal et al. [CRYPTO 2013] have demonstrated several functionalities whose differentially private computation results in much lower accuracies in the distributed setting, as compared to the client-server setting.

We explore lower bounds on the computational assumptions under which this particular accuracy gap can be possibly reduced for general two-party boolean output functions. In the distributed setting, it is possible to achieve optimal accuracy, i.e. the maximal achievable accuracy in the client-server setting, for any function, if a semi-honest secure protocol for oblivious transfer exists. However, we show the following strong impossibility results:

1) For any boolean function and fixed level of privacy, the maximal achievable accuracy of any (fully) black-box construction based on existence of key-agreement protocols is at least a constant smaller than optimal achievable accuracy. Since key-agreement protocols imply the existence of one-way functions, this separation also extends to one-way functions.

2) Our results are tight for the AND and XOR functions. For AND, there exists an accuracy threshold such that any accuracy up to the threshold can be information theoretically achieved; while no (fully) black-box construction based on existence of key-agreement can achieve accuracy beyond this threshold. An analogous statement is also true for XOR (albeit with a different accuracy threshold).

Our results build on recent developments in black-box separation techniques for functions with private input; and consequently translate information theoretic impossibilities into black-box separation results.

Category / Keywords: Differentially Private Protocols, Computational Complexity, Random Oracle, Key agreement Protocols, Black-box Separation.

Original Publication (with minor differences): IACR-ASIACRYPT-2014
DOI:
10.1007/978-3-662-45608-8_21

Date: received 23 Nov 2014

Contact author: dakshkhurana at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20141125:203936 (All versions of this report)

Short URL: ia.cr/2014/957

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]