Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1202.6423 · IEEE Journal on Selected Areas in Communications

Limits of Reliable Communication with Low Probability of Detection on AWGN Channels

Boulat A. Bash, Dennis Goeckel, Don Towsley

Published Aug 23, 2013• 1,096 citations
arXivHTMLPDF

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(√n) bits can be sent from the transmitter to the receiver in n channel uses while lower-bounding α + β ≥ 1-ε for any ε > 0, where α and β 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(√n) bits can be sent in n LPD channel uses. Conversely, attempting to transmit more than O(√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→∞.

DOI
10.1109/jsac.2013.130923

Related papers

Limits of Covert Communication over AWGN Channels in the Presence of Multiple Wardens

Ranran Sun, Shuiguang Zeng, Xinghui Zhu

Covert communication has recently been recognized as a highly promising security technology that enables a transmitter Alice to reliably and covertly communicate with a receiver Bob without being detected by a malicious warden. Available works on covert communication mainly focus on scenarios with only one warden, while the fundamental limits of covert communication in more practical multi-warden scenarios remain largely unknown. This paper therefore investigates the fundamental limits of covert communication over an additive white Gaussian noise (AWGN) channel in the presence of multiple wardens. We first consider a scenario with two wardens and derive the maximum number of bits Alice can transmit to Bob over n channel uses while ensuring a negligible detection probability at wardens. We then generalize this result to the multi-warden case and find that the minimal power of wardens has impacts on the scaling law of the performance limits of covert communication over AWGN channels.

International Conference on Networking and Network Applications (NaNA)•Oct 1, 2018•6 citations

Quantum-noise limited communication with low probability of detection

Boulat A. Bash, Saikat Guha, Dennis Goeckel +1 more

We demonstrate the achievability of a square root limit on the amount of information transmitted reliably and with low probability of detection (LPD) over the single-mode lossy bosonic channel if either the eavesdropper's measurements or the channel itself is subject to the slightest amount of excess noise. Specifically, Alice can transmit $\mathcal{O}(\sqrt{n})$ bits to Bob over $n$ channel uses such that Bob's average codeword error probability is upper-bounded by an arbitrarily small $δ>0$ while a passive eavesdropper, Warden Willie, who is assumed to be able to collect all the transmitted photons that do not reach Bob, has an average probability of detection error that is lower-bounded by $1/2-ε$ for an arbitrarily small $ε>0$. We analyze the thermal noise and pure loss channels. The square root law holds for the thermal noise channel even if Willie employs a quantum-optimal measurement, while Bob is equipped with a standard coherent detection receiver. We also show that LPD communication is not possible on the pure loss channel. However, this result assumes Willie to possess an ideal receiver that is not subject to excess noise. If Willie is restricted to a practical receiver with a non-zero dark current, the square root law is achievable on the pure loss channel.

arXiv:1403.5616•Mar 22, 2014•3 citations

Quantum noise limited optical communication with low probability of detection

Boulat A. Bash, Saikat Guha, Dennis Goeckel +1 more

We demonstrate the achievability of a square root limit on the amount of information transmitted reliably and with low probability of detection (LPD) over the single-mode lossy bosonic channel if either the eavesdropper's measurements or the channel itself is subject to the slightest amount of excess noise. Specifically, Alice can transmit O(√n) bits to Bob over n channel uses such that Bob's average codeword error probability is upper-bounded by an arbitrarily small δ > 0 while a passive eavesdropper, Warden Willie, who is assumed to be able to collect all the transmitted photons that do not reach Bob, has an average probability of detection error that is lower-bounded by 1/2 - ε for an arbitrarily small ε > 0. We analyze the thermal noise and pure loss channels. The square root law holds for the thermal noise channel even if Willie employs a quantum-optimal measurement, while Bob is equipped with a standard coherent detection receiver. We also show that LPD communication is not possible with coherent state transmission on the pure loss channel. However, this result assumes Willie to possess an ideal receiver that is not subject to excess noise. If Willie is restricted to a practical receiver with a non-zero dark current, the square root law is achievable on the pure loss channel.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2013•21 citations

Covert Communication in the Presence of an Uninformed Jammer

Tamara V. Sobers, Boulat A. Bash, Saikat Guha +2 more

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 O(√n) bits in n channel uses. However, this assumes that 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 n, thus conveying O(n) bits covertly and reliably in n uses of an AWGN channel. Here, we consider covert communication of O(n) bits in n channel uses while generalizing the environment and removing any restrictions on Willie's receiver. We assume that an uninformed “jammer” is present to help Alice, and we consider AWGN and block fading channels. In some scenarios, Willie's optimal detector is a threshold test on the received power. When the channel between the jammer and Willie has multiple fading blocks per codeword, a threshold test on the received power is not optimal. However, we establish that Alice can remain covert with a transmit power that does not decrease with n even when Willie employs an optimal detector.

arXiv:1608.00698•IEEE Transactions on Wireless Communications•Jun 30, 2017•463 citations

Covert single-hop communication in a wireless network with distributed artificial noise generation

Ramin Soltani, Boulat A. Bash, Dennis Goeckel +2 more

Covert communication, also known as low probability of detection (LPD) communication, prevents the adversary from knowing that a communication is taking place. Recent work has demonstrated that, in a three-party scenario with a transmitter (Alice), intended recipient (Bob), and adversary (Warden Willie), the maximum number of bits that can be transmitted reliably from Alice to Bob without detection by Willie, when additive white Gaussian noise (AWGN) channels exist between all parties, is on the order of the square root of the number of channel uses. In this paper, we begin consideration of network scenarios by studying the case where there are additional “friendly” nodes present in the environment that can produce artificial noise to aid in hiding the communication. We establish achievability results by considering constructions where the system node closest to the warden produces artificial noise and demonstrate a significant improvement in the throughput achieved covertly, without requiring close coordination between Alice and the noise-generating node. Conversely, under mild restrictions on the communication strategy, we demonstrate no higher covert throughput is possible. Extensions to the consideration of the achievable covert throughput when multiple wardens randomly located in the environment collaborate to attempt detection of the transmitter are also considered.

arXiv:1610.00384•Allerton Conference on Communication, Control, and Computing•Sep 1, 2014•40 citations

Covert Communication Gains From Adversary’s Ignorance of Transmission Time

Boulat A. Bash, Dennis Goeckel, Don Towsley

The recent square root law (SRL) for covert communication demonstrates that Alice can reliably transmit O(√n) bits to Bob in n uses of an additive white Gaussian noise (AWGN) channel while keeping ineffective any detector employed by the adversary; conversely, exceeding this limit either results in detection by the adversary with high probability or nonzero decoding error probability at Bob. This SRL is under the assumption that the adversary knows when Alice transmits (if she transmits); however, in many operational scenarios, he does not know this. Hence, here, we study the impact of the adversary's ignorance of the time of the communication attempt. We employ a slotted AWGN channel model with T(n) slots each containing n symbol periods, where Alice may use a single slot out of T(n). Provided that Alice's slot selection is secret, the adversary needs to monitor all T(n) slots for possible transmission. We show that this allows Alice to reliably transmit O(min{(n log T(n))1/2, n}) bits to Bob (but no more) while keeping the adversary's detector ineffective. To achieve this gain over SRL, Bob does not have to know the time of transmission provided T(n)cTn, cT= O(1).

arXiv:1403.1013•IEEE Transactions on Wireless Communications•Sep 29, 2016•160 citations
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(√n) bits can be sent from the transmitter to the receiver in n channel uses while lower-bounding α + β ≥ 1-ε for any ε > 0, where α and β 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(√n) bits can be sent in n LPD channel uses. Conversely, attempting to transmit more than O(√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→∞.
Covert communication has recently been recognized as a highly promising security technology that enables a transmitter Alice to reliably and covertly communicate with a receiver Bob without being detected by a malicious warden. Available works on covert communication mainly focus on scenarios with only one warden, while the fundamental limits of covert communication in more practical multi-warden scenarios remain largely unknown. This paper therefore investigates the fundamental limits of covert communication over an additive white Gaussian noise (AWGN) channel in the presence of multiple wardens. We first consider a scenario with two wardens and derive the maximum number of bits Alice can transmit to Bob over n channel uses while ensuring a negligible detection probability at wardens. We then generalize this result to the multi-warden case and find that the minimal power of wardens has impacts on the scaling law of the performance limits of covert communication over AWGN channels.
We demonstrate the achievability of a square root limit on the amount of information transmitted reliably and with low probability of detection (LPD) over the single-mode lossy bosonic channel if either the eavesdropper's measurements or the channel itself is subject to the slightest amount of excess noise. Specifically, Alice can transmit O(n)\mathcal{O}(\sqrt{n})O(n​) bits to Bob over nnn channel uses such that Bob's average codeword error probability is upper-bounded by an arbitrarily small δ>0δ>0δ>0 while a passive eavesdropper, Warden Willie, who is assumed to be able to collect all the transmitted photons that do not reach Bob, has an average probability of detection error that is lower-bounded by 1/2−ε1/2-ε1/2−ε for an arbitrarily small ε>0ε>0ε>0. We analyze the thermal noise and pure loss channels. The square root law holds for the thermal noise channel even if Willie employs a quantum-optimal measurement, while Bob is equipped with a standard coherent detection receiver. We also show that LPD communication is not possible on the pure loss channel. However, this result assumes Willie to possess an ideal receiver that is not subject to excess noise. If Willie is restricted to a practical receiver with a non-zero dark current, the square root law is achievable on the pure loss channel.
We demonstrate the achievability of a square root limit on the amount of information transmitted reliably and with low probability of detection (LPD) over the single-mode lossy bosonic channel if either the eavesdropper's measurements or the channel itself is subject to the slightest amount of excess noise. Specifically, Alice can transmit O(√n) bits to Bob over n channel uses such that Bob's average codeword error probability is upper-bounded by an arbitrarily small δ > 0 while a passive eavesdropper, Warden Willie, who is assumed to be able to collect all the transmitted photons that do not reach Bob, has an average probability of detection error that is lower-bounded by 1/2 - ε for an arbitrarily small ε > 0. We analyze the thermal noise and pure loss channels. The square root law holds for the thermal noise channel even if Willie employs a quantum-optimal measurement, while Bob is equipped with a standard coherent detection receiver. We also show that LPD communication is not possible with coherent state transmission on the pure loss channel. However, this result assumes Willie to possess an ideal receiver that is not subject to excess noise. If Willie is restricted to a practical receiver with a non-zero dark current, the square root law is achievable on the pure loss channel.
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 O(√n) bits in n channel uses. However, this assumes that 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 n, thus conveying O(n) bits covertly and reliably in n uses of an AWGN channel. Here, we consider covert communication of O(n) bits in n channel uses while generalizing the environment and removing any restrictions on Willie's receiver. We assume that an uninformed “jammer” is present to help Alice, and we consider AWGN and block fading channels. In some scenarios, Willie's optimal detector is a threshold test on the received power. When the channel between the jammer and Willie has multiple fading blocks per codeword, a threshold test on the received power is not optimal. However, we establish that Alice can remain covert with a transmit power that does not decrease with n even when Willie employs an optimal detector.
Covert communication, also known as low probability of detection (LPD) communication, prevents the adversary from knowing that a communication is taking place. Recent work has demonstrated that, in a three-party scenario with a transmitter (Alice), intended recipient (Bob), and adversary (Warden Willie), the maximum number of bits that can be transmitted reliably from Alice to Bob without detection by Willie, when additive white Gaussian noise (AWGN) channels exist between all parties, is on the order of the square root of the number of channel uses. In this paper, we begin consideration of network scenarios by studying the case where there are additional “friendly” nodes present in the environment that can produce artificial noise to aid in hiding the communication. We establish achievability results by considering constructions where the system node closest to the warden produces artificial noise and demonstrate a significant improvement in the throughput achieved covertly, without requiring close coordination between Alice and the noise-generating node. Conversely, under mild restrictions on the communication strategy, we demonstrate no higher covert throughput is possible. Extensions to the consideration of the achievable covert throughput when multiple wardens randomly located in the environment collaborate to attempt detection of the transmitter are also considered.
The recent square root law (SRL) for covert communication demonstrates that Alice can reliably transmit O(√n) bits to Bob in n uses of an additive white Gaussian noise (AWGN) channel while keeping ineffective any detector employed by the adversary; conversely, exceeding this limit either results in detection by the adversary with high probability or nonzero decoding error probability at Bob. This SRL is under the assumption that the adversary knows when Alice transmits (if she transmits); however, in many operational scenarios, he does not know this. Hence, here, we study the impact of the adversary's ignorance of the time of the communication attempt. We employ a slotted AWGN channel model with T(n) slots each containing n symbol periods, where Alice may use a single slot out of T(n). Provided that Alice's slot selection is secret, the adversary needs to monitor all T(n) slots for possible transmission. We show that this allows Alice to reliably transmit O(min{(n log T(n))1/2, n}) bits to Bob (but no more) while keeping the adversary's detector ineffective. To achieve this gain over SRL, Bob does not have to know the time of transmission provided T(n)cTn, cT= O(1).