Contraction of Locally Differentially Private Mechanisms

被引:1
|
作者
Asoodeh, Shahab [1 ,2 ]
Zhang, Huanyu [3 ]
机构
[1] Metas Stat & Privacy Team, New York, NY 10003 USA
[2] McMaster Univ, Dept Comp & Software, Hamilton, ON L8S IC7, Canada
[3] Meta Platforms Inc, New York, NY 10003 USA
关键词
Differential privacy; data processing inequality; contraction coefficient; minimax estimation risk; f-divergences; INFORMATION CONSTRAINTS; COEFFICIENTS; CONVERGENCE; DIVERGENCE; INFERENCE; ENTROPY;
D O I
10.1109/JSAIT.2024.3397305
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We investigate the contraction properties of locally differentially private mechanisms. More specifically, we derive tight upper bounds on the divergence between PK and QK output distributions of an epsilon-LDP mechanism K in terms of a divergence between the corresponding input distributions P and Q, respectively. Our first main technical result presents a sharp upper bound on the chi(2)-divergence chi(2)(PK||QK) in terms of chi(2)(P||Q) and epsilon. We also show that the same result holds for a large family of divergences, including KL-divergence and squared Hellinger distance. The second main technical result gives an upper bound on chi(2)(PK||QK) in terms of total variation distance TV(P, Q) and epsilon. We then utilize these bounds to establish locally private versions of the van Trees inequality, Le Cam's, Assouad's, and the mutual information methods-powerful tools for bounding minimax estimation risks. These results are shown to lead to tighter privacy analyses than the state-of-the-arts in several statistical problems such as entropy and discrete distribution estimation, non-parametric density estimation, and hypothesis testing.
引用
收藏
页码:385 / 395
页数:11
相关论文
共 50 条
  • [1] Optimal Compression of Locally Differentially Private Mechanisms
    Shah, Abhin
    Chen, Wei-Ning
    Balle, Johannes
    Kairouz, Peter
    Theis, Lucas
    INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 151, 2022, 151
  • [2] On the Utility Gain of Iterative Bayesian Update for Locally Differentially Private Mechanisms
    Arcolezi, Heber H.
    Cerna, Selene
    Palamidessi, Catuscia
    DATA AND APPLICATIONS SECURITY AND PRIVACY XXXVII, DBSEC 2023, 2023, 13942 : 165 - 183
  • [3] Locally Differentially Private Minimum Finding
    Fukuchi, Kazuto
    Yu, Chia-Mu
    Sakuma, Jun
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2022, E105D (08) : 1418 - 1430
  • [4] Basic Differentially Private Mechanisms
    Le Ny, Jerome
    SpringerBriefs in Control, Automation and Robotics, 2020, : 13 - 30
  • [5] Locally Differentially Private Sparse Vector Aggregation
    Zhou, Mingxun
    Wang, Tianhao
    Chan, T-H. Hubert
    Fanti, Giulia
    Shi, Elaine
    43RD IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP 2022), 2022, : 422 - 439
  • [6] LDPTrace: Locally Differentially Private Trajectory Synthesis
    Du, Yuntao
    Hu, Yujia
    Zhang, Zhikun
    Fang, Ziquan
    Chen, Lu
    Zheng, Baihua
    Gao, Yunjun
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2023, 16 (08): : 1897 - 1909
  • [7] Locally Differentially Private Protocols for Frequency Estimation
    Wang, Tianhao
    Blocki, Jeremiah
    Li, Ninghui
    Jha, Somesh
    PROCEEDINGS OF THE 26TH USENIX SECURITY SYMPOSIUM (USENIX SECURITY '17), 2017, : 729 - 745
  • [8] Locally Differentially Private Heavy Hitter Identification
    Wang, Tianhao
    Li, Ninghui
    Jha, Somesh
    IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2021, 18 (02) : 982 - 993
  • [9] Locally Differentially-Private Distribution Estimation
    Pastore, Adrian
    Gastpar, Michael
    2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 2694 - 2698
  • [10] Locally Differentially Private (Contextual) Bandits Learning
    Zheng, Kai
    Cai, Tianle
    Huang, Weiran
    Li, Zhenguo
    Wang, Liwei
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020, 2020, 33