Improved Summation from Shuffling

09/24/2019
by   Borja Balle, et al.
0

A protocol by Ishai et al. (FOCS 2006) showing how to implement distributed n-party summation from secure shuffling has regained relevance in the context of the recently proposed shuffle model of differential privacy, as it allows to attain the accuracy levels of the curator model at a moderate communication cost. To achieve statistical security 2^-σ, the protocol by Ishai et al. requires the number of messages sent by each party to grow logarithmically with n as O(log n + σ). In this note we give an improved analysis achieving a dependency of the form O(1+σ/log n). Conceptually, this addresses the intuitive question left open by Ishai et al.of whether the shuffling step in their protocol provides a "hiding in the crowd" amplification effect as n increases. From a practical perspective, our analysis provides explicit constants and shows, for example, that the method of Ishai et al. applied to summation of 32-bit numbers from n=10^4 parties sending 12 messages each provides statistical security 2^-40.

READ FULL TEXT

page 1

page 2

page 3

page 4

06/20/2019

Differentially Private Summation with Multi-Message Shuffling

In recent work, Cheu et al. (Eurocrypt 2019) proposed a protocol for n-p...
09/24/2019

Private Aggregation from Fewer Anonymous Messages

Consider the setup where n parties are each given a number x_i ∈F_q and ...
07/03/2022

How to Sample Approval Elections?

We study the multifaceted question of how to sample approval elections i...
02/03/2020

Private Summation in the Multi-Message Shuffle Model

The shuffle model of differential privacy (Erlingsson et al. SODA 2019; ...
09/25/2018

Enhanced Session Initiation Protocols for Emergency Healthcare Applications

In medical emergencies, an instant and secure messaging is an important ...
07/04/2018

A New Look at the Refund Mechanism in the Bitcoin Payment Protocol

BIP70 is the Bitcoin payment protocol for communication between a mercha...
10/08/2018

A Note On the Size of Largest Bins Using Placement With Linear Transformations

We study the placement of n balls into n bins where balls and bins are r...