Hypothesis Testing Under Mutual Information Privacy Constraints in the High Privacy Regime

被引:33
|
作者
Liao, Jiachun [1 ]
Sankar, Lalitha
Tan, Vincent Y. F. [2 ]
Calmon, Flavio du Pin [3 ,4 ]
机构
[1] Arizona State Univ, Tempe, AZ 85281 USA
[2] Natl Univ Singapore, Singapore 119077, Singapore
[3] IBM Thomas J Watson Res Ctr, Yorktown Hts, NY 10598 USA
[4] Harvard Univ, John A Paulson Sch Engn & Appl Sci, Cambridge, MA 02138 USA
基金
美国国家科学基金会;
关键词
Hypothesis testing; privacy-guaranteed data publishing; privacy mechanism; euclidean information theory; relative entropy; Renyi divergence; mutual information;
D O I
10.1109/TIFS.2017.2779108
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Hypothesis testing is a statistical inference framework for determining the true distribution among a set of possible distributions for a given data set. Privacy restrictions may require the curator of the data or the respondents themselves to share data with the test only after applying a randomizing privacy mechanism. This work considers mutual information (MI) as the privacy metric for measuring leakage. In addition, motivated by the Chernoff-Stein lemma, the relative entropy between pairs of distributions of the output (generated by the privacy mechanism) is chosen as the utility metric. For these metrics, the goal is to find the optimal privacy-utility tradeoff (PUT) and the corresponding optimal privacy mechanism for both binary and m-ary hypothesis testing. Focusing on the high privacy regime, Euclidean information-theoretic approximations of the binary and m-ary PUT problems are developed. The solutions for the approximation problems clarify that an MI-based privacy metric preserves the privacy of the source symbols in inverse proportion to their likelihoods.
引用
收藏
页码:1058 / 1071
页数:14
相关论文
共 50 条
  • [31] Non-Stochastic Hypothesis Testing with Application to Privacy Against Hypothesis-Testing Adversaries
    Farokhi, Farhad
    2019 IEEE 58TH CONFERENCE ON DECISION AND CONTROL (CDC), 2019, : 6118 - 6123
  • [32] The privacy issue in the contemporary information regime within the context of Information Science
    St Anna, Juliana
    Weber, Claudiane
    Prado, Jorge Moises Kroll do
    Ardigo, Julibio David
    REVISTA IBERO-AMERICANA DE CIENCIA DA INFORMACAO, 2023, 16 (02): : 346 - 364
  • [33] An Information-Theoretic Analysis of the Cost of Decentralization for Learning and Inference under Privacy Constraints
    Jose, Sharu Theresa
    Simeone, Osvaldo
    ENTROPY, 2022, 24 (04)
  • [34] Privacy-preserving schema matching using mutual information
    Cruz, Isabel F.
    Tamassia, Roberto
    Yao, Danfeng
    DATA AND APPLICATIONS SECURITY XXI, PROCEEDINGS, 2007, 4602 : 93 - +
  • [35] Combining Differential Privacy and Mutual Information for Analyzing Leakages in Workflows
    Pettai, Martin
    Laud, Peeter
    PRINCIPLES OF SECURITY AND TRUST (POST 2017), 2017, 10204 : 298 - 319
  • [36] Privacy-preserving Feature Selection based on Mutual Information
    Wu, Ningning
    Li, Hongwei
    Chen, Hanxiao
    Zhang, Xilin
    Wang, Yingzhe
    IEEE CONFERENCE ON GLOBAL COMMUNICATIONS, GLOBECOM, 2023, : 1789 - 1794
  • [37] A Framework for Privacy Quantification: Measuring the Impact of Privacy Techniques Through Mutual Information, Distance Mapping, and Machine Learning
    Miche, Yoan
    Ren, Wei
    Oliver, Ian
    Holtmanns, Silke
    Lendasse, Amaury
    COGNITIVE COMPUTATION, 2019, 11 (02) : 241 - 261
  • [38] A Framework for Privacy Quantification: Measuring the Impact of Privacy Techniques Through Mutual Information, Distance Mapping, and Machine Learning
    Yoan Miche
    Wei Ren
    Ian Oliver
    Silke Holtmanns
    Amaury Lendasse
    Cognitive Computation, 2019, 11 : 241 - 261
  • [39] On some testing of hypothesis problems with information constraints
    Burnashev, MV
    Amari, S
    Han, TS
    THEORY OF PROBABILITY AND ITS APPLICATIONS, 2000, 45 (04) : 558 - 568
  • [40] Fisher information under local differential privacy
    Barnes L.P.
    Chen W.-N.
    Özgür A.
    IEEE Journal on Selected Areas in Information Theory, 2020, 1 (03): : 645 - 659