SECRET KEY AGREEMENT BY PUBLIC DISCUSSION FROM COMMON INFORMATION
SECRET KEY AGREEMENT BY PUBLIC DISCUSSION FROM COMMON INFORMATION
复制标题
DOI：
10.1109/18.256484
复制
发表时间：
1993-05-01
影响因子：
2.5
通讯作者：
MAURER, UM
中科院分区：
文献类型：
--
作者：
MAURER, UM
研究了由已知相依随机变量X和Y的两个参与者在初始不共享密钥的情况下生成共享密钥S的问题。一个知道随机变量Z的敌人，根据某个概率分布P（XYZ）与X和Y共同分布，也可以接收双方在公共信道上交换的所有消息。协议的目标是使敌人获得最多可忽略不计的关于S的信息。给出了H（S）作为P（XYZ）的函数的上界。对于X = [X1，.]的情况，导出了速率H（S）/N（当N ->无穷大时）的下界X（N）]，Y = [Y1，...，Y（N）]和Z = [Z1，...，Z（N）]是随机实验的N次独立执行的结果，生成X（i）、Y（i）和Z（i），其中i = 1，.，N.特别是，它示出，这样的秘密密钥协议是可能的情况下，所有三方接收的输出的二进制对称源在独立的二进制对称通道，即使当敌人的通道是上级的其他两个通道。研究结果表明，如何建立加密系统，可证明是安全的，对敌人的计算能力无限的现实假设下的部分独立的噪声所涉及的通信信道。
The problem of generating a shared secret key S by two parties knowing dependent random variables X and Y, respectively, hut not sharing a secret key initially, is considered. An enemy who knows the random variable Z, jointly distributed with X and Y according to some probability distribution P(XYZ), can also receive all messages exchanged by the two parties over a public channel. The goal of a protocol is that the enemy obtains at most a negligible amount of information about S. Upper bounds on H(S) as a function of P(XYZ) are presented. Lower bounds on the rate H(S)/N (as N --> infinity) are derived for the case where X = [X1,..., X(N)], Y = [Y1,...,Y(N)] and Z = [Z1,..., Z(N)] result from N independent executions of a random experiment generating X(i), Y(i) and Z(i) for i = 1,..., N. In particular, it is shown that such secret key agreement is possible for a scenario where all three parties receive the output of a binary symmetric source over independent binary symmetric channels, even when the enemy's channel is superior to the other two channels. The results suggest how to build cryptographic systems that are provably secure against enemies with unlimited computing power under realistic assumptions about the partial independence of the noise on the involved communication channels.