License: Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2020.44
URN: urn:nbn:de:0030-drops-127102
URL: https://drops.dagstuhl.de/opus/volltexte/2020/12710/
Go to the corresponding LIPIcs Volume Portal


Gürpınar, Emirhan ; Romashchenko, Andrei

Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory

pdf-format:
LIPIcs-MFCS-2020-44.pdf (0.4 MB)


Abstract

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.

BibTeX - Entry

@InProceedings{grpnar_et_al:LIPIcs:2020:12710,
  author =	{Emirhan G{\"u}rpınar and Andrei Romashchenko},
  title =	{{Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory}},
  booktitle =	{45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)},
  pages =	{44:1--44:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-159-7},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{170},
  editor =	{Javier Esparza and Daniel Kr{\'a}ľ},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/12710},
  URN =		{urn:nbn:de:0030-drops-127102},
  doi =		{10.4230/LIPIcs.MFCS.2020.44},
  annote =	{Keywords: Kolmogorov complexity, mutual information, communication complexity, expander mixing lemma, finite geometry}
}

Keywords: Kolmogorov complexity, mutual information, communication complexity, expander mixing lemma, finite geometry
Collection: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
Issue Date: 2020
Date of publication: 18.08.2020


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI