Secure multi-party differential privacy

Peter Kairouz, Sewoong Oh, Pramod Viswanath

Research output: Contribution to journalConference article

Abstract

We study the problem of interactive function computation by multiple parties, each possessing a bit, in a differential privacy setting (i.e., there remains an uncertainty in any party's bit even when given the transcript of interactions and all the other parties' bits). Each party wants to compute a function, which could differ from party to party, and there could be a central observer interested in computing a separate function. Performance at each party is measured via the accuracy of the function to be computed. We allow for an arbitrary cost metric to measure the distortion between the true and the computed function values. Our main result is the optimality of a simple non-interactive protocol: each party randomizes its bit (sufficiently) and shares the privatized version with the other parties. This optimality result is very general: it holds for all types of functions, heterogeneous privacy conditions on the parties, all types of cost metrics, and both average and worst-case (over the inputs) measures of accuracy.

Original languageEnglish (US)
Pages (from-to)2008-2016
Number of pages9
JournalAdvances in Neural Information Processing Systems
Volume2015-January
StatePublished - Jan 1 2015
Event29th Annual Conference on Neural Information Processing Systems, NIPS 2015 - Montreal, Canada
Duration: Dec 7 2015Dec 12 2015

Fingerprint

Costs
Uncertainty

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems
  • Signal Processing

Cite this

Secure multi-party differential privacy. / Kairouz, Peter; Oh, Sewoong; Viswanath, Pramod.

In: Advances in Neural Information Processing Systems, Vol. 2015-January, 01.01.2015, p. 2008-2016.

Research output: Contribution to journalConference article

Kairouz, Peter ; Oh, Sewoong ; Viswanath, Pramod. / Secure multi-party differential privacy. In: Advances in Neural Information Processing Systems. 2015 ; Vol. 2015-January. pp. 2008-2016.
@article{349d14330a134e619cada485ea82b640,
title = "Secure multi-party differential privacy",
abstract = "We study the problem of interactive function computation by multiple parties, each possessing a bit, in a differential privacy setting (i.e., there remains an uncertainty in any party's bit even when given the transcript of interactions and all the other parties' bits). Each party wants to compute a function, which could differ from party to party, and there could be a central observer interested in computing a separate function. Performance at each party is measured via the accuracy of the function to be computed. We allow for an arbitrary cost metric to measure the distortion between the true and the computed function values. Our main result is the optimality of a simple non-interactive protocol: each party randomizes its bit (sufficiently) and shares the privatized version with the other parties. This optimality result is very general: it holds for all types of functions, heterogeneous privacy conditions on the parties, all types of cost metrics, and both average and worst-case (over the inputs) measures of accuracy.",
author = "Peter Kairouz and Sewoong Oh and Pramod Viswanath",
year = "2015",
month = "1",
day = "1",
language = "English (US)",
volume = "2015-January",
pages = "2008--2016",
journal = "Advances in Neural Information Processing Systems",
issn = "1049-5258",

}

TY - JOUR

T1 - Secure multi-party differential privacy

AU - Kairouz, Peter

AU - Oh, Sewoong

AU - Viswanath, Pramod

PY - 2015/1/1

Y1 - 2015/1/1

N2 - We study the problem of interactive function computation by multiple parties, each possessing a bit, in a differential privacy setting (i.e., there remains an uncertainty in any party's bit even when given the transcript of interactions and all the other parties' bits). Each party wants to compute a function, which could differ from party to party, and there could be a central observer interested in computing a separate function. Performance at each party is measured via the accuracy of the function to be computed. We allow for an arbitrary cost metric to measure the distortion between the true and the computed function values. Our main result is the optimality of a simple non-interactive protocol: each party randomizes its bit (sufficiently) and shares the privatized version with the other parties. This optimality result is very general: it holds for all types of functions, heterogeneous privacy conditions on the parties, all types of cost metrics, and both average and worst-case (over the inputs) measures of accuracy.

AB - We study the problem of interactive function computation by multiple parties, each possessing a bit, in a differential privacy setting (i.e., there remains an uncertainty in any party's bit even when given the transcript of interactions and all the other parties' bits). Each party wants to compute a function, which could differ from party to party, and there could be a central observer interested in computing a separate function. Performance at each party is measured via the accuracy of the function to be computed. We allow for an arbitrary cost metric to measure the distortion between the true and the computed function values. Our main result is the optimality of a simple non-interactive protocol: each party randomizes its bit (sufficiently) and shares the privatized version with the other parties. This optimality result is very general: it holds for all types of functions, heterogeneous privacy conditions on the parties, all types of cost metrics, and both average and worst-case (over the inputs) measures of accuracy.

UR - http://www.scopus.com/inward/record.url?scp=84965109981&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84965109981&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:84965109981

VL - 2015-January

SP - 2008

EP - 2016

JO - Advances in Neural Information Processing Systems

JF - Advances in Neural Information Processing Systems

SN - 1049-5258

ER -