文章基本信息

标题：Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory
本地全文：下载
作者：Emirhan G{"u}rpÄ±nar ; Andrei Romashchenko
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2020
卷号：170
页码：44:1-44:14
DOI：10.4230/LIPIcs.MFCS.2020.44
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：It is known that the mutual information, in the sense of Kolmogorov complexity, of any pair of strings x and y is equal to the length of the longest shared secret key that two parties can establish via a probabilistic protocol with interaction on a public channel, assuming that the parties hold as their inputs x and y respectively. We determine the worst-case communication complexity of this problem for the setting where the parties can use private sources of random bits. We show that for some x, y the communication complexity of the secret key agreement does not decrease even if the parties have to agree on a secret key the size of which is much smaller than the mutual information between x and y. On the other hand, we provide examples of x, y such that the communication complexity of the protocol declines gradually with the size of the derived secret key. The proof of the main result uses spectral properties of appropriate graphs and the expander mixing lemma as well as various information theoretic techniques.
关键词：Kolmogorov complexity; mutual information; communication complexity; expander mixing lemma; finite geometry