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 Transactions on Wireless Communications

Achieving Covertness and Security in Broadcast Channels With Finite Blocklength

Chao Wang, Zan Li, Haibin Zhang, Derrick Wing Kwan Ng, Naofal Al‐Dhahir

Published Mar 23, 2022• 72 citations
Publisher

Abstract

Considering multi-user downlink ultra-high reliability and low latency communications (URLLC), this paper employs the artificial noise (AN) technique to establish a secure and covert broadcast communication paradigm for the first time. Specifically, a multi-antenna transmitter (Alice) broadcasts the confidential information to multiple legitimate users in the presence of a multi-antenna malicious warden (Willie) and a multi-antenna eavesdropper (Eve). It is well known that AN is an effective technique for securing the physical layer security (PLS) of signal transmissions. Nevertheless, AN emission also exposes the signal transmission and decreases the signal covertness. Taking into account the impact of short-packet URLLC transmissions, we investigate the joint optimization of the precoder and AN to maximize the secrecy rate under the covertness constraint. Although the considered problem is nonconvex, we propose a branch-reduce-and-bound (BRB)-based algorithm to solve it optimally. However, the nested-loop structure of the BRB-based algorithm incurs a high computational complexity. To strike a balance between the performance and computational complexity, we also propose a low-complexity penalty successive convex approximation (SCA)-based algorithm, whose performance approaches that of the optimal BRB-based algorithm, particularly in the low to medium transmit power regime. Simulation results demonstrate the excellent performance of our proposed optimization algorithms compared with various benchmark algorithms and unveil the importance of exploiting AN for secrecy provisioning.

DOI
10.1109/twc.2022.3160051

Related papers

Optimal Joint Beamforming and Jamming Design for Secure and Covert URLLC

Chao Wang, Zan Li, Derrick Wing Kwan Ng

This paper considers the physical layer security (PLS) and covertness of the signal transmission in a multiple-input single-output downlink adopting ultra-high reliability and low latency communication (URLLC). In the considered system, Alice transmits confidential signals to Bob in the presence of a multi-antenna eavesdropper (Eve) and a multi-antenna watchful adversary (Willie). Although artificial noise (AN) is a common PLS technique for protecting the confidential signal from wiretapping, it may reduce the communication covertness due to the additional signal emission. For maximizing the achievable secrecy rate, we propose an AN-aided secure and covert communication strategy through optimizing the information carrying beamformer and AN jointly subject to the covertness constraint. To tackle the formulated non-convex design problem, we propose a branch-reduce-and-bound (BRB)-based algorithm to solve the considered problem globally. Simulation results validate its efficiency compared with a benchmark algorithm and unveil the importance of exploiting AN.

Globecom•Dec 1, 2021•6 citations

Secrecy analysis of short-packet transmissions in ultra-reliable and low-latency communications

Jianhua He, Guangheng Zhao, Lu Wang +2 more

Abstract In this paper, we investigate the secrecy performance of short-packet transmissions in ultra-reliable and low-latency communications (URLLC). We consider the scenario where a multi-antenna source communicates with a single-antenna legitimate receiver requiring ultra-high reliability and low latency, in the presence of a single-antenna eavesdropper. In order to safeguard URLLC, the source transmits the artificial noise (AN) signal together with the confidential signal to confuse the eavesdropper. We adopt a lower bound on the maximal secrecy rate as the secrecy performance metric for short-packet transmissions in URLLC, which takes the target decoding error probabilities at the legitimate receiver and the eavesdropper into account. Using this metric, we first derive a compact expression of the generalized secrecy outage probability (SOP). Then, we formally prove that the generalized SOP is a convex function with respect to the power allocation factor between the confidential signal and the AN signal. We further determine the optimal power allocation factor that minimizes the generalized SOP. The results presented in this work can be useful for designing new secure transmission schemes for URLLC.

EURASIP Journal on Wireless Communications and Networking•Feb 15, 2021•4 citations

Secrecy Throughput Enhancement with ANECE and Multi-Antenna Beamforming in Finite Blocklength

Ishmam Zabir, Ananthram Swami, Yingbo Hua

