Common randomness in information theory and cryptography. II. CR capacity

Author

Ahlswede, Rudolf ; Csiszar, Imre

Author_Institution

Fakultat fur Math., Bielefeld Univ., Germany

Volume

44

Issue

1

fYear

1998

fDate

1/1/1998 12:00:00 AM

Firstpage

225

Lastpage

240

Abstract

For pt.I see ibid., vol.39, p.1121, 1993. The common randomness (CR) capacity of a two-terminal model is defined as the maximum rate of common randomness that the terminals can generate using resources specified by the given model. We determine CR capacity for several models, including those whose statistics depend on unknown parameters. The CR capacity is shown to be achievable robustly, by common randomness of nearly uniform distribution no matter what the unknown parameters are. Our CR capacity results are relevant for the problem of identification capacity, and also yield a new result on the regular (transmission) capacity of arbitrarily varying channels with feedback

Keywords

channel capacity; cryptography; feedback; identification; random processes; CR capacity; channel regular capacity; common randomness; cryptography; feedback; identification capacity; information theory; statistics; two-terminal model; unknown parameters; Chromium; Cryptography; Decoding; Entropy; Information theory; Noise generators; Output feedback; Random variables; Robustness; Statistical distributions;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.651026

Filename

651026