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

arXiv:2201.08472 · IEEE Wireless Communications and Networking Conference

Weighted Sum-Rate Maximization for Rate-Splitting Multiple Access Based Secure Communication

Huiyun Xia, Yijie Mao, Bruno Clerckx, Xiaokang Zhou, Shuai Han, Cheng Li

Published Apr 10, 2022• 30 citations
arXivHTMLPDF

Abstract

As investigations on physical layer security evolve from point-to-point systems to multi-user scenarios, multi-user interference (MUI) is introduced and becomes an unavoidable issue. Different from treating MUI totally as noise in conventional secure communications, in this paper, we propose a rate-splitting multiple access (RSMA)-based secure beamforming design, where user messages are split and encoded into common and private streams. Each user not only decodes the common stream and the intended private stream, but also tries to eavesdrop the private streams of other users. We formulate a weighted sum-rate (WSR) maximization problem subject to the secrecy rate requirements of all users. To tackle the non-convexity of the formulated problem, a successive convex approximation (SCA)-based approach is adopted to convert the original non-convex and intractable problem into a low-complexity suboptimal iterative algorithm. Numerical results demonstrate that the proposed secure beamforming scheme outperforms the conventional multi-user linear precoding (MULP) technique in terms of the WSR performance while ensuring user secrecy rate requirements.

DOI
10.1109/wcnc51071.2022.9771854

Related papers

Security-Reliability Tradeoff in RSMA-Based Communications Against Eavesdropper Collusion

Huiyun Xia, Xiaokang Zhou, Shuai Han +1 more

This letter exploits secure beamforming for achieving security-reliability tradeoff in rate splitting multiple access (RSMA)-based communications against eavesdropper collusion. Considering user fairness, we maximize the minimum secrecy rate (MSR) among all legitimate users subject to the quality of service (QoS) constraints and transmit power constraint. A feasibility check problem is first presented to avoid infeasible cases. Then, a successive convex approximation-based algorithm is proposed to iteratively optimize the beamforming design. Numerical results show that the proposed RSMA-based design outperforms the baseline design in terms of MSR within certain QoS requirement ranges to trade security for reliability by balancing the power allocated to the common stream and private streams. And the performance advantage enlarges as the number of collusive eavesdroppers increases.

IEEE Wireless Communications Letters•May 25, 2023•18 citations

Cooperative Rate-Splitting for Secrecy Sum-Rate Enhancement in Multi-antenna Broadcast Channels

Li Ping, Ming Chen, Yijie Mao +3 more

In this paper, we employ Cooperative Rate-Splitting (CRS) technique to enhance the Secrecy Sum Rate (SSR) for the Multiple Input Single Output (MISO) Broadcast Channel (BC), consisting of two legitimate users and one eavesdropper, with perfect Channel State Information (CSI) available at all nodes. For CRS based on the three-node relay channel, the transmitter splits and encodes the messages of legitimate users into common and private streams based on Rate-Splitting (RS). With the goal of maximizing SSR, the proposed CRS strategy opportunistically asks the relaying legitimate user to forward its decoded common message. During the transmission, the eavesdropper keeps wiretapping silently. To ensure secure transmission, the common message is used for the dual purpose, serving both as a desired message and Artificial Noise (AN) without consuming extra transmit power comparing to the conventional AN design. Taking into account the total power constraint and the Physical Layer (PHY) security, the precoders and timeslot allocation are jointly optimized by solving the nonconvex SSR maximization problem based on Sequential Convex Approximation (SCA) algorithm. Numerical results show that the proposed CRS secure transmission scheme outperforms existing Multi-User Linear Precoding (MU-LP) and Cooperative Non-Orthogonal Multiple Access (C-NOMA) strategies. Therefore, CRS is a promising strategy to enhance the PHY security in Multi-antenna BC systems.

arXiv:2006.02555•IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Aug 1, 2020•60 citations

A Novel Grouping-Based Rate-Splitting Multiple Access Scheme Against Internal Eavesdropping

Chang Liu, Junji Pan, Zheng Xue +2 more

In this paper, we propose a novel grouping-based rate splitting multiple access (G-RSMA) against internal eavesdroppers (Eves). Specifically, after users are grouped, their messages are split and encoded into inner-group common and private streams. The inner-group common streams could achieve the dual use: they deliver designated information to legitimate users and serve as artificial noise (AN) to Eves. To ensure the security among users in the presence of internal Eves, our approach maximizes the minimum secrecy rate (MSR) of all legitimate users in the system, which is formulated as a non-convex problem. We tackle it with a novel algorithm leveraging successive convex approximation (SCA), enabling efficient optimization of the transmit precoding scheme. Numerical results show that the G-RSMA approach enhances the MSR performance compared with the one-layer rate splitting multiple access (RSMA) or space division multiple access (SDMA), validating its effectiveness in securing RSMA systems against internal eavesdropping.

IEEE Wireless Communications Letters•Sep 30, 2025•5 citations

Rate-Splitting Multiple Access Precoding for Selective Security

Sangmin Lee, Seokjun Park, Jeonghun Park +1 more

