2026-07-23T05:04:57Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:9099 2024-03-06T10:43:21Z ddc:004 open_access

An Operational Characterization of Mutual Information in Algorithmic Information Theory Romashchenko, Andrei Zimand, Marius Kolmogorov complexity mutual information communication complexity secret key agreement We show that the mutual information, in the sense of Kolmogorov complexity, of any pair of strings x and y is equal, up to logarithmic precision, to the length of the longest shared secret key that two parties, one having x and the complexity profile of the pair and the other one having y and the complexity profile of the pair, can establish via a probabilistic protocol with interaction on a public channel. For l > 2, the longest shared secret that can be established from a tuple of strings (x_1, . . . , x_l) by l parties, each one having one component of the tuple and the complexity profile of the tuple, is equal, up to logarithmic precision, to the complexity of the tuple minus the minimum communication necessary for distributing the tuple to all parties. We establish the communication complexity of secret key agreement protocols that produce a secret key of maximal length, for protocols with public randomness. We also show that if the communication complexity drops below the established threshold then only very short secret keys can be obtained. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Andrei Romashchenko and Marius Zimand 2018 Is Part Of LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICALP.2018.95 urn:nbn:de:0030-drops-90998 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.95 eng https://creativecommons.org/licenses/by/3.0/legalcode