secret key agreement by public discussion from common information（密钥协议从公共信息公开讨论）.pdfVIP

App eared in IEEE Transactions on Information Theory Vol pp Secret Key Agreement by Public Discussion From Common Information Ueli M Maurer Memb er IEEE Abstract The problem of generating a shared secret key S by two parties knowing de p endent random variables X and Y resp ectively but 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 can also receive all messages exchanged by X Y Z the two parties over a public channel The goal of a proto col is that the enemy obtains at most a negligible amount of information ab out S Upp er b ounds on H S as a function of P are presented Lower b ounds on the rate H S N as N are derived for the case X Y Z where X X X Y Y Y and Z Z Z result from N indep endent N N N executions of a random exp eriment generating X Y and Z for i N In particular i i i it is shown that such secret key agreement is p ossible for a scenario where all three parties receive the output of a binary symmetric source over indep endent binary symmetric chan nels even when the enemys channel is sup erior to the other two channels The results of this pap er suggest to build cryptographic systems that are provably secure against enemies with unlimited computing p ower under realistic assumptions ab out the partial indep endenc e of the noise on the involved communication channels Index Terms Secret key agreement public discussion proto cols provable security broad cast channel s