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

Sensors

Optimal Channel Training Design for Secure Short-Packet Communications

Dechuan Chen, Jin Li, Jianwei Hu, Xingang Zhang, Shuai Zhang

Published Jan 17, 2023• 0 citations
Publisher

Abstract

Physical layer security is a promising technique to ensure the confidentiality of short-packet communications, since no additional channel uses are needed. Motivated by the fact of finite coding blocklength in short-packet communications, we attempt to investigate the problem of how many the channel uses utilized for channel training should be allocated to perform secure communications. Based on the finite blocklength information theory, we derive a closed-form expression to approximate the average achievable secrecy throughput. To gain more insights, we also present the asymptotic average secrecy throughput under two special cases, i.e., high signal-to-noise ratio (SNR) and infinite blocklength. Moreover, we determine the optimal channel training length to maximize the average secrecy throughput under the reliability constraint and given blocklength. Numerical results are provided to validate the analysis and demonstrate that the performance gain achieved by the optimal channel training length is remarkable, relative to other benchmark schemes.

DOI
10.3390/s23031068

Related papers

Secure short-packet communications using a full-duplex receiver

Dechuan Chen, Jin Li, Jianwei Hu +2 more

In this work, we consider the physical layer security in short-packet communications, where a full-duplex (FD) receiver receives information signals from a source while generating artificial noise (AN) to confuse an eavesdropper. Taking into account the finite blocklength coding and the self-interference (SI) in FD mode, we derive new approximation closed-form expression for the secrecy throughput. Moreover, we analyze the asymptotic secrecy throughput in two distinct scenarios, i.e., high signal-to-noise ratio (SNR) regime and infinite blocklength coding, to gain more insights. Our examination illustrates the correctness of our expressions and shows how the critical system variables affect the secrecy throughput.

International Journal of Intelligent Networks•Jan 1, 2023•5 citations

Secure Short-Packet Communications for Mission-Critical IoT Applications

Hui‐Ming Wang, Qian Yang, Zhiguo Ding +1 more

In applications of the Internet of Things (IoT), the use of short packets is expected to meet the stringent latency requirement in ultra-reliable low-latency communications; however, the incurred security issues and the impact of finite blocklength coding on the physical-layer security are not well understood. This paper investigates the performance of secure short-packet communications in a mission-critical IoT system with an external multi-antenna eavesdropper. An analytical framework is proposed to approximate the average achievable secrecy throughput of the system with finite blocklength coding. To gain more insight, a simple case with a single-antenna access point (AP) is considered first, in which the secrecy throughput is approximated in a closed form. Based on that result, the optimal blocklengths to maximize the secrecy throughput with and without the reliability and latency constraints, respectively, are derived. For the case with a multi-antenna AP, following the proposed analytical framework, closed-form approximations for the secrecy throughput are obtained under both beamforming and artificial-noise-aided transmission schemes. The numerical results verify the accuracy of the proposed approximations and illustrate the impact of the system parameters on the tradeoff between transmission latency and reliability under a secrecy constraint.

arXiv:1903.01433•IEEE Transactions on Wireless Communications•Mar 20, 2019•195 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

Secure Transmission Rate of Short Packets With Queueing Delay Requirement

Chunhui Li, Changyang She, Nan Yang +1 more

Physical layer security (PLS) is promising for secure short-packet transmissions in ultra-reliable and low-latency communications. The bottlenecks of applying PLS in practice include 1) lack of accurate channel state information (CSI) of both the intended user and the eavesdropper; 2) high computational complexity for solving optimization problems. To address the first issue, we compare the secure transmission rates of short packets in different scenarios (i.e., with/without eavesdropper’s instantaneous CSI and with/without channel estimation errors) and derive the closed-form optimal power control policy in a special case. To find numerical solutions in general cases, we apply an unsupervised deep learning method, which has low complexity after the training stage. Through numerical results, we obtain the following three key findings: 1) The learning-based power control policy approaches the closed-form optimal policy in the special case and outperforms two existing power control policies in general cases. 2) Knowing the instantaneous CSI of the eavesdropper only provides a marginal gain of the secure data rate in the high signal-to-noise ratio regime. 3) In the presence of channel estimation errors, the learning-based policy trained by the estimated channels can guarantee the average transmit power constraint, while the closed-form policy cannot.

IEEE Transactions on Wireless Communications•Jul 13, 2021•27 citations

Physical-Layer Security with Finite Blocklength over Slow Fading Channels

Tong-Xing Zheng, Haowen Liu, Zhaowei Wang +2 more

This paper studies physical-layer security over slow fading channels, considering the impact of finite-blocklength secrecy coding. A comprehensive analysis and optimization framework is established to investigate the secrecy throughput (ST) of a legitimate user pair coexisting with an eavesdropper. Specifically, we devise both adaptive and non-adaptive optimization schemes to maximize the ST, where we derive optimal parameters including the transmission policy, blocklength, and code rates based on the instantaneous and statistical channel state information of the legitimate pair, respectively. Various important insights are provided. In particular, 1) increasing blocklength improves both reliability and secrecy with our transmission policy; 2) ST monotonically increases with blocklength; 3) ST initially increases and then decreases with secrecy rate, and there exists a critical secrecy rate that maximizes the ST. Numerical results are presented to verify theoretical findings.

2012 International Conference on Computing, Networking and Communications (ICNC)•Feb 1, 2020•1 citation

