Distributions attaining secret key at a rate of the conditional mutual information

DOI10.1007/978-3-662-48000-7_22MaRDI QIDQ3457079zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Eric Chitambar, Benjamin Fortescue, Min-Hsiu Hsieh

Publication date 10 December 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1502.04430

zbMATH Keywords

Gács-Körner common informationinformation-theoretic securitypublic key agreement

Mathematics Subject Classification ID

Information theory (general) (94A15) Cryptography (94A60)

Abstract: In this paper we consider the problem of extracting secret key from an eavesdropped source $p_{XYZ}$ at a rate given by the conditional mutual information. We investigate this question under three different scenarios: (i) Alice ($X$) and Bob ($Y$) are unable to communicate but share common randomness with the eavesdropper Eve ($Z$), (ii) Alice and Bob are allowed one-way public communication, and (iii) Alice and Bob are allowed two-way public communication. Distributions having a key rate of the conditional mutual information are precisely those in which a "helping" Eve offers Alice and Bob no greater advantage for obtaining secret key than a fully adversarial one. For each of the above scenarios, strong necessary conditions are derived on the structure of distributions attaining a secret key rate of $I(X:Y|Z)$. In obtaining our results, we completely solve the problem of secret key distillation under scenario (i) and identify $H(S|Z)$ to be the optimal key rate using shared randomness, where $S$ is the G'acs-K"orner Common Information. We thus provide an operational interpretation of the conditional G'acs-K"orner Common Information. Additionally, we introduce simple example distributions in which the rate $I(X:Y|Z)$ is achievable if and only if two-way communication is allowed.

Recommendations

• Unconditionally secure key agreement and the intrinsic conditional information
• Common randomness in information theory and cryptography. I. Secret sharing
• scientific article; zbMATH DE number 1759326
• Information-theoretic key agreement: from weak to strong secret for free
• Secret key agreement by public discussion from common information

Cites work

• Common randomness and secret key generation with a helper
• Generalized privacy amplification
• scientific article; zbMATH DE number 3497786 (Why is no real title available?)
• Information-Theoretic Key Agreement of Multiple Terminals—Part I
• Secret key agreement by public discussion from common information
• Unconditionally secure key agreement and the intrinsic conditional information

Cited in

(4)

• Key Distillation and the Secret-Bit Fraction
• Unconditionally secure key agreement and the intrinsic conditional information
• An operational characterization of mutual information in algorithmic information theory
• An operational characterization of mutual information in algorithmic information theory

This page was built for publication: Distributions attaining secret key at a rate of the conditional mutual information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457079)