Embedding Covert Information in Broadcast Communications
- 25 March 2019
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 14 (10) , 2787-2801
Abstract
We analyze a two-receiver binary-input discrete memoryless broadcast channel, in which the transmitter communicates a common message simultaneously to both receivers and a covert message to only one of them. The unintended recipient of the covert message is treated as an adversary who attempts to detect the covert transmission. This model captures the problem of embedding covert messages in an innocent codebook and generalizes previous covert communication models in which the innocent behavior corresponds to the absence of communication between legitimate users. We identify the exact asymptotic behavior of the number of covert bits that can be transmitted when the rate of the innocent codebook is close to the capacity of the channel to the adversary. Our results also identify the dependence of the number of covert bits on the channel parameters and the characteristics of the innocent codebook.Keywords
All Related Versions
Funding Information
- National Science Foundation (1527387)
This publication has 18 references indexed in Scilit:
- Computationally efficient deniable communication2016
- Fundamental Limits of Communication With Low Probability of DetectionIEEE Transactions on Information Theory, 2016
- Covert Communication Over Noisy Channels: A Resolvability PerspectiveIEEE Transactions on Information Theory, 2016
- Achieving Undetectable CommunicationIEEE Journal of Selected Topics in Signal Processing, 2015
- Reliable deniable communication with channel uncertainty2014
- LPD communication when the warden does not know when2014
- Reliable, deniable and hidable communication2014
- Reliable deniable communication: Hiding messages in noise2013
- Secret Agent Radio: Covert Communication through Dirty Constellations2013
- An Information-Theoretic Model for Steganography1998