Title :
Common randomness and secret key generation with a helper
Author :
Caiszar, I. ; Narayan, Prakash
Author_Institution :
Math. Inst., Hungarian Acad. of Sci., Budapest, Hungary
Abstract :
Summary form only given. 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 the CR which can be thus generated, and also under additional secrecy conditions when it must be concealed from an eavesdropper and from a wiretapper. Single-letter capacity formulae are obtained for several special cases of interest. Connections are shown between CR capacity and identification capacity in specific situations
Keywords :
channel capacity; public key cryptography; random processes; telecommunication security; telecommunication terminals; common randomness generation; discrete memoryless multiple source; eavesdropper; helper terminal; identification capacity; maximum rate; noiseless public channel; rate constraint; secrecy conditions; secret key generation; single-letter capacity formulae; user terminals; wiretapper; Chromium; Educational institutions;
Conference_Titel :
Information Theory and Communications Workshop, 1999. Proceedings of the 1999 IEEE
Conference_Location :
Kruger National Park
Print_ISBN :
0-7803-5268-8
DOI :
10.1109/ITCOM.1999.781417
