{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:37:23Z","timestamp":1773376643495,"version":"3.50.1"},"reference-count":35,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206578","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"1794-1799","source":"Crossref","is-referenced-by-count":7,"title":["Strong Data Processing Inequalities for Locally Differentially Private Mechanisms"],"prefix":"10.1109","author":[{"given":"Behnoosh","family":"Zamanlooy","sequence":"first","affiliation":[{"name":"McMaster University,Department of Computing and Software"}]},{"given":"Shahab","family":"Asoodeh","sequence":"additional","affiliation":[{"name":"McMaster University,Department of Computing and Software"}]}],"member":"263","reference":[{"key":"ref13","first-page":"1120","article-title":"Hadamard response: Estimating distributions privately, efficiently, and with little communication","volume":"89","author":"acharya","year":"2019","journal-title":"Proceedings of the Twenty-Second International Conference on Artificial Intelligence and Statistics"},{"key":"ref35","author":"cover","year":"2012","journal-title":"Elements of Information Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2809790"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2482978"},{"key":"ref15","first-page":"3208","article-title":"Lossless compression of efficient private local randomizers","author":"feldman","year":"2021","journal-title":"Proceedings of the 38th Annual Conference on International Conference on Machine Learning"},{"key":"ref14","first-page":"2436","article-title":"Discrete distribution estimation under local privacy","volume":"48","author":"kairouz","year":"2016","journal-title":"Proc Int Conf Machine Learning"},{"key":"ref31","author":"asoodeh","year":"2020","journal-title":"Privacy analysis of online learning algorithms via contraction coefficients"},{"key":"ref30","first-page":"13 277","article-title":"Privacy amplification by mixing and diffusion mechanisms","author":"balle","year":"2019","journal-title":"NeurIPS"},{"key":"ref11","first-page":"11","article-title":"A unified maximum likelihood approach for estimating symmetric properties of discrete distributions","author":"acharya","year":"2017","journal-title":"International Conference on Machine Learning"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.2307\/2283137"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1214\/19-AOS1901"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3054692"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/090756090"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773174"},{"key":"ref17","first-page":"6418","article-title":"Private frequency estimation via projective geometry","author":"feldman","year":"2022","journal-title":"International Conference on Machine Learning"},{"key":"ref16","author":"shah","year":"2021","journal-title":"Optimal compression of locally differentially private mechanisms"},{"key":"ref19","article-title":"Locally differentially private estimation of functionals of discrete distributions","author":"butucea","year":"0"},{"key":"ref18","author":"asoodeh","year":"2022","journal-title":"Contraction of locally differentially private mechanisms"},{"key":"ref24","author":"pensia","year":"2023","journal-title":"Simple binary hypothesis testing under local differential privacy and communication constraints"},{"key":"ref23","first-page":"1","article-title":"Extremal mechanisms for local differential privacy","volume":"17","author":"kairouz","year":"2016","journal-title":"Journal of Machine Learning Research"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00015"},{"key":"ref25","author":"cohen","year":"1998","journal-title":"Comparisons of Stochastic Matrices with Applications in Information Theory Economics and Population Sciences"},{"key":"ref20","first-page":"423","author":"yu","year":"1997","journal-title":"Assouad Fano and Le Cam"},{"key":"ref22","author":"wu","year":"2020","journal-title":"Lecture notes for information-theoretic methods for high-dimensional statistics"},{"key":"ref21","article-title":"Extremal mechanisms for local differential privacy","author":"kairouz","year":"2014","journal-title":"Proc Neural Information Processing Systems (NeurIPS)"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1966.tb00626.x"},{"key":"ref27","first-page":"299","article-title":"Information-type measures of difference of probability distributions and indirect observations","volume":"2","author":"csisz\u00e1r","year":"1967","journal-title":"Studia Sci Math Hungar"},{"key":"ref29","first-page":"6280","article-title":"Privacy amplification by subsampling: Tight analyses via couplings and divergences","author":"balle","year":"2018","journal-title":"NeurIPS"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517999"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028440"},{"key":"ref9","first-page":"1046","article-title":"Optimal algorithms for mean estimation under local differential privacy","author":"asi","year":"2022","journal-title":"Proceedings of the 39th International Conference on Machine Learning"},{"key":"ref4","author":"bhowmick","year":"2018","journal-title":"Protection against reconstruction and its applications in private federated learning"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2017.1389735"},{"key":"ref6","first-page":"1161","article-title":"Lower bounds for locally private estimation via communication complexity","author":"duchi","year":"2019","journal-title":"Proc Conf Learn Theory"},{"key":"ref5","author":"duchi","year":"2020","journal-title":"The right complexity measure in locally private estimation It is not the fisher information"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206578.pdf?arnumber=10206578","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:15Z","timestamp":1773347235000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206578\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206578","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}