Cryptology ePrint Archive: Report 2020/029

Differentially-Private Multi-Party Sketching for Large-Scale Statistics

Seung Geol Choi and Dana Dachman-Soled and Mukul Kulkarni and Arkady Yerukhimovich

Abstract: We consider a scenario where multiple organizations holding large amounts of sensitive data from their users wish to compute aggregate statistics on this data while protecting the privacy of individual users. To support large-scale analytics we investigate how this privacy can be provided for the case of sketching algorithms running in time sub-linear of the input size.

We begin with the well-known LogLog sketch for computing the number of unique elements in a data stream. We show that this algorithm already achieves differential privacy (even without adding any noise) when computed using a private hash function by a trusted curator. Next, we show how to eliminate this requirement of a private hash function by injecting a small amount of noise, allowing us to instantiate an efficient LogLog protocol for the multi-party setting. To demonstrate the practicality of this approach, we run extensive experimentation on multiple datasets, including the publicly available IP address data set from University of Michiganís scans of internet IPv4 space, to determine the tradeoffs among efficiency, privacy and accuracy of our implementation for varying numbers of parties and input sizes.

Finally, we generalize our approach for the LogLog sketch and obtain a general framework for constructing multi-party differentially private protocols for several other sketching algorithms.

Category / Keywords: cryptographic protocols / multiparty computation, differential privacy, big data, sketching

Date: received 10 Jan 2020

Contact author: danadach at umd edu,choi@usna edu,mukul@cs umass edu,arkady@gwu edu

Available format(s): PDF | BibTeX Citation

Version: 20200113:102837 (All versions of this report)

Short URL: ia.cr/2020/029


[ Cryptology ePrint archive ]