Research Project

Privada: Differentially private data aggregation with optimal utility

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.

We present Privada, a novel design architecture for distributed differential privacy that leverages recent advances in secure multiparty computations 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 several application scenarios such as privacy-preserving web analytics.


ArithmeticSMPC Library

As a part of this project, we have implemented a full-fledged secure multi-party computation (SMPC) library for several important arithmetic operation over the integers, and rational numbers in the fixed point form and the floating point form.

Our complete code base is available : [ArithmeticSMPC Library]

More details as well as documentation will appear soon...