An Information Theoretic approach to Post Randomization Methods under Differential Privacy

by   Fadhel Ayed, et al.

Post Randomization Methods (PRAM) are among the most popular disclosure limitation techniques for both categorical and continuous data. In the categorical case, given a stochastic matrix M and a specified variable, an individual belonging to category i is changed to category j with probability M_i,j. Every approach to choose the randomization matrix M has to balance between two desiderata: 1) preserving as much statistical information from the raw data as possible; 2) guaranteeing the privacy of individuals in the dataset. This trade-off has generally been shown to be very challenging to solve. In this work, we use recent tools from the computer science literature and propose to choose M as the solution of a constrained maximization problems. Specifically, M is chosen as the solution of a constrained maximization problem, where we maximize the Mutual Information between raw and transformed data, given the constraint that the transformation satisfies the notion of Differential Privacy. For the general Categorical model, it is shown how this maximization problem reduces to a convex linear programming and can be therefore solved with known optimization algorithms.



There are no comments yet.


page 1

page 2

page 3

page 4


Information-Theoretic Approaches to Differential Privacy

The tutorial studies relationships between differential privacy and vari...

Probabilistic Counters for Privacy Preserving Data Aggregation

Probabilistic counters are well known tools often used for space-efficie...

Connecting Randomized Response, Post-Randomization, Differential Privacy and t-Closeness via Deniability and Permutation

We explore some novel connections between the main privacy models in use...

On Properties and Optimization of Information-theoretic Privacy Watchdog

We study the problem of privacy preservation in data sharing, where S is...

A Linear Reduction Method for Local Differential Privacy and Log-lift

This paper considers the problem of publishing data X while protecting c...

α-Information-theoretic Privacy Watchdog and Optimal Privatization Scheme

This paper proposes an α-lift measure for data privacy and determines th...

Kendall transformation

Kendall transformation is a conversion of an ordered feature into a vect...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.