Secret Key Agreement: General Capacity and Second-Order Asymptotics
Secret Key Agreement: General Capacity and Second-Order Asymptotics
复制标题
DOI：
10.1109/isit.2014.6875010
复制
发表时间：
2014-08
影响因子：
2.5
通讯作者：
Masahito Hayashi;Himanshu Tyagi;Shun Watanabe
中科院分区：
文献类型：
--
作者：
Masahito Hayashi;Himanshu Tyagi;Shun Watanabe
我们重新审视了双方使用交互式公共通信的密钥协商问题，并提出了一种新的密钥协商协议。该协议获得了一般观测的密钥容量，并获得了独立同分布观测的密钥最大长度的二阶渐近项。与之前建议的密钥协商协议相比，所提出的协议使用交互式通信。事实上，本文之前使用的标准单向通信协议未能获得上述渐近结果。我们的逆向证明依赖于最近建立的密钥长度上限。我们的下限和上限都是在单次设置中导出的，并且渐近结果作为推论获得。
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 paper 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.