Common Information and Secret Key Capacity
From MaRDI portal
Publication:5346380
DOI10.1109/TIT.2013.2264355zbMATH Open1364.94584arXiv1304.2444MaRDI QIDQ5346380FDOQ5346380
Authors: Himanshu Tyagi 
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: We study the generation of a secret key of maximum rate by a pair of terminals observing correlated sources and with the means to communicate over a noiseless public com- munication channel. Our main result establishes a structural equivalence between the generation of a maximum rate secret key and the generation of a common randomness that renders the observations of the two terminals conditionally independent. The minimum rate of such common randomness, termed interactive common information, is related to Wyner's notion of common information, and serves to characterize the minimum rate of interactive public communication required to generate an optimum rate secret key. This characterization yields a single-letter expression for the aforementioned communication rate when the number of rounds of interaction are bounded. An application of our results shows that interaction does not reduce this rate for binary symmetric sources. Further, we provide an example for which interaction does reduce the minimum rate of communication. Also, certain invariance properties of common information quantities are established that may be of independent interest.
Full work available at URL: https://arxiv.org/abs/1304.2444
Communication theory (94A05) Information theory (general) (94A15) Measures of information, entropy (94A17) Authentication, digital signatures and secret sharing (94A62)
Cited In (4)
This page was built for publication: Common Information and Secret Key Capacity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346380)
