Cryptology ePrint Archive: Report 2014/482
Privacy-preserving Data Aggregation with Optimal Utility
Fabienne Eigner and Aniket Kate and Matteo Maffei and Francesca Pampaloni and Ivan Pryvalov
Abstract: Computing aggregate statistics about user data is of vital importance for a variety of services and systems, but this practice has been shown to seriously undermine the privacy of users. Differential privacy has proved to be an effective tool to sanitize queries over a database, and various cryptographic protocols have been recently proposed to enforce differential privacy in a distributed setting, e.g., statical queries on sensitive data stored on the userís side. The widespread deployment of differential privacy techniques in real-life settings is, however, undermined by several limitations that existing constructions suffer from: they support only a limited class of queries, they pose a trade-off between privacy and utility of the query result, they are affected by the answer pollution problem, or they are inefficient.
This paper presents PrivaDA, a novel design architecture for distributed differential privacy that leverages recent advances in SMPCs on fixed and floating point arithmetics to overcome the previously mentioned limitations. In particular, PrivaDA supports a variety of perturbation mechanisms (e.g., the Laplace, discrete Laplace, and exponential mechanisms) and it constitutes the first generic technique to generate noise in a fully distributed manner while maintaining the optimal utility. Furthermore, PrivaDA does not suffer from the answer pollution problem. We demonstrate the efficiency of PrivaDA with a performance evaluation, and its expressiveness and flexibility by illustrating a variety of application scenarios such as privacy-preserving web analytics.
Category / Keywords: applications / Secure Multiparty Computation (SMPC), Distributed Differential Privacy, Data Aggregation
Date: received 18 Jun 2014
Contact author: eigner at cs uni-saarland de, aniket@mmci uni-saarland de
Available format(s): PDF | BibTeX Citation
Version: 20140623:130026 (All versions of this report)
Short URL: ia.cr/2014/482
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]