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

Asilomar Conference on Signals, Systems and Computers (ACSSC)

Covert communications on continuous-time channels in the presence of jamming

Tamara V. Sobers, Boulat A. Bash, Saikat Guha, Don Towsley, Dennis Goeckel

Published Oct 1, 2017• 12 citations
Publisher

Abstract

Covert communication is achieved if the transmitter (Alice) sends messages to a legitimate receiver (Bob) without detection by an attentive warden (Willie). Recently, there has been significant work on establishing the limits of such covert communication, including our work demonstrating that a cooperative jammer can greatly improve the throughput of covert communication systems. However, this previous work has considered a discrete-time model, with the implicit implication that the results will be similar on the true continuous-time model of the physical channel. In this paper, we consider covert communication over the continuous-time channel model to understand the throughput scaling for large blocklengths. For the Alice-Bob-Willie scenario, the results from the discrete-time channel generally follow. However, when a jammer is added to the environment, we demonstrate that timing offsets between Alice's signal and that of the jammer allow for the application of co-channel interference mitigation techniques at Willie's detector, which call into question whether our previous results suggesting an improvement in the covert throughput with the help of the jammer will be obtained in practice. Finally, we consider initial approaches to thwart such a detector and achieve improved throughput scaling in the presence of the jammer.

DOI
10.1109/acssc.2017.8335649

Related papers

Covert Communication in Continuous-Time Systems in the Presence of a Jammer

Ke Li, Tamara V. Sobers, Don Towsley +1 more

Covert communication considers the ability of transmitter Alice to communicate reliably to receiver Bob without being detected by warden Willie. Previous work has generally considered a discrete-time model, and, in the standard Alice-Bob-Willie scenario, it has been shown that a discrete-time model captures the salient aspects of the underlying continuous-time covert communications system. However, in the presence of a jammer assisting Alice, where it has been shown in previous work that Alice can achieve a positive covert rate on a discrete-time model, we demonstrate here that a straightforward extension of the discrete-time construction to the continuous-time system does not guarantee a positive covert rate, hence indicating that the discrete-time model does not capture the salient aspects of the continuous-time system in such a scenario. This is because Willie is able to exploit excess bandwidth for co-channel interference suppression, as we demonstrate with an interference cancellation receiver. Hence, for the case when Alice is assisted by an uninformed jammer, we consider the continuous-time channel directly and study whether efficient covert communication can still be achieved against any possible receiver that Willie might employ. By presenting and characterizing an approach much different than that suggested by previous work for discrete-time systems in such a scenario, we establish that$\mathcal {O}(WT)$information bits can be transmitted covertly and reliably on a continuous-time channel of asymptotic bandwidth$W$in$T$seconds, regardless of the receiver that Willie employs. This is done for two separate scenarios: 1) when there is perfect frame synchronization between Alice and the jammer’s signals; 2) when there is no frame synchronization between Alice and the jammer’s signals. Numerical results are provided to validate the theory.

IEEE Transactions on Wireless Communications•Dec 16, 2021•22 citations

COVERT COMMUNICATIONS IN CONTINUOUS-TIME SYSTEMS

Ke Li

This dissertation studies covert wireless communications where a transmitter (Alice) intends to transmit messages to a legitimate receiver (Bob) such that the presence of the message is hidden from an attentive warden (Willie). Here we consider pertinent aspects of covert communications that focus on moving such systems closer to implementation. For example, previous studies use the standard discrete-time communication model when analyzing covert communications, since this is commonly assumed without loss of generality in standard communication theory. However, it is not clear that such a model captures the salient aspects of the continuous-time covert communications problem. A power detector that is optimal for the warden in a discrete-time covert communications scenario may not be optimal on a continuous- time model. Thus, it is of interest to consider this more realistic model for physical channels. After analyzing a power optimization problem using the standard discrete-time model, we move to the key part of system implementation: the instantiation in true continuous-time systems of the discrete-time models studied to this point in the literature. A key goal is to examine Willie’s detection capability on a continuous-time model and study how the limits of covert communications change from the discrete-time case. In particular, we show that detectors for Willie can benefit from the continuous-time setting and outperform detectors based on the discrete-time model; not surprisingly, this has a significant impact on the true covert throughput of the system. Nevertheless, we establish constructions such that efficient covert communications can still be achieved in a continuous-time model, and prove the fundamental limit on the covert communication rate. After considering the continuous-time problem in detail, we then turn to addressing another limitation of previous work - the requirement for an intentional jammer to facilitate efficient covert communication. Instead, we consider how to exploit a pre-existing interference source – a radar - to achieve covert communication. We establish a covert communication scheme in such an environment, and analyze the corresponding covert rate. Finally, we consider the use of a detection technique similar to that in the covert communications problem, in the area of quantized signal detection.

