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:1710.09754 · IEEE Transactions on Information Forensics and Security

Time-Division is Optimal for Covert Communication Over Some Broadcast Channels

Vincent Y. F. Tan, Si-Hyeon Lee

Published Oct 30, 2018• 77 citations
arXivHTMLPDF

Abstract

We consider a covert communication scenario where a transmitter wishes to communicate simultaneously to two legitimate receivers while ensuring that the communication is not detected by an adversary, the warden. The legitimate receivers and the adversary observe the transmission from the transmitter via a three-user discrete or Gaussian memoryless broadcast channel. We focus on the case where the “no-input” symbol is not redundant, i.e., the output distribution at the warden induced by the no-input symbol is not a mixture of the output distributions induced by other input symbols, so that the covert communication is governed by the square root law, i.e., at most Θ(√n) bits can be transmitted over n channel uses. We show that for such a setting, a simple time-division strategy achieves the optimal throughputs for a non-trivial class of broadcast channels; this is not true for communicating over broadcast channels without the covert communication constraint. Our result implies that a code that uses two separate optimal point-to-point codes each designed for the constituent channels and each used for a fraction of the time is optimal in the sense that it achieves the best constants of the √n-scaling for the throughputs. Our proof strategy combines several elements in the network information theory literature, including concave envelope representations of the capacity regions of broadcast channels and El Gamal's outer bound for more capable broadcast channels.

DOI
10.1109/tifs.2018.2878398

Related papers

Covert Communication Over a KKK -User Multiple-Access Channel

Keerthi Suria Kumar Arumugam, Matthieu R. Bloch

We consider a scenario in which K transmitters attempt to communicate covert messages reliably to a legitimate receiver over a discrete memoryless multiple-access channel (MAC) while simultaneously escaping detection from an adversary who observes their communication through another discrete memoryless MAC. We assume that each transmitter may use a secret key that is shared only between itself and the legitimate receiver. We show that each of the K transmitters can transmit on the order of √n reliable and covert bits per n channel uses, exceeding which, the warden will be able to detect the communication. We identify the optimal pre-constants of the scaling, which leads to a complete characterization of the covert capacity region of the K-user binary-input MAC. We show that, asymptotically, all sum-rate constraints are inactive unlike the traditional MAC capacity region. We also characterize the channel conditions that have to be satisfied for the transmitters to operate without a secret key.

arXiv:1803.06007•IEEE Transactions on Information Theory•Jul 22, 2019•105 citations

Treating Interference as Noise Is Optimal for Covert Communication Over Interference Channels

Kang-Hee Cho, Si-Hyeon Lee

We study the covert communication over K-user-pair discrete memoryless interference channels (DM-ICs) with a warden. It is assumed that the warden's channel output distribution induced by K “off” input symbols, which are sent when no communication occurs, is not a convex combination of those induced by any other combination of input symbols (otherwise, the square-root law does not hold). We derive the exact covert capacity region and show that a simple point-to-point based scheme with treating interference as noise is optimal. In addition, we analyze the secret key length required for the reliable and covert communication with the desired rates, and present a channel condition where a secret key between each user pair is unnecessary. The results are extended to the Gaussian case and the case with multiple wardens.

IEEE Transactions on Information Forensics and Security•Jul 30, 2020•44 citations

Treating Interference as Noise is Optimal for Covert Communication over Interference Channels

Kang-Hee Cho, Si-Hyeon Lee

In this paper, the covert communication scenario over K-user-pair discrete memoryless interference channels with a warden is studied. We assume that the wardens channel output distribution induced by K "off input symbols, which are sent when no communication occurs, is not a convex combination of those induced by any other combination of input symbols (otherwise, the square-root law does not hold). We derive the exact covert capacity region and show that a simple point-topoint based scheme with treating interference as noise is optimal. In addition, we analyze the secret key length required for the reliable and covert communication with the desired rates, and present a channel condition where the secret key between each user pair is unnecessary.

arXiv:2003.04531•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2020•3 citations

Covert Communication Over Gaussian Multiple-Access Channels With Feedback

Kang-Hee Cho, Si-Hyeon Lee

We consider the covert communication over the two-user Gaussian multiple access channel (GMAC) with causal feedback. It is shown that any causal feedback does not enlarge the covert capacity region and the time-division scheme is optimal for a class of channels, which includes the case where the warden observes what the legitimate receiver receives. For the proof, we derive an outer bound on the covert capacity region of general GMACs with noiseless causal feedback, which implies that the square-root law holds for arbitrary channel gains. Furthermore, the extension to multi-user case is presented.

IEEE Wireless Communications Letters•Jul 13, 2022•10 citations

Keyless Covert Communication in the Presence of Non-causal Channel State Information

Hassan ZivariFard, Matthieu R. Bloch, Aria Nosratinia

We consider the problem of covert communication over a state-dependent channel, for which the transmitter and the legitimate receiver have non-causal access to the channel state information. Covert communication with respect to an adversary, referred to as the “warden,” is one in which the distribution induced during communication at the channel output observed by the warden is identical to the output distribution conditioned on an inactive channel-input symbol. Covert communication involves fooling an adversary in part by a proliferation of codebooks; for reliable decoding at the legitimate receiver the codebook uncertainty is removed via a shared secret key that is unavailable to the warden. Unlike earlier work in state-dependent covert communication, we do not assume the availability of a shared key at the transmitter and legitimate receiver. Rather, a shared randomness is extracted at the transmitter and the receiver from the channel state, in a manner that keeps the shared randomness secret from the warden despite the influence of the channel state on the warden's output. An inner bound on the covert capacity, in the absence of an externally provided secret key, is derived.

