One-Shot Variable-Length Secret Key Agreement Approaching Mutual Information
Cheuk Ting Li, Venkat Anantharam

TL;DR
This paper investigates the limits of one-shot variable-length secret key agreement with public discussion, showing that the optimal key length approaches the mutual information between the observations within a small logarithmic gap.
Contribution
It establishes bounds on the expected key length in the one-shot setting that are close to mutual information, bridging one-shot and asymptotic scenarios.
Findings
Optimal expected key length is close to mutual information I(X;Y).
Upper and lower bounds depend only on I(X;Y).
Results apply to non-i.i.d. and sequential observation scenarios.
Abstract
This paper studies an information-theoretic one-shot variable-length secret key agreement problem with public discussion. Let and be jointly distributed random variables, each taking values in some measurable space. Alice and Bob observe and respectively, can communicate interactively through a public noiseless channel, and want to agree on a key length and a key that is approximately uniformly distributed over all bit sequences with the agreed key length. The public discussion is observed by an eavesdropper, Eve. The key should be approximately independent of the public discussion, conditional on the key length. We show that the optimal expected key length is close to the mutual information within a logarithmic gap. Moreover, an upper bound and a lower bound on the optimal expected key length can be written down in terms of only. This means that the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
