Differentially Private Selection from Secure Distributed Computing

Ivan Damgård, Hannah Keller, Boel Nelson +2

Given a collection of vectors $x^{(1)},\dots ,x^{(n)}\in \{0,1{\}}^d$, the selection problem asks to report the index of an "approximately largest" entry in $x={\sum }_{j=1}^n{x}^{(j)}$.…