Practically Efficient Secure Computation of Rank-based Statistics Over Distributed Datasets. (arXiv:2302.08121v1 [cs.CR])

In this paper, we propose a practically efficient model for securely
computing rank-based statistics, e.g., median, percentiles and quartiles, over
distributed datasets in the malicious setting without leaking individual data
privacy. Based on the binary search technique of Aggarwal et al. (EUROCRYPT
\textquotesingle 04), we respectively present an interactive protocol and a
non-interactive protocol, involving at most $\log ||R||$ rounds, where $||R||$
is the range size of the dataset elements. Besides, we introduce a series of
optimisation techniques to reduce …

binary computation computing data data privacy datasets distributed eurocrypt log malicious non privacy protocol search secure computation size statistics