Limits of Reliable Communication with Low Probability of Detection on AWGN Channels
Authors:
- Boulat A. BashBBBoulat A. Bash
- Dennis GoeckelDGDennis Goeckel
- Don TowsleyDTDon Towsley
Preprint
Abstract
We present a square root limit on the amount of information transmitted reliably and with low probability of detection (LPD) over additive white Gaussian noise (AWGN) channels. Specifically, if the transmitter has AWGN channels to an intended receiver and a warden, both with non-zero noise power, we prove that $o(\sqrt{n})$ bits can be sent from the transmitter to the receiver in $n$ channel uses while lower-bounding $\alpha+\beta\geq1-\epsilon$ for any $\epsilon>0$, where $\alpha$ and $\beta$ respectively denote the warden's probabilities of a false alarm when the sender is not transmitting and a missed detection when the sender is transmitting. Moreover, in most practical scenarios, a lower bound on the noise power on the channel between the transmitter and the warden is known and $O(\sqrt{n})$ bits can be sent in $n$ LPD channel uses. Conversely, attempting to transmit more than $O(\sqrt{n})$ bits either results in detection by the warden with probability one or a non-zero probability of decoding error at the receiver as $n\rightarrow\infty$.
Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Reliable deniable communication: Hiding messages in noise2013
- The Embedding Capacity of Information Flows Under Renewal TrafficIEEE Transactions on Information Theory, 2012
- A survey of spectrum sensing algorithms for cognitive radio applicationsIEEE Communications Surveys & Tutorials, 2009
- Estimating Steganographic Fisher Information in Real Images2009
- Fisher Information Determines Capacity of ε-Secure SteganographyLecture Notes in Computer Science, 2009
- A Capacity Result for Batch SteganographyIEEE Signal Processing Letters, 2007
- An information-theoretic model for steganographyInformation and Computation, 2004
- New exponential bounds and approximations for the computation of error probability in fading channelsIEEE Transactions on Wireless Communications, 2003
- Random codes: minimum distances and error exponentsIEEE Transactions on Information Theory, 2002
- Broadcast channels with confidential messagesIEEE Transactions on Information Theory, 1978