Practically Efficient Secure Computation of Rank-based Statistics Over Distributed Datasets

02/16/2023
by   Nan Wang, et al.
0

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 '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 the round complexity. Our computing model is modular and can be instantiated with either homomorphic encryption or secret-sharing schemes. Compared to the state-of-the-art solutions, it provides stronger security and privacy while maintaining high efficiency and accuracy. Unlike differential-privacy-based solutions, it does not suffer a trade-off between accuracy and privacy. On the other hand, it only involves O(N log ||R||) time complexity, which is far more efficient than those bitwise-comparison-based solutions with O(N^2log ||R||) time complexity, where N is the dataset size. Finally, we provide a UC-secure instantiation with the threshold Paillier cryptosystem and Σ-protocol zero-knowledge proofs of knowledge.

READ FULL TEXT
research
02/11/2019

Drynx: Decentralized, Secure, Verifiable System for Statistical Queries and Machine Learning on Distributed Datasets

Data sharing has become of primary importance in many domains such as bi...
research
09/28/2020

On the Round Complexity of the Shuffle Model

The shuffle model of differential privacy was proposed as a viable model...
research
12/28/2018

The Power of Distributed Verifiers in Interactive Proofs

We explore the power of interactive proofs with a distributed verifier. ...
research
09/24/2019

Improved Summation from Shuffling

A protocol by Ishai et al. (FOCS 2006) showing how to implement distribu...
research
02/05/2022

Linear Model with Local Differential Privacy

Scientific collaborations benefit from collaborative learning of distrib...
research
03/11/2020

ENSEI: Efficient Secure Inference via Frequency-Domain Homomorphic Convolution for Privacy-Preserving Visual Recognition

In this work, we propose ENSEI, a secure inference (SI) framework based ...
research
12/22/2021

Randomize the Future: Asymptotically Optimal Locally Private Frequency Estimation Protocol for Longitudinal Data

Longitudinal data tracking under Local Differential Privacy (LDP) is a c...

Please sign up or login with your details

Forgot password? Click here to reset