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:1506.03236 · IEEE Transactions on Information Theory

Fundamental Limits of Communication With Low Probability of Detection

Ligong Wang, Gregory W. Wornell, Lizhong Zheng

Published Apr 5, 2016• 423 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1109/tit.2016.2548471

Related papers

Limits of low-probability-of-detection communication over a discrete memoryless channel

Ligong Wang, Gregory W. Wornell, Lizhong Zheng

This paper considers the problem of communication over a discrete memoryless channel subject to the constraint that the probability that an adversary who observes the channel outputs can detect the communication is low. Specifically, 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 channel whose output distribution induced by the zero input symbol is not a mixture of the output distributions induced by other input symbols, it is shown that the maximum number of bits that can be transmitted under this criterion scales like the square root of the blocklength. Exact expressions for the scaling constant are also derived.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2015•26 citations

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

Boulat A. Bash, Dennis Goeckel, Don Towsley

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→∞.

arXiv:1202.6423•IEEE Journal on Selected Areas in Communications•Aug 23, 2013•1,096 citations

Bounds on Covert Capacity With Sub-Exponential Random Slot Selection

Shi-Yuan Wang, Keerthi Suria Kumar Arumugam, Matthieu R. Bloch

We consider the problem of covert communication with random slot selection over binary-input Discrete Memoryless Channels (DMCs) and Additive White Gaussian Noise (AWGN) channels, in which a transmitter attempts to reliably communicate with a legitimate receiver while simultaneously maintaining covertness with respect to (w.r.t.) an eavesdropper. Covertness refers to the inability of the eavesdropper to distinguish the transmission of a message from the absence of communication, modeled by the transmission of a fixed channel input. Random slot selection refers to the transmitter’s ability to send a codeword in a time slot with known boundaries selected uniformly at random among a predetermined number of slots. Our main contribution is to develop bounds for the information-theoretic limit of communication in this model, called the covert capacity, when the number of time slots scales sub-exponentially with the codeword length. Our upper and lower bounds for the covert capacity are within a multiplicative factor of$\sqrt {2}$independent of the channel. This result partially fills a characterization gap between the covert capacity without random slot selection and the covert capacity with random selection among an exponential number of slots in the codeword length. Our key technical contributions consist of 1) a tight upper bound for the relative entropy characterizing the effect of random slot selection on the covertness constraint in our achievability proof; 2) a careful converse analysis to characterize the maximum allowable weight or power of codewords to meet the covertness constraint. Our results suggest that, unlike the case without random slot selection, the choice of covertness metric does not change the covert capacity in the presence of random slot selection.

arXiv:2409.07777•IEEE Transactions on Information Theory•Jul 16, 2025•1 citation

Optimal throughput for covert communication over a classical-quantum channel

Ligong Wang

This paper considers the problem of communication over a memoryless classical-quantum wiretap channel subject to the constraint that the eavesdropper on the channel should not be able to learn with high confidence whether the legitimate parties are using the channel to communicate or not. Specifically, the relative entropy between the output quantum states at the eavesdropper when a codeword is transmitted and when no input is provided must be sufficiently small. Extending earlier works, this paper proves the “square-root law” for a broad class of classical-quantum channels: the maximum amount of information that can be reliably and covertly transmitted over n uses of such a channel scales like √n. The scaling constant is also determined.

arXiv:1603.05823•IEEE Information Theory Workshop (ITW)•Sep 1, 2016•43 citations

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

Covert Communication With Channel-State Information at the Transmitter

Si-Hyeon Lee, Ligong Wang, Ashish J. Khisti +1 more

We consider the problem of covert communication over a state-dependent channel, where the transmitter has causal or noncausal knowledge of the channel states. Here, covert means that a warden on the channel should observe similar statistics when the transmitter is sending a message and when it is not. When a sufficiently long secret key is shared between the transmitter and the receiver, we derive closed-form formulas for the maximum achievable covert communication rate (covert capacity) for discrete memoryless channels and, when the transmitter's channel-state information (CSI) is noncausal, for additive white Gaussian noise (AWGN) channels. For certain channel models, including the AWGN channel, we show that the covert capacity is positive with CSI at the transmitter, but is zero without CSI. We also derive lower bounds on the rate of the secret key that is needed for the transmitter and the receiver to achieve the covert capacity.

arXiv:1708.02501•IEEE Transactions on Information Forensics and Security•Mar 22, 2018•85 citations
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.
This paper considers the problem of communication over a discrete memoryless channel subject to the constraint that the probability that an adversary who observes the channel outputs can detect the communication is low. Specifically, 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 channel whose output distribution induced by the zero input symbol is not a mixture of the output distributions induced by other input symbols, it is shown that the maximum number of bits that can be transmitted under this criterion scales like the square root of the blocklength. Exact expressions for the scaling constant are also derived.
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→∞.
We consider the problem of covert communication with random slot selection over binary-input Discrete Memoryless Channels (DMCs) and Additive White Gaussian Noise (AWGN) channels, in which a transmitter attempts to reliably communicate with a legitimate receiver while simultaneously maintaining covertness with respect to (w.r.t.) an eavesdropper. Covertness refers to the inability of the eavesdropper to distinguish the transmission of a message from the absence of communication, modeled by the transmission of a fixed channel input. Random slot selection refers to the transmitter’s ability to send a codeword in a time slot with known boundaries selected uniformly at random among a predetermined number of slots. Our main contribution is to develop bounds for the information-theoretic limit of communication in this model, called the covert capacity, when the number of time slots scales sub-exponentially with the codeword length. Our upper and lower bounds for the covert capacity are within a multiplicative factor of2\sqrt {2}2​independent of the channel. This result partially fills a characterization gap between the covert capacity without random slot selection and the covert capacity with random selection among an exponential number of slots in the codeword length. Our key technical contributions consist of 1) a tight upper bound for the relative entropy characterizing the effect of random slot selection on the covertness constraint in our achievability proof; 2) a careful converse analysis to characterize the maximum allowable weight or power of codewords to meet the covertness constraint. Our results suggest that, unlike the case without random slot selection, the choice of covertness metric does not change the covert capacity in the presence of random slot selection.
This paper considers the problem of communication over a memoryless classical-quantum wiretap channel subject to the constraint that the eavesdropper on the channel should not be able to learn with high confidence whether the legitimate parties are using the channel to communicate or not. Specifically, the relative entropy between the output quantum states at the eavesdropper when a codeword is transmitted and when no input is provided must be sufficiently small. Extending earlier works, this paper proves the “square-root law” for a broad class of classical-quantum channels: the maximum amount of information that can be reliably and covertly transmitted over n uses of such a channel scales like √n. The scaling constant is also determined.
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 consider the problem of covert communication over a state-dependent channel, where the transmitter has causal or noncausal knowledge of the channel states. Here, covert means that a warden on the channel should observe similar statistics when the transmitter is sending a message and when it is not. When a sufficiently long secret key is shared between the transmitter and the receiver, we derive closed-form formulas for the maximum achievable covert communication rate (covert capacity) for discrete memoryless channels and, when the transmitter's channel-state information (CSI) is noncausal, for additive white Gaussian noise (AWGN) channels. For certain channel models, including the AWGN channel, we show that the covert capacity is positive with CSI at the transmitter, but is zero without CSI. We also derive lower bounds on the rate of the secret key that is needed for the transmitter and the receiver to achieve the covert capacity.