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

IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

On Covert Communication Over Infinite-Bandwidth Gaussian Channels

Ligong Wang

Published Jun 1, 2018• 8 citations
Publisher

Abstract

We consider a problem of communication over a continuous-time additive Gaussian noise channel. A covertness constraint is imposed on the communication protocol, which says that the channel output must statistically resemble pure noise. When there is no bandwidth constraint on the input, we argue that the covert communication capacity of this channel is positive, in contrast to the band-limited case where covertness requires that the amount of transmission grow at most like the square root of total communication time. This claim is formally proven in the case where the Gaussian noise is white with respect to the bandwidth used by the transmitter.

DOI
10.1109/spawc.2018.8445976

Related papers

Covert Communication Over the Poisson Channel

Ligong Wang

We consider the problem of communication over a continuous-time Poisson channel subject to a covertness constraint: The relative entropy between the output distributions when a message is transmitted and when no input is provided must be small. In the absence of both bandwidth and peak-power constraints, we show the covert communication capacity of this channel, in nats per second, to be infinity. When a peak-power constraint is imposed on the input, the covert communication capacity becomes zero, and the “square-root scaling law” applies. When a bandwidth constraint but no peak-power constraint is imposed, the covert communication capacity is again shown to be zero, but we have not determined whether the square-root law holds or not.

IEEE Journal on Selected Areas in Information Theory•Jan 21, 2021•24 citations

The Continuous-Time Poisson Channel Has Infinite Covert Communication Capacity

Ligong Wang

We consider the problem of communication over a continuous-time, infinite-bandwidth Poisson channel without peak-power constraint, but subject to a covertness constraint: the relative entropy between the output distributions when a codeword is transmitted and when no input is provided to the channel must tend to zero as total communication time grows large. We show that, under such a constraint, the capacity of this channel, in nats per second, is infinity.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2018•14 citations

An Extensible Covert Communication Scheme Over the AWGN Channel With Feedback

Hangmei Rao, Ligong Wang

We consider a problem of communication over a physically-degraded additive white Gaussian noise wiretap channel. A covertness constraint is imposed, which says that the output at the wiretapper must statistically resemble pure noise. Previous works have shown that the total amount of information that can be transmitted over n uses of the channel is proportional to n, but the communication schemes in those works are designed to transmit only one message of predetermined length. We propose a feedback-aided scheme that, at the cost of less-than-optimal message length, is easily extensible to transmitting multiple messages and an unbounded amount of information.

IEEE Information Theory Workshop (ITW)•Nov 1, 2022•1 citation

Covert MIMO Communications Under Variational Distance Constraint

Shi-Yuan Wang, Matthieu R. Bloch

The problem of covert communication over Multiple-Input Multiple-Output (MIMO) Additive White Gaussian Noise (AWGN) channels is investigated, in which a transmitter attempts to reliably communicate with a legitimate receiver while avoiding detection by a passive adversary. The covert capacity of the MIMO AWGN channel is characterized under a variational distance covertness constraint when the MIMO channel matrices are static and known. The characterization of the covert capacity is also extended to a class of channels in which the legitimate channel matrix is known but the adversary’s channel matrix is only known up to a rank and a spectral norm constraint.

arXiv:2102.11336•IEEE Transactions on Information Forensics and Security•Jan 1, 2021•38 citations

Covert MIMO Communications under Variational Distance Constraint

Shiyuan Wang, Matthieu R. Bloch

We consider the problem of covert communication over Multiple-Input Multiple-Output (MIMO) Additive White Gaussian Noise (AWGN) channels, in which a transmitter attempts to reliably communicate with a legitimate receiver while ensuring a low probability of detection by an adversary. We exactly characterize the covert capacity under a variational distance covertness constraint when MIMO channel matrices are static and known to all parties. We also characterize the covert capacity for a class of channels in which the legitimate channel matrix is known but the adversary's channel matrix is only known to satisfy a rank and a spectral norm constraint.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2020•4 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
We consider a problem of communication over a continuous-time additive Gaussian noise channel. A covertness constraint is imposed on the communication protocol, which says that the channel output must statistically resemble pure noise. When there is no bandwidth constraint on the input, we argue that the covert communication capacity of this channel is positive, in contrast to the band-limited case where covertness requires that the amount of transmission grow at most like the square root of total communication time. This claim is formally proven in the case where the Gaussian noise is white with respect to the bandwidth used by the transmitter.
We consider the problem of communication over a continuous-time Poisson channel subject to a covertness constraint: The relative entropy between the output distributions when a message is transmitted and when no input is provided must be small. In the absence of both bandwidth and peak-power constraints, we show the covert communication capacity of this channel, in nats per second, to be infinity. When a peak-power constraint is imposed on the input, the covert communication capacity becomes zero, and the “square-root scaling law” applies. When a bandwidth constraint but no peak-power constraint is imposed, the covert communication capacity is again shown to be zero, but we have not determined whether the square-root law holds or not.
We consider a problem of communication over a physically-degraded additive white Gaussian noise wiretap channel. A covertness constraint is imposed, which says that the output at the wiretapper must statistically resemble pure noise. Previous works have shown that the total amount of information that can be transmitted over n uses of the channel is proportional to n, but the communication schemes in those works are designed to transmit only one message of predetermined length. We propose a feedback-aided scheme that, at the cost of less-than-optimal message length, is easily extensible to transmitting multiple messages and an unbounded amount of information.
The problem of covert communication over Multiple-Input Multiple-Output (MIMO) Additive White Gaussian Noise (AWGN) channels is investigated, in which a transmitter attempts to reliably communicate with a legitimate receiver while avoiding detection by a passive adversary. The covert capacity of the MIMO AWGN channel is characterized under a variational distance covertness constraint when the MIMO channel matrices are static and known. The characterization of the covert capacity is also extended to a class of channels in which the legitimate channel matrix is known but the adversary’s channel matrix is only known up to a rank and a spectral norm constraint.
We consider the problem of covert communication over Multiple-Input Multiple-Output (MIMO) Additive White Gaussian Noise (AWGN) channels, in which a transmitter attempts to reliably communicate with a legitimate receiver while ensuring a low probability of detection by an adversary. We exactly characterize the covert capacity under a variational distance covertness constraint when MIMO channel matrices are static and known to all parties. We also characterize the covert capacity for a class of channels in which the legitimate channel matrix is known but the adversary's channel matrix is only known to satisfy a rank and a spectral norm constraint.
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.