Fundamental Limits of Communication With Low Probability of Detection
By Ligong Wang, Gregory W. Wornell, Lizhong Zheng. IEEE Transactions on Information Theory, 2015
407 citations recorded by the source corpus.
This paper considers the problem of communication over a discrete memoryless channel (DMC) or an additive white Gaussian noise (AWGN) channel subject to the constraint that the probability that an adversary who observes the channel outputs can detect the communication is low. In particular, the relative entropy between the output distributions when a codeword is transmitted and when no input is provided to the channel must be sufficiently small. For a DMC whose output distribution induced by the “off” input symbol is not a mixture of the output distributions induced by other input symbols, it is shown that the maximum amount of information that can be transmitted under this criterion scales like the square root of the blocklength. The same is true for the AWGN channel. Exact expressions for the scaling constant are also derived.
Subfields: Computer Networks and Communications, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/a94f999ee9be33ab263f99824cb779fdc074253d
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- D. Towsley
- Saikat Guha
- Xiangyun Zhou
- Shihao Yan
- Dennis L. Goeckel
- Boulat A. Bash
- Stephen V. Hanly
- F. Yu
In Electrical and Electronic Engineering
- D. Towsley
- Saikat Guha
- Xiangyun Zhou
- Shihao Yan
- Dennis L. Goeckel
- Boulat A. Bash
- Stephen V. Hanly
- F. Yu
Citations in the corpus
- Low Probability of Detection Communication: Opportunities and Challenges (2019, background): “After [4], the scaling constant of the amount of covert information with respect to √ n was characterized for a discrete memoryless channel (DMC) and the AWGN channel in [6].”
- Covert Communication in the Presence of an Uninformed Jammer (2016, background): “Follow-on work has considered the length of the pre-shared secret in [4] and [5], characterization of the constant hidden by Big-O notation in [5] and [6], and both the theory and experimental verification of covert communication over quantum channels in [7] and [8].”
- Covert Communications: A Comprehensive Survey (2023, methodology): “After the pioneering SRL research in [22], many works are performed to establish the coding schemes or the shared secret-key length between Alice and Bob [138], [139], [140], [141], [142].”