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.
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.
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.
In this work, we consider the pros and cons of using various layers of keyless coding to achieve secure and reliable communication over the Gaussian wiretap channel. We define a new approach to information theoretic security, called practical secrecy and the secrecy benefit, to be used over real-world channels and finite blocklength instantiations of coding layers, and use this new approach to show the fundamental reliability and security implications of several coding mechanisms that have traditionally been used for physical-layer security. We perform a systematic/structured analysis of the effect of error-control coding, scrambling, interleaving, and coset coding, as coding layers of a secrecy system. Using this new approach, scrambling and interleaving are shown to be of no effect in increasing information theoretic security, even when measuring the effect at the output of the eavesdropper's decoder. Error control coding is shown to present a trade-off between secrecy and reliability that is dictated by the chosen code and the signal-to-noise ratios at the legitimate and eavesdropping receivers. Finally, the benefits of secrecy coding are highlighted, and it is shown how one can shape the secrecy benefit according to system specifications using combinations of different layers of coding to achieve both reliable and secure throughput.
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 secure communications over wireless fading channels, the secrecy outage probability is widely used as the performance measure. However, the current secrecy outage formulation has two major limitations in evaluating the secrecy performance: a) the amount of information leakage to the eavesdropper cannot be characterized when an outage occurs, b) the current formulation does not give insights into the eavesdropper's decodability of confidential messages. To overcome such limitations and obtain in-depth understanding of secrecy performance over wireless fading channels, this paper proposes three new secrecy measures for different practical aims, namely, 1) generalized secrecy outage probability, 2) asymptotic lower bound on eavesdropper's decoding error probability, and 3) average information leakage rate. A specific example of wireless transmissions with a fixed-rate wiretap code is given to illustrate the use of the proposed secrecy measures.
Abstract Physical layer security (PLS) has been proposed to afford an extra layer of security on top of the conventional cryptographic techniques. Unlike the conventional complexity-based cryptographic techniques at the upper layers, physical layer security exploits the characteristics of wireless channels, e.g., fading, noise, interference, etc., to enhance wireless security. It is proved that secure transmission can benefit from fading channels. Accordingly, numerous researchers have explored what fading can offer for physical layer security, especially the investigation of physical layer security over wiretap fading channels. Therefore, this paper aims at reviewing the existing and ongoing research works on this topic. More specifically, we present a classification of research works in terms of the four categories of fading models: (i) small-scale, (ii) large-scale, (iii) composite, and (iv) cascaded. To elaborate these fading models with a generic and flexible tool, three promising candidates, including the mixture gamma (MG), mixture of Gaussian (MoG), and Fox’sH-function distributions, are comprehensively examined and compared. Their advantages and limitations are further demonstrated via security performance metrics, which are designed as vivid indicators to measure how perfect secrecy is ensured. Two clusters of secrecy metrics, namely (i) secrecy outage probability (SOP), and the lower bound of SOP; and (ii) the probability of nonzero secrecy capacity (PNZ), the intercept probability, average secrecy capacity (ASC), and ergodic secrecy capacity, are displayed and, respectively, deployed in passive and active eavesdropping scenarios. Apart from those, revisiting the secrecy enhancement techniques based on Wyner’s wiretap model, the on-off transmission scheme, jamming approach, antenna selection, and security region are discussed.
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.