Measuring Information Leakage in Non-stochastic Brute-Force Guessing

We propose an operational measure of information leakage in a non-stochastic setting to formalize privacy against a brute-force guessing adversary. We use uncertain variables, non-probabilistic counterparts of random variables, to construct a guessing framework in which an adversary is interested in determining private information based on uncertain reports. We consider brute-force trial-and-error guessing in which an adversary can potentially check all the possibilities of the private information that are compatible with the available outputs to find the actual private realization. The ratio of the worst-case number of guesses for the adversary in the presence of the output and in the absence of it captures the reduction in the adversary's guessing complexity and is thus used as a measure of private information leakage. We investigate the relationship between the newly-developed measure of information leakage with the existing non-stochastic maximin information and stochastic maximal leakage that are shown arise in one-shot guessing.

[1]  Chris Clifton,et al.  Differential identifiability , 2012, KDD.

[2]  Mill Johannes G.A. Van,et al.  Transmission Of Information , 1961 .

[3]  Lei Ying,et al.  On the relation between identifiability, differential privacy, and mutual-information privacy , 2014, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[4]  Spiros Skiadopoulos,et al.  SECRETA: A Tool for Anonymizing Relational, Transaction and RT-Datasets , 2015, Medical Data Privacy Handbook.

[5]  Fabian Prasser,et al.  SafePub: A Truthful Data Anonymization Algorithm With Strong Privacy Guarantees , 2018, Proc. Priv. Enhancing Technol..

[6]  Andrey V. Savkin,et al.  Shannon zero error capacity in the problems of state estimation and stabilization via noisy communication channels , 2007, Int. J. Control.

[7]  Sudeep Kamath,et al.  An Operational Approach to Information Leakage , 2018, IEEE Transactions on Information Theory.

[8]  Girish N. Nair,et al.  A Nonstochastic Information Theory for Communication and State Estimation , 2011, IEEE Transactions on Automatic Control.

[9]  R. Sibson Information radius , 1969 .

[10]  J. Massey Guessing and entropy , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[11]  Cynthia Dwork,et al.  Calibrating Noise to Sensitivity in Private Data Analysis , 2006, TCC.

[12]  Rajeev Motwani,et al.  Towards robustness in query auditing , 2006, VLDB.

[13]  Farhad Farokhi Noiseless Privacy , 2019, ArXiv.

[14]  Stefan Wolf,et al.  Zero-error information and applications in cryptography , 2004, Information Theory Workshop.

[15]  Peter E. Latham,et al.  Mutual Information , 2006 .

[16]  G. Crooks On Measures of Entropy and Information , 2015 .

[17]  Ni Ding,et al.  Developing Non-Stochastic Privacy-Preserving Policies Using Agglomerative Clustering , 2019, IEEE Transactions on Information Forensics and Security.

[18]  Raghav Bhaskar,et al.  Noiseless Database Privacy , 2011, ASIACRYPT.

[19]  A. Kolmogorov,et al.  Entropy and "-capacity of sets in func-tional spaces , 1961 .

[20]  Tobias J. Oechtering,et al.  Privacy Against a Hypothesis Testing Adversary , 2018, IEEE Transactions on Information Forensics and Security.

[21]  Deniz Gündüz,et al.  Privacy Against Brute-Force Inference Attacks , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[22]  Oliver Kosut,et al.  A Tunable Measure for Information Leakage , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[23]  Farhad Farokhi,et al.  Development and Analysis of Deterministic Privacy-Preserving Policies Using Non- Stochastic Information Theory , 2018, IEEE Transactions on Information Forensics and Security.

[24]  Sergio Verdú,et al.  Arimoto–Rényi Conditional Entropy and Bayesian $M$ -Ary Hypothesis Testing , 2017, IEEE Transactions on Information Theory.