Differentially Private Release of High-Dimensional Datasets using the Gaussian Copula

02/04/2019
by   Hassan Jameel Asghar, et al.
0

We propose a generic mechanism to efficiently release differentially private synthetic versions of high-dimensional datasets with high utility. The core technique in our mechanism is the use of copulas. Specifically, we use the Gaussian copula to define dependencies of attributes in the input dataset, whose rows are modelled as samples from an unknown multivariate distribution, and then sample synthetic records through this copula. Despite the inherently numerical nature of Gaussian correlations we construct a method that is applicable to both numerical and categorical attributes alike. Our mechanism is efficient in that it only takes time proportional to the square of the number of attributes in the dataset. We propose a differentially private way of constructing the Gaussian copula without compromising computational efficiency. Through experiments on three real-world datasets, we show that we can obtain highly accurate answers to the set of all one-way marginal, and two-and three-way positive conjunction queries, with 99% of the query answers having absolute (fractional) error rates between 0.01 to 3%. Furthermore, for a majority of two-way and three-way queries, we outperform independent noise addition through the well-known Laplace mechanism. In terms of computational time we demonstrate that our mechanism can output synthetic datasets in around 6 minutes 47 seconds on average with an input dataset of about 200 binary attributes and more than 32,000 rows, and about 2 hours 30 mins to execute a much larger dataset of about 700 binary attributes and more than 5 million rows. To further demonstrate scalability, we ran the mechanism on larger (artificial) datasets with 1,000 and 2,000 binary attributes (and 5 million rows) obtaining synthetic outputs in approximately 6 and 19 hours, respectively.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/21/2022

Differentially Private Maximal Information Coefficients

The Maximal Information Coefficient (MIC) is a powerful statistic to ide...
research
08/10/2018

Optimizing error of high-dimensional statistical queries under differential privacy

Differentially private algorithms for answering sets of predicate counti...
research
08/15/2022

Private Query Release via the Johnson-Lindenstrauss Transform

We introduce a new method for releasing answers to statistical queries w...
research
06/16/2022

Differentially Private Multi-Party Data Release for Linear Regression

Differentially Private (DP) data release is a promising technique to dis...
research
07/18/2020

Differentially Private Mechanisms for Count Queries

In this paper, we consider the problem of responding to a count query (o...
research
05/14/2023

An Optimal and Scalable Matrix Mechanism for Noisy Marginals under Convex Loss Functions

Noisy marginals are a common form of confidentiality-protecting data rel...
research
08/31/2023

Differentially Private Functional Summaries via the Independent Component Laplace Process

In this work, we propose a new mechanism for releasing differentially pr...

Please sign up or login with your details

Forgot password? Click here to reset