•Jul 1, 2021•2 citations

Covert Communication in Continuous-Time Systems

Ke Li, Don Towsley, Dennis Goeckel

Recent works have considered the ability of transmitter Alice to communicate reliably to receiver Bob without being detected by warden Willie. These works generally assume a standard discrete-time model. But the assumption of a discrete-time model in standard communication scenarios is often predicated on its equivalence to a continuous-time model, which has not been established for the covert communications problem. Here, we consider the continuous-time channel directly and study if efficient covert communication can still be achieved. We assume that an uninformed jammer is present to assist Alice, and we consider additive white Gaussian noise (AWGN) channels between all parties. For a channel with approximate bandwidth W, we establish constructions such that O(WT) information bits can be transmitted covertly and reliably from Alice to Bob in T seconds for two separate scenarios: 1) when the path-loss between Alice and Willie is known; and 2) when the path-loss between Alice and Willie is unknown.

arXiv:2001.06932•Jan 20, 2020•1 citation

Covert Communications in a Dynamic Interference Environment

Dennis Goeckel, Azadeh Sheikholeslami, Tamara V. Sobers +3 more

Much of security research focuses on preventing an adversary from deciphering a message's content, but there are a number of applications that motivate the more challenging goal of “covert” communications: transmitter Alice conveying information to legitimate receiver Bob while preventing a capable and attentive adversary Willie from detecting the presence of the message. Willie detects Alice's transmission by looking for deviations from the background environment; hence, covert throughput can be increased if Willie has uncertainty about that background environment, as might be caused by user mobility or time-varying jamming. Here, we consider how the dynamics of the background environment impact the throughput of covert communications. Our previous work has shown that a background environment varying a constant number of times per codeword duration can greatly increase the covert throughput. In this paper, we consider the covert throughput for all potential rates of variation of the background. Neither extreme of variation is favorable to Alice: (1) when the background environment varies too quickly relative to the codeword length, Willie can average out the variation and hence limit Alice's covert throughput; (2) when the background environment varies too slowly, Willie can estimate the current environment and again limit Alice's covert throughput. We analyze a detector at Willie that provides an upper bound (converse) to the covert throughput of Alice for all potential rates of variation. Next, we provide an explicit construction for a scheme for Alice that provides a lower bound (achievability) on the covert throughput at each rate of variation.

IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)•Jun 1, 2018•6 citations

Optimal Power Adaptation in Covert Communication With an Uninformed Jammer

Ke Li, Patrick A. Kelly, Dennis Goeckel

Covert communication is achieved if a transmitter (Alice) sends a message to a legitimate receiver (Bob) without being detected by an attentive warden (Willie). Recent work has taken an outage approach that considers an infinite blocklength and analyzes the probability that channel conditions are such that communication is reliable and/or covert. Power adaptation via truncated channel inversion (TCI) has been examined in previous work in an attempt to minimize outage under the covertness constraint. However, the optimality of TCI was not established, and the associated parameters in the TCI scheme were only found numerically. We provide the exact optimal power adaptation schemes under different covertness constraints and with different channel models: 1) when the channel between Willie and an uninformed jammer is AWGN; and 2) when the channel is a Rayleigh fading channel. We also examine the performance improvement of these schemes over standard approaches. This establishes that TCI is optimal in some, but not all, scenarios of interest.

IEEE Transactions on Wireless Communications•Feb 21, 2020•71 citations

Achieving Covert Communication With a Probabilistic Jamming Strategy

Xun Chen, Fujun Gao, Min Qiu +3 more

