{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:18:50Z","timestamp":1761293930718,"version":"build-2065373602"},"reference-count":39,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T00:00:00Z","timestamp":1557187200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>We revisit the distributed hypothesis testing (or hypothesis testing with communication constraints) problem from the viewpoint of privacy. Instead of observing the raw data directly, the transmitter observes a sanitized or randomized version of it. We impose an upper bound on the mutual information between the raw and randomized data. Under this scenario, the receiver, which is also provided with side information, is required to make a decision on whether the null or alternative hypothesis is in effect. We first provide a general lower bound on the type-II exponent for an arbitrary pair of hypotheses. Next, we show that if the distribution under the alternative hypothesis is the product of the marginals of the distribution under the null (i.e., testing against independence), then the exponent is known exactly. Moreover, we show that the strong converse property holds. Using ideas from Euclidean information theory, we also provide an approximate expression for the exponent when the communication rate is low and the privacy level is high. Finally, we illustrate our results with a binary and a Gaussian example.<\/jats:p>","DOI":"10.3390\/e21050478","type":"journal-article","created":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T11:00:57Z","timestamp":1557745257000},"page":"478","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Distributed Hypothesis Testing with Privacy Constraints"],"prefix":"10.3390","volume":"21","author":[{"given":"Atefeh","family":"Gilani","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, College of Engineering, University of Tehran, Tehran 14171614418, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Selma","family":"Belhadj Amor","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, National University of Singapore, Singapore 117583, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sadaf","family":"Salehkalaibar","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, College of Engineering, University of Tehran, Tehran 14171614418, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5008-4527","authenticated-orcid":false,"given":"Vincent Y. F.","family":"Tan","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, National University of Singapore, Singapore 117583, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,5,7]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1109\/TIT.1986.1057194","article-title":"Hypothesis testing with communication constraints","volume":"32","author":"Ahlswede","year":"1986","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Zhao, W., and Lai, L. (October, January 30). Distributed testing against independence with multiple terminals. Proceedings of the 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, USA.","DOI":"10.1109\/ALLERTON.2014.7028598"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Xiang, Y., and Kim, Y.H. (2013, January 7\u201312). Interactive hypothesis testing against independence. Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey.","DOI":"10.1109\/ISIT.2013.6620744"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"4666","DOI":"10.1109\/TIT.2008.928951","article-title":"Successive refinement for hypothesis testing and lossless one-helper problem","volume":"54","author":"Tian","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"6282","DOI":"10.1109\/TIT.2012.2206793","article-title":"On the optimality of binning for distributed hypothesis testing","volume":"58","author":"Rahman","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Sreekuma, S., and G\u00fcnd\u00fcz, D. (2017, January 25\u201330). Distributed Hypothesis Testing Over Noisy Channels. Proceedings of the 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany.","DOI":"10.1109\/ISIT.2017.8006675"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Salehkalaibar, S., Wigger, M., and Timo, R. (2017). On hypothesis testing against independence with multiple decision centers. arXiv.","DOI":"10.1109\/TCOMM.2018.2798659"},{"key":"ref_8","unstructured":"Salehkalaibar, S., Wigger, M., and Wang, L. (2017). Hypothesis Testing In Multi-Hop Networks. arXiv."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Mhanna, M., and Piantanida, P. (2015, January 14\u201319). On secure distributed hypothesis testing. Proceedings of the 2015 IEEE International Symposium on Information Theory (ISIT), Hong Kong, China.","DOI":"10.1109\/ISIT.2015.7282727"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1109\/TIT.1987.1057383","article-title":"Hypothesis testing with multiterminal data compression","volume":"33","author":"Han","year":"1987","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_11","first-page":"533","article-title":"Error bound for hypothesis testing with data compression","volume":"32","author":"Shimokawa","year":"1994","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Ugur, Y., Aguerri, I.E., and Zaidi, A. (2018). Vector Gaussian CEO Problem Under Logarithmic Loss and Applications. arXiv.","DOI":"10.1109\/ITW.2018.8613480"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Zaidi, A., Aguerri, I.E., Caire, G., and Shamai, S. (2018, January 11\u201316). Uplink oblivious cloud radio access networks: An information theoretic overview. Proceedings of the 2018 Information Theory and Applications Workshop (ITA), San Diego, CA, USA.","DOI":"10.1109\/ITA.2018.8503144"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Aguerri, I.E., Zaidi, A., Caire, G., and Shamai, S. (2017, January 25\u201330). On the capacity of cloud radio access networks with oblivious relaying. Proceedings of the 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany.","DOI":"10.1109\/ISIT.2017.8006893"},{"key":"ref_15","unstructured":"Aguerri, I.E., and Zaidi, A. (2018, January 21\u201323). Distributed information bottleneck method for discrete and Gaussian sources. Proceedings of the 2018 International Zurich Seminar on Information and Communication (IZS), Zurich, Switzerland."},{"key":"ref_16","unstructured":"Aguerri, I.E., and Zaidi, A. (2018). Distributed variational representation learning. arXiv."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Evfimievski, A.V., Gehrke, J., and Srikant, R. (2003, January 9\u201311). Limiting privacy breaches in privacy preserving data mining. Proceedings of the Twenty-Second Symposium on Principles of Database Systems, San Diego, CA, USA.","DOI":"10.1145\/773153.773174"},{"key":"ref_18","unstructured":"Smith, G. (2009). On the Foundations of Quantitative Information Flow. Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, Springer."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1109\/TIFS.2013.2253320","article-title":"Utility-Privacy Tradeoffs in Databases: An Information-Theoretic Approach","volume":"8","author":"Sankar","year":"2013","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1058","DOI":"10.1109\/TIFS.2017.2779108","article-title":"Hypothesis Testing Under Mutual Information Privacy Constraints in the High Privacy Regime","volume":"13","author":"Liao","year":"2018","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Barthe, G., and K\u00f6pf, B. (2011, January 27\u201329). Information-theoretic bounds for differentially private mechanisms. Proceedings of the 2011 IEEE 24th Computer Security Foundations Symposium, Cernay-la-Ville, France.","DOI":"10.1109\/CSF.2011.20"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Issa, I., and Wagner, A.B. (2017, January 25\u201330). Operational definitions for some common information leakage metrics. Proceedings of the 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany.","DOI":"10.1109\/ISIT.2017.8006632"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Liao, J., Sankar, L., Calmon, F., and Tan, V.Y.F. (2017, January 25\u201330). Hypothesis testing under maximal leakage privacy constraints. Proceedings of the 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany.","DOI":"10.1109\/ISIT.2017.8006634"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Wagner, I., and Eckhoff, D. (2018). Technical Privacy Metrics: A Systematic Survey. ACM Comput. Surv. (CSUR), 51, to appear.","DOI":"10.1145\/3168389"},{"key":"ref_25","first-page":"1","article-title":"Differential Privacy","volume":"Volume 4052","author":"Dwork","year":"2006","journal-title":"Proceedings of the 33rd International Colloquium on Automata, Languages and Programming, Part II (ICALP 2006)"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1007\/11761679_29","article-title":"Our Data, Ourselves: Privacy Via Distributed Noise Generation","volume":"Volume 4004","author":"Dwork","year":"2006","journal-title":"Advances in Cryptology (EUROCRYPT 2006)"},{"key":"ref_27","unstructured":"Dwork, C. (2008). Differential Privacy: A Survey of Results, Springer. Chapter Theory and Applications of Models of Computation; TAMC 2008; Lecture Notes in Computer Science."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1198\/jasa.2009.tm08651","article-title":"A statistical framework for differential privacy","volume":"105","author":"Wasserman","year":"2010","journal-title":"J. Am. Stat. Assoc."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Sreekumar, A.C., and Gunduz, D. (2018). Distributed hypothesis testing with a privacy constraint. arXiv.","DOI":"10.1109\/ITW.2018.8613433"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Borade, S., and Zheng, L. (2008, January 12\u201314). Euclidean Information Theory. Proceedings of the 2008 IEEE International Zurich Seminar on Communications, Zurich, Switzerland.","DOI":"10.1109\/IZS.2008.4497265"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"6795","DOI":"10.1109\/TIT.2015.2484066","article-title":"Euclidean information theory of networks","volume":"61","author":"Huang","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_32","unstructured":"Viterbi, A.J., and Omura, J.K. (1979). Principles of Digital Communication and Coding, McGraw-Hill."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"2165","DOI":"10.1109\/TIT.2015.2405537","article-title":"Optimum tradeoffs between the error exponent and the excess-rate exponent of variable rate Slepian-Wolf coding","volume":"61","author":"Weinberger","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"El Gamal, A., and Kim, Y.H. (2011). Network Information Theory, Cambridge University Press.","DOI":"10.1017\/CBO9781139030687"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1109\/18.119685","article-title":"Multiterminal detection with zero-rate data compression","volume":"38","author":"Shalaby","year":"1992","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Cover, T.M., and Thomas, J.A. (2006). Elements of Information Theory, Wiley. [2nd ed.].","DOI":"10.1002\/047174882X"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"4923","DOI":"10.1109\/TIT.2017.2778252","article-title":"Neyman-Pearson Test for Zero-Rate Multiterminal Hypothesis Testing","volume":"64","author":"Watanabe","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_38","unstructured":"Csisz\u00e0r, I., and K\u00f6rner, J. (1982). Information theory: Coding Theorems for Discrete Memoryless Systems, Academic Press."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/TIT.1973.1055107","article-title":"A theorem on the entropy of certain binary sequences and applications (Part I)","volume":"19","author":"Wyner","year":"1973","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/5\/478\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:49:54Z","timestamp":1760186994000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/5\/478"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,7]]},"references-count":39,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2019,5]]}},"alternative-id":["e21050478"],"URL":"https:\/\/doi.org\/10.3390\/e21050478","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2019,5,7]]}}}