IEEE Information Theory Workshop (ITW)•Aug 1, 2019•17 citations

Keyless covert communication over Multiple-Access Channels

Keerthi Suria Kumar Arumugam, Matthieu R. Bloch

We consider a scenario in which two legitimate transmitters attempt to communicate with a legitimate receiver over a discrete memoryless Multiple-Access Channel (MAC), while escaping detection from an adversary who observes their communication through another discrete memoryless MAC. If the MAC to the legitimate receiver is “better” than the one to the adversary, in a sense that we make precise, then the legitimate users can reliably communicate on the order of √n bits per n channel uses with arbitrarily Low Probability of Detection (LPD) without using a secret key. We also identify the pre-constants of the scaling, which leads to a characterization of the covert capacity region.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2016•84 citations
We consider a covert communication scenario where a transmitter wishes to communicate simultaneously to two legitimate receivers while ensuring that the communication is not detected by an adversary, the warden. The legitimate receivers and the adversary observe the transmission from the transmitter via a three-user discrete or Gaussian memoryless broadcast channel. We focus on the case where the “no-input” symbol is not redundant, i.e., the output distribution at the warden induced by the no-input symbol is not a mixture of the output distributions induced by other input symbols, so that the covert communication is governed by the square root law, i.e., at most Θ(√n) bits can be transmitted over n channel uses. We show that for such a setting, a simple time-division strategy achieves the optimal throughputs for a non-trivial class of broadcast channels; this is not true for communicating over broadcast channels without the covert communication constraint. Our result implies that a code that uses two separate optimal point-to-point codes each designed for the constituent channels and each used for a fraction of the time is optimal in the sense that it achieves the best constants of the √n-scaling for the throughputs. Our proof strategy combines several elements in the network information theory literature, including concave envelope representations of the capacity regions of broadcast channels and El Gamal's outer bound for more capable broadcast channels.
We consider a scenario in which K transmitters attempt to communicate covert messages reliably to a legitimate receiver over a discrete memoryless multiple-access channel (MAC) while simultaneously escaping detection from an adversary who observes their communication through another discrete memoryless MAC. We assume that each transmitter may use a secret key that is shared only between itself and the legitimate receiver. We show that each of the K transmitters can transmit on the order of √n reliable and covert bits per n channel uses, exceeding which, the warden will be able to detect the communication. We identify the optimal pre-constants of the scaling, which leads to a complete characterization of the covert capacity region of the K-user binary-input MAC. We show that, asymptotically, all sum-rate constraints are inactive unlike the traditional MAC capacity region. We also characterize the channel conditions that have to be satisfied for the transmitters to operate without a secret key.
We study the covert communication over K-user-pair discrete memoryless interference channels (DM-ICs) with a warden. It is assumed that the warden's channel output distribution induced by K “off” input symbols, which are sent when no communication occurs, is not a convex combination of those induced by any other combination of input symbols (otherwise, the square-root law does not hold). We derive the exact covert capacity region and show that a simple point-to-point based scheme with treating interference as noise is optimal. In addition, we analyze the secret key length required for the reliable and covert communication with the desired rates, and present a channel condition where a secret key between each user pair is unnecessary. The results are extended to the Gaussian case and the case with multiple wardens.
In this paper, the covert communication scenario over K-user-pair discrete memoryless interference channels with a warden is studied. We assume that the wardens channel output distribution induced by K "off input symbols, which are sent when no communication occurs, is not a convex combination of those induced by any other combination of input symbols (otherwise, the square-root law does not hold). We derive the exact covert capacity region and show that a simple point-topoint based scheme with treating interference as noise is optimal. In addition, we analyze the secret key length required for the reliable and covert communication with the desired rates, and present a channel condition where the secret key between each user pair is unnecessary.
We consider the covert communication over the two-user Gaussian multiple access channel (GMAC) with causal feedback. It is shown that any causal feedback does not enlarge the covert capacity region and the time-division scheme is optimal for a class of channels, which includes the case where the warden observes what the legitimate receiver receives. For the proof, we derive an outer bound on the covert capacity region of general GMACs with noiseless causal feedback, which implies that the square-root law holds for arbitrary channel gains. Furthermore, the extension to multi-user case is presented.
We consider the problem of covert communication over a state-dependent channel, for which the transmitter and the legitimate receiver have non-causal access to the channel state information. Covert communication with respect to an adversary, referred to as the “warden,” is one in which the distribution induced during communication at the channel output observed by the warden is identical to the output distribution conditioned on an inactive channel-input symbol. Covert communication involves fooling an adversary in part by a proliferation of codebooks; for reliable decoding at the legitimate receiver the codebook uncertainty is removed via a shared secret key that is unavailable to the warden. Unlike earlier work in state-dependent covert communication, we do not assume the availability of a shared key at the transmitter and legitimate receiver. Rather, a shared randomness is extracted at the transmitter and the receiver from the channel state, in a manner that keeps the shared randomness secret from the warden despite the influence of the channel state on the warden's output. An inner bound on the covert capacity, in the absence of an externally provided secret key, is derived.
We consider a scenario in which two legitimate transmitters attempt to communicate with a legitimate receiver over a discrete memoryless Multiple-Access Channel (MAC), while escaping detection from an adversary who observes their communication through another discrete memoryless MAC. If the MAC to the legitimate receiver is “better” than the one to the adversary, in a sense that we make precise, then the legitimate users can reliably communicate on the order of √n bits per n channel uses with arbitrarily Low Probability of Detection (LPD) without using a secret key. We also identify the pre-constants of the scaling, which leads to a characterization of the covert capacity region.