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

Science China Information Sciences

Covert communication with beamforming over MISO channels in the finite blocklength regime

Xinchun Yu, Yuan Luo, Wen Chen

Published Aug 18, 2021• 12 citations
Publisher
DOI
10.1007/s11432-019-2919-5

Related papers

Finite Blocklength Analysis on Covert Communication over AWGN Channels

Xinchun Yu, Chenhao Ying, Shuangqin Wei +1 more

arXiv:1901.03123•Jan 10, 2019•1 citation

Robust Covert Communication in MISO-RSMA Systems with Internal Eavesdropper

Pengpai Xu, Ye Fan, Rugui Yao +1 more

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Sep 1, 2026•0 citations

Joint Beamforming for Jammer-Aided MU-MISO Covert Communications With Finite Blocklength

Xing Lv, Manlin Wang, Zhen Ming Xu +1 more

In this work, a jammer-aided covert communication system with finite blocklength is investigated, where we propose a joint beamforming strategy of the legitimate transmitter and the friendly jammer in spatial and temporal domains. Specifically, we first derive the warder’s detection performance using a novel covertness metric. Then, an optimization problem is formulated to maximize the minimum covert rate, and a successive convex approximation-based algorithm is proposed to obtain a near-optimal solution. Numerical simulations show that our proposed joint beamforming strategy outperforms several benchmarks and achieves more realistic performance for short packet transmission than the results with infinite blocklength.

IEEE Wireless Communications Letters•Jun 26, 2025•2 citations

Robust beamforming for physical-layer secrecy

Zou Jingbo, Shûichi Ohno

IEICE Technical Report; IEICE Tech. Rep.•Jan 11, 2016•0 citations

Probabilistic Jamming Aided Covert Communication in the Finite Blocklength Regime

Ruiqian Ma, Weiwei Yang, Kaixin Cheng +1 more

In this work, the covert communication assisted by a probabilistic jammer is investigated in the finite blocklength regime, in which the jammer emits jamming signals with a certain probability to alleviate its negative effect on legitimate link but still enhance the covertness performance. Specifically, we first derive a tractable expression of covertness constraint based on the average KL divergence. Then, a closed-form expression of average decoding error probability (DEP) involving the effect of probabilistic jamming is presented. Moreover, joint optimization of transmit power and blocklength at the transmitter for maximizing the average effective covert throughput (AECT) is formulated and tackled, which demonstrates the trade-off between the transmit power and blocklength to improve covert communication performance. Our results show that the probabilistic jamming can indeed enhance the covert communication performance, and the jamming probability can be optimized to further improve the AECT.

International Conference on Wireless Communications and Signal Processing (WCSP)•Nov 1, 2022•5 citations

Finite Blocklength Analysis of Gaussian Random Coding in AWGN Channels Under Covert Constraint

Xinchun Yu, Shuangqin Wei, Yuan Luo

It is well known that finite blocklength analysis plays an important role in evaluating performances of communication systems in practical settings. This paper considers the achievability and converse bounds on the maximal channel coding rate (throughput) at a given blocklength and error probability in covert communication over AWGN channels. The covert constraint is given in terms of an upper bound on total variation distance (TVD) between the distributions of eavesdropped signals at an adversary with and without presence of active and legitimate communication, respectively. For the achievability, Gaussian random coding scheme is adopted for convenience in the analysis of TVD. The classical results of finite blocklength regime are not applicable in this case. By exploiting and extending canonical approaches, we first present new and more general achievability bounds for random coding schemes under maximal or average probability of error requirements. The general bounds are then applied to covert communication in AWGN channels where codewords are generated from Gaussian distribution while meeting the maximal power constraint. We further show an interesting connection between attaining tight achievability and converse bounds and solving two total variation distance based minimax and maxmin problems. The TVD constraint is analyzed under the given random coding scheme, which induces bounds on the transmission power through divergence inequalities. Further comparison is made between the new achievability bounds and existing ones derived under deterministic codebooks. Our thorough analysis thus leads us to a comprehensive characterization of the attainable throughput in covert communication over AWGN channels.

arXiv:1909.11324•IEEE Transactions on Information Forensics and Security•Oct 21, 2020•22 citations
In this work, a jammer-aided covert communication system with finite blocklength is investigated, where we propose a joint beamforming strategy of the legitimate transmitter and the friendly jammer in spatial and temporal domains. Specifically, we first derive the warder’s detection performance using a novel covertness metric. Then, an optimization problem is formulated to maximize the minimum covert rate, and a successive convex approximation-based algorithm is proposed to obtain a near-optimal solution. Numerical simulations show that our proposed joint beamforming strategy outperforms several benchmarks and achieves more realistic performance for short packet transmission than the results with infinite blocklength.
In this work, the covert communication assisted by a probabilistic jammer is investigated in the finite blocklength regime, in which the jammer emits jamming signals with a certain probability to alleviate its negative effect on legitimate link but still enhance the covertness performance. Specifically, we first derive a tractable expression of covertness constraint based on the average KL divergence. Then, a closed-form expression of average decoding error probability (DEP) involving the effect of probabilistic jamming is presented. Moreover, joint optimization of transmit power and blocklength at the transmitter for maximizing the average effective covert throughput (AECT) is formulated and tackled, which demonstrates the trade-off between the transmit power and blocklength to improve covert communication performance. Our results show that the probabilistic jamming can indeed enhance the covert communication performance, and the jamming probability can be optimized to further improve the AECT.
It is well known that finite blocklength analysis plays an important role in evaluating performances of communication systems in practical settings. This paper considers the achievability and converse bounds on the maximal channel coding rate (throughput) at a given blocklength and error probability in covert communication over AWGN channels. The covert constraint is given in terms of an upper bound on total variation distance (TVD) between the distributions of eavesdropped signals at an adversary with and without presence of active and legitimate communication, respectively. For the achievability, Gaussian random coding scheme is adopted for convenience in the analysis of TVD. The classical results of finite blocklength regime are not applicable in this case. By exploiting and extending canonical approaches, we first present new and more general achievability bounds for random coding schemes under maximal or average probability of error requirements. The general bounds are then applied to covert communication in AWGN channels where codewords are generated from Gaussian distribution while meeting the maximal power constraint. We further show an interesting connection between attaining tight achievability and converse bounds and solving two total variation distance based minimax and maxmin problems. The TVD constraint is analyzed under the given random coding scheme, which induces bounds on the transmission power through divergence inequalities. Further comparison is made between the new achievability bounds and existing ones derived under deterministic codebooks. Our thorough analysis thus leads us to a comprehensive characterization of the attainable throughput in covert communication over AWGN channels.