{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T14:10:12Z","timestamp":1771855812407,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T00:00:00Z","timestamp":1769817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T00:00:00Z","timestamp":1771804800000},"content-version":"vor","delay-in-days":23,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"ZENITH Research and Leadership Career Development Fund"},{"name":"Swedish Foundation for Strategic Research"},{"name":"EU COST Action 6G-PHYSEC"},{"DOI":"10.13039\/501100003945","name":"Link\u00f6ping University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003945","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Inf. Secur."],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>We establish the randomized distributed function computation (RDFC) framework, in which a sender transmits just enough information for a receiver to generate a randomized function of the input data. Describing RDFC as a form of semantic communication, which can be essentially seen as a generalized remote-source-coding problem, we show that security and privacy constraints naturally fit this model, as they generally require a randomization step. Using strong coordination metrics, we ensure (local differential) privacy for every input sequence and prove that such guarantees can be met even when no common randomness is shared between the transmitter and receiver. This work provides lower bounds on Wyner\u2019s common information (WCI), which is the communication cost when common randomness is absent, and proposes numerical techniques to evaluate the other corner point of the RDFC rate region for continuous-alphabet random variables with unlimited shared randomness. Experiments illustrate that a sufficient amount of common randomness can reduce the semantic communication rate by up to two orders of magnitude compared to the WCI point, while RDFC without any shared randomness still outperforms lossless transmission by a large margin. A finite blocklength analysis further confirms that the privacy parameter gap between the asymptotic and non-asymptotic RDFC methods closes exponentially fast with input length. Our results position RDFC as an energy-efficient semantic communication strategy for privacy-aware distributed computation systems.<\/jats:p>","DOI":"10.1186\/s13635-026-00223-z","type":"journal-article","created":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T07:15:29Z","timestamp":1769843729000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Randomized distributed function computation (RDFC): ultra-efficient semantic communication applications to privacy"],"prefix":"10.1186","volume":"2026","author":[{"given":"Onur","family":"G\u00fcnl\u00fc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,31]]},"reference":[{"issue":"4","key":"223_CR1","doi-asserted-by":"publisher","first-page":"336","DOI":"10.23919\/JCIN.2021.9663101","volume":"6","author":"Q Lan","year":"2021","unstructured":"Q. Lan et al., What is semantic communication? A view on conveying meaning in the era of machine intelligence. J. Commun. Inf. Netw. (JCIN) 6(4), 336\u2013371 (2021)","journal-title":"J. Commun. Inf. Netw. (JCIN)"},{"issue":"1","key":"223_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/JSAC.2022.3223408","volume":"41","author":"D G\u00fcnd\u00fcz","year":"2022","unstructured":"D. G\u00fcnd\u00fcz et al., Beyond transmitting bits: Context, semantics, and task-oriented communications. IEEE J. Sel. Areas Commun. (JSAC) 41(1), 5\u201341 (2022)","journal-title":"IEEE J. Sel. Areas Commun. (JSAC)"},{"issue":"1","key":"223_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1109\/MBITS.2023.3322667","volume":"3","author":"D G\u00fcnd\u00fcz","year":"2023","unstructured":"D. G\u00fcnd\u00fcz et al., Timely and massive communication in 6G: Pragmatics, learning, and inference. IEEE BITS Inf. Theory Mag. 3(1), 27\u201340 (2023)","journal-title":"IEEE BITS Inf. Theory Mag."},{"issue":"5","key":"223_CR4","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1109\/TIT.1962.1057738","volume":"8","author":"R Dobrushin","year":"1962","unstructured":"R. Dobrushin, B. Tsybakov, Information transmission with additional noise. IRE Trans. Inf. Theory (T-IT) 8(5), 293\u2013304 (1962)","journal-title":"IRE Trans. Inf. Theory (T-IT)"},{"key":"223_CR5","doi-asserted-by":"crossref","unstructured":"T. Berger, Rate-distortion theory. (Wiley Encyclopedia of Telecommunications, 2003)","DOI":"10.1002\/0471219282.eot142"},{"key":"223_CR6","doi-asserted-by":"crossref","unstructured":"I. Csisz\u00e1r, J. K\u00f6rner, Information Theory: Coding Theorems for Discrete Memoryless Systems (Cambridge University Press,\u00a0Cambridge, 2011)","DOI":"10.1017\/CBO9780511921889"},{"issue":"1","key":"223_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/JSAIT.2021.3062755","volume":"2","author":"M Bloch","year":"2021","unstructured":"M. Bloch et al., An overview of information-theoretic security and privacy: Metrics, limits and applications. IEEE J. Sel. Areas Inf. Theory (JSAIT) 2(1), 5\u201322 (2021)","journal-title":"IEEE J. Sel. Areas Inf. Theory (JSAIT)"},{"issue":"9","key":"223_CR8","doi-asserted-by":"publisher","first-page":"5492","DOI":"10.1109\/TIT.2020.2980789","volume":"66","author":"D Data","year":"2020","unstructured":"D. Data, G.R. Kurri, J. Ravi, V.M. Prabhakaran, Interactive secure function computation. IEEE Trans. Inf. Theory (T-IT) 66(9), 5492\u20135521 (2020)","journal-title":"IEEE Trans. Inf. Theory (T-IT)"},{"key":"223_CR9","doi-asserted-by":"crossref","unstructured":"G. \u00c5hlgren, O. G\u00fcnl\u00fc, in IEEE International Symposium on Information Theory (ISIT). Secure rate-distortion-perception trade-off over channels: A randomized distributed function computation (RDFC) application (Ann Arbor, 2025)","DOI":"10.1109\/ISIT63088.2025.11195669"},{"issue":"11","key":"223_CR10","doi-asserted-by":"publisher","first-page":"7071","DOI":"10.1109\/TIT.2013.2279330","volume":"59","author":"P Cuff","year":"2013","unstructured":"P. Cuff, Distributed channel synthesis. IEEE Trans. Inf. Theory (T-IT) 59(11), 7071\u20137096 (2013)","journal-title":"IEEE Trans. Inf. Theory (T-IT)"},{"key":"223_CR11","doi-asserted-by":"crossref","unstructured":"O. G\u00fcnl\u00fc, M. Skorski, H.V. Poor, in\u00a0Proceedings of\u00a0EuCNC & 6G Summit. Low-latency rate-distortion-perception trade-off: A randomized distributed function computation application (Poznan, 2025)","DOI":"10.1109\/EuCNC\/6GSummit63408.2025.11037206"},{"issue":"10","key":"223_CR12","doi-asserted-by":"publisher","first-page":"2637","DOI":"10.1109\/TIT.2002.802612","volume":"48","author":"C Bennett","year":"2002","unstructured":"C. Bennett, P. Shor, J. Smolin, A. Thapliyal, Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem. IEEE Trans. Inf. Theory (T-IT) 48(10), 2637\u20132655 (2002)","journal-title":"IEEE Trans. Inf. Theory (T-IT)"},{"issue":"1","key":"223_CR13","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1109\/TIT.2009.2034824","volume":"56","author":"P Harsha","year":"2010","unstructured":"P. Harsha, R. Jain, D. McAllester, J. Radhakrishnan, The communication complexity of correlation. IEEE Trans. Inf. Theory (T-IT) 56(1), 438\u2013449 (2010)","journal-title":"IEEE Trans. Inf. Theory (T-IT)"},{"issue":"2","key":"223_CR14","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1109\/TIT.2006.889015","volume":"53","author":"G Kramer","year":"2007","unstructured":"G. Kramer, S.A. Savari, Communicating probability distributions. IEEE Trans. Inf. Theory (T-IT) 53(2), 518\u2013525 (2007)","journal-title":"IEEE Trans. Inf. Theory (T-IT)"},{"key":"223_CR15","unstructured":"M. Havasi, R. Peharz, J.M. Hern\u00e1ndez-Lobato, in International Conference on Learning Representations (ICLR). Minimal random code learning: Getting bits back from compressed model parameters (New Orleans, 2019)"},{"key":"223_CR16","unstructured":"A. Shah, W.N. Chen, J. Balle, P. Kairouz, L. Theis, in International Conference on Artificial Intelligence and Statistics (AISTATS). Optimal compression of locally differentially private mechanisms (Valencia, 2022), pp. 7680\u20137723"},{"key":"223_CR17","unstructured":"B. Phan, A. Khisti, C. Louizos, in International Conference on Artificial Intelligence and Statistics (AISTATS). Importance matching lemma for lossy compression with side information (Valencia, 2024), pp. 1387\u20131395"},{"key":"223_CR18","unstructured":"B. Isik, F. Pase, D. G\u00fcnd\u00fcz, S. Koyejo, T. Weissman, M. Zorzi, in International Conference on Artificial Intelligence and Statistics (AISTATS). Adaptive compression in federated learning via side information (Valencia, 2024), pp. 487\u2013495"},{"key":"223_CR19","doi-asserted-by":"crossref","unstructured":"G.R. Kurri, V. Ramachandran, S.R.B. Pillai, V.M. Prabhakaran, in IEEE International Symposium on Information Theory (ISIT). Multiple access channel simulation (Melbourne, 2021), pp. 2411\u20132416","DOI":"10.1109\/ISIT45174.2021.9517982"},{"issue":"2","key":"223_CR20","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1109\/TIT.1975.1055346","volume":"21","author":"A Wyner","year":"1975","unstructured":"A. Wyner, The common information of two dependent random variables. IEEE Trans. Inf. Theory (T-IT) 21(2), 163\u2013179 (1975)","journal-title":"IEEE Trans. Inf. Theory (T-IT)"},{"key":"223_CR21","doi-asserted-by":"crossref","unstructured":"O. G\u00fcnl\u00fc, in IEEE International Workshop on Information Forensics and Security (WIFS). Randomized distributed function computation with semantic communications: Applications to privacy (Rome, 2024), pp. 1\u20136","DOI":"10.1109\/WIFS61860.2024.10810724"},{"key":"223_CR22","doi-asserted-by":"crossref","unstructured":"D. Bergstr\u00f6m, O. G\u00fcnl\u00fc, in IEEE International Symposium on Information Theory (ISIT). Deep randomized distributed function computation (DeepRDFC): Neural distributed channel simulation (Ann Arbor, 2025)","DOI":"10.1109\/ISIT63088.2025.11195680"},{"key":"223_CR23","doi-asserted-by":"crossref","unstructured":"O. G\u00fcnl\u00fc, O. \u0130\u015fcan, V. Sidorenko, G. Kramer, in IEEE Global Conference on Signal and Information Processing (GLOBALSIP). Reliable secret-key binding for physical unclonable functions with transform coding (Washington, DC, 2016), pp. 986\u2013991","DOI":"10.1109\/GlobalSIP.2016.7905989"},{"key":"223_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139030687","volume-title":"Network Information Theory","author":"AE Gamal","year":"2011","unstructured":"A.E. Gamal, Y.H. Kim, Network Information Theory (Cambridge University Press, Cambridge, 2011)"},{"key":"223_CR25","doi-asserted-by":"crossref","unstructured":"S.L. Huang, X. Xu, L. Zheng, G.W. Wornell, in IEEE International Symposium on Information Theory (ISIT). A local characterization for Wyner common information (Los Angeles, 2020), pp. 2252\u20132257","DOI":"10.1109\/ISIT44484.2020.9174206"},{"issue":"9","key":"223_CR26","doi-asserted-by":"publisher","first-page":"4181","DOI":"10.1109\/TIT.2010.2054651","volume":"56","author":"PW Cuff","year":"2010","unstructured":"P.W. Cuff, H.H. Permuter, T.M. Cover, Coordination capacity. IEEE Trans. Inf. Theory (T-IT) 56(9), 4181\u20134206 (2010)","journal-title":"IEEE Trans. Inf. Theory (T-IT)"},{"issue":"3","key":"223_CR27","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"C.E. Shannon, A mathematical theory of communication. Bell Syst. Tech. J. 27(3), 379\u2013423 (1948)","journal-title":"Bell Syst. Tech. J."},{"key":"223_CR28","doi-asserted-by":"crossref","unstructured":"S. Asoodeh, M. Aliakbarpour, F.P. Calmon, in IEEE International Symposium on Information Theory (ISIT). Local differential privacy is equivalent to contraction of an f-divergence (Melbourne, 2021), pp. 545\u2013550","DOI":"10.1109\/ISIT45174.2021.9517999"},{"key":"223_CR29","doi-asserted-by":"crossref","unstructured":"A. Evfimievski, J. Gehrke, R. Srikant, in ACM Symposium on Principles of Database Systems (PODS). Limiting privacy breaches in privacy preserving data mining (San Diego, 2003), pp. 211\u2013222","DOI":"10.1145\/773153.773174"},{"key":"223_CR30","doi-asserted-by":"crossref","unstructured":"S.P. Kasiviswanathan, H.K. Lee, K. Nissim, S. Raskhodnikova, A. Smith, in IEEE Symposium on Foundations of Computer Science (FOCS). What can we learn privately? (Philadelphia, 2008), pp. 531\u2013540","DOI":"10.1109\/FOCS.2008.27"},{"key":"223_CR31","doi-asserted-by":"crossref","unstructured":"R. Bassily, A. Smith, A. Thakurta, in IEEE Symposium on Foundations of Computer Science (FOCS). Private empirical risk minimization: Efficient algorithms and tight error bounds (Philadelphia, 2014), pp. 464\u2013473","DOI":"10.1109\/FOCS.2014.56"},{"issue":"3\u20134","key":"223_CR32","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1561\/0400000042","volume":"9","author":"C Dwork","year":"2014","unstructured":"C. Dwork, A. Roth et al., The algorithmic foundations of differential privacy. Found. Trends\u00ae Theor. Comput. Sci. 9(3\u20134), 211\u2013407 (2014)","journal-title":"Found. Trends\u00ae Theor. Comput. Sci."},{"key":"223_CR33","doi-asserted-by":"crossref","unstructured":"M. Seif, R. Tandon, M. Li, in IEEE International Symposium on Information Theory (ISIT). Wireless federated learning with local differential privacy (Los Angeles, 2020), pp. 2604\u20132609","DOI":"10.1109\/ISIT44484.2020.9174426"},{"key":"223_CR34","doi-asserted-by":"crossref","unstructured":"E. Sula, M. Gastpar, in IEEE International Symposium on Information Theory (ISIT). Lower bound on relaxed Wyner\u2019s common information (Melbourne, 2021), pp. 1510\u20131515","DOI":"10.1109\/ISIT45174.2021.9518172"},{"key":"223_CR35","unstructured":"E. Drysdale, A parametric distribution for exact post-selection inference with data carving. preprint.\u00a0(2023). available [Online] https:\/\/arxiv.org\/abs\/2305.12581"},{"issue":"4","key":"223_CR36","doi-asserted-by":"publisher","first-page":"1836","DOI":"10.1109\/TIT.2016.2529657","volume":"62","author":"EC Song","year":"2016","unstructured":"E.C. Song, P. Cuff, H.V. Poor, The likelihood encoder for lossy compression. IEEE Trans. Inf. Theory (T-IT) 62(4), 1836\u20131849 (2016)","journal-title":"IEEE Trans. Inf. Theory (T-IT)"},{"key":"223_CR37","doi-asserted-by":"crossref","unstructured":"M.H. Yassaee, in IEEE International Symposium on Information Theory (ISIT). Almost exact analysis of soft covering lemma via large deviation (Paris, 2019), pp. 1387\u20131391","DOI":"10.1109\/ISIT.2019.8849341"},{"key":"223_CR38","unstructured":"H. Tyagi, Lecture 2. Tech. rep., Indian Institute of Science (IISc) (2019). https:\/\/ece.iisc.ac.in\/ htyagi\/courses\/E2209\/lectures\/lecture2-scribe.pdf. Lecture Notes for Course E2 209"},{"key":"223_CR39","unstructured":"B. Bebensee, Local differential privacy: A tutorial.\u00a0(2019). preprint, available [Online] https:\/\/arxiv.org\/abs\/1907.11908"},{"issue":"11","key":"223_CR40","doi-asserted-by":"publisher","first-page":"2872","DOI":"10.1109\/TIFS.2018.2834303","volume":"13","author":"O G\u00fcnl\u00fc","year":"2018","unstructured":"O. G\u00fcnl\u00fc, G. Kramer, Privacy, secrecy, and storage with multiple noisy measurements of identifiers. IEEE Trans. Inf. Forensics Secur. (TIFS) 13(11), 2872\u20132883 (2018)","journal-title":"IEEE Trans. Inf. Forensics Secur. (TIFS)"},{"issue":"2","key":"223_CR41","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1137\/0131026","volume":"31","author":"HS Witsenhausen","year":"1976","unstructured":"H.S. Witsenhausen, Values and bounds for the common information of two discrete random variables. SIAM J. Appl. Math. (SIAP) 31(2), 313\u2013333 (1976)","journal-title":"SIAM J. Appl. Math. (SIAP)"},{"issue":"3","key":"223_CR42","doi-asserted-by":"publisher","first-page":"2054","DOI":"10.1109\/TIT.2025.3532280","volume":"71","author":"TH Huang","year":"2025","unstructured":"T.H. Huang, H. El Gamal, Efficient solvers for Wyner common information with application to multi-modal clustering. IEEE Trans. Inf. Theory (T-IT) 71(3), 2054\u20132074 (2025)","journal-title":"IEEE Trans. Inf. Theory (T-IT)"}],"container-title":["Journal on Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13635-026-00223-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13635-026-00223-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13635-026-00223-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T13:14:00Z","timestamp":1771852440000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1186\/s13635-026-00223-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,31]]},"references-count":42,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["223"],"URL":"https:\/\/doi.org\/10.1186\/s13635-026-00223-z","relation":{},"ISSN":["3091-4515"],"issn-type":[{"value":"3091-4515","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,31]]},"assertion":[{"value":"27 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"3"}}