Secret Key Agreement: General Capacity and Second-Order Asymptotics

DOI10.1109/TIT.2016.2567440MaRDI QIDQ2976690zbMATH OpenOpenAlexFDO

Authors Masahito Hayashi, Himanshu Tyagi, Shun Watanabe

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Authentication, digital signatures and secret sharing (94A62)

Abstract: We revisit the problem of secret key agreement using interactive public communication for two parties and propose a new secret key agreement protocol. The protocol attains the secret key capacity for general observations and attains the second-order asymptotic term in the maximum length of a secret key for independent and identically distributed observations. In contrast to the previously suggested secret key agreement protocols, the proposed protocol uses interactive communication. In fact, the standard one-way communication protocol used prior to this work fails to attain the asymptotic results above. Our converse proofs rely on a recently established upper bound for secret key lengths. Both our lower and upper bounds are derived in a single-shot setup and the asymptotic results are obtained as corollaries.

Cited in

(6)

• Information-theoretic secret-key agreement: the asymptotically tight relation between the secret-key rate and the channel quality ratio
• When Are Fuzzy Extractors Possible?
• The Sender-Excited Secret Key Agreement Model: Capacity, Reliability, and Secrecy Exponents
• Common Randomness and Secret Key Capacities of Two-Way Channels
• On the Optimality of Secret Key Agreement via Omniscience
• Impossibility of efficient information-theoretic fuzzy extraction

This page was built for publication: Secret Key Agreement: General Capacity and Second-Order Asymptotics

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