Work

Common Information in Well-Mixing Graphs and Applications to Information-Theoretic Cryptography

Year: 2024

Type: conference-paper

Abstract: We study the connection between mixing properties for bipartite graphs and materialization of the mutual information in one-shot settings. We show that mixing properties of a graph imply impossibility to extract the mutual information shared by the ends of an edge randomly sampled in the graph. We apply these impossibility results to some questions motivated by information-theoretic cryptography. In particular, we show that communication complexity of a secret key agreement in one-shot setting is inherently uneven: for some inputs, almost all communication complexity inevitably falls on only one party.

Source: IEEE Information Theory Workshop (ITW)

DOI: 10.1109/itw61385.2024.10806994

Authors: Geoffroy Caillat-Grenier, Andrei Romashchenko, Rustam Zyavgarov

Institutions: Centre National de la Recherche Scientifique, Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier, Lomonosov Moscow State University

Language: English

Topic: Quantum Information and Cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Agence Nationale de la Recherche

Award: Fundamental Laws of Information Theory through the Lens of Applications