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 Transactions on Information Forensics and Security

Secure-Reliable Transmission Designs for Full-Duplex Receiver With Finite-Alphabet Inputs

Guiyang Xia, Xiaobo Zhou, Lichuan Gu, Feng Shu, Yongpeng Wu, Jiangzhou Wang

Published Jan 1, 2022• 5 citations
Publisher

Abstract

This paper studies a convincingly secure transmission framework under an allowable outage probability for practical finite-alphabet inputs, where a full-duplex receiver (Bob) is taken into account to emit the artificial noise for deteriorating the eavesdropper’s decoding performance. We develop a secure-reliable mechanism to take the place of prior secrecy rate (SR) maximization strategy, where a closed form expression is invoked for substituting the non-closed SR expression upon exploiting the multi-exponential decay fitting approach. Hence, the intractable expectation operation over a large number of noise samples is circumvented. Moreover, a pair of critical probabilities of the reliable transmission and secure outage are first analyzed, and then a low-complexity optimization scheme is formulated. Apart from designing the transmission scheme for classically secure networks consisting of a transmitter, Bob and an eavesdropper, we further carry out an investigation on conceiving a secure-reliable strategy against multiple Eves for improving the system’s extensibility. To this end, analytical expressions of both the reliability outage and secrecy outage probabilities for multiple-Eve scenarios are also derived. Furthermore, a pragmatic iterative solution is conceived for addressing the corresponding max-min optimization problem. Finally, the simulation results validate the significance of our considered secure-reliable transmission in terms of the average SR performance attained.

DOI
10.1109/tifs.2022.3206420

Related papers

To Establish a Secure Channel From a Full-Duplex Transmitter to a Half-Duplex Receiver: An Artificial-Noise-Aided Scheme

Xinyue Hu, Caihong Kai, Shengli Zhang +2 more

This letter considers a new secure communication scenario where a full-duplex transmitter (Alan) needs to transmit confidential information to a half-duplex receiver (Bob), with an eavesdropper (Eve) that tries to overhear the confidential information. For realizing the secure communication, we design an effective artificial-noise-aided secure scheme (ANAS) which is composed of two phases' transmissions: in Phase 1, Alan and Bob transmit two independent artificial noises (ANs) simultaneously, while in Phase 2, Alan superimposes the AN received in Phase 1 with its confidential signal and sends out the mixed signal. Since the superimposed AN by Alan in Phase 2 can be effectively cancelled by Bob while remains an interference to Eve, a secrecy rate could then be achieved. Importantly, we derive the approximate closed-form solutions of the average secrecy rate and secrecy outage probability of ANAS under a Rayleigh block-fading channel. Numerical results show that the secrecy rate of ANAS is about twice higher than the benchmark scheme, even though in ANAS half of the time is used to transmit ANs.

IEEE Wireless Communications Letters•Oct 17, 2018•9 citations

Joint Precoder and Beamformer Design for Secure Relay Networks With Finite-Alphabet Inputs and Statistical CSI of Eve

Guiyang Xia, Xiaobo Zhou, Lichuan Gu +3 more

Because of discrepant deteriorations of the intended receiver and the unintended receiver, artificial noise (AN) can be invoked in conjunction with the precoder to wireless transmissions for enhancing the secrecy rate (SR) performance as long as we elaborately frame them. This paper studies a secure transmission strategy by jointly designing the precoder and AN beamformer at the relay network, where a passive eavesdropper and finite-alphabet inputs are taken into account. We propose a pair of solutions for low-order modulation and high-order modulation, respectively. To solve the first optimization problem, we propose a low-complexity algorithm with the aid of the invoked cut-off rate. Interestingly, we find that the phase of an optimum precoder for maximizing the SR has a correlation to both the channels spanning from the transmitter to the relays and spanning from the relays to the legitimate receiver. Furthermore, we reveal that the AN beamformer vector has at most one non-zero component, which only locates at the position corresponding to the minimum element of the channel between the relays and the intended receiver. According to these findings, the SR maximization problem over the two vectors is simplified as one only related to a pair of scalars. As for the high-order modulation, a new solution is further proposed for circumventing the predicament that the computational complexity exponentially increases as the size of the adopted modulation increases, where we not only eliminate two-layer summation over the legitimate symbols but also conceive a concave maximization SR problem. Finally, simulation results demonstrate the efficiency of the proposed algorithms in terms of the SR performance.

IEEE Transactions on Wireless Communications•Jan 25, 2022•8 citations

Adaptive Secure Rate Allocation via TAS/MRC under Multi-Antenna Eavesdroppers

Irfan Muhammad, Onel L. Alcaraz López, Hirley Alves +3 more

