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 条
  • [21] Hypothesis Testing Interpretations and Renyi Differential Privacy
    Balle, Borja
    Barthe, Gilles
    Gaboardi, Marco
    Hsu, Justin
    Sato, Tetsuya
    INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 108, 2020, 108 : 2496 - 2505
  • [22] Estimation Efficiency Under Privacy Constraints
    Asoodeh, Shahab
    Diaz, Mario
    Alajaji, Fady
    Linder, Tamas
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (03) : 1512 - 1534
  • [23] Privacy Under Hard Distortion Constraints
    Liao, Jiachun
    Kosut, Oliver
    Sankar, Lalitha
    Calmon, Flavio P.
    2018 IEEE INFORMATION THEORY WORKSHOP (ITW), 2018, : 465 - 469
  • [24] Quantum Hypothesis Testing Mutual Information
    Zhang S.
    Xi Z.
    Xi, Zhengjun (xizhengjun@snnu.edu.cn), 1906, Science Press (58): : 1906 - 1914
  • [25] Large-Scale Information Extraction under Privacy-Aware Constraints
    Gupta, Rajeev
    Kondapally, Ranganath
    PROCEEDINGS OF THE 28TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, KDD 2022, 2022, : 4792 - 4793
  • [26] On the Mutual Information of Two Boolean Functions, with Application to Privacy
    Bassi, German
    Skoglund, Mikael
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 1197 - 1201
  • [27] Large-Scale Information Extraction under Privacy-Aware Constraints
    Gupta, Rajeev
    Kondapally, Ranganath
    PROCEEDINGS OF THE 30TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, CIKM 2021, 2021, : 4845 - 4848
  • [28] Smart Meter Privacy Based on Adversarial Hypothesis Testing
    Li, Zuxing
    Oechtering, Tobias J.
    Gunduz, Deniz
    2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 774 - 778
  • [29] Organization of mobile networks under privacy constraints
    Hamano, T
    Takakura, H
    Kambayashi, Y
    INTERNET APPLICATIONS, 1999, 1749 : 317 - 322
  • [30] Selling Data at an Auction under Privacy Constraints
    Zhang, Mengxiao
    Beltran, Fernando
    Liu, Jiamou
    CONFERENCE ON UNCERTAINTY IN ARTIFICIAL INTELLIGENCE (UAI 2020), 2020, 124 : 669 - 678