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

Globecom

Physical-Layer Secrecy Performance in Finite Blocklength Case

Chen Cao, Hongxiang Li, Zixia Hu, Wenqi Liu, Xiaohui Zhang

Published Dec 1, 2014• 3 citations
Publisher

Abstract

For physical-layer secrecy performance, existing studies only focus on coding schemes that can achieve the secrecy capacity. However, finite blocklength penalty could be fatal for security of private message. In this paper, we explore the impact of finite blocklength on secrecy for the wiretap channel model. We propose secrecy performance matrices for finite blocklength analysis and provide analytical expressions to evaluate the secrecy performance. We demonstrate trade-off between secrecy and reliability, and also provide an upper bound of secret information rate in finite blocklength case. The results are also applied to indicate asymptotic performance.

DOI
10.1109/glocom.2014.7417362

Related papers

Physical-Layer Secrecy Performance in Finite Blocklength Case

Chen Cao, Hongxiang Li, Zixia Hu +2 more

For physical-layer secrecy performance, existing studies only focus on coding schemes that can achieve the secrecy capacity. However, finite blocklength penalty could be fatal for security of private message. In this paper, we explore the impact of finite blocklength on secrecy for the wiretap channel model. We propose secrecy performance matrices for finite blocklength analysis and provide analytical expressions to evaluate the secrecy performance. We demonstrate trade-off between secrecy and reliability, and also provide an upper bound of secret information rate in finite blocklength case. The results are also applied to indicate asymptotic performance.

Globecom•Dec 1, 2015•14 citations

Finite Blocklength Secrecy Coding

Jack Pfister

Coding for physical layer security is typically evaluated as blocklengths approach infinity using information theoretic measures.This thesis presents techniques to quantify secrecy guarantees of finite blocklength wiretap codes across two common channel models.This is an important step for the field of physical layer security as secrecy guarantees are generally not quantified at finite blocklengths.From this analysis, we are able to determine the best performing linear secrecy codes for their respective blocklengths and information rates.Due to the error correcting shortcomings of wiretap codes, we also investigate the error correcting capabilities of a secrecy coding technique that uses polar codes.

•May 9, 2018•3 citations

Leakage Thresholds and Security Trade-offs in Finite Blocklength Wiretap Channels

Shabnam Sodagari

This work discusses the bounds for the wiretap channel (WTC) in the finite blocklength regime, characterizing the behavior of the performance trade-off between information delivery to the legitimate receiver and information leakage to the eavesdropper as a function of blocklength. Since the error probability at the legitimate receiver is the same as that of a conventional point-to-point channel, the characterization of the former builds on the finite blocklength analysis for that case. The information leakage bound relies on the analysis of the corresponding leakage density. This paper extends these concepts by incorporating the use of the Berry-Esseen theorem in assessing the convergence rates of leakage and secrecy metrics to their asymptotic values, which provides a refined analytical tool to evaluate the performance of secrecy systems under finite blocklength constraints. Furthermore, this approach facilitates a quantification of the trade-offs involved, integrating concepts such as the aggregate leakage rate and empirical average leakage, thus enabling a more comprehensive understanding of how system parameters affect the overall secrecy performance. This allows for a more detailed exploration of the dependencies between blocklength, secrecy, and reliability trade-offs required to balance effective communication against security imperatives. These analyses also highlight the critical balance necessary between ensuring low probability of error for the legitimate receiver while maintaining stringent secrecy requirements against an eavesdropper. Furthermore, the study introduces metrics such as aggregate leakage rate and empirical average leakage, providing new insights into how these factors interplay to influence the overall performance of secure communication systems.

2012 International Conference on Computing, Networking and Communications (ICNC)•Feb 17, 2025•0 citations

Analysis of short blocklength codes for secrecy

Willie K. Harrison, Dinis Sarmento, João P. Vilela +1 more

In this paper, we provide secrecy metrics applicable to physical-layer coding techniques with finite blocklengths over Gaussian and fading wiretap channel models and analyze their secrecy performance over several cases of concatenated code designs. Our metrics go beyond some of the known practical secrecy measures, such as bit error rate and security gap, so as to make lower bound probabilistic guarantees on error rates over short blocklengths both preceding and following a secrecy decoder. Our techniques are especially useful in cases where application of traditional information-theoretic security measures is either impractical or simply not yet understood. The metrics can aid both practical system analysis, including cryptanalysis, and practical system design when concatenated codes are used for physical-layer security. Furthermore, these new measures fill a void in the current landscape of practical security measures for physical-layer security coding and may assist in the wide-scale adoption of physical-layer techniques for security in real-world systems. We also show how the new metrics provide techniques for reducing realistic channel models to simpler discrete memoryless wiretap channel equivalents over which existing secrecy code designs may achieve information-theoretic security.

arXiv:1509.07092•EURASIP Journal on Wireless Communications and Networking•Oct 29, 2018•25 citations

Performance Analysis of Finite Blocklength Transmissions Over Wiretap Fading Channels: An Average Information Leakage Perspective

Milad Tatar Mamaghani, Xiangyun Zhou, Nan Yang +2 more