This paper presents a secure downlink communication system where a transmitter with multiple antennas sends information to multiple single antenna users under ultra reliable and low-latency communication (uRLLC) system requirement. To meet uRLLC requirement and provide secrecy against multi-antenna eavesdropper (Eve), transmitter adopts a special channel training scheme called anti-eavesdropping channel estimation (ANECE) as well as a standard transmit beamforming to send secret information in short blocklength regime. Using ANECE, two or more cooperative full-duplex radio devices obtain their receive channel state information (CSI) with respect to each other while preventing Eve from obtaining a consistent estimate of its receive CSI, which improves the secrecy of subsequent transmission of information between the devices. We derive an expression for the average secrecy throughput (AST) of ANECE assisted transmission. This easy-to-evaluate expression of approximated AST in terms of blocklength and various controllable parameters leads to useful insights to maximize AST under uRLLC requirement. Finally, numerical results are presented and discussed.

International Conference on Communications•May 16, 2022•1 citation

Optimizing Training and Transmission Overheads for Secure URLLC Against Randomly Distributed Eavesdroppers

Yuncong Xie, Pinyi Ren

In this article, we focus on the pilot-assisted transmission design for secure ultra-reliable and low-latency communication (URLLC) systems, which has not yet been studied in the existing literatures. In each transmission period of this system, the multi-antenna controller sends confidential URLLC messages integrated with artificial noise (AN) to a single-antenna actuator for some mission-critical operations (e.g., remote control), and while an unknown number of passive eavesdroppers attempt to intercept this confidential message in a non-colluding manner. Since the conventional ergodic secrecy capacity is not accurate to describe the maximal achievable secrecy rate of URLLC with short blocklength coding, we establish the concept of achievable effective secrecy rate (AESR) to measure the secrecy performance of our URLLC system, which is defined as the average number of information bits can be transmitted per channel use under given reliability and information leakage constraints. Due to the exact expression of AESR has an intractable form, we derive a closed-form approximation on the AESR to simplify the calculation, via leveraging the Laplace approximation and Gaussian-Chebyshev quadrature method. Following by this approximation, we propose an efficient two-dimensional search algorithm to determine the optimal transmission parameters that maximize the AESR, i.e., the training pilot length and the power allocation ratio between confidential data signals and AN. Furthermore, the asymptotic performance of AESR in the high-SNR regime is also analyzed to gain more insights. Numerical results validate the accuracy of theoretical approximations presented in this paper, and illustrate how the particular system parameters impact the AESR of our considered URLLC system.

IEEE Transactions on Vehicular Technology•Jul 26, 2022•10 citations

Joint Information-Theoretic Secrecy and Covert Communication in the Presence of an Untrusted User and Warden

Moslem Forouzesh, Paeiz Azmi, Ali Kuhestani +1 more

In this article, we investigate joint information-theoretic secrecy and covert communication in a single-input-multioutput (SIMO) system where a transmitter (Alice) is communicating with two legitimate users (Bob and Carol). We consider that an untrusted user and a warden node are also present in the network attempting to attack the secure and covert communications to Bob and Carol, respectively. Specifically, Bob requires secure communications such that his messages from Alice are not decoded by the untrusted user, while Carol requires covert communications such that her messages from Alice are not detected by the warden. To do so, we consider that Alice transmits Carol's messages during selected time slots to hide them from the warden while also transmitting Bob's messages in each time slot contentiously. We formulate an optimization problem with the aim of maximizing the average rate subject to a covert communication requirement and a secure communications constraint. Since the proposed optimization problem is nonconvex, we utilize successive convex approximation to obtain a tractable solution. Moreover, we extend our proposed system model to multiple antenna Alice scenario and find beamforming vectors so that the average sum rate is maximized. Furthermore, we consider practical assumptions that Alice has imperfect knowledge of the warden's location and imperfect channel state information (CSI) of Bob and Carol. Our numerical examples highlight that the imperfect CSI at Carol has a more detrimental impact on the average rate compared to imperfect CSI at Bob.

arXiv:2007.05502•IEEE Internet of Things Journal•Nov 17, 2020•53 citations

Physical-Layer Security in the Finite Blocklength Regime Over Fading Channels

Tong-Xing Zheng, Hui‐Ming Wang, Derrick Wing Kwan Ng +1 more

