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:2603.29645

Second-Order Asymptotics for Covert Communication over Quasi-Static Multiple-Antenna Fading Channels

Changhong Liu, Jingjing Wang, Qiaosheng Zhang, Jinpeng Xu, Lin Zhou

Published Mar 31, 2026• 2 citations
arXivHTMLPDF

Abstract

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^{-\frac{1}{2}})$ 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.

DOI
10.48550/arxiv.2603.29645

Related papers

Second-Order Asymptotics for Covert Communication over MIMO AWGN Channels

Changhong Liu, Jingjing Wang, Lin Zhou

As claimed in International Telecommunications Union (ITU) Recommendation ITU-R M.2160, 6G communication systems require extremely high-security and low-latency communication, necessitating the study of covert communication operating at finite blocklengths. In the point-to-point (P2P) setting, covert communication enables a transmitter to send messages reliably over a noisy channel to a legitimate receiver without being detected by any third party. Under the covertness metric of Kullback–Leibler divergence (KLD), we derive exact second-order asymptotics for P2P covert communication over a multiple-input multiple-output (MIMO) additive white Gaussian noise (AWGN) channel. In particular, our theoretical benchmarks refine the first-order asymptotics of Wang and Bloch (TIFS 2021), which is known as the square root law by showing that the non-asymptotic maximal number of transmitted messages has a back off that scales in the order \(\Theta(n^\frac{1}{4})\) beyond the first-order term scaling in the order \(\Theta(n^\frac{1}{2})\) when the blocklength is \(n\). Thus, our second-order asymptotic bound provides a better approximation to the finite blocklength performance of optimal codes. Furthermore, compared with the single antenna result of Yu et al. (arXiv:2305.17924v3), we demonstrate the impact of the number of antennas \(m\) and reveal spatial diversity gains of MIMO, advocating the use of MIMO for covert communication to achieve a high transmission rate. To prove our results, we extend the quasi-\(\eta\)-neighborhood framework from single-antenna real value channels to multi-antenna complex value MIMO channels. To ensure covertness, the transmission power vanishes as the blocklength \(n\) increases. Thus, we judiciously analyze the finite blocklength performance of MIMO communication by modifying critical steps concerning the Berry–Esseen Theorem to deal with vanishing second and third absolute moments of information densities that rely on blocklength, which is in stark contrast with the non-covert case.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2026•0 citations

Covert rate characterization under multi-antenna detection: A study on warden's CSI availability and noise uncertainty

Yuchen Zhang, Sa Xiao, Wang Jianquan +3 more

In this paper, we investigate covert communications under multi-antenna detection, and explore the impacts of the warden's channel state information (CSI) availability and the noise uncertainty on system covert capability. The detection performance at warden is analyzed in two cases under the perfect and statistical CSI at warden, respectively. In particular, for the former one, the warden utilizes the likelihood ratio (LR) detector, while for the latter one, the generalized likelihood ratio (GLR) detector is adopted. We first consider the scenario where the blocklength is finite, and demonstrate that the covert rate under both cases asymptotically goes to zero as the blocklength goes to infinity. Subsequently, we take the noise uncertainty at the warden into account which leads to positive covert rate, and characterize the covert rate for infinite blocklength. Specially, we derive the optimal transmit power for the legitimate transmitter that maximizes the covert rate. Besides, the rate gap under two cases, with different CSI availability at the warden, can be presented in closed form. Finally, numerical results validate the effectiveness of our theoretical analysis and also demonstrate the impacts of the factors studied on the system covertness.

China Communications•Feb 1, 2025•1 citation

On the Second Order Asymptotics of Covert Communications over AWGN Channels

Y. Xinchun, Shuangqing Wei, Shao‐Lun Huang +1 more

