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

fYear

1997

fDate

29 Jun-4 Jul 1997

Firstpage

157

Abstract

Ahlswede-Csiszar (1993) and Csiszar (see Problemy Peredacii Informatsii, 1996) have addressed problems of determining the common randomness (CR) capacity and the secret key (SK) capacity for a variety of models as they arise in information theory and cryptography. We study problems of common randomness and secret key generation by a pair of terminals called the “users” with help from a third terminal, called the “helper”. Noiseless one-way communication from the helper to the users as also from one user to the other, subject to rate constraints, is permitted over public channels. A situation involving a wiretapper is also considered

Keywords

channel capacity; discrete systems; information theory; memoryless systems; public key cryptography; random processes; common randomness capacity; common randomness generation; common secret key generation; cryptography; discrete memoryless multiple source; helper; information theory; noiseless one-way communication; public channels; rate constraints; secret key capacity; terminals; users; wiretapper; Chromium; Cryptography; Educational institutions; Information theory; Noise generators; Random number generation;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on

Conference_Location

Ulm

Print_ISBN

0-7803-3956-8

Type

conf

DOI

10.1109/ISIT.1997.613072

Filename

613072