Differentially Private Aggregation in the Shuffle Model: Almost Central Accuracy in Almost a Single Message

Authors: Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Rasmus Pagh, Amer Sinha
Published: 2021-09-27

Source: https://arxiv.org/abs/2109.13158

PDF: https://arxiv.org/pdf/2109.13158

AIにより推定されたラベル

アルゴリズム データプライバシー評価 プライバシーリスク管理

※ こちらのラベルはAIによって自動的に追加されました。そのため、正確でないことがあります。
詳細は文献データベースについてをご覧ください。

Abstract

The shuffle model of differential privacy has attracted attention in the literature due to it being a middle ground between the well-studied central and local models. In this work, we study the problem of summing (aggregating) real numbers or integers, a basic primitive in numerous machine learning tasks, in the shuffle model. We give a protocol achieving error arbitrarily close to that of the (Discrete) Laplace mechanism in the central model, while each user only sends 1 + o(1) short messages in expectation.