Covert Communication in the Presence of an Uninformed Jammer
Tamara V. Sobers, Boulat A. Bash, Saikat Guha, Don Towsley, Dennis, Goeckel

TL;DR
This paper explores covert communication strategies in noisy channels with an uninformed jammer, demonstrating that Alice can reliably transmit (n) bits without detection even against an optimal detector by Willie, under various channel conditions.
Contribution
It generalizes covert communication to environments with an uninformed jammer and no restrictions on Willie's detector, showing (n) bits can be transmitted covertly.
Findings
Alice can transmit (n) bits covertly with constant power.
Threshold detection is optimal in some scenarios, but not always.
Covert communication remains feasible with an uninformed jammer and complex fading channels.
Abstract
Recent work has established that when transmitter Alice wishes to communicate reliably to recipient Bob without detection by warden Willie, with additive white Gaussian noise (AWGN) channels between all parties, communication is limited to bits in channel uses. However, this assumes Willie has an accurate statistical characterization of the channel. When Willie has uncertainty about such and his receiver is limited to a threshold test on the received power, Alice can transmit covertly with a power that does not decrease with , thus conveying bits covertly and reliably in uses of an AWGN channel. Here, we consider covert communication of bits in channel uses while generalizing the environment and removing any restrictions on Willie's receiver. We assume an uninformed "jammer" is present to help Alice, and we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWireless Communication Security Techniques