This work tackles the asymptotics of the maximal throughput of covert communications over AWGN channels when the covert metric is Kullback-Leibler divergence (KL divergence). It is shown that the first and second order asymptotics of the maximal throughput are$\sqrt{n\delta\log e}$and (2)${ }^{\frac{1}{2}}(n \delta)^{\frac{1}{4}}(\log e)^{\frac{3}{4}} \cdot Q^{-1}(\epsilon)$, respectively by$n$channel uses, where$\delta$and$\epsilon$are constraints imposed on covertness and channel decoding error probabilities, respectively. The technique we use in the achievability is quasi-$\varepsilon$-neighborhood notion from information geometry. For finite blocklength$n$, the generating distributions are chosen to be a family of truncated Gaussian distributions with decreasing variances. The law of decreasing is carefully designed so that it maximizes the throughput at the main channel in the asymptotic sense under the condition that the output distributions satisfy the covert constraint. For the converse, the optimality of Gaussian distribution for minimizing KL divergence under second order moment constraint is extended from dimension 1 to dimension$n$, which further leads to the direct converse bound in terms of covert metric.

International Conference on Communications•Jun 9, 2024•3 citations

A Cooperative Deception Strategy for Covert Communication in Presence of a Multi-Antenna Adversary

Jiangbo Si, Zizhen Liu, Zan Li +4 more

Covert transmission is investigated for a cooperative deception strategy, where a cooperative jammer (Jammer) tries to attract a multi-antenna adversary (Willie) and degrade the adversary’s reception ability for the signal from a transmitter (Alice). For this strategy, we formulate an optimization problem to maximize the covert rate when three different types of channel state information (CSI) are available. The total power is optimally allocated between Alice and Jammer subject to the Kullback-Leibler (KL) divergence constraint, which can be expressed analytically and be widely used as a covertness measurement. Different from the existing literature, in our proposed strategy, we also determine the optimal transmission power at the jammer when Alice is silent, while existing works always assume that the jammer’s power is fixed. Specifically, we apply the S-procedure to convert infinite constraints into linear-matrix-inequalities (LMI) constraints. When statistical CSI at Willie is available, we convert double integration to single integration using asymptotic approximation and substitution method. Finally, our simulation results show that for the proposed strategy, the covert rate is increased with the number of antennas at Willie. Moreover, compared to the benchmark, our proposed strategy is more robust in the presence of imperfect CSI.

arXiv:2209.11171•IEEE Transactions on Communications•May 18, 2023•14 citations

Covert Communications under Multiple-Antenna Eavesdropping without Channel State Information

Yuchen Zhang, Sa Xiao, Jianquan Wang +2 more

In this paper, we investigate covert communications under multiple-antenna eavesdropping, and explore the impact of the channel state information (CSI) at the adversary on the covertness of the system with noise uncertainty. We first analyze the detection performance of the adversary without the CSI of the eavesdropping channel. Specially, the generalized likelihood ratio (GLR) detection is adopted to handle this scenario. Then, a more practical scenario with the uncertain noise power at the adversary is considered, and the covertness of the system is analyzed. In addition, the optimal transmit power at the legitimate transmitter is derived theoretically to maximize the covert throughput. Finally, we present numerical results to compare the covert throughputs when the adversary knows or doesn't know the CSI. The results demonstrate the significance of unknown CSI at the adversary when considering the covert throughput of the system.

IEEE Military Communications Conference (MILCOM)•Nov 29, 2021•0 citations

Keyless Covert Communication via Channel State Information

Hassan ZivariFard, Matthieu R. Bloch, Aria Nosratinia

