Sep 24, 2019 · A protocol by Ishai et al.\ (FOCS 2006) showing how to implement distributed n-party summation from secure shuffling has regained relevance.
In this note we give an improved analysis achieving a dependency of the form $O(1+\sigma/\log n)$. Conceptually, this addresses the intuitive question left open ...
Improved Summation from Shuffling · Borja Balle, James Bell, +1 author. Kobbi Nissim · Published in arXiv.org 24 September 2019 · 2019; Computer Science, ...
Sep 24, 2019 · Abstract. A protocol by Ishai et al. (FOCS 2006) showing how to implement distributed n-party sum- mation from secure shuffling has regained ...
Improved Summation from Shuffling - Kobbi Nissim - Academia.edu
www.academia.edu › Improved_Summat...
In this note we give an improved analysis achieving a dependency of the form $O(1+\sigma/\log n)$. Conceptually, this addresses the intuitive question left open ...
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 ...
Nov 2, 2020 · This paper introduces two new protocols for summation in the shuffle model with improved accuracy and communication trade-offs.
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 ...
The output is some vector of messages. A service or party called the shuffler concatenates all message vectors and then applies a uniformly random permutation.
Borja Balle, James Bell, Adrià Gascón, Kobbi Nissim: Improved Summation from Shuffling. CoRR abs/1909.11225 (2019). a service of Schloss Dagstuhl - Leibniz ...