An operational characterization of mutual information in algorithmic information theory

DOI10.1145/3356867zbMATH Open1473.68100arXiv1710.05984OpenAlexW2963148337MaRDI QIDQ5215467FDOQ5215467

Andrei Romashchenko, Marius Zimand

Publication date: 11 February 2020

Published in: Journal of the ACM (Search for Journal in Brave)

Abstract: 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 $ell>2$, the longest shared secret that can be established from a tuple of strings $(x_1,ldots,x_{e}ll)$ by $ell$ 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.

Full work available at URL: https://arxiv.org/abs/1710.05984

Recommendations

• An operational characterization of mutual information in algorithmic information theory
• Unconditionally secure key agreement and the intrinsic conditional information
• Distributions attaining secret key at a rate of the conditional mutual information
• Secret key agreement by public discussion from common information
• Secret-key agreement over unauthenticated public channels-part I: definitions and a completeness result

zbMATH Keywords

mutual informationcommunication complexityKolmogorov complexityinformation inequalitiessecret key agreement

Mathematics Subject Classification ID

Cryptography (94A60) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Communication complexity, information complexity (68Q11)

Cited In (5)

• Title not available (Why is that?)
• A criterion for extractability of mutual information for a triple of strings
• Information disclosure in the framework of Kolmogorov complexity
• Operational Interpretation of Rényi Information Measures via Composite Hypothesis Testing Against Product and Markov Distributions
• Pairs of words with nonmaterializable mutual information

This page was built for publication: An operational characterization of mutual information in algorithmic information theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5215467)