… from secure shuffling has regained relevance in the context of the recently proposed shuffle
… In this note we give an improved analysis achieving a dependency of the form O(1 + σ/log n)…

… This paper introduces two new protocols for summation in the shuffle model with improved
accuracy and communication tradeoffs. Our first contribution is a recursive construction based …

… summation in the shuffle model exists, we would now like to use it for private real summation.
… The constants implied by this proof can be improved by using a sharper bound for (2k k ) in …

… The clipping mechanism also works in the shuffle model, but … Our experiments show
order-of-magnitude improvements of … dimensional summation by treating our 1D summation …

… Our method is more general since it covers different shuffling variants in both deterministic
and randomized worlds. When a randomized reshuffling strategy is used, we can improve our …

… 2.3, the summation over r is over all possible neuronal responses. The summation over s is
… This property is important to improving the sampling properties of the information quantities, …

… aggregation in the context of the Shuffle Model. The aim of … summation of real vectors in
the Shuffle Model, using advanced composition results. Secondly, we provide an improvement …

… and shuffling. We moreover extend the approach with the use of higher-order masking and
we show that it enables to significantly improve the … The attack consists in summing all the …

… or semi-random shuffling of the data with … improvement as a function of data shuffling with
replacement. In our system, the excess data stored at local nodes are not only used to improve …

… They generally either (1) focus on simple summations and require a single “semi-honest”/“…
in the general shuffled model. We also do not know if this bound can be improved. We leave it …