Average Secrecy Throughput Analysis with Multiple Eavesdroppers in the Finite Blocklength

Nihan Arı, Nikolaos Thomos, Leila Musavian

This paper studies the problem of secure communication from a transmitter to a receiver with the use of short packets under the existence of multiple eavesdroppers, who are overhearing the transmission. We assume that the eavesdroppers are mutually independent. Further, we consider that the main channel and eavesdropper channels are Rayleigh fading, then use the performance metric of average secrecy throughput to measure how secure the communication is. We derive a closed form approximation of the average secrecy throughput in the presence of multiple eavesdroppers. Finally, the approximation is validated through simulations and we have seen that the approximation is very close to the corresponding simulation results.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Aug 1, 2020•7 citations
Physical layer security is a promising technique to ensure the confidentiality of short-packet communications, since no additional channel uses are needed. Motivated by the fact of finite coding blocklength in short-packet communications, we attempt to investigate the problem of how many the channel uses utilized for channel training should be allocated to perform secure communications. Based on the finite blocklength information theory, we derive a closed-form expression to approximate the average achievable secrecy throughput. To gain more insights, we also present the asymptotic average secrecy throughput under two special cases, i.e., high signal-to-noise ratio (SNR) and infinite blocklength. Moreover, we determine the optimal channel training length to maximize the average secrecy throughput under the reliability constraint and given blocklength. Numerical results are provided to validate the analysis and demonstrate that the performance gain achieved by the optimal channel training length is remarkable, relative to other benchmark schemes.
In this work, we consider the physical layer security in short-packet communications, where a full-duplex (FD) receiver receives information signals from a source while generating artificial noise (AN) to confuse an eavesdropper. Taking into account the finite blocklength coding and the self-interference (SI) in FD mode, we derive new approximation closed-form expression for the secrecy throughput. Moreover, we analyze the asymptotic secrecy throughput in two distinct scenarios, i.e., high signal-to-noise ratio (SNR) regime and infinite blocklength coding, to gain more insights. Our examination illustrates the correctness of our expressions and shows how the critical system variables affect the secrecy throughput.
In applications of the Internet of Things (IoT), the use of short packets is expected to meet the stringent latency requirement in ultra-reliable low-latency communications; however, the incurred security issues and the impact of finite blocklength coding on the physical-layer security are not well understood. This paper investigates the performance of secure short-packet communications in a mission-critical IoT system with an external multi-antenna eavesdropper. An analytical framework is proposed to approximate the average achievable secrecy throughput of the system with finite blocklength coding. To gain more insight, a simple case with a single-antenna access point (AP) is considered first, in which the secrecy throughput is approximated in a closed form. Based on that result, the optimal blocklengths to maximize the secrecy throughput with and without the reliability and latency constraints, respectively, are derived. For the case with a multi-antenna AP, following the proposed analytical framework, closed-form approximations for the secrecy throughput are obtained under both beamforming and artificial-noise-aided transmission schemes. The numerical results verify the accuracy of the proposed approximations and illustrate the impact of the system parameters on the tradeoff between transmission latency and reliability under a secrecy constraint.
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.
Physical layer security (PLS) is promising for secure short-packet transmissions in ultra-reliable and low-latency communications. The bottlenecks of applying PLS in practice include 1) lack of accurate channel state information (CSI) of both the intended user and the eavesdropper; 2) high computational complexity for solving optimization problems. To address the first issue, we compare the secure transmission rates of short packets in different scenarios (i.e., with/without eavesdropper’s instantaneous CSI and with/without channel estimation errors) and derive the closed-form optimal power control policy in a special case. To find numerical solutions in general cases, we apply an unsupervised deep learning method, which has low complexity after the training stage. Through numerical results, we obtain the following three key findings: 1) The learning-based power control policy approaches the closed-form optimal policy in the special case and outperforms two existing power control policies in general cases. 2) Knowing the instantaneous CSI of the eavesdropper only provides a marginal gain of the secure data rate in the high signal-to-noise ratio regime. 3) In the presence of channel estimation errors, the learning-based policy trained by the estimated channels can guarantee the average transmit power constraint, while the closed-form policy cannot.
This paper studies physical-layer security over slow fading channels, considering the impact of finite-blocklength secrecy coding. A comprehensive analysis and optimization framework is established to investigate the secrecy throughput (ST) of a legitimate user pair coexisting with an eavesdropper. Specifically, we devise both adaptive and non-adaptive optimization schemes to maximize the ST, where we derive optimal parameters including the transmission policy, blocklength, and code rates based on the instantaneous and statistical channel state information of the legitimate pair, respectively. Various important insights are provided. In particular, 1) increasing blocklength improves both reliability and secrecy with our transmission policy; 2) ST monotonically increases with blocklength; 3) ST initially increases and then decreases with secrecy rate, and there exists a critical secrecy rate that maximizes the ST. Numerical results are presented to verify theoretical findings.
This paper studies the problem of secure communication from a transmitter to a receiver with the use of short packets under the existence of multiple eavesdroppers, who are overhearing the transmission. We assume that the eavesdroppers are mutually independent. Further, we consider that the main channel and eavesdropper channels are Rayleigh fading, then use the performance metric of average secrecy throughput to measure how secure the communication is. We derive a closed form approximation of the average secrecy throughput in the presence of multiple eavesdroppers. Finally, the approximation is validated through simulations and we have seen that the approximation is very close to the corresponding simulation results.