Common randomness and secret key generation with a helper

Author

Csiszár, Imre ; Narayan, Prakash

Author_Institution

Math. Inst., Hungarian Acad. of Sci., Budapest, Hungary

Volume

46

Issue

2

fYear

2000

fDate

3/1/2000 12:00:00 AM

Firstpage

344

Lastpage

366

Abstract

We consider the generation of common randomness (CR), secret or not secret, by two user terminals with aid from a “helper” terminal. Each terminal observes a different component of a discrete memoryless multiple source. The helper aids the users by transmitting information to them over a noiseless public channel subject to a rate constraint. Furthermore, one of the users is allowed to transmit to the other user over a public channel under a similar rate constraint. We study the maximum rate of CR which can be thus generated, including under additional secrecy conditions when it must be concealed from a wiretapper. Lower bounds for the corresponding capacities are provided, and single-letter capacity formulas are obtained for several special cases of interest

Keywords

channel capacity; memoryless systems; public key cryptography; random processes; common randomness generation; discrete memoryless multiple source; helper terminal; information transmission; lower bounds; maximum rate; noiseless public channel; public channel; rate constraint; secrecy conditions; secret key generation; single-letter capacity formulas; user terminals; wiretapper; Artificial satellites; Bandwidth; Chromium; Communication networks; Information theory; Mathematics; NASA; Noise generators; Procurement; Protocols;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.825796

Filename

825796