Developing Non-Stochastic Privacy-Preserving Policies Using Agglomerative Clustering

Download
Author
Ding, N; Farokhi, FDate
2020-06-15Source Title
IEEE Transactions on Information Forensics and SecurityPublisher
Institute of Electrical and Electronics EngineersAffiliation
Computing and Information SystemsElectrical and Electronic Engineering
Metadata
Show full item recordDocument Type
Journal ArticleCitations
Ding, N. & Farokhi, F. (2020). Developing Non-Stochastic Privacy-Preserving Policies Using Agglomerative Clustering. IEEE Transactions on Information Forensics and Security, 15, pp.3911-3923. https://doi.org/10.1109/TIFS.2020.3002479.Access Status
Open AccessAbstract
We consider a non-stochastic privacy-preserving problem in which an adversary aims to infer sensitive information S from publicly accessible data X without using statistics. We consider the problem of generating and releasing a quantization X^ of X to minimize the privacy leakage of S to X^ while maintaining a certain level of utility (or, inversely, the quantization loss). The variables S and X are treated as bounded and non-probabilistic, but are otherwise general. We consider two existing non-stochastic privacy measures, namely the maximum uncertainty reduction L0(S→X^) and the refined information I∗(S;X^) (also called the maximin information) of S . For each privacy measure, we propose a corresponding agglomerative clustering algorithm that converges to a locally optimal quantization solution X^ by iteratively merging elements in the alphabet of X . To instantiate the solution to this problem, we consider two specific utility measures, the worst-case resolution of X by observing X^ and the maximal distortion of the released data X^ . We show that the value of the maximin information I∗(S;X^) can be determined by dividing the confusability graph into connected subgraphs. Hence, I∗(S;X^) can be reduced by merging nodes connecting subgraphs. The relation to the probabilistic information-theoretic privacy is also studied by noting that the Gács-Körner common information is the stochastic version of I∗ and indicates the attainability of statistical indistinguishability.
Export Reference in RIS Format
Endnote
- Click on "Export Reference in RIS Format" and choose "open with... Endnote".
Refworks
- Click on "Export Reference in RIS Format". Login to Refworks, go to References => Import References