arXiv Analytics

Sign in

arXiv:2009.04157 [cs.IT]AbstractReferencesReviewsResources

On Perfect Obfuscation: Local Information Geometry Analysis

Behrooz Razeghi, Flavio. P. Calmon, Deniz Gunduz, Slava Voloshynovskiy

Published 2020-09-09Version 1

We consider the problem of privacy-preserving data release for a specific utility task under perfect obfuscation constraint. We establish the necessary and sufficient condition to extract features of the original data that carry as much information about a utility attribute as possible, while not revealing any information about the sensitive attribute. This problem formulation generalizes both the information bottleneck and privacy funnel problems. We adopt a local information geometry analysis that provides useful insight into information coupling and trajectory construction of spherical perturbation of probability mass functions. This analysis allows us to construct the modal decomposition of the joint distributions, divergence transfer matrices, and mutual information. By decomposing the mutual information into orthogonal modes, we obtain the locally sufficient statistics for inferences about the utility attribute, while satisfying perfect obfuscation constraint. Furthermore, we develop the notion of perfect obfuscation based on $\chi^2$-divergence and Kullback-Leibler divergence in the Euclidean information geometry.

Related articles: Most relevant | Search more
arXiv:1707.04413 [cs.IT] (Published 2017-07-14)
The Mutual information of LDGM codes
arXiv:0704.1751 [cs.IT] (Published 2007-04-13, updated 2010-08-24)
Information Theoretic Proofs of Entropy Power Inequalities
arXiv:1510.02330 [cs.IT] (Published 2015-10-08)
On Maximal Correlation, Mutual Information and Data Privacy