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 Globecom Workshops (GC Wkshps)

Performance Analysis of the Wiretap Channel with a Friendly Jammer under Finite Blocklength

Uppalapati Somalatha, Parthajit Mohapatra, Νικόλαος Παππάς

Published Dec 4, 2022• 6 citations
Publisher

Abstract

In many real-time applications, timely delivery of data is essential along with guarantees of reliability and secrecy. To address this problem, this work considers a Rayleigh fading wiretap channel with a friendly jammer where the legitimate transmitter has bursty external traffic. The work derives the stable secure throughput for the considered model which takes into account the size of the packet and security requirements. The characterization of stable throughput involves the determination of the probability of successful decoding of a packet at the legitimate receiver and it is obtained using results from finite block-length information theory. Using the developed results, delay and Average Age of Information (AAoI) are analysed. The developed results help to explore the interplay between stable throughput, secrecy, delay, and AAoI. As a special case of the developed results, we can obtain the delay and AAoI for the wiretap channel with random arrival of data at the transmitter. The developed results illustrate the role of a friendly jammer in improving the performance of the system.

DOI
10.1109/gcwkshps56602.2022.10008520

Related papers

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

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

Active Eavesdropping in Short Packet Communication: Average Secrecy Throughput Analysis

Nihan Arı, Nikolaos Thomos, Leila Musavian

In this paper, we investigate secure short packet transmission from a legitimate transmitter to a receiver in the presence of an active eavesdropper. The aim is to gain more insights into how an active eavesdropper affects the secrecy throughput of short packet communications. The eavesdropper is assumed to have full-duplex (FD) capability, which enables performing eavesdropping and jamming simultaneously. All the communication links in the wiretap channel are assumed to be Rayleigh fading. An approximation of the average achievable secrecy throughput is proposed to measure the security of the system. The proposed approximation is examined and analysed in two different topology scenarios, which are triangular and line topologies. Then, Monte-Carlo simulations are performed to get an understanding of how good the approximation is. The results show that the closed-form expressions have a good match with Monte-Carlo simulations. We also investigate the impact of the eavesdropper's distance to the legitimate nodes as well as the different jamming power levels. Furthermore, self-interference influence on the eavesdropper is discussed.

IEEE International Conference on Communications workshops•Jun 1, 2021•6 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

On the Information Leakage Performance of Secure Finite Blocklength Transmissions over Rayleigh Fading Channels

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

This paper presents a secrecy performance study of a wiretap communication system with finite blocklength (FBL) transmissions over Rayleigh fading channels, based on the definition of an average information leakage (AIL) metric. We evaluate the exact and closed-form approximate AIL performance, assuming that only statistical channel state information (CSI) of the eavesdropping link is available. Then, we reveal an inherent statistical relationship between the AIL metric in the FBL regime and the commonly-used secrecy outage probability in conventional infinite blocklength communications. Aiming to improve the secure communication performance of the considered system, we formulate a blocklength optimization problem and solve it via a low-complexity approach. Next, we present numerical results to verify our analytical findings and provide various important insights into the impacts of system parameters on the AIL. Specifically, our results indicate that i) compromising a small amount of AIL can lead to significant reliability improvements, and ii) the AIL experiences a secrecy floor in the high signal-to-noise ratio regime.

arXiv:2401.11219•International Conference on Communications•Jun 9, 2024•2 citations

On the Throughput of Secure Hybrid-ARQ Protocols for Gaussian Block-Fading Channels

Xiaojun Tang, Ruoheng Liu, Predrag Spasojević +1 more

The focus of this paper is an information-theoretic study of retransmission protocols for reliable packet communication under a secrecy constraint. Thehybridautomaticretransmission request (HARQ) protocol is revisited for a block-fading wiretap channel. Here, two legitimate users communicate over a block-fading channel in the presence of a passive eavesdropper who intercepts the transmissions through an independent block-fading channel. In this model, the transmitter obtains a 1-bit ACK/NACK feedback from the legitimate receiver via an error-freepublicchannel. Both reliability and confidentiality of secure HARQ protocols are studied through the joint consideration of channel coding, secrecy coding, and retransmission protocols. In particular, the error and secrecy performance ofrepetition time diversity(RTD) andincremental redundancy(INR) protocols are investigated based on Wyner code sequences. These protocols ensure that the confidential message is decoded successfully by the legitimate receiver and is kept completely secret from the eavesdropper for a set of channel realizations. This paper illustrates that there exists a rate-compatible Wyner code family which ensures a secure INR protocol. Further, it defines theconnection outageandsecrecy outageprobabilities to characterize the tradeoff between the reliability of the legitimate communication link and the confidentiality with respect to the eavesdropper's link. For a given connection/secrecy outage probability pair, an achievable throughput of secure HARQ protocols is derived for block-fading channels. Finally, both asymptotic analysis and numerical calculations demonstrate the benefits of HARQ protocols to throughput and secrecy.