Physical-layer security (PLS) is a promising technique to complement more traditional means of communication security in beyond-5G wireless networks. However, studies of PLS are often based on ideal assumptions such as infinite coding blocklengths or perfect knowledge of the wiretap link’s channel state information (CSI). In this work, we study the performance of finite blocklength (FBL) transmissions using a new secrecy metric — the average information leakage (AIL). We evaluate the exact and approximate AIL with Gaussian signaling and arbitrary fading channels, assuming that the eavesdropper’s instantaneous CSI is unknown. We then conduct case studies that use artificial noise (AN) beamforming to analyze the AIL in both Rayleigh and Rician fading channels. The accuracy of the analytical expressions is verified through extensive simulations, and various insights regarding the impact of key system parameters on the AIL are obtained. Particularly, our results reveal that allowing a small level of AIL can potentially lead to significant reliability enhancements. To improve the system performance, we formulate and solve an average secrecy throughput (AST) optimization problem via both non-adaptive and adaptive design strategies. Our findings highlight the significance of blocklength design and AN power allocation, as well as the impact of their trade-off on the AST.

arXiv:2308.13184•IEEE Transactions on Wireless Communications•May 21, 2024•10 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
For physical-layer secrecy performance, existing studies only focus on coding schemes that can achieve the secrecy capacity. However, finite blocklength penalty could be fatal for security of private message. In this paper, we explore the impact of finite blocklength on secrecy for the wiretap channel model. We propose secrecy performance matrices for finite blocklength analysis and provide analytical expressions to evaluate the secrecy performance. We demonstrate trade-off between secrecy and reliability, and also provide an upper bound of secret information rate in finite blocklength case. The results are also applied to indicate asymptotic performance.
For physical-layer secrecy performance, existing studies only focus on coding schemes that can achieve the secrecy capacity. However, finite blocklength penalty could be fatal for security of private message. In this paper, we explore the impact of finite blocklength on secrecy for the wiretap channel model. We propose secrecy performance matrices for finite blocklength analysis and provide analytical expressions to evaluate the secrecy performance. We demonstrate trade-off between secrecy and reliability, and also provide an upper bound of secret information rate in finite blocklength case. The results are also applied to indicate asymptotic performance.
Coding for physical layer security is typically evaluated as blocklengths approach infinity using information theoretic measures.This thesis presents techniques to quantify secrecy guarantees of finite blocklength wiretap codes across two common channel models.This is an important step for the field of physical layer security as secrecy guarantees are generally not quantified at finite blocklengths.From this analysis, we are able to determine the best performing linear secrecy codes for their respective blocklengths and information rates.Due to the error correcting shortcomings of wiretap codes, we also investigate the error correcting capabilities of a secrecy coding technique that uses polar codes.
This work discusses the bounds for the wiretap channel (WTC) in the finite blocklength regime, characterizing the behavior of the performance trade-off between information delivery to the legitimate receiver and information leakage to the eavesdropper as a function of blocklength. Since the error probability at the legitimate receiver is the same as that of a conventional point-to-point channel, the characterization of the former builds on the finite blocklength analysis for that case. The information leakage bound relies on the analysis of the corresponding leakage density. This paper extends these concepts by incorporating the use of the Berry-Esseen theorem in assessing the convergence rates of leakage and secrecy metrics to their asymptotic values, which provides a refined analytical tool to evaluate the performance of secrecy systems under finite blocklength constraints. Furthermore, this approach facilitates a quantification of the trade-offs involved, integrating concepts such as the aggregate leakage rate and empirical average leakage, thus enabling a more comprehensive understanding of how system parameters affect the overall secrecy performance. This allows for a more detailed exploration of the dependencies between blocklength, secrecy, and reliability trade-offs required to balance effective communication against security imperatives. These analyses also highlight the critical balance necessary between ensuring low probability of error for the legitimate receiver while maintaining stringent secrecy requirements against an eavesdropper. Furthermore, the study introduces metrics such as aggregate leakage rate and empirical average leakage, providing new insights into how these factors interplay to influence the overall performance of secure communication systems.
In this paper, we provide secrecy metrics applicable to physical-layer coding techniques with finite blocklengths over Gaussian and fading wiretap channel models and analyze their secrecy performance over several cases of concatenated code designs. Our metrics go beyond some of the known practical secrecy measures, such as bit error rate and security gap, so as to make lower bound probabilistic guarantees on error rates over short blocklengths both preceding and following a secrecy decoder. Our techniques are especially useful in cases where application of traditional information-theoretic security measures is either impractical or simply not yet understood. The metrics can aid both practical system analysis, including cryptanalysis, and practical system design when concatenated codes are used for physical-layer security. Furthermore, these new measures fill a void in the current landscape of practical security measures for physical-layer security coding and may assist in the wide-scale adoption of physical-layer techniques for security in real-world systems. We also show how the new metrics provide techniques for reducing realistic channel models to simpler discrete memoryless wiretap channel equivalents over which existing secrecy code designs may achieve information-theoretic security.
Physical-layer security (PLS) is a promising technique to complement more traditional means of communication security in beyond-5G wireless networks. However, studies of PLS are often based on ideal assumptions such as infinite coding blocklengths or perfect knowledge of the wiretap link’s channel state information (CSI). In this work, we study the performance of finite blocklength (FBL) transmissions using a new secrecy metric — the average information leakage (AIL). We evaluate the exact and approximate AIL with Gaussian signaling and arbitrary fading channels, assuming that the eavesdropper’s instantaneous CSI is unknown. We then conduct case studies that use artificial noise (AN) beamforming to analyze the AIL in both Rayleigh and Rician fading channels. The accuracy of the analytical expressions is verified through extensive simulations, and various insights regarding the impact of key system parameters on the AIL are obtained. Particularly, our results reveal that allowing a small level of AIL can potentially lead to significant reliability enhancements. To improve the system performance, we formulate and solve an average secrecy throughput (AST) optimization problem via both non-adaptive and adaptive design strategies. Our findings highlight the significance of blocklength design and AN power allocation, as well as the impact of their trade-off on the AST.
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.