Cargando…
Privacy-Aware Distributed Hypothesis Testing †
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 anot...
Autores principales: | , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7517198/ https://www.ncbi.nlm.nih.gov/pubmed/33286437 http://dx.doi.org/10.3390/e22060665 |
_version_ | 1783587174908690432 |
---|---|
author | Sreekumar, Sreejith Cohen, Asaf Gündüz, Deniz |
author_facet | Sreekumar, Sreejith Cohen, Asaf Gündüz, Deniz |
author_sort | Sreekumar, Sreejith |
collection | PubMed |
description | 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. |
format | Online Article Text |
id | pubmed-7517198 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2020 |
publisher | MDPI |
record_format | MEDLINE/PubMed |
spelling | pubmed-75171982020-11-09 Privacy-Aware Distributed Hypothesis Testing † Sreekumar, Sreejith Cohen, Asaf Gündüz, Deniz Entropy (Basel) Article 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. MDPI 2020-06-16 /pmc/articles/PMC7517198/ /pubmed/33286437 http://dx.doi.org/10.3390/e22060665 Text en © 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/). |
spellingShingle | Article Sreekumar, Sreejith Cohen, Asaf Gündüz, Deniz Privacy-Aware Distributed Hypothesis Testing † |
title | Privacy-Aware Distributed Hypothesis Testing † |
title_full | Privacy-Aware Distributed Hypothesis Testing † |
title_fullStr | Privacy-Aware Distributed Hypothesis Testing † |
title_full_unstemmed | Privacy-Aware Distributed Hypothesis Testing † |
title_short | Privacy-Aware Distributed Hypothesis Testing † |
title_sort | privacy-aware distributed hypothesis testing † |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7517198/ https://www.ncbi.nlm.nih.gov/pubmed/33286437 http://dx.doi.org/10.3390/e22060665 |
work_keys_str_mv | AT sreekumarsreejith privacyawaredistributedhypothesistesting AT cohenasaf privacyawaredistributedhypothesistesting AT gunduzdeniz privacyawaredistributedhypothesistesting |