mlsanityData to 7 Oct 2026

On Perfect Obfuscation: Local Information Geometry Analysis

arXiv 2009.04157 ↗First posted 9 Sep 2020cs.IT cs.CR math.ITcited by 6

Not on the map. Why?

Abstract (arXiv)

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 chi2-divergence and Kullback-Leibler divergence in the Euclidean information geometry.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 9 Sep 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 1; 2023: 0; 2024: 3; 2025: 1.

6 papers.