This paper studies physical-layer secure transmissions from a transmitter to a legitimate receiver against an eavesdropper over slow fading channels, taking into account the impact of finite blocklength secrecy coding. A comprehensive analysis and optimization framework is established to investigate secrecy throughput for both single- and multi-antenna transmitter scenarios. Both adaptive and non-adaptive design schemes are devised, in which the secrecy throughput is maximized by exploiting the instantaneous and statistical channel state information of the legitimate receiver, respectively. Specifically, optimal transmission policy, blocklength, and code rates are jointly designed to maximize the secrecy throughput. Additionally, null-space artificial noise is employed to improve the secrecy throughput for the multi-antenna setup with the optimal power allocation derived. Various important insights are developed. In particular, 1) increasing blocklength benefits both reliability and secrecy under the proposed transmission policy; 2) secrecy throughput monotonically increases with blocklength; 3) secrecy throughput initially increases but then decreases as secrecy rate increases, and the optimal secrecy rate maximizing the secrecy throughput should be carefully chosen in order to strike a good balance between rate and decoding correctness. Numerical results are eventually presented to verify theoretical findings.

arXiv:2002.03106•IEEE Transactions on Wireless Communications•Feb 19, 2020•41 citations
Considering multi-user downlink ultra-high reliability and low latency communications (URLLC), this paper employs the artificial noise (AN) technique to establish a secure and covert broadcast communication paradigm for the first time. Specifically, a multi-antenna transmitter (Alice) broadcasts the confidential information to multiple legitimate users in the presence of a multi-antenna malicious warden (Willie) and a multi-antenna eavesdropper (Eve). It is well known that AN is an effective technique for securing the physical layer security (PLS) of signal transmissions. Nevertheless, AN emission also exposes the signal transmission and decreases the signal covertness. Taking into account the impact of short-packet URLLC transmissions, we investigate the joint optimization of the precoder and AN to maximize the secrecy rate under the covertness constraint. Although the considered problem is nonconvex, we propose a branch-reduce-and-bound (BRB)-based algorithm to solve it optimally. However, the nested-loop structure of the BRB-based algorithm incurs a high computational complexity. To strike a balance between the performance and computational complexity, we also propose a low-complexity penalty successive convex approximation (SCA)-based algorithm, whose performance approaches that of the optimal BRB-based algorithm, particularly in the low to medium transmit power regime. Simulation results demonstrate the excellent performance of our proposed optimization algorithms compared with various benchmark algorithms and unveil the importance of exploiting AN for secrecy provisioning.
This paper considers the physical layer security (PLS) and covertness of the signal transmission in a multiple-input single-output downlink adopting ultra-high reliability and low latency communication (URLLC). In the considered system, Alice transmits confidential signals to Bob in the presence of a multi-antenna eavesdropper (Eve) and a multi-antenna watchful adversary (Willie). Although artificial noise (AN) is a common PLS technique for protecting the confidential signal from wiretapping, it may reduce the communication covertness due to the additional signal emission. For maximizing the achievable secrecy rate, we propose an AN-aided secure and covert communication strategy through optimizing the information carrying beamformer and AN jointly subject to the covertness constraint. To tackle the formulated non-convex design problem, we propose a branch-reduce-and-bound (BRB)-based algorithm to solve the considered problem globally. Simulation results validate its efficiency compared with a benchmark algorithm and unveil the importance of exploiting AN.
Abstract In this paper, we investigate the secrecy performance of short-packet transmissions in ultra-reliable and low-latency communications (URLLC). We consider the scenario where a multi-antenna source communicates with a single-antenna legitimate receiver requiring ultra-high reliability and low latency, in the presence of a single-antenna eavesdropper. In order to safeguard URLLC, the source transmits the artificial noise (AN) signal together with the confidential signal to confuse the eavesdropper. We adopt a lower bound on the maximal secrecy rate as the secrecy performance metric for short-packet transmissions in URLLC, which takes the target decoding error probabilities at the legitimate receiver and the eavesdropper into account. Using this metric, we first derive a compact expression of the generalized secrecy outage probability (SOP). Then, we formally prove that the generalized SOP is a convex function with respect to the power allocation factor between the confidential signal and the AN signal. We further determine the optimal power allocation factor that minimizes the generalized SOP. The results presented in this work can be useful for designing new secure transmission schemes for URLLC.
This paper presents a secure downlink communication system where a transmitter with multiple antennas sends information to multiple single antenna users under ultra reliable and low-latency communication (uRLLC) system requirement. To meet uRLLC requirement and provide secrecy against multi-antenna eavesdropper (Eve), transmitter adopts a special channel training scheme called anti-eavesdropping channel estimation (ANECE) as well as a standard transmit beamforming to send secret information in short blocklength regime. Using ANECE, two or more cooperative full-duplex radio devices obtain their receive channel state information (CSI) with respect to each other while preventing Eve from obtaining a consistent estimate of its receive CSI, which improves the secrecy of subsequent transmission of information between the devices. We derive an expression for the average secrecy throughput (AST) of ANECE assisted transmission. This easy-to-evaluate expression of approximated AST in terms of blocklength and various controllable parameters leads to useful insights to maximize AST under uRLLC requirement. Finally, numerical results are presented and discussed.
In this article, we focus on the pilot-assisted transmission design for secure ultra-reliable and low-latency communication (URLLC) systems, which has not yet been studied in the existing literatures. In each transmission period of this system, the multi-antenna controller sends confidential URLLC messages integrated with artificial noise (AN) to a single-antenna actuator for some mission-critical operations (e.g., remote control), and while an unknown number of passive eavesdroppers attempt to intercept this confidential message in a non-colluding manner. Since the conventional ergodic secrecy capacity is not accurate to describe the maximal achievable secrecy rate of URLLC with short blocklength coding, we establish the concept of achievable effective secrecy rate (AESR) to measure the secrecy performance of our URLLC system, which is defined as the average number of information bits can be transmitted per channel use under given reliability and information leakage constraints. Due to the exact expression of AESR has an intractable form, we derive a closed-form approximation on the AESR to simplify the calculation, via leveraging the Laplace approximation and Gaussian-Chebyshev quadrature method. Following by this approximation, we propose an efficient two-dimensional search algorithm to determine the optimal transmission parameters that maximize the AESR, i.e., the training pilot length and the power allocation ratio between confidential data signals and AN. Furthermore, the asymptotic performance of AESR in the high-SNR regime is also analyzed to gain more insights. Numerical results validate the accuracy of theoretical approximations presented in this paper, and illustrate how the particular system parameters impact the AESR of our considered URLLC system.
In this article, we investigate joint information-theoretic secrecy and covert communication in a single-input-multioutput (SIMO) system where a transmitter (Alice) is communicating with two legitimate users (Bob and Carol). We consider that an untrusted user and a warden node are also present in the network attempting to attack the secure and covert communications to Bob and Carol, respectively. Specifically, Bob requires secure communications such that his messages from Alice are not decoded by the untrusted user, while Carol requires covert communications such that her messages from Alice are not detected by the warden. To do so, we consider that Alice transmits Carol's messages during selected time slots to hide them from the warden while also transmitting Bob's messages in each time slot contentiously. We formulate an optimization problem with the aim of maximizing the average rate subject to a covert communication requirement and a secure communications constraint. Since the proposed optimization problem is nonconvex, we utilize successive convex approximation to obtain a tractable solution. Moreover, we extend our proposed system model to multiple antenna Alice scenario and find beamforming vectors so that the average sum rate is maximized. Furthermore, we consider practical assumptions that Alice has imperfect knowledge of the warden's location and imperfect channel state information (CSI) of Bob and Carol. Our numerical examples highlight that the imperfect CSI at Carol has a more detrimental impact on the average rate compared to imperfect CSI at Bob.
This paper studies physical-layer secure transmissions from a transmitter to a legitimate receiver against an eavesdropper over slow fading channels, taking into account the impact of finite blocklength secrecy coding. A comprehensive analysis and optimization framework is established to investigate secrecy throughput for both single- and multi-antenna transmitter scenarios. Both adaptive and non-adaptive design schemes are devised, in which the secrecy throughput is maximized by exploiting the instantaneous and statistical channel state information of the legitimate receiver, respectively. Specifically, optimal transmission policy, blocklength, and code rates are jointly designed to maximize the secrecy throughput. Additionally, null-space artificial noise is employed to improve the secrecy throughput for the multi-antenna setup with the optimal power allocation derived. Various important insights are developed. In particular, 1) increasing blocklength benefits both reliability and secrecy under the proposed transmission policy; 2) secrecy throughput monotonically increases with blocklength; 3) secrecy throughput initially increases but then decreases as secrecy rate increases, and the optimal secrecy rate maximizing the secrecy throughput should be carefully chosen in order to strike a good balance between rate and decoding correctness. Numerical results are eventually presented to verify theoretical findings.