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

International Conference on Communications

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

Ishmam Zabir, Ananthram Swami, Yingbo Hua

Published May 16, 2022• 1 citation
Publisher

Abstract

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.

DOI
10.1109/icc45855.2022.9839077

Related papers

Secrecy Throughput of ANECE Assisted Transmission of Information in Finite Blocklength

Ishmam Zabir, Ananthram Swami, Yingbo Hua

Anti-eavesdropping channel estimation (ANECE) among two or more cooperative full-duplex radio devices allows these devices to obtain consistent estimates of their receive channel state information (CSI) with respect to each other but at the same time prevents eavesdropper (Eve) from obtaining a consistent estimate of its receive CSI, which improves the secrecy of subsequent transmission of information between the devices. This paper presents an analysis of secrecy throughput of ANECE assisted transmission of information between such single-antenna devices against Eve with multiple antennas. The analysis is based on finite blocklength coding and assumes that Eve applies a standard approach for information detection. Easy-to-compute analytical expressions of secrecy throughput in terms of various controllable parameters are obtained. Numerical results are presented and discussed.

IEEE Wireless Communications and Networking Conference•Apr 10, 2022•1 citation

Total Secrecy From Anti-Eavesdropping Channel Estimation

Shuo Wu, Yingbo Hua

Anti-eavesdropping channel estimation (ANECE) is useful for a network of cooperative full-duplex radio devices/users. Using ANECE, a secret key can be generated by each pair of users, and additional secret information can be transmitted between a pair of users. This paper analyzes the capacity of the secret key based on ANECE, and compares it with the conventional method for channel training. The paper also analyzes the secrecy capacity of information transmission using an one-way scheme, and compares it with a two-way scheme. It is shown that the total amount of secrecy generated from ANECE can be substantially larger than that based on the conventional method especially when an eavesdropper may have an unlimited number of antennas. The paper also formulates a total secure degree of freedom (TSDoF) of the ANECE based scheme, and compares it with a prior scheme of secret information transmission from a multi-antenna node to another against a multi-antenna eavesdropper where channel state information is unknown everywhere initially. The comparison shows that there is a substantial gain of TSDoF by exploiting full-duplex radios and reciprocal channels via ANECE. Most of the key insights are highlighted in twelve proven properties.

IEEE Transactions on Signal Processing•Jan 1, 2022•8 citations

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

Achieving Covertness and Security in Broadcast Channels With Finite Blocklength

Chao Wang, Zan Li, Haibin Zhang +2 more

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.

IEEE Transactions on Wireless Communications•Mar 23, 2022•72 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

Advanced Properties of Full-Duplex Radio for Securing Wireless Network

Yingbo Hua

This paper examines the role of full-duplex radio for securing wireless network from a new perspective. It first studies the secrecy capacity of two single-antenna full-duplex users against a multi-antenna eavesdropper (Eve) who has the perfect knowledge of the channel state information (CSI) from users to Eve. It is shown that if Eve uses a basic matched-filtering, the probability of zero secrecy (or outage) can be made small by a large jamming power from both users and a small gain of residual self-interference (RSI) power. But if Eve uses the optimal matched-filtering, the probability of outage grows rapidly as either the jamming power from the users increases or the number of antennas on Eve increases, regardless of the RSI gain. To prevent any Eve from obtaining its CSI, this paper then proposes a novel anti-eavesdropping channel estimation (ANECE) method, which allows users to obtain their own CSI while keeping all Eves in handicap. This method also prevents Eves from colluding with each other at any layer. The design of ideal pilots for ANECE for multiple multi-antenna users and multiple broadband multi-antenna users is discussed. It is also shown that the capacity of Eve with any number of antennas but without its CSI can be virtually eliminated over a time window corresponding to the number of antennas at the transmitter for each realization of the CSI.

IEEE Transactions on Signal Processing•Nov 6, 2018•29 citations
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.
Anti-eavesdropping channel estimation (ANECE) among two or more cooperative full-duplex radio devices allows these devices to obtain consistent estimates of their receive channel state information (CSI) with respect to each other but at the same time prevents eavesdropper (Eve) from obtaining a consistent estimate of its receive CSI, which improves the secrecy of subsequent transmission of information between the devices. This paper presents an analysis of secrecy throughput of ANECE assisted transmission of information between such single-antenna devices against Eve with multiple antennas. The analysis is based on finite blocklength coding and assumes that Eve applies a standard approach for information detection. Easy-to-compute analytical expressions of secrecy throughput in terms of various controllable parameters are obtained. Numerical results are presented and discussed.
Anti-eavesdropping channel estimation (ANECE) is useful for a network of cooperative full-duplex radio devices/users. Using ANECE, a secret key can be generated by each pair of users, and additional secret information can be transmitted between a pair of users. This paper analyzes the capacity of the secret key based on ANECE, and compares it with the conventional method for channel training. The paper also analyzes the secrecy capacity of information transmission using an one-way scheme, and compares it with a two-way scheme. It is shown that the total amount of secrecy generated from ANECE can be substantially larger than that based on the conventional method especially when an eavesdropper may have an unlimited number of antennas. The paper also formulates a total secure degree of freedom (TSDoF) of the ANECE based scheme, and compares it with a prior scheme of secret information transmission from a multi-antenna node to another against a multi-antenna eavesdropper where channel state information is unknown everywhere initially. The comparison shows that there is a substantial gain of TSDoF by exploiting full-duplex radios and reciprocal channels via ANECE. Most of the key insights are highlighted in twelve proven properties.
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.
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.
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 examines the role of full-duplex radio for securing wireless network from a new perspective. It first studies the secrecy capacity of two single-antenna full-duplex users against a multi-antenna eavesdropper (Eve) who has the perfect knowledge of the channel state information (CSI) from users to Eve. It is shown that if Eve uses a basic matched-filtering, the probability of zero secrecy (or outage) can be made small by a large jamming power from both users and a small gain of residual self-interference (RSI) power. But if Eve uses the optimal matched-filtering, the probability of outage grows rapidly as either the jamming power from the users increases or the number of antennas on Eve increases, regardless of the RSI gain. To prevent any Eve from obtaining its CSI, this paper then proposes a novel anti-eavesdropping channel estimation (ANECE) method, which allows users to obtain their own CSI while keeping all Eves in handicap. This method also prevents Eves from colluding with each other at any layer. The design of ideal pilots for ANECE for multiple multi-antenna users and multiple broadband multi-antenna users is discussed. It is also shown that the capacity of Eve with any number of antennas but without its CSI can be virtually eliminated over a time window corresponding to the number of antennas at the transmitter for each realization of the CSI.