This paper investigates the secrecy outage performance of a multiple-input multiple-output and multi-antenna eavesdropper system. We consider a novel formulation for the secrecy outage probability, which is capable of quantifying reliability and secrecy separately, thus constituting a useful tool in the context of new scenarios with stringent requirements on reliability as the case of ultra-reliable low-latency communication. Our system considers a multi-antenna transmitter, Alice, that employs transmit antenna selection, a legitimate multi-antenna receiver, Bob, and a multi-antenna eavesdropper, Eve, where both employing maximal-ratio combining. For this system, exact and simpler asymptotic closed-form expressions for the conditional outage probability are provided. Moreover, for the case where channel state information is available at the three nodes, a numerical secure throughput maximization is carried out by considering quality-of-service and security constraints for an adaptive rate allocation scheme in an ON-OFF transmission. Our proposed closed-form expressions are validated via Monte Carlo simulations.

International Symposium on Wireless Communication Systems•Aug 1, 2019•1 citation

Alleviating Secrecy Outage Events via Power Optimization for Finite-Alphabet Inputs

Guiyang Xia, Yan Lin, Xiaobo Zhou +2 more

This letter aims at minimizing the total power consumption of security-reliability transmission (SRT) for practical finite-alphabet inputs. To this end, we coercively restrict that the mutual information over the legitimate channel is greater than an anticipated rate while the one over the illegitimate channel is constrained by a low rate. Our proposed strategy contributes to the secure transmission in circumventing secrecy outage events, which is a challenge in conventional secrecy rate maximization problems. Finally, simulation results reveal the significance of our proposed SRT in terms of both the total power consumption and the secrecy performance attained.

IEEE Wireless Communications Letters•Nov 15, 2021•2 citations

Jamming-Aided Secure-Reliable Transmission with Untrusted Users Under Fixed-Rate Signalling

Sapna Thapar, Shankar Prakriya, Ravikant Saini

This paper investigates a jamming-assisted secure and reliable downlink transmission with untrusted users under practical fixed-rate signalling. Unlike conventional adaptive secrecy-rate formulations, the proposed framework targets fixedrate systems, where reliability and secrecy are enforced via rate thresholds, ensuring successful decoding at the legitimate receiver while preventing information leakage to untrusted users. We consider a two-user scenario where a strong near user acts as an internal eavesdropper, and the far user's data must be secured. A transmitter-assisted power apportioning strategy is developed, where available power is split across two signalling phases for near and far users. To ensure secrecy, jamming is selectively applied only during the second phase, corresponding to far user transmission. Under statistical channel state information, a closed-form expression for secrecy non-outage probability is derived. Based on this, secrecy throughput is used as a performance metric capturing both reliability and secrecy. An optimization problem is formulated to maximize secrecy performance through joint optimization of transmission and jamming power apportioning, and the optimal solution is derived using the Karush-Kuhn-Tucker conditions. Numerical results validate the analysis, present key design insights, and show the optimal solution outperforms different benchmarks.

IEEE Vehicular Technology Conference•Sep 1, 2026•0 citations

Outage Probability Oriented Secrecy Rate Optimization for Finite-Alphabet Inputs

Hao Xu, Guiyang Xia, Xiaobo Zhou +3 more

This letter aims at investigating the secrecy outage probability (SOP) performance and formulating an associated precoder optimization problem to maximize the achievable secrecy rate (SR) for finite-alphabet inputs. As a passive eavesdropper is taken into account, we derive that: 1) the phase of the optimal precoder is orthogonal to that of the channel spanning from the transmitter to the intended receiver; 2) the modulus of the optimal precoder vector also has a linear correlation to that of the mentioned channel. Benefited from these findings, the original optimization problem is simplified to one only related to a pair of scalars, which thus dramatically reduces the computational complexity. Our simulation results finally verify the effectiveness of the proposed precoder design scheme.