In this work, we consider a covert communication scenario, where a transmitter Alice communicates to a receiver Bob with the aid of a probabilistic and uninformed jammer against an adversary warden’s detection. The transmission status and power of the jammer are random and follow some priori probabilities. We first analyze the warden’s detection performance as a function of the jammer’s transmission probability, transmit power distribution, and Alice’s transmit power. We then maximize the covert throughput from Alice to Bob subject to a covertness constraint, by designing the covert communication strategies from three different perspectives: Alice’s perspective, the jammer’s perspective, and the global perspective. Our analysis reveals that the minimum jamming power should not always be zero in the probabilistic jamming strategy, which is different from that in the continuous jamming strategy presented in the literature. In addition, we prove that the minimum jamming power should be the same as Alice’s covert transmit power, depending on the covertness and average jamming power constraints. Furthermore, our results show that the probabilistic jamming can outperform the continuous jamming in terms of achieving a higher covert throughput under the same covertness and average jamming power constraints.

arXiv:2308.04278•IEEE Transactions on Information Forensics and Security•Jan 1, 2024•29 citations
Covert communication is achieved if the transmitter (Alice) sends messages to a legitimate receiver (Bob) without detection by an attentive warden (Willie). Recently, there has been significant work on establishing the limits of such covert communication, including our work demonstrating that a cooperative jammer can greatly improve the throughput of covert communication systems. However, this previous work has considered a discrete-time model, with the implicit implication that the results will be similar on the true continuous-time model of the physical channel. In this paper, we consider covert communication over the continuous-time channel model to understand the throughput scaling for large blocklengths. For the Alice-Bob-Willie scenario, the results from the discrete-time channel generally follow. However, when a jammer is added to the environment, we demonstrate that timing offsets between Alice's signal and that of the jammer allow for the application of co-channel interference mitigation techniques at Willie's detector, which call into question whether our previous results suggesting an improvement in the covert throughput with the help of the jammer will be obtained in practice. Finally, we consider initial approaches to thwart such a detector and achieve improved throughput scaling in the presence of the jammer.
Covert communication considers the ability of transmitter Alice to communicate reliably to receiver Bob without being detected by warden Willie. Previous work has generally considered a discrete-time model, and, in the standard Alice-Bob-Willie scenario, it has been shown that a discrete-time model captures the salient aspects of the underlying continuous-time covert communications system. However, in the presence of a jammer assisting Alice, where it has been shown in previous work that Alice can achieve a positive covert rate on a discrete-time model, we demonstrate here that a straightforward extension of the discrete-time construction to the continuous-time system does not guarantee a positive covert rate, hence indicating that the discrete-time model does not capture the salient aspects of the continuous-time system in such a scenario. This is because Willie is able to exploit excess bandwidth for co-channel interference suppression, as we demonstrate with an interference cancellation receiver. Hence, for the case when Alice is assisted by an uninformed jammer, we consider the continuous-time channel directly and study whether efficient covert communication can still be achieved against any possible receiver that Willie might employ. By presenting and characterizing an approach much different than that suggested by previous work for discrete-time systems in such a scenario, we establish thatO(WT)\mathcal {O}(WT)O(WT)information bits can be transmitted covertly and reliably on a continuous-time channel of asymptotic bandwidthWWWinTTTseconds, regardless of the receiver that Willie employs. This is done for two separate scenarios: 1) when there is perfect frame synchronization between Alice and the jammer’s signals; 2) when there is no frame synchronization between Alice and the jammer’s signals. Numerical results are provided to validate the theory.
This dissertation studies covert wireless communications where a transmitter (Alice) intends to transmit messages to a legitimate receiver (Bob) such that the presence of the message is hidden from an attentive warden (Willie). Here we consider pertinent aspects of covert communications that focus on moving such systems closer to implementation. For example, previous studies use the standard discrete-time communication model when analyzing covert communications, since this is commonly assumed without loss of generality in standard communication theory. However, it is not clear that such a model captures the salient aspects of the continuous-time covert communications problem. A power detector that is optimal for the warden in a discrete-time covert communications scenario may not be optimal on a continuous- time model. Thus, it is of interest to consider this more realistic model for physical channels. After analyzing a power optimization problem using the standard discrete-time model, we move to the key part of system implementation: the instantiation in true continuous-time systems of the discrete-time models studied to this point in the literature. A key goal is to examine Willie’s detection capability on a continuous-time model and study how the limits of covert communications change from the discrete-time case. In particular, we show that detectors for Willie can benefit from the continuous-time setting and outperform detectors based on the discrete-time model; not surprisingly, this has a significant impact on the true covert throughput of the system. Nevertheless, we establish constructions such that efficient covert communications can still be achieved in a continuous-time model, and prove the fundamental limit on the covert communication rate. After considering the continuous-time problem in detail, we then turn to addressing another limitation of previous work - the requirement for an intentional jammer to facilitate efficient covert communication. Instead, we consider how to exploit a pre-existing interference source – a radar - to achieve covert communication. We establish a covert communication scheme in such an environment, and analyze the corresponding covert rate. Finally, we consider the use of a detection technique similar to that in the covert communications problem, in the area of quantized signal detection.
Recent works have considered the ability of transmitter Alice to communicate reliably to receiver Bob without being detected by warden Willie. These works generally assume a standard discrete-time model. But the assumption of a discrete-time model in standard communication scenarios is often predicated on its equivalence to a continuous-time model, which has not been established for the covert communications problem. Here, we consider the continuous-time channel directly and study if efficient covert communication can still be achieved. We assume that an uninformed jammer is present to assist Alice, and we consider additive white Gaussian noise (AWGN) channels between all parties. For a channel with approximate bandwidth W, we establish constructions such that O(WT) information bits can be transmitted covertly and reliably from Alice to Bob in T seconds for two separate scenarios: 1) when the path-loss between Alice and Willie is known; and 2) when the path-loss between Alice and Willie is unknown.
Much of security research focuses on preventing an adversary from deciphering a message's content, but there are a number of applications that motivate the more challenging goal of “covert” communications: transmitter Alice conveying information to legitimate receiver Bob while preventing a capable and attentive adversary Willie from detecting the presence of the message. Willie detects Alice's transmission by looking for deviations from the background environment; hence, covert throughput can be increased if Willie has uncertainty about that background environment, as might be caused by user mobility or time-varying jamming. Here, we consider how the dynamics of the background environment impact the throughput of covert communications. Our previous work has shown that a background environment varying a constant number of times per codeword duration can greatly increase the covert throughput. In this paper, we consider the covert throughput for all potential rates of variation of the background. Neither extreme of variation is favorable to Alice: (1) when the background environment varies too quickly relative to the codeword length, Willie can average out the variation and hence limit Alice's covert throughput; (2) when the background environment varies too slowly, Willie can estimate the current environment and again limit Alice's covert throughput. We analyze a detector at Willie that provides an upper bound (converse) to the covert throughput of Alice for all potential rates of variation. Next, we provide an explicit construction for a scheme for Alice that provides a lower bound (achievability) on the covert throughput at each rate of variation.
Covert communication is achieved if a transmitter (Alice) sends a message to a legitimate receiver (Bob) without being detected by an attentive warden (Willie). Recent work has taken an outage approach that considers an infinite blocklength and analyzes the probability that channel conditions are such that communication is reliable and/or covert. Power adaptation via truncated channel inversion (TCI) has been examined in previous work in an attempt to minimize outage under the covertness constraint. However, the optimality of TCI was not established, and the associated parameters in the TCI scheme were only found numerically. We provide the exact optimal power adaptation schemes under different covertness constraints and with different channel models: 1) when the channel between Willie and an uninformed jammer is AWGN; and 2) when the channel is a Rayleigh fading channel. We also examine the performance improvement of these schemes over standard approaches. This establishes that TCI is optimal in some, but not all, scenarios of interest.
In this work, we consider a covert communication scenario, where a transmitter Alice communicates to a receiver Bob with the aid of a probabilistic and uninformed jammer against an adversary warden’s detection. The transmission status and power of the jammer are random and follow some priori probabilities. We first analyze the warden’s detection performance as a function of the jammer’s transmission probability, transmit power distribution, and Alice’s transmit power. We then maximize the covert throughput from Alice to Bob subject to a covertness constraint, by designing the covert communication strategies from three different perspectives: Alice’s perspective, the jammer’s perspective, and the global perspective. Our analysis reveals that the minimum jamming power should not always be zero in the probabilistic jamming strategy, which is different from that in the continuous jamming strategy presented in the literature. In addition, we prove that the minimum jamming power should be the same as Alice’s covert transmit power, depending on the covertness and average jamming power constraints. Furthermore, our results show that the probabilistic jamming can outperform the continuous jamming in terms of achieving a higher covert throughput under the same covertness and average jamming power constraints.