We consider the problem of covert communication over a state-dependent channel when the Channel State Information (CSI) is available either non-causally, causally, or strictly causally, either at the transmitter alone, or at both transmitter and receiver. Covert communication with respect to an adversary, called “warden,” is one in which, despite communication over the channel, the warden’s observation remains indistinguishable from an output induced by innocent channel-input symbols. Covert communication involves fooling an adversary in part by a proliferation of codebooks; for reliable decoding at the legitimate receiver, the codebook uncertainty is typically removed via a shared secret key that is unavailable to the warden. In contrast to previous work, we do not assume the availability of a large shared key at the transmitter and legitimate receiver. Instead, we only require a secret key with negligible rate to bootstrap the communication and our scheme extracts shared randomness from the CSI in a manner that keeps it secret from the warden, despite the influence of the CSI on the warden’s output. When CSI is available at the transmitter and receiver, we derive the covert capacity region. When CSI is only available at the transmitter, we derive inner and outer bounds on the covert capacity. We also provide examples for which the covert capacity is positive with knowledge of CSI but is zero without it.

arXiv:2003.03308•IEEE Transactions on Information Theory•Dec 13, 2021•35 citations
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 nnn, the first-order covert rate satisfies the square root law, scaling as Θ(n−12)Θ(n^{-\frac{1}{2}})Θ(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.
As claimed in International Telecommunications Union (ITU) Recommendation ITU-R M.2160, 6G communication systems require extremely high-security and low-latency communication, necessitating the study of covert communication operating at finite blocklengths. In the point-to-point (P2P) setting, covert communication enables a transmitter to send messages reliably over a noisy channel to a legitimate receiver without being detected by any third party. Under the covertness metric of Kullback–Leibler divergence (KLD), we derive exact second-order asymptotics for P2P covert communication over a multiple-input multiple-output (MIMO) additive white Gaussian noise (AWGN) channel. In particular, our theoretical benchmarks refine the first-order asymptotics of Wang and Bloch (TIFS 2021), which is known as the square root law by showing that the non-asymptotic maximal number of transmitted messages has a back off that scales in the order Θ(n14)\Theta(n^\frac{1}{4})Θ(n41​) beyond the first-order term scaling in the order Θ(n12)\Theta(n^\frac{1}{2})Θ(n21​) when the blocklength is nnn. Thus, our second-order asymptotic bound provides a better approximation to the finite blocklength performance of optimal codes. Furthermore, compared with the single antenna result of Yu et al. (arXiv:2305.17924v3), we demonstrate the impact of the number of antennas mmm and reveal spatial diversity gains of MIMO, advocating the use of MIMO for covert communication to achieve a high transmission rate. To prove our results, we extend the quasi-η\etaη-neighborhood framework from single-antenna real value channels to multi-antenna complex value MIMO channels. To ensure covertness, the transmission power vanishes as the blocklength nnn increases. Thus, we judiciously analyze the finite blocklength performance of MIMO communication by modifying critical steps concerning the Berry–Esseen Theorem to deal with vanishing second and third absolute moments of information densities that rely on blocklength, which is in stark contrast with the non-covert case.
In this paper, we investigate covert communications under multi-antenna detection, and explore the impacts of the warden's channel state information (CSI) availability and the noise uncertainty on system covert capability. The detection performance at warden is analyzed in two cases under the perfect and statistical CSI at warden, respectively. In particular, for the former one, the warden utilizes the likelihood ratio (LR) detector, while for the latter one, the generalized likelihood ratio (GLR) detector is adopted. We first consider the scenario where the blocklength is finite, and demonstrate that the covert rate under both cases asymptotically goes to zero as the blocklength goes to infinity. Subsequently, we take the noise uncertainty at the warden into account which leads to positive covert rate, and characterize the covert rate for infinite blocklength. Specially, we derive the optimal transmit power for the legitimate transmitter that maximizes the covert rate. Besides, the rate gap under two cases, with different CSI availability at the warden, can be presented in closed form. Finally, numerical results validate the effectiveness of our theoretical analysis and also demonstrate the impacts of the factors studied on the system covertness.
This work tackles the asymptotics of the maximal throughput of covert communications over AWGN channels when the covert metric is Kullback-Leibler divergence (KL divergence). It is shown that the first and second order asymptotics of the maximal throughput arenδlog⁡e\sqrt{n\delta\log e}nδloge​and (2)12(nδ)14(log⁡e)34⋅Q−1(ϵ){ }^{\frac{1}{2}}(n \delta)^{\frac{1}{4}}(\log e)^{\frac{3}{4}} \cdot Q^{-1}(\epsilon)21​(nδ)41​(loge)43​⋅Q−1(ϵ), respectively bynnnchannel uses, whereδ\deltaδandϵ\epsilonϵare constraints imposed on covertness and channel decoding error probabilities, respectively. The technique we use in the achievability is quasi-ε\varepsilonε-neighborhood notion from information geometry. For finite blocklengthnnn, the generating distributions are chosen to be a family of truncated Gaussian distributions with decreasing variances. The law of decreasing is carefully designed so that it maximizes the throughput at the main channel in the asymptotic sense under the condition that the output distributions satisfy the covert constraint. For the converse, the optimality of Gaussian distribution for minimizing KL divergence under second order moment constraint is extended from dimension 1 to dimensionnnn, which further leads to the direct converse bound in terms of covert metric.
Covert transmission is investigated for a cooperative deception strategy, where a cooperative jammer (Jammer) tries to attract a multi-antenna adversary (Willie) and degrade the adversary’s reception ability for the signal from a transmitter (Alice). For this strategy, we formulate an optimization problem to maximize the covert rate when three different types of channel state information (CSI) are available. The total power is optimally allocated between Alice and Jammer subject to the Kullback-Leibler (KL) divergence constraint, which can be expressed analytically and be widely used as a covertness measurement. Different from the existing literature, in our proposed strategy, we also determine the optimal transmission power at the jammer when Alice is silent, while existing works always assume that the jammer’s power is fixed. Specifically, we apply the S-procedure to convert infinite constraints into linear-matrix-inequalities (LMI) constraints. When statistical CSI at Willie is available, we convert double integration to single integration using asymptotic approximation and substitution method. Finally, our simulation results show that for the proposed strategy, the covert rate is increased with the number of antennas at Willie. Moreover, compared to the benchmark, our proposed strategy is more robust in the presence of imperfect CSI.
In this paper, we investigate covert communications under multiple-antenna eavesdropping, and explore the impact of the channel state information (CSI) at the adversary on the covertness of the system with noise uncertainty. We first analyze the detection performance of the adversary without the CSI of the eavesdropping channel. Specially, the generalized likelihood ratio (GLR) detection is adopted to handle this scenario. Then, a more practical scenario with the uncertain noise power at the adversary is considered, and the covertness of the system is analyzed. In addition, the optimal transmit power at the legitimate transmitter is derived theoretically to maximize the covert throughput. Finally, we present numerical results to compare the covert throughputs when the adversary knows or doesn't know the CSI. The results demonstrate the significance of unknown CSI at the adversary when considering the covert throughput of the system.
We consider the problem of covert communication over a state-dependent channel when the Channel State Information (CSI) is available either non-causally, causally, or strictly causally, either at the transmitter alone, or at both transmitter and receiver. Covert communication with respect to an adversary, called “warden,” is one in which, despite communication over the channel, the warden’s observation remains indistinguishable from an output induced by innocent channel-input symbols. Covert communication involves fooling an adversary in part by a proliferation of codebooks; for reliable decoding at the legitimate receiver, the codebook uncertainty is typically removed via a shared secret key that is unavailable to the warden. In contrast to previous work, we do not assume the availability of a large shared key at the transmitter and legitimate receiver. Instead, we only require a secret key with negligible rate to bootstrap the communication and our scheme extracts shared randomness from the CSI in a manner that keeps it secret from the warden, despite the influence of the CSI on the warden’s output. When CSI is available at the transmitter and receiver, we derive the covert capacity region. When CSI is only available at the transmitter, we derive inner and outer bounds on the covert capacity. We also provide examples for which the covert capacity is positive with knowledge of CSI but is zero without it.