2020 IEEE International Symposium
on Information Theory
21-26 June 2020 • Los Angeles, California, USA
| Paper ID | P.7.4 | ||
| Paper Title | Capacity Region of the Gaussian Arbitrarily-Varying Broadcast Channel | ||
| Authors | Fatemeh Hosseinigoki, Oliver Kosut, Arizona State University, United States | ||
| Session | P.7: Information Theoretic Security III | ||
| Presentation | Lecture | ||
| Track | Cryptography, Security and Privacy | ||
| Manuscript | Click here to download the manuscript | ||
| Virtual Presentation | Click here to watch in the Virtual Symposium | ||
| Abstract | This paper considers the two-user Gaussian arbitrarily-varying broadcast channel, wherein a power-limited transmitter wishes to send a message to each of two receivers. Each receiver sees a superposition of the transmitter's sequence, Gaussian noise, and a signal from a power-limited malicious jammer. The jammer is assumed to know the code, but is oblivious to real-time transmissions. The exact capacity region of this setting is determined to be the capacity region of the standard Gaussian broadcast channel, but with the noise variance increased by the power of the jammer, as long as the received power of the jammer at each receiver is less than that of the legitimate transmitter. A key aspect of the achievable scheme involves sharing randomness from the transmitter to the receivers by breaking the transmitted sequence into segments, and either transmitting at full power in a segment, or sending zero. By coding over the on/off signal, a small shared randomness can be established without corruption by the jammer, and without interfering with the standard superposition coding strategy for the Gaussian broadcast channel. | ||
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia
