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 Vehicular Technology Conference

Rate-Splitting Multiple Access Precoding for Selective Security

Sangmin Lee, Seokjun Park, Jeonghun Park, Jinseok Choi

Published Jun 1, 2023• 3 citations
Publisher

Abstract

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.

DOI
10.1109/vtc2023-spring57618.2023.10200467

Related papers

A Selective Secure Precoding Framework for MU-MIMO Rate-Splitting Multiple Access Networks Under Limited CSIT

Sangmin Lee, Seokjun Park, Jeonghun Park +1 more

In this paper, we propose a robust and adaptable secure precoding framework designed to encapsulate a intricate scenario where legitimate users have different information security: secure private or normal public information. Leveraging rate-splitting multiple access (RSMA), we formulate the sum secrecy spectral efficiency (SE) maximization problem in downlink multi-user multiple-input multiple-output (MIMO) systems with multi-eavesdropper. To resolve the challenges including the heterogeneity of security, non-convexity, and non-smoothness of the problem, we initially approximate the problem using a LogSumExp technique. Subsequently, we derive the first-order optimality condition in the form of a generalized eigenvalue problem. We utilize a power iteration-based method to solve the condition, thereby achieving a superior local optimal solution. The proposed algorithm is further extended to a more realistic scenario involving limited channel state information at the transmitter (CSIT). To effectively utilize the limited channel information, we employ a conditional average rate approach. Handling the conditional average by deriving useful bounds, we establish a lower bound for the objective function under the conditional average. Then we apply the similar optimization method as for the perfect CSIT case. In simulations, we validate the proposed algorithm in terms of the sum secrecy SE.

arXiv:2412.19110•Dec 26, 2024•0 citations

Precoding Optimization Assisted Secure Transmission for Rate-Splitting Multiple Access

Dongdong Li, Zhutian Yang, Nan Zhao +3 more

Rate-splitting multiple access (RSMA) is an emerging multiple access strategy, with non-orthogonal multiple access (NOMA) and space division multiple access (SDMA) as its two special cases. RSMA divides the messages required by users into the private and common parts, and the private streams are naturally suitable for the secure transmission. In this paper, we establish a unified rate-splitting framework to ensure the secure transmission for the three multiple access systems mentioned above. The precoders at the multi-antenna transmitter are conjointly optimized to improve the transmission rate of common message. Successive interference cancellation (SIC) is utilized, and the private message for the downlink broadcasting RSMA network can be effectively hidden in the high-power common message. Simulation results demonstrate that the proposed rate-splitting framework can effectively guarantee the secure transmission of the secrecy information.

International Conference on Communications•May 16, 2022•6 citations

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

Huiyun Xia, Yijie Mao, Bruno Clerckx +3 more

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.

arXiv:2201.08472•IEEE Wireless Communications and Networking Conference•Apr 10, 2022•30 citations

Max-Min Fairness Precoding for Physical Layer Security With Partial Channel Knowledge

Sangmin Lee, Eunsung Choi, Jinseok Choi

We propose secure max-min fairness (MMF) precoding for a downlink multi-antenna system with multiple users and eavesdroppers. Since the problem is non-convex and non-smooth and partial channel knowledge is assumed, it is highly challenging to solve. To resolve the difficulties, we first reformulate the problem with conditional average rates, allowing to exploit the partial channel knowledge. Then, we derive the original problem as an approximate smoothing problem using a LogSumExp approach. We identify the first-order optimality condition and cast it to a generalized eigenvalue problem. Solving the problem via a power iteration offers the best local optimal solution. Simulations validate the proposed secure-MMF precoding method.

IEEE Wireless Communications Letters•Jun 13, 2023•5 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

Resource Allocation for Secure Rate-Splitting Multiple Access with Adaptive Beamforming

Tenghao Cai, Jia Zhang, Shihao Yan +3 more

