Proceedings chapter (112 Kb)  Free access
Translation (248 Kb)  Free access
Highlights
Title 
On the SecretKey Rate of Binary Random Variables 

Authors  
Published in  IEEE International Symposium on Information Theory. Trondheim (Norway)  27 June1 July  IEEE. 1994, 351  
Abstract  Consider a scenario in which two parties Alice and Bob as well as an opponent Eve receive the output of a binary symmetric source (e,g. installed in a satellite) over individual, not necessarily independent binary symmetric channels. Alice and Bob share no secret key initially and can only communicate over a public channel completely accessible to Eve. The authors derive a lower bound on the rate at which Alice and Bob can generate secretkey bits about which Eve has arbitrarily little information, This lower bound is strictly positive as long as Eve's binary symmetric channel is not perfect, even if Alice's and Bob's channels are by orders of magnitude less reliable than Eve's channel  
Identifiers  ISBN: 9780780320154  
Note  With an extended german version  
Full text  
Citation (ISO format)  GANDER, Martin Jakob, MAURER, Ueli M. On the SecretKey Rate of Binary Random Variables. In: IEEE International Symposium on Information Theory. Trondheim (Norway). [s.l.] : IEEE, 1994. p. 351. doi: 10.1109/ISIT.1994.394667 https://archiveouverte.unige.ch/unige:6555 