Capacity of a shared secret key
Capacity of a shared secret key
复制标题
共享密钥的容量
DOI：
10.1109/isit.2010.5513769
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
P. Narayan
中科院分区：
文献类型：
--
作者：
I. Csiszár;P. Narayan
考虑多个终端通过香农理论生成共享密钥的情况，针对一种源模型，其中离散无记忆多源的各个分量以及一个容量无限制的无噪公共信道可用于实现这一目标。为不同的终端联盟生成共享密钥，所有终端通过其公共通信在这项任务中进行协作。终端的通信可以是其观测到的源分量以及所有先前通信的函数。联盟的成员终端联合恢复密钥。要求对观察公共终端间通信的窃听者保密。得到了共享密钥容量的单字母特征。当密钥还必须对联盟成员的子集保密时，我们给出了严格共享密钥容量的上界。
Shannon theoretic shared secret key generation by multiple terminals is considered for a source model in which the components of a discrete memoryless multiple source and a noiseless public channel of unlimited capacity are available for accomplishing this goal. A shared secret key is generated for distinct coalitions of terminals, with all the terminals cooperating in this task through their public communication. A communication from a terminal can be a function of its observed source component and of all previous communication. Member terminals of a coalition unite in recovering the key. Secrecy is required from an eavesdropper that observes the public interterminal communication. A single-letter characterization of the shared secret key capacity is obtained. When the key must be concealed additionally from subsets of coalition members, we provide an upper bound for the strict shared secret key capacity.