{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T15:52:48Z","timestamp":1787759568008,"version":"build-2784847793"},"reference-count":40,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2022,1,11]],"date-time":"2022-01-11T00:00:00Z","timestamp":1641859200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["SCHA 1944\/9-1"],"award-info":[{"award-number":["SCHA 1944\/9-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002347","name":"Federal Ministry of Education and Research","doi-asserted-by":"publisher","award":["16KIS1004"],"award-info":[{"award-number":["16KIS1004"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.mdpi.com"],"crossmark-restriction":true},"short-container-title":["Entropy"],"abstract":"<jats:p>The problem of reliable function computation is extended by imposing privacy, secrecy, and storage constraints on a remote source whose noisy measurements are observed by multiple parties. The main additions to the classic function computation problem include (1) privacy leakage to an eavesdropper is measured with respect to the remote source rather than the transmitting terminals\u2019 observed sequences; (2) the information leakage to a fusion center with respect to the remote source is considered a new privacy leakage metric; (3) the function computed is allowed to be a distorted version of the target function, which allows the storage rate to be reduced compared to a reliable function computation scenario, in addition to reducing secrecy and privacy leakages; (4) two transmitting node observations are used to compute a function. Inner and outer bounds on the rate regions are derived for lossless and lossy single-function computation with two transmitting nodes, which recover previous results in the literature. For special cases, including invertible and partially invertible functions, and degraded measurement channels, simplified lossless and lossy rate regions are characterized, and one achievable region is evaluated as an example scenario.<\/jats:p>","DOI":"10.3390\/e24010110","type":"journal-article","created":{"date-parts":[[2022,1,11]],"date-time":"2022-01-11T14:05:07Z","timestamp":1641909907000},"page":"110","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Function Computation under Privacy, Secrecy, Distortion, and Communication Constraints"],"prefix":"10.3390","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0313-7788","authenticated-orcid":false,"given":"Onur","family":"G\u00fcnl\u00fc","sequence":"first","affiliation":[{"name":"Chair of Communications Engineering and Security, University of Siegen, 57076 Siegen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2022,1,11]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1109\/COMST.2015.2477041","article-title":"Network Function Virtualization: State-of-the-Art and Research Challenges","volume":"18","author":"Mijumbi","year":"2016","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1109\/MSP.2006.1657817","article-title":"Distributed learning in wireless sensor networks","volume":"23","author":"Predd","year":"2006","journal-title":"IEEE Sign. Process. Mag."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Yao, A.C. (1982, January 3\u20135). Protocols for secure computations. Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, Chicago, IL, USA.","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Yao, A.C. (1986, January 27\u201329). How to generate and exchange secrets. Proceedings of the 27th Annual Symposium on Foundations of Computer Science, Toronto, ON, Canada.","DOI":"10.1109\/SFCS.1986.25"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"6337","DOI":"10.1109\/TIT.2011.2165807","article-title":"When Is a Function Securely Computable?","volume":"57","author":"Tyagi","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1109\/18.915643","article-title":"Coding for computing","volume":"47","author":"Orlitsky","year":"2001","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/JSAIT.2021.3062755","article-title":"An Overview of Information-Theoretic Security and Privacy: Metrics, Limits and Applications","volume":"2","author":"Bloch","year":"2021","journal-title":"IEEE J. Sel. Areas Inf. Theory"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"6180","DOI":"10.1109\/TIT.2011.2161916","article-title":"Some Results on Distributed Source Coding for Interactive Function Computation","volume":"57","author":"Ma","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Sefidgaran, M., and Tchamkerten, A. (August, January 31). Computing a function of correlated Sources: A rate region. Proceedings of the 2011 IEEE International Symposium on Information Theory, St. Petersburg, Russia.","DOI":"10.1109\/ISIT.2011.6033872"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"3498","DOI":"10.1109\/TIT.2007.904785","article-title":"Computation Over Multiple-Access Channels","volume":"53","author":"Nazer","year":"2007","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"3407","DOI":"10.1109\/TIT.2012.2188883","article-title":"Optimal Function Computation in Directed and Undirected Graphs","volume":"58","author":"Kowshik","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1109\/JSAC.2013.130408","article-title":"Multi-Session Function Computation and Multicasting in Undirected Graphs","volume":"31","author":"Kannan","year":"2013","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1109\/TIT.1973.1055037","article-title":"Noiseless coding of correlated information sources","volume":"19","author":"Slepian","year":"1973","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1976.1055508","article-title":"The rate-distortion function for source coding with side information at the decoder","volume":"22","author":"Wyner","year":"1976","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Goldenbaum, M., Boche, H., and Poor, H.V. (2016, January 11\u201314). On secure computation over the binary modulo-2 adder multiple-access wiretap channel. Proceedings of the 2016 IEEE Information Theory Workshop (ITW), Cambridge, UK.","DOI":"10.1109\/ITW.2016.7606788"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"4809","DOI":"10.1109\/TIT.2015.2457926","article-title":"Converses For Secret Key Agreement and Secure Computing","volume":"61","author":"Tyagi","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Prabhakaran, V., and Ramchandran, K. (2007, January 2\u20136). On Secure Distributed Source Coding. Proceedings of the 2007 IEEE Information Theory Workshop, Lake Tahoe, CA, USA.","DOI":"10.1109\/ITW.2007.4313115"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"6716","DOI":"10.1109\/TIT.2019.2922634","article-title":"On Function Computation with Privacy and Secrecy Constraints","volume":"65","author":"Tu","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_19","unstructured":"G\u00fcnl\u00fc, O. (2018). Key Agreement with Physical Unclonable Functions and Biometric Identifiers. [Ph.D. Thesis, Technische Universit\u00e4t M\u00fcnchen]."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"G\u00fcnl\u00fc, O., Bloch, M., and Schaefer, R.F. (2021). Secure Multi-Function Computation with Private Remote Sources. arXiv.","DOI":"10.1109\/ISIT45174.2021.9518019"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1825","DOI":"10.1109\/TIFS.2012.2210215","article-title":"A Theoretical Analysis of Authentication, Privacy, and Reusability Across Secure Biometric Systems","volume":"7","author":"Wang","year":"2012","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1945","DOI":"10.1109\/TIFS.2018.2806937","article-title":"Controllable Identifier Measurements for Private Authentication With Secret Keys","volume":"13","author":"Kittichokechai","year":"2018","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_23","unstructured":"Li, N., Zhang, Y., and Kuo, C.C.J. (2020). Explainable Machine Learning based Transform Coding for High Efficiency Intra Prediction. arXiv."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Voloshynovskiy, S., Koval, O., Holotyak, T., and Beekhof, F. (2009, January 6\u20139). Privacy enhancement of common randomness based authentication: Key rate maximized case. Proceedings of the 2009 First IEEE International Workshop on Information Forensics and Security (WIFS), London, UK.","DOI":"10.1109\/WIFS.2009.5386478"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Wayman, J., Jain, A., Maltoni, D., and Maio, D. (2005). Biometric Systems: Technology, Design and Performance Evaluation, Springer.","DOI":"10.1007\/b138151"},{"key":"ref_26","first-page":"1","article-title":"Information leakage of continuous-source zero secrecy leakage helper data schemes","volume":"1","author":"Linnartz","year":"2012","journal-title":"Citeseer Gen"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Voloshynovskiy, S., Koval, O., Holotyak, T., Beekhof, F., and Farhadzadeh, F. (2010, January 12\u201315). Privacy amplification of content identification systems based on fingerprint bit reliability. Proceedings of the 2010 IEEE International Workshop on Information Forensics and Security, Seattle, WA, USA.","DOI":"10.1109\/WIFS.2010.5711461"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Campisi, P. (2013). Security and Privacy in Biometrics, Springer.","DOI":"10.1007\/978-1-4471-5230-9"},{"key":"ref_29","first-page":"1273","article-title":"Communication-Efficient Learning of Deep Networks from Decentralized Data","volume":"54","author":"McMahan","year":"2017","journal-title":"Int. Conf. Artif. Intell. Statist."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"6760","DOI":"10.1109\/TIT.2014.2351812","article-title":"Achievability Proof via Output Statistics of Random Binning","volume":"60","author":"Yassaee","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1865","DOI":"10.1109\/TIT.2011.2110230","article-title":"On the Randomness of Independent Experiments","volume":"57","author":"Holenstein","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_32","unstructured":"G\u00fcnl\u00fc, O., Bloch, M., and Schaefer, R.F. (2021, January 10\u201312). Secure Lossy Function Computation with Multiple Private Remote Source Observations. Proceedings of the 25th International ITG Workshop on Smart Antennas (WSA 2021), French Riviera, France."},{"key":"ref_33","unstructured":"G\u00fcnl\u00fc, O., Bloch, M., and Schaefer, R.F. (November, January 31). Multiple Noisy Private Remote Source Observations for Secure Function Computation. Proceedings of the Asilomar Conference on Signals, Systems & Computers, Pacific Grove, CA, USA."},{"key":"ref_34","unstructured":"Gamal, A.E., and Kim, Y.H. (2011). Network Information Theory, Cambridge University Press."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1109\/TIT.1983.1056668","article-title":"Successive encoding of correlated sources","volume":"29","author":"Ericson","year":"1983","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Ahmadipour, M., Wigger, M., and Kobayashi, M. (2021, January 17\u201321). Joint Sensing and Communication over Memoryless Broadcast Channels. Proceedings of the IEEE Information Theory Workshop, Kanazawa, Japan.","DOI":"10.1109\/ITW46852.2021.9457571"},{"key":"ref_37","unstructured":"Bloch, M. (2018). Lecture Notes in Information-Theoretic Security, The Georgia Institute of Technology."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Bloch, M., and Barros, J. (2011). Physical-Layer Security, Cambridge University Press.","DOI":"10.1017\/CBO9780511977985"},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"G\u00fcnl\u00fc, O., Schaefer, R.F., and Poor, H.V. (2020). Biometric and Physical Identifiers with Correlated Noise for Controllable Private Authentication. arXiv.","DOI":"10.1109\/ISIT44484.2020.9174159"},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Csisz\u00e1r, I., and K\u00f6rner, J. (2011). Information Theory: Coding Theorems for Discrete Memoryless Systems, Cambridge University Press. [2nd ed.].","DOI":"10.1017\/CBO9780511921889"}],"updated-by":[{"DOI":"10.3390\/e24070861","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2022,1,11]],"date-time":"2022-01-11T00:00:00Z","timestamp":1641859200000}}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/1\/110\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T22:16:54Z","timestamp":1754259414000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/1\/110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,11]]},"references-count":40,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,1]]}},"alternative-id":["e24010110"],"URL":"https:\/\/doi.org\/10.3390\/e24010110","relation":{"has-preprint":[{"id-type":"doi","id":"10.20944\/preprints202112.0135.v1","asserted-by":"object"}]},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,11]]}}}