Information Theoretic Security
Foundations and Trends in Communications and Information Theory
Secret keys from channel noise
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Common randomness and secret key capacities of two-way channels
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
General Theory of Information Transfer and Combinatorics
Watermarking identification codes with related topics on common randomness
General Theory of Information Transfer and Combinatorics
| Hi-index | 754.84 |
We study the following problem: two agents Alice and Bob are connected to each other by independent discrete memoryless channels. They wish to generate common randomness, i.e. agree on a common random variable, by communicating interactively over the two channels. Assuming that Alice and Bob are allowed access to independent external random sources at rates (in bits per step of communication) of HA and HB, respectively, we show that they can generate common randomness at a rate of max{min[HA+H(W|Q),I(P;V)]+min[HB +H(V|P), I(Q;W)]} bits per step, by exploiting the noise on the two channels. Here, V is the channel from Alice to Bob, and W is the channel from Bob to Alice. The maximum is over all probability distributions P and Q on the input alphabets of V and W, respectively. We also prove a strong converse which establishes the above rate as the highest attainable in this situation