Secret Key Generation With Limited Interaction
From MaRDI portal
Publication:4566565
DOI10.1109/TIT.2017.2746104zbMATH Open1390.94865arXiv1601.00899OpenAlexW2963414882MaRDI QIDQ4566565FDOQ4566565
Authors: Jingbo Liu, P. Cuff, Sergio Verdú
Publication date: 27 June 2018
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: A basic two-terminal secret key generation model is considered, where the interactive communication rate between the terminals may be limited, and in particular may not be enough to achieve the maximum key rate. We first prove a multi-letter characterization of the key-communication rate region (where the number of auxiliary random variables depend on the number of rounds of the communication), and then provide an equivalent but simpler characterization in terms of concave envelopes in the case of unlimited number of rounds. Two extreme cases are given special attention. First, in the regime of very low communication rates, the emph{key bits per interaction bit} (KBIB) is expressed with a new "symmetric strong data processing constant", which has a concave envelope characterization analogous to that of the conventional strong data processing constant. The symmetric strong data processing constant can be upper bounded by the supremum of the maximal correlation coefficient over a set of distributions, which allows us to determine the KBIB for binary symmetric sources, and conclude, in particular, that the interactive scheme is not more efficient than the one-way scheme at least in the low communication-rate regime. Second, a new characterization of the emph{minimum interaction rate needed for achieving the maximum key rate} (MIMK) is given, and we resolve a conjecture by Tyagi regarding the MIMK for (possibly nonsymmetric) binary sources. We also propose a new conjecture for binary symmetric sources that the interactive scheme is not more efficient than the one-way scheme at any communication rate.
Full work available at URL: https://arxiv.org/abs/1601.00899
Recommendations
- scientific article; zbMATH DE number 1095500
- scientific article; zbMATH DE number 2077190
- Session-key generation using human passwords only
- scientific article; zbMATH DE number 1842504
- Secret Key Generation for Minimally Connected Hypergraphical Sources
- Secret public key schemes
- Common randomness and secret key generation with a helper
- Secure key establishment
Cited In (1)
This page was built for publication: Secret Key Generation With Limited Interaction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4566565)