IEEE Communications Letters•Jun 14, 2023•0 citations
This paper studies a convincingly secure transmission framework under an allowable outage probability for practical finite-alphabet inputs, where a full-duplex receiver (Bob) is taken into account to emit the artificial noise for deteriorating the eavesdropper’s decoding performance. We develop a secure-reliable mechanism to take the place of prior secrecy rate (SR) maximization strategy, where a closed form expression is invoked for substituting the non-closed SR expression upon exploiting the multi-exponential decay fitting approach. Hence, the intractable expectation operation over a large number of noise samples is circumvented. Moreover, a pair of critical probabilities of the reliable transmission and secure outage are first analyzed, and then a low-complexity optimization scheme is formulated. Apart from designing the transmission scheme for classically secure networks consisting of a transmitter, Bob and an eavesdropper, we further carry out an investigation on conceiving a secure-reliable strategy against multiple Eves for improving the system’s extensibility. To this end, analytical expressions of both the reliability outage and secrecy outage probabilities for multiple-Eve scenarios are also derived. Furthermore, a pragmatic iterative solution is conceived for addressing the corresponding max-min optimization problem. Finally, the simulation results validate the significance of our considered secure-reliable transmission in terms of the average SR performance attained.
This letter considers a new secure communication scenario where a full-duplex transmitter (Alan) needs to transmit confidential information to a half-duplex receiver (Bob), with an eavesdropper (Eve) that tries to overhear the confidential information. For realizing the secure communication, we design an effective artificial-noise-aided secure scheme (ANAS) which is composed of two phases' transmissions: in Phase 1, Alan and Bob transmit two independent artificial noises (ANs) simultaneously, while in Phase 2, Alan superimposes the AN received in Phase 1 with its confidential signal and sends out the mixed signal. Since the superimposed AN by Alan in Phase 2 can be effectively cancelled by Bob while remains an interference to Eve, a secrecy rate could then be achieved. Importantly, we derive the approximate closed-form solutions of the average secrecy rate and secrecy outage probability of ANAS under a Rayleigh block-fading channel. Numerical results show that the secrecy rate of ANAS is about twice higher than the benchmark scheme, even though in ANAS half of the time is used to transmit ANs.
Because of discrepant deteriorations of the intended receiver and the unintended receiver, artificial noise (AN) can be invoked in conjunction with the precoder to wireless transmissions for enhancing the secrecy rate (SR) performance as long as we elaborately frame them. This paper studies a secure transmission strategy by jointly designing the precoder and AN beamformer at the relay network, where a passive eavesdropper and finite-alphabet inputs are taken into account. We propose a pair of solutions for low-order modulation and high-order modulation, respectively. To solve the first optimization problem, we propose a low-complexity algorithm with the aid of the invoked cut-off rate. Interestingly, we find that the phase of an optimum precoder for maximizing the SR has a correlation to both the channels spanning from the transmitter to the relays and spanning from the relays to the legitimate receiver. Furthermore, we reveal that the AN beamformer vector has at most one non-zero component, which only locates at the position corresponding to the minimum element of the channel between the relays and the intended receiver. According to these findings, the SR maximization problem over the two vectors is simplified as one only related to a pair of scalars. As for the high-order modulation, a new solution is further proposed for circumventing the predicament that the computational complexity exponentially increases as the size of the adopted modulation increases, where we not only eliminate two-layer summation over the legitimate symbols but also conceive a concave maximization SR problem. Finally, simulation results demonstrate the efficiency of the proposed algorithms in terms of the SR performance.
This paper investigates the secrecy outage performance of a multiple-input multiple-output and multi-antenna eavesdropper system. We consider a novel formulation for the secrecy outage probability, which is capable of quantifying reliability and secrecy separately, thus constituting a useful tool in the context of new scenarios with stringent requirements on reliability as the case of ultra-reliable low-latency communication. Our system considers a multi-antenna transmitter, Alice, that employs transmit antenna selection, a legitimate multi-antenna receiver, Bob, and a multi-antenna eavesdropper, Eve, where both employing maximal-ratio combining. For this system, exact and simpler asymptotic closed-form expressions for the conditional outage probability are provided. Moreover, for the case where channel state information is available at the three nodes, a numerical secure throughput maximization is carried out by considering quality-of-service and security constraints for an adaptive rate allocation scheme in an ON-OFF transmission. Our proposed closed-form expressions are validated via Monte Carlo simulations.
This letter aims at minimizing the total power consumption of security-reliability transmission (SRT) for practical finite-alphabet inputs. To this end, we coercively restrict that the mutual information over the legitimate channel is greater than an anticipated rate while the one over the illegitimate channel is constrained by a low rate. Our proposed strategy contributes to the secure transmission in circumventing secrecy outage events, which is a challenge in conventional secrecy rate maximization problems. Finally, simulation results reveal the significance of our proposed SRT in terms of both the total power consumption and the secrecy performance attained.
This paper investigates a jamming-assisted secure and reliable downlink transmission with untrusted users under practical fixed-rate signalling. Unlike conventional adaptive secrecy-rate formulations, the proposed framework targets fixedrate systems, where reliability and secrecy are enforced via rate thresholds, ensuring successful decoding at the legitimate receiver while preventing information leakage to untrusted users. We consider a two-user scenario where a strong near user acts as an internal eavesdropper, and the far user's data must be secured. A transmitter-assisted power apportioning strategy is developed, where available power is split across two signalling phases for near and far users. To ensure secrecy, jamming is selectively applied only during the second phase, corresponding to far user transmission. Under statistical channel state information, a closed-form expression for secrecy non-outage probability is derived. Based on this, secrecy throughput is used as a performance metric capturing both reliability and secrecy. An optimization problem is formulated to maximize secrecy performance through joint optimization of transmission and jamming power apportioning, and the optimal solution is derived using the Karush-Kuhn-Tucker conditions. Numerical results validate the analysis, present key design insights, and show the optimal solution outperforms different benchmarks.
This letter aims at investigating the secrecy outage probability (SOP) performance and formulating an associated precoder optimization problem to maximize the achievable secrecy rate (SR) for finite-alphabet inputs. As a passive eavesdropper is taken into account, we derive that: 1) the phase of the optimal precoder is orthogonal to that of the channel spanning from the transmitter to the intended receiver; 2) the modulus of the optimal precoder vector also has a linear correlation to that of the mentioned channel. Benefited from these findings, the original optimization problem is simplified to one only related to a pair of scalars, which thus dramatically reduces the computational complexity. Our simulation results finally verify the effectiveness of the proposed precoder design scheme.