This paper investigates the achievable message transmission rate of covert communication over slow fading channels where the channel coefficient remains unchanged over a finite transmission block. Such communication is often implemented with an extremely low transmission power aiming to achieve low probability of detection by the eavesdropper and under tolerable probability of decoding error for the legitimate receiver. The exact expression of achievability and asymptotic covert bounds are derived, which are shown in accordance with the square root law in AWGN (Additive White Gaussian Noise) channels with large transmission blocks. The case that the eavesdropper has unknown channel state information is also studied in the paper.
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.
With advances in computing and signal processing technologies, wireless communication systems are facing severe security threats, necessitating effective countermeasures. Unlike traditional secure communication schemes, covert communication should hide not only information content but also data transmission activity from adversaries. To this end, we propose an energy dispersion-based covert communication scheme to ensure that communication signal detection by adversaries has close-to-zero probability. The proposed scheme spreads the energy of transmitted signals throughout the whole parameter space to limit the signal detection capability of adversaries and improve the covertness of signal transmission. By defining the covertness of transmitted signals with respect to the adversaries' prior knowledge of parameter spaces, we study the modeling of energy dispersion-based covert communication systems and analyze their fundamental performance limitations. With these analytical results, we further investigate the impacts of adversaries' prior knowledge on the achievable throughput of covert communications. These results demonstrate that the dispersion of signal energy can degrade the performance of coherent signal detection so that the achievable throughput of the covert communication system does not necessarily follow the power-law decrease observed in existing work on the low probability of detection communications. This work lays the theoretical foundation for covert communication based on energy dispersion.
Information security has always been a critical issue in wireless networks. Apart from other secure techniques, covert communication emerges as a potential solution to security for wireless networks owing to its high-security level. In covert communication networks, the transmitter hides the transmitted signals into environmental or artificial noise by introducing randomness to avoid detection at the warden. By eliminating the existence of transmitted signals at the warden, information security can be preserved more solidly than other secure transmission techniques, i.e., without noticing the existence. Due to the promising security protection, covert communication has been successfully utilized in tremendous wireless communication scenarios. However, fundamental challenges in its practical implementation still exist, e.g., the effectiveness of randomness utilization, the low signal-to-interference-plus-noise ratio at legitimate users, etc. In this survey, we demonstrate a comprehensive review concentrating on the applications, solutions, and future challenges of covert communications. Specifically, the covert principle and research categories are first introduced. Then, the applications in the networks with different topologies and the effective covert techniques in the existing literature are reviewed. We also discuss the potential implementation of covert communications in future networks and the open challenges.
We study the second-order asymptotics of optimal codes for covert communication over quasi-static multi-antenna fading channels, under the covertness metric of Kullback--Leibler (KL) divergence. In particular, we study all four cases regarding the availability of channel state information (CSI) for the legitimate transmitter and receiver, assume that the warden knows perfect CSI for the channel from the legitimate transmitter to itself, whereas the legitimate transmitter knows only that the warden's channel matrix belongs to a bounded deterministic uncertainty set. Specifically, we show that, when the blocklength is
n, the first-order covert rate satisfies the square root law, scaling as
Θ(n−21) with the coefficient determined by the traces of the channel matrices of the legitimate users and the warden, and the second-order rate vanishes. We also show that the availability of CSI at the transmitter enables optimal covert power allocation across the spatial sub-channels, which can increase the covert rate, relatively to equal power allocation, without changing the square root law. Furthermore, we reveal the significant spatial diversity gain provided by multiple-antenna systems for covert communication and demonstrate the critical role of the number of antennas to achieve high throughput covert communication. For the covertness analysis, we extend the quasi-
η-neighborhood framework to quasi-static fading channels. For the reliability analysis, due to the vanishing power imposed by the covertness constraint, we refine the non-covert analysis by Yang et al. (TIT, 2014), by carefully controlling higher-order terms and exploiting the properties of covert outage probability.
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.