arXiv:0712.4135•IEEE Transactions on Information Theory•Mar 19, 2009•145 citations
In many real-time applications, timely delivery of data is essential along with guarantees of reliability and secrecy. To address this problem, this work considers a Rayleigh fading wiretap channel with a friendly jammer where the legitimate transmitter has bursty external traffic. The work derives the stable secure throughput for the considered model which takes into account the size of the packet and security requirements. The characterization of stable throughput involves the determination of the probability of successful decoding of a packet at the legitimate receiver and it is obtained using results from finite block-length information theory. Using the developed results, delay and Average Age of Information (AAoI) are analysed. The developed results help to explore the interplay between stable throughput, secrecy, delay, and AAoI. As a special case of the developed results, we can obtain the delay and AAoI for the wiretap channel with random arrival of data at the transmitter. The developed results illustrate the role of a friendly jammer in improving the performance of the system.
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.
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.
In this paper, we investigate secure short packet transmission from a legitimate transmitter to a receiver in the presence of an active eavesdropper. The aim is to gain more insights into how an active eavesdropper affects the secrecy throughput of short packet communications. The eavesdropper is assumed to have full-duplex (FD) capability, which enables performing eavesdropping and jamming simultaneously. All the communication links in the wiretap channel are assumed to be Rayleigh fading. An approximation of the average achievable secrecy throughput is proposed to measure the security of the system. The proposed approximation is examined and analysed in two different topology scenarios, which are triangular and line topologies. Then, Monte-Carlo simulations are performed to get an understanding of how good the approximation is. The results show that the closed-form expressions have a good match with Monte-Carlo simulations. We also investigate the impact of the eavesdropper's distance to the legitimate nodes as well as the different jamming power levels. Furthermore, self-interference influence on the eavesdropper is 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.
This paper presents a secrecy performance study of a wiretap communication system with finite blocklength (FBL) transmissions over Rayleigh fading channels, based on the definition of an average information leakage (AIL) metric. We evaluate the exact and closed-form approximate AIL performance, assuming that only statistical channel state information (CSI) of the eavesdropping link is available. Then, we reveal an inherent statistical relationship between the AIL metric in the FBL regime and the commonly-used secrecy outage probability in conventional infinite blocklength communications. Aiming to improve the secure communication performance of the considered system, we formulate a blocklength optimization problem and solve it via a low-complexity approach. Next, we present numerical results to verify our analytical findings and provide various important insights into the impacts of system parameters on the AIL. Specifically, our results indicate that i) compromising a small amount of AIL can lead to significant reliability improvements, and ii) the AIL experiences a secrecy floor in the high signal-to-noise ratio regime.
The focus of this paper is an information-theoretic study of retransmission protocols for reliable packet communication under a secrecy constraint. Thehybridautomaticretransmission request (HARQ) protocol is revisited for a block-fading wiretap channel. Here, two legitimate users communicate over a block-fading channel in the presence of a passive eavesdropper who intercepts the transmissions through an independent block-fading channel. In this model, the transmitter obtains a 1-bit ACK/NACK feedback from the legitimate receiver via an error-freepublicchannel. Both reliability and confidentiality of secure HARQ protocols are studied through the joint consideration of channel coding, secrecy coding, and retransmission protocols. In particular, the error and secrecy performance ofrepetition time diversity(RTD) andincremental redundancy(INR) protocols are investigated based on Wyner code sequences. These protocols ensure that the confidential message is decoded successfully by the legitimate receiver and is kept completely secret from the eavesdropper for a set of channel realizations. This paper illustrates that there exists a rate-compatible Wyner code family which ensures a secure INR protocol. Further, it defines theconnection outageandsecrecy outageprobabilities to characterize the tradeoff between the reliability of the legitimate communication link and the confidentiality with respect to the eavesdropper's link. For a given connection/secrecy outage probability pair, an achievable throughput of secure HARQ protocols is derived for block-fading channels. Finally, both asymptotic analysis and numerical calculations demonstrate the benefits of HARQ protocols to throughput and secrecy.