Rate splitting multiple access (RSMA) is promising to achieve high spectral efficiency with a higher flexibility relative to non-orthogonal multiple access (NOMA) and orthogonal multiple access (OMA). In this paper, a novel RSMA-based secure transmission scheme with artificial noise (AN) and an adaptive beamforming is developed with the aim of maximizing the secrecy sum rate (SSR) of the considered system subject to specific constraints. The joint optimization of the power allocation between useful messages and AN signals, rate splitting between the two legitimate receivers, and the two mastering parameters of the beamforming design is tackled. To solve such a non-convex problem, we first analytically reveal some properties of the solution and then focus on an asymptotic scenario with a sufficiently large number of transmit antennas to derive closed-form expressions for the optimal power allocation coefficients. This enables us to develop an efficient method to identify the optimal rate splitting and beamforming parameters. Our examinations demonstrate that the proposed RSMA-based scheme outperforms two benchmark schemes in terms of achieving a higher SSR and the achievable performance gain is exceptional when the number of transmit antennas is small.

IEEE International Conference on Communications workshops•Jun 1, 2021•16 citations
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 propose a robust and adaptable secure precoding framework designed to encapsulate a intricate scenario where legitimate users have different information security: secure private or normal public information. Leveraging rate-splitting multiple access (RSMA), we formulate the sum secrecy spectral efficiency (SE) maximization problem in downlink multi-user multiple-input multiple-output (MIMO) systems with multi-eavesdropper. To resolve the challenges including the heterogeneity of security, non-convexity, and non-smoothness of the problem, we initially approximate the problem using a LogSumExp technique. Subsequently, we derive the first-order optimality condition in the form of a generalized eigenvalue problem. We utilize a power iteration-based method to solve the condition, thereby achieving a superior local optimal solution. The proposed algorithm is further extended to a more realistic scenario involving limited channel state information at the transmitter (CSIT). To effectively utilize the limited channel information, we employ a conditional average rate approach. Handling the conditional average by deriving useful bounds, we establish a lower bound for the objective function under the conditional average. Then we apply the similar optimization method as for the perfect CSIT case. In simulations, we validate the proposed algorithm in terms of the sum secrecy SE.
Rate-splitting multiple access (RSMA) is an emerging multiple access strategy, with non-orthogonal multiple access (NOMA) and space division multiple access (SDMA) as its two special cases. RSMA divides the messages required by users into the private and common parts, and the private streams are naturally suitable for the secure transmission. In this paper, we establish a unified rate-splitting framework to ensure the secure transmission for the three multiple access systems mentioned above. The precoders at the multi-antenna transmitter are conjointly optimized to improve the transmission rate of common message. Successive interference cancellation (SIC) is utilized, and the private message for the downlink broadcasting RSMA network can be effectively hidden in the high-power common message. Simulation results demonstrate that the proposed rate-splitting framework can effectively guarantee the secure transmission of the secrecy information.
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.
We propose secure max-min fairness (MMF) precoding for a downlink multi-antenna system with multiple users and eavesdroppers. Since the problem is non-convex and non-smooth and partial channel knowledge is assumed, it is highly challenging to solve. To resolve the difficulties, we first reformulate the problem with conditional average rates, allowing to exploit the partial channel knowledge. Then, we derive the original problem as an approximate smoothing problem using a LogSumExp approach. We identify the first-order optimality condition and cast it to a generalized eigenvalue problem. Solving the problem via a power iteration offers the best local optimal solution. Simulations validate the proposed secure-MMF precoding method.
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.
Rate splitting multiple access (RSMA) is promising to achieve high spectral efficiency with a higher flexibility relative to non-orthogonal multiple access (NOMA) and orthogonal multiple access (OMA). In this paper, a novel RSMA-based secure transmission scheme with artificial noise (AN) and an adaptive beamforming is developed with the aim of maximizing the secrecy sum rate (SSR) of the considered system subject to specific constraints. The joint optimization of the power allocation between useful messages and AN signals, rate splitting between the two legitimate receivers, and the two mastering parameters of the beamforming design is tackled. To solve such a non-convex problem, we first analytically reveal some properties of the solution and then focus on an asymptotic scenario with a sufficiently large number of transmit antennas to derive closed-form expressions for the optimal power allocation coefficients. This enables us to develop an efficient method to identify the optimal rate splitting and beamforming parameters. Our examinations demonstrate that the proposed RSMA-based scheme outperforms two benchmark schemes in terms of achieving a higher SSR and the achievable performance gain is exceptional when the number of transmit antennas is small.