In this paper, we consider a sum secrecy spectral efficiency (SE) maximization problem in a downlink rate-splitting multiple access (RSMA) system with multiple antennas. We also assume two types of users: secret users whose private streams require information security and normal users whose private streams do not require security. Due to its max and min operations in the wiretap SE and the SE of the common stream, respectively, which makes the non-convex problem even non-smooth, solving the problem is highly challenging. To deal with the difficulties, we reformulate the optimization problem into an approximated smooth problem using a LogSumExp approach. Then, we identify the first-order optimality condition and develop formulas into a generalized eigenvalue problem. We use a power iteration based algorithm to find the best local optimal solution. Simulations validate the proposed secure RSMA precoding method.

IEEE Vehicular Technology Conference•Jun 1, 2023•3 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•119 citations

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
As investigations on physical layer security evolve from point-to-point systems to multi-user scenarios, multi-user interference (MUI) is introduced and becomes an unavoidable issue. Different from treating MUI totally as noise in conventional secure communications, in this paper, we propose a rate-splitting multiple access (RSMA)-based secure beamforming design, where user messages are split and encoded into common and private streams. Each user not only decodes the common stream and the intended private stream, but also tries to eavesdrop the private streams of other users. We formulate a weighted sum-rate (WSR) maximization problem subject to the secrecy rate requirements of all users. To tackle the non-convexity of the formulated problem, a successive convex approximation (SCA)-based approach is adopted to convert the original non-convex and intractable problem into a low-complexity suboptimal iterative algorithm. Numerical results demonstrate that the proposed secure beamforming scheme outperforms the conventional multi-user linear precoding (MULP) technique in terms of the WSR performance while ensuring user secrecy rate requirements.
This letter exploits secure beamforming for achieving security-reliability tradeoff in rate splitting multiple access (RSMA)-based communications against eavesdropper collusion. Considering user fairness, we maximize the minimum secrecy rate (MSR) among all legitimate users subject to the quality of service (QoS) constraints and transmit power constraint. A feasibility check problem is first presented to avoid infeasible cases. Then, a successive convex approximation-based algorithm is proposed to iteratively optimize the beamforming design. Numerical results show that the proposed RSMA-based design outperforms the baseline design in terms of MSR within certain QoS requirement ranges to trade security for reliability by balancing the power allocated to the common stream and private streams. And the performance advantage enlarges as the number of collusive eavesdroppers increases.
In this paper, we employ Cooperative Rate-Splitting (CRS) technique to enhance the Secrecy Sum Rate (SSR) for the Multiple Input Single Output (MISO) Broadcast Channel (BC), consisting of two legitimate users and one eavesdropper, with perfect Channel State Information (CSI) available at all nodes. For CRS based on the three-node relay channel, the transmitter splits and encodes the messages of legitimate users into common and private streams based on Rate-Splitting (RS). With the goal of maximizing SSR, the proposed CRS strategy opportunistically asks the relaying legitimate user to forward its decoded common message. During the transmission, the eavesdropper keeps wiretapping silently. To ensure secure transmission, the common message is used for the dual purpose, serving both as a desired message and Artificial Noise (AN) without consuming extra transmit power comparing to the conventional AN design. Taking into account the total power constraint and the Physical Layer (PHY) security, the precoders and timeslot allocation are jointly optimized by solving the nonconvex SSR maximization problem based on Sequential Convex Approximation (SCA) algorithm. Numerical results show that the proposed CRS secure transmission scheme outperforms existing Multi-User Linear Precoding (MU-LP) and Cooperative Non-Orthogonal Multiple Access (C-NOMA) strategies. Therefore, CRS is a promising strategy to enhance the PHY security in Multi-antenna BC systems.
In this paper, we propose a novel grouping-based rate splitting multiple access (G-RSMA) against internal eavesdroppers (Eves). Specifically, after users are grouped, their messages are split and encoded into inner-group common and private streams. The inner-group common streams could achieve the dual use: they deliver designated information to legitimate users and serve as artificial noise (AN) to Eves. To ensure the security among users in the presence of internal Eves, our approach maximizes the minimum secrecy rate (MSR) of all legitimate users in the system, which is formulated as a non-convex problem. We tackle it with a novel algorithm leveraging successive convex approximation (SCA), enabling efficient optimization of the transmit precoding scheme. Numerical results show that the G-RSMA approach enhances the MSR performance compared with the one-layer rate splitting multiple access (RSMA) or space division multiple access (SDMA), validating its effectiveness in securing RSMA systems against internal eavesdropping.
In this paper, we consider a sum secrecy spectral efficiency (SE) maximization problem in a downlink rate-splitting multiple access (RSMA) system with multiple antennas. We also assume two types of users: secret users whose private streams require information security and normal users whose private streams do not require security. Due to its max and min operations in the wiretap SE and the SE of the common stream, respectively, which makes the non-convex problem even non-smooth, solving the problem is highly challenging. To deal with the difficulties, we reformulate the optimization problem into an approximated smooth problem using a LogSumExp approach. Then, we identify the first-order optimality condition and develop formulas into a generalized eigenvalue problem. We use a power iteration based algorithm to find the best local optimal solution. Simulations validate the proposed secure RSMA precoding method.
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.
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.