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 International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

Robust Covert Communication in MISO-RSMA Systems with Internal Eavesdropper

Pengpai Xu, Ye Fan, Rugui Yao, Xiaoya Zuo

Published Sep 1, 2026• 0 citations
Publisher

Abstract

This paper investigates robust covert communication in a Multi-Input Single-Output (MISO) Rate-Splitting Multiple Access (RSMA) system facing both an internal eavesdropper and an external warden. To maximize the covert communication rate, we formulate a joint optimization problem that leverages the RSMA common stream for simultaneous transmission and jamming. To solve this highly coupled and nonconvex problem, we propose an iterative Robust Beamforming and Rate Allocation (RBRA) algorithm. This algorithm utilizes the S-Procedure, Semidefinite Relaxation (SDR), and Fractional Programming (FP) to effectively handle variable coupling and the warden’s Channel State Information (CSI) uncertainty. Simulation results demonstrate that the proposed scheme outperforms the Non-Orthogonal Multiple Access (NOMA) benchmark in both covertness and robustness. Furthermore, compared to traditional non-secure schemes, it drastically reduces the maximum internal eavesdropping rate by approximately 60% with only a 10% degradation in covert performance, effectively balancing external covertness and internal security.

DOI
10.1109/pimrc69400.2026.11711697

Related papers

Secrecy Outage-Constrained Robust Resource Allocation Design for MU-MISO RSMA Systems

Hao Fu, Suili Feng, Weijun Tang +2 more

In this paper, we study the robust and fair transmission design for a rate splitting multiple access (RSMA)-based multi-user multiple-input single-output (MU-MISO) probabilistic secrecy communication system, where the statistic distribution of estimation errors of eavesdropping channels is available at the transmitter. Our robust resource allocation design aims to maximize the minimum achievable outage constrained (OC) secrecy rate among multiple single-antenna legitimated users (LUs) via optimizing the beamforming vectors and the artificial noise (AN) matrix at the transmitter. To this end, the algorithm design is formulated as a non-convex probabilistic optimization problem which takes into account the maximum transmit power budget. To address the intractability of the optimization problem, the successive convex approximation (SCA) technique and the alternating optimization (AO) approach are exploited to design a suboptimal iterative algorithm for obtaining a locally optimal solution of the considered problem. Simulation results demonstrate that the minimum achievable OC secrecy rate performance of our proposed RSMA-based probabilistic secure transmission system outperforms that of several baseline schemes.

IEEE Globecom Workshops (GC Wkshps)•Dec 1, 2021•2 citations

Robust Secure Beamforming Design for Two-User Downlink MISO Rate-Splitting Systems

Hao Fu, Suili Feng, Weijun Tang +1 more

In this paper, we consider max-min fairness for a downlink two-user multi-input single-output (MISO) system with imperfect channel state information available at transmitter (CSIT) taking into account the total power constraint and the physical layer security. Considering the worst-case channel uncertainty for a potential eavesdropper (PE), we study the robust secure beamforming algorithm design which maximizes the minimum achieved worst-case secrecy rate among single-antenna legitimate users. In contrast to existing schemes adopted in the literatures, we propose a rather unorthodox rate splitting (RS) scheme which advocates the dual use of a common message serving both as a desired message and artificial noise (AN) for legitimate users and the PE, respectively. The algorithm design is formulated as a non-convex optimization problem which is generally intractable. As a compromise approach, we apply the successive convex approximation (SCA) method which facilitates the design of a low-complexity suboptimal iterative algorithm. In each iteration, a rank-constrained semi-definite program (SDP) is solved optimally by SDP relaxation (SDR). Simulation results demonstrate that our proposed robust secure beamforming scheme in the MISO-RS secure transmission system outperforms that of the non-robust counterpart. Moreover, our results also unveil that the proposed RS scheme can achieve a superior performance compared to the existing non-orthogonal multiple access (NOMA) schemes and the traditional scheme.

IEEE Transactions on Wireless Communications•Sep 14, 2020•123 citations

Robust Transmit Designs for Secrecy Rate Constrained MISO NOMA System

Binbin Su, Qiang Ni, Bingtao He

This paper studies the secure transmission for downlink multiple-input single-output (MISO) non-orthogonal multiple access (NOMA) system in which imperfect channel state information (CSI) of the eavesdropper links is considered. We propose the novel robust beamforming strategies for the direct transmission NOMA (DT NOMA) and cooperative jamming NOMA (CJ NOMA) with a helper. We formulate our problem as the worst-case sum power minimization subject to secrecy rate constraint. The semidefinite relaxation (SDR) method is firstly applied to relax the quadratic terms and rank-one optimality is proved. Then an iterative algorithm based on successive convex approximation (SCA) is proposed to transform the nonconvex problem into convex approximations. Simulation results show that both the proposed NOMA schemes outperform the orthogonal multiple scheme, and CJ NOMA scheme can achieve much better system performance gain than DT NOMA scheme.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Sep 1, 2018•7 citations

Covert and Secure Communications in NOMA Networks With Internal Eavesdropping

Qiang Li, Dongyang Xu, Keivan Navaie +1 more

This letter proposes a joint covert and secure transmission scheme in the non-orthogonal multiple access (NOMA) networks against internal eavesdropping and external monitoring. In the network, the strong user wiretaps the signals of the weak user while an external warden monitors the communication behaviors of the strong user. To address the issue, a random artificial noise (AN) based beamforming is adopted, which not only reduces the eavesdropping rate of the strong user but also confuses the warden. We consider the worst case, where the warden can minimize the detection error probability (DEP) by optimizing its detection threshold. Further, we characterize the closed-form expressions of the average minimum DEP of the warden, the connection outage probabilities of the NOMA users and the secrecy outage probability of the weak user under the imperfect successive interference cancellation (SIC). To improve the performance, an effective covert rate maximization problem is formulated, under the constraints of the covertness, reliability and secrecy, which is analytically solved. Numerical results validate the superiority of the proposed scheme.

IEEE Wireless Communications Letters•Sep 7, 2023•28 citations

Robust Secure Resource Allocation for Downlink Two-User MISO Rate-Splitting Systems

Hao Fu, Suili Feng, Weijun Tang +1 more

In this paper, we consider max-min fairness for a downlink two-user multi-input single-output (MISO) system with imperfect channel state information available at transmitter (CSIT) taking into account the total power constraint and the physical layer security. To handle the worst-case channel uncertainty of a potential eavesdropper (PE), we study the robust secure resource allocation algorithm which maximizes the minimum achieved worst-case secrecy rate among single-antenna legitimate users. In contrast to existing schemes adopted in the literature, we propose a rate-splitting (RS)-based secure transmission scheme, which advocates the dual use of a common message serving both as a desired message and artificial noise (AN) for legitimate users and the PE, respectively. Considering the non-convex resource allocation algorithm design problem, we apply the majorization maximization (MM) method to obtain a suboptimal iterative algorithm. In each iteration, a rank-constrained semi-definite program (SDP) is solved optimally by SDP relaxation (SDR). Simulation results demonstrate that our proposed robust secure beamforming scheme in the MISO-RS secure transmission system outperforms that of several baselines.

IEEE International Conference on Communications workshops•Jun 1, 2020•7 citations

Robust Secure Transmission Design for RIS-Aided MISO-NOMA System with Hardware Impairments and Imperfect CSI

Chenyan Xiao, Fei Du, Dacai Wei +2 more

Hardware impairments (HWI) and the channel state information (CSI) estimation errors inevitably degrade the security performance of the communication system. In this work, we explore a robust beamforming solution for a reconfigurable intelligence surface (RIS)-assisted multiple-input single-output (MISO) multi-user secure network under HWI and imperfect CSI. Artificial noise (AN) is designed to jam eavesdroppers while non-orthogonal multiple access (NOMA) is employed to suppress the interference between legitimate users. Aimed at maximizing secrecy sum rate, the active beamforming with AN at the BS and the passive beamforming at the RIS are jointly optimized. The nonconvex optimization problem is handled using the semi-definite relaxation (SDR), where the eavesdropper's channel uncertainty is tackled by the S-procedure. Then the multi-variable coupling problem is decomposed into two sub-problems and three blocks of variables are alternately optimized using the block coordinate descent (BCD) method. The results suggest that the developed scheme outperforms the benchmark ones in terms of security and resistance to HWI.

IEEE International Conference on Communication Technology (ICCT)•Oct 20, 2023•2 citations
This paper investigates robust covert communication in a Multi-Input Single-Output (MISO) Rate-Splitting Multiple Access (RSMA) system facing both an internal eavesdropper and an external warden. To maximize the covert communication rate, we formulate a joint optimization problem that leverages the RSMA common stream for simultaneous transmission and jamming. To solve this highly coupled and nonconvex problem, we propose an iterative Robust Beamforming and Rate Allocation (RBRA) algorithm. This algorithm utilizes the S-Procedure, Semidefinite Relaxation (SDR), and Fractional Programming (FP) to effectively handle variable coupling and the warden’s Channel State Information (CSI) uncertainty. Simulation results demonstrate that the proposed scheme outperforms the Non-Orthogonal Multiple Access (NOMA) benchmark in both covertness and robustness. Furthermore, compared to traditional non-secure schemes, it drastically reduces the maximum internal eavesdropping rate by approximately 60% with only a 10% degradation in covert performance, effectively balancing external covertness and internal security.
In this paper, we study the robust and fair transmission design for a rate splitting multiple access (RSMA)-based multi-user multiple-input single-output (MU-MISO) probabilistic secrecy communication system, where the statistic distribution of estimation errors of eavesdropping channels is available at the transmitter. Our robust resource allocation design aims to maximize the minimum achievable outage constrained (OC) secrecy rate among multiple single-antenna legitimated users (LUs) via optimizing the beamforming vectors and the artificial noise (AN) matrix at the transmitter. To this end, the algorithm design is formulated as a non-convex probabilistic optimization problem which takes into account the maximum transmit power budget. To address the intractability of the optimization problem, the successive convex approximation (SCA) technique and the alternating optimization (AO) approach are exploited to design a suboptimal iterative algorithm for obtaining a locally optimal solution of the considered problem. Simulation results demonstrate that the minimum achievable OC secrecy rate performance of our proposed RSMA-based probabilistic secure transmission system outperforms that of several baseline schemes.
In this paper, we consider max-min fairness for a downlink two-user multi-input single-output (MISO) system with imperfect channel state information available at transmitter (CSIT) taking into account the total power constraint and the physical layer security. Considering the worst-case channel uncertainty for a potential eavesdropper (PE), we study the robust secure beamforming algorithm design which maximizes the minimum achieved worst-case secrecy rate among single-antenna legitimate users. In contrast to existing schemes adopted in the literatures, we propose a rather unorthodox rate splitting (RS) scheme which advocates the dual use of a common message serving both as a desired message and artificial noise (AN) for legitimate users and the PE, respectively. The algorithm design is formulated as a non-convex optimization problem which is generally intractable. As a compromise approach, we apply the successive convex approximation (SCA) method which facilitates the design of a low-complexity suboptimal iterative algorithm. In each iteration, a rank-constrained semi-definite program (SDP) is solved optimally by SDP relaxation (SDR). Simulation results demonstrate that our proposed robust secure beamforming scheme in the MISO-RS secure transmission system outperforms that of the non-robust counterpart. Moreover, our results also unveil that the proposed RS scheme can achieve a superior performance compared to the existing non-orthogonal multiple access (NOMA) schemes and the traditional scheme.
This paper studies the secure transmission for downlink multiple-input single-output (MISO) non-orthogonal multiple access (NOMA) system in which imperfect channel state information (CSI) of the eavesdropper links is considered. We propose the novel robust beamforming strategies for the direct transmission NOMA (DT NOMA) and cooperative jamming NOMA (CJ NOMA) with a helper. We formulate our problem as the worst-case sum power minimization subject to secrecy rate constraint. The semidefinite relaxation (SDR) method is firstly applied to relax the quadratic terms and rank-one optimality is proved. Then an iterative algorithm based on successive convex approximation (SCA) is proposed to transform the nonconvex problem into convex approximations. Simulation results show that both the proposed NOMA schemes outperform the orthogonal multiple scheme, and CJ NOMA scheme can achieve much better system performance gain than DT NOMA scheme.
This letter proposes a joint covert and secure transmission scheme in the non-orthogonal multiple access (NOMA) networks against internal eavesdropping and external monitoring. In the network, the strong user wiretaps the signals of the weak user while an external warden monitors the communication behaviors of the strong user. To address the issue, a random artificial noise (AN) based beamforming is adopted, which not only reduces the eavesdropping rate of the strong user but also confuses the warden. We consider the worst case, where the warden can minimize the detection error probability (DEP) by optimizing its detection threshold. Further, we characterize the closed-form expressions of the average minimum DEP of the warden, the connection outage probabilities of the NOMA users and the secrecy outage probability of the weak user under the imperfect successive interference cancellation (SIC). To improve the performance, an effective covert rate maximization problem is formulated, under the constraints of the covertness, reliability and secrecy, which is analytically solved. Numerical results validate the superiority of the proposed scheme.
In this paper, we consider max-min fairness for a downlink two-user multi-input single-output (MISO) system with imperfect channel state information available at transmitter (CSIT) taking into account the total power constraint and the physical layer security. To handle the worst-case channel uncertainty of a potential eavesdropper (PE), we study the robust secure resource allocation algorithm which maximizes the minimum achieved worst-case secrecy rate among single-antenna legitimate users. In contrast to existing schemes adopted in the literature, we propose a rate-splitting (RS)-based secure transmission scheme, which advocates the dual use of a common message serving both as a desired message and artificial noise (AN) for legitimate users and the PE, respectively. Considering the non-convex resource allocation algorithm design problem, we apply the majorization maximization (MM) method to obtain a suboptimal iterative algorithm. In each iteration, a rank-constrained semi-definite program (SDP) is solved optimally by SDP relaxation (SDR). Simulation results demonstrate that our proposed robust secure beamforming scheme in the MISO-RS secure transmission system outperforms that of several baselines.
Hardware impairments (HWI) and the channel state information (CSI) estimation errors inevitably degrade the security performance of the communication system. In this work, we explore a robust beamforming solution for a reconfigurable intelligence surface (RIS)-assisted multiple-input single-output (MISO) multi-user secure network under HWI and imperfect CSI. Artificial noise (AN) is designed to jam eavesdroppers while non-orthogonal multiple access (NOMA) is employed to suppress the interference between legitimate users. Aimed at maximizing secrecy sum rate, the active beamforming with AN at the BS and the passive beamforming at the RIS are jointly optimized. The nonconvex optimization problem is handled using the semi-definite relaxation (SDR), where the eavesdropper's channel uncertainty is tackled by the S-procedure. Then the multi-variable coupling problem is decomposed into two sub-problems and three blocks of variables are alternately optimized using the block coordinate descent (BCD) method. The results suggest that the developed scheme outperforms the benchmark ones in terms of security and resistance to HWI.