Covert Communication in the Presence of an Uninformed, Informed, and Coordinated Jammer

Abstract

This paper is eligible for the Jack Keil Wolf ISIT Student Paper Award. This paper investigates covert communication in the presence of a cooperative jammer. Covert communication refers to the inability of an adversary to distinguish data transmission from a so-called innocent symbol at the input. We consider three related problems: (1) a jammer without direct communication or coordination with the transmitter, (2) a jammer that cribs the output of the transmitter, and (3) a jammer that is able to coordinate with the transmitter via a secret key that is also shared with the legitimate receiver. For each model, we derive inner and outer bounds on the capacity region that are tight in some special cases. Unlike prior results in the literature, the jammer in our model does not have access to unlimited local randomness. In fact, uncovering the fundamental interplay between the covert communication rate, local randomness, and secret key rate, is one of the distinctions and contributions of the present work. In the context of a few specific channels, we calculate achievable covert rates to illuminate our results.