Common randomness and secret key capacities of two-way channels
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Strong secrecy for multiple access channels
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.00 |
We consider the problem of secure communications over the two-way wiretap channel under a strong secrecy criterion. We improve existing results by developing an achievable region based on strategies that exploit both the interference at the eavesdropper's terminal and cooperation between legitimate users. We leverage the notion of channel resolvability for the multiple-access channel to analyze cooperative jamming and we show that the artificial noise created by cooperative jamming induces a source of common randomness that can be used for secret-key agreement. We illustrate the gain provided by this coding technique in the case of the Gaussian two-way wiretap channel, and we show significant improvements for some channel configurations.