Secret Key Agreement by Public Discussion From Common Information

Secret Key Agreement by Public Discussion From Common Information (1993)

by Ueli M. Maurer

Venue:	IEEE Transactions on Information Theory
Citations:	175 - 18 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Secret Key Agreement by Public Discussion From Common Information	user correction - Legacy Corrections
AUTHOR NAME	Ueli M. Maurer	SVM HeaderParse 0.1
AUTHOR AFFIL	2;, Member, IEEE	SVM HeaderParse 0.2
ABSTRACT	. The problem of generating a shared secret key S by two parties knowing dependent random variables X and Y , respectively, 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 PXY Z , 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 PXY Z are presented. Lower bounds on the rate H(S)=N (as N !1) are derived for the case where X = [X 1 ; : : : ; XN ], Y = [Y 1 ; : : : ; YN ] and Z = [Z 1 ; : : : ; ZN ] 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 symmetr...	user correction - Legacy Corrections
YEAR	1993	INFERENCE
VENUE	IEEE Transactions on Information Theory	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	733--742	INFERENCE
VOLUME	39	INFERENCE
CITATIONS	16 found	ParsCit 1.0