Privacy-Aware Distributed Hypothesis Testing

被引:6
|
作者
Sreekumar, Sreejith [1 ]
Cohen, Asaf [2 ]
Gunduz, Deniz [3 ]
机构
[1] Cornell Univ, Dept Elect & Comp Engn, Ithaca, NY 14850 USA
[2] Ben Gurion Univ Negev, Sch Elect & Comp Engn, IL-8410501 Beer Sheva, Israel
[3] Imperial Coll London, Dept Elect & Elect Engn, London SW7 2AZ, England
基金
欧洲研究理事会;
关键词
Hypothesis testing; privacy; testing against conditional independence; error exponent; equivocation; distortion; causal disclosure; SEMANTIC-SECURITY; INFORMATION; INDEPENDENCE;
D O I
10.3390/e22060665
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
A distributed binary hypothesis testing (HT) problem involving two parties, a remote observer and a detector, is studied. The remote observer has access to a discrete memoryless source, and communicates its observations to the detector via a rate-limited noiseless channel. The detector observes another discrete memoryless source, and performs a binary hypothesis test on the joint distribution of its own observations with those of the observer. While the goal of the observer is to maximize the type II error exponent of the test for a given type I error probability constraint, it also wants to keep a private part of its observations as oblivious to the detector as possible. Considering both equivocation and average distortion under a causal disclosure assumption as possible measures of privacy, the trade-off between the communication rate from the observer to the detector, the type II error exponent, and privacy is studied. For the general HT problem, we establish single-letter inner bounds on both the rate-error exponent-equivocation and rate-error exponent-distortion trade-offs. Subsequently, single-letter characterizations for both trade-offs are obtained (i) for testing against conditional independence of the observer's observations from those of the detector, given some additional side information at the detector; and (ii) when the communication rate constraint over the channel is zero. Finally, we show by providing a counter-example where the strong converse which holds for distributed HT without a privacy constraint does not hold when a privacy constraint is imposed. This implies that in general, the rate-error exponent-equivocation and rate-error exponent-distortion trade-offs are not independent of the type I error probability constraint.
引用
收藏
页数:44
相关论文
共 50 条
  • [21] Privacy-Aware Network Monitoring
    Dorfinger, Peter
    Schmoll, Carsten
    Strohmeier, Felix
    ERCIM NEWS, 2009, (77): : 28 - 29
  • [22] Privacy-aware electronic society
    Maryline Laurent
    Sara Foresti
    Heng Xu
    annals of telecommunications - annales des télécommunications, 2014, 69 : 1 - 2
  • [23] A privacy-aware distributed software architecture for automation services in compliance with GDPR
    Kittmann, Tom
    Lambrecht, Jens
    Horn, Christian
    2018 IEEE 23RD INTERNATIONAL CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION (ETFA), 2018, : 1067 - 1070
  • [24] Privacy-Aware Trust Negotiation
    Rios, Ruben
    Fernandez-Gago, Carmen
    Lopez, Javier
    SECURITY AND TRUST MANAGEMENT, STM 2016, 2016, 9871 : 98 - 105
  • [25] Towards privacy-aware eLearning
    Borcea, Katrin
    Donker, Hilko
    Franz, Elke
    Pfitzmann, Andreas
    Wahrig, Hagen
    PRIVACY ENHANCING TECHNOLOGIES, 2006, 3856 : 167 - 178
  • [26] Privacy-aware loyalty programs
    Blanco-Justicia, Alberto
    Domingo-Ferrer, Josep
    COMPUTER COMMUNICATIONS, 2016, 82 : 83 - 94
  • [27] Repeated games for privacy-aware distributed state estimation in interconnected networks
    Belmega, E. V.
    Sankar, L.
    Poor, H. V.
    2012 6TH INTERNATIONAL CONFERENCE ON NETWORK GAMES, CONTROL AND OPTIMIZATION (NETGCOOP), 2012, : 64 - 68
  • [28] A communication-efficient and privacy-aware distributed algorithm for sparse PCA
    Wang, Lei
    Liu, Xin
    Zhang, Yin
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2023, 85 (03) : 1033 - 1072
  • [29] A communication-efficient and privacy-aware distributed algorithm for sparse PCA
    Lei Wang
    Xin Liu
    Yin Zhang
    Computational Optimization and Applications, 2023, 85 : 1033 - 1072
  • [30] Privacy-Aware Rejection Sampling
    Awan, Jordan
    Rao, Vinayak
    JOURNAL OF MACHINE LEARNING RESEARCH, 2023, 24 : 1 - 32