Proceedings chapter
OA Policy
English

On the Secret-Key Rate of Binary Random Variables

Presented at

Trondheim (Norway), 27 June-1 July

Publisher

IEEE

Publication date

1994

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 secret-key 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

Note

With an extended german version

UNIGE affiliation entities

Not a UNIGE publication

Citation (ISO format)

GANDER, Martin Jakob, MAURER, Ueli M. On the Secret-Key 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

Main files (1)

Proceedings chapter

Secondary files (1)

Translation

Identifiers

ISBN

978-0-7803-2015-4
537views
681downloads

Technical informations

Creation

12/05/2010 08:49:00

First validation

12/05/2010 08:49:00

Update

14/03/2023 15:28:56

Status update

14/03/2023 15:28:56

Last indexation

29/10/2024 14:45:13
All rights reserved by Archive ouverte UNIGE and the University of Geneva
OpenAIRE Indexed & Validated