We consider the problem of covert communication when \ac{CSI} is available non-causally, causally, and strictly causally at both transmitter and receiver, as well as the case when channel state information is only available at the transmitter. Covert communication with respect to an adversary referred to as the ``warden,'' is one in which the distribution induced during communication at the channel output observed by the warden is identical to the output distribution conditioned on an innocent channel-input symbol. In contrast to previous work, we do not assume the availability of a shared key at the transmitter and legitimate receiver; instead shared randomness is extracted from the channel state, in a manner that keeps it secret from the warden despite the influence of the channel state on the warden's output. When \ac{CSI} is available at both transmitter and receiver, we derive the covert capacity region; when \ac{CSI} is only available at the transmitter, we derive inner and outer bounds on the covert capacity. We also derive the covert capacity when the warden's channel is less noisy with respect to the legitimate receiver. We provide examples for which covert capacity is zero without channel state information, but is positive in the presence of channel state information.


Hassan ZivariFard

University of Texas at Dallas

Matthieu Bloch

Georgia Institute of Technology

Aria Nosratinia

University of Texas at Dallas
Private Conversation

Reach out to the speaker privately

Questions & Answers

Post a publicly available question

No questions have been asked.

Session Chair

Eduard Jorswieck

Technische Universität Braunschweig