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 Communications Letters

Artificial-Noise-Aided Optimal Beamforming in Layered Physical Layer Security

Wei Zhang, Jian Chen, Yonghong Kuo, Yuchen Zhou

Published Nov 13, 2018• 71 citations
Publisher

Abstract

In this letter, we develop a novel layered physical layer security model to secure multiple messages simultaneously. It maintains a hierarchical security structure, in which each message transmitted from the base station has a security level, and each user in the network has a security clearance correspondingly. Focusing on the basic two-layer unicast system, we propose an artificial-noise-aided optimal beamforming scheme to maximize the higher level information security performance while adhering to the low-level information secrecy rate constraint. Due to the nonconvexity of the problem formulated, a successive convex approximation-based algorithm is proposed to earn a safe convex approximation of the original. Afterward, a low-complexity zero-forcing beamforming scheme is proposed to achieve high efficiency by reducing the computational complexity. Simulation results validate the superiority of our schemes on the promotion of the overall secrecy performance.

DOI
10.1109/lcomm.2018.2881182

Related papers

Transmit Beamforming for Layered Physical Layer Security

Wei Zhang, Jian Chen, Yonghong Kuo +1 more

In this paper, we propose a novel layered physical layer security model, which is the extension of the traditional physical layer security to the domain of multiple-layer information security. It has a hierarchical information security structure that every transmitted message has a security level, while every user has a security clearance. Users can only decode the messages with security levels lower than or equal to their clearance, otherwise they will be deemed as eavesdroppers. Based on the framework of the layered information security and assuming perfect channel state information of all users, an artificial-noise-aided optimal beamforming scheme is proposed to minimize the total transmit power at the base station, while satisfying the minimum secrecy rate requirements of all secret messages. Due to the intrinsical complexity of the formulated nonconvex problem, a safe and convex reformulation based on the first-order Taylor series expansion method is proposed to generate a tractable approximation. A successive convex approximation-based algorithm is then proposed, which solves a series of second-order cone problems with convergence to the stationary point of the original problem. We also consider the imperfect channel state information case, and then propose a worst-case robust design to overcome the influence of channel uncertainties. Semi-definite relaxation method and S-procedure are utilized to get a computationally efficient lower bound of the intractable power minimization problem. Moreover, we investigate the application of the suboptimal zero-forcing-based beamforming scheme in the system to tradeoff the achievable performance and the computational complexity. Simulation results are provided to demonstrate the effectiveness of our proposed schemes.

IEEE Transactions on Vehicular Technology•Aug 2, 2019•66 citations

Robust Artificial-Noise-Aided Beamforming in Physical Layer Security

Biyuan Xie, Ruxiang Zhou

Considering that an illegitimate user wants to eavesdrop on the messages which are broadcasted from the base station to two legitimate users, we study the robust artificial-noise-aided optimal beamforming scheme where imperfect channel state information(CSI) is assumed. Our aim is to maximize the sum of the achievable secrecy rate, subject to the sum of the power. We propose to apply S-procedure to reformulate it and employ an alternating optimization(AO) algorithm to solve the problem. Simulation results show that our proposed scheme is superior to the non-robust one.

IEEE Information Technology, Networking, Electronic and Automation Control Conference (ITNEC)•May 5, 2020•0 citations

Robust Beamforming and Jamming for Enhancing the Physical Layer Security of Full Duplex Radios

Zhengmin Kong, Shaoshi Yang, Die Wang +1 more

In this paper, we investigate the physical layer security of a full-duplex base station (BS)-aided system in the worst case, where an uplink transmitter (UT) and a downlink receiver (DR) are equipped with a single antenna, while a powerful eavesdropper is equipped with multiple antennas. For securing the confidentiality of signals transmitted from the BS and UT, an artificial noise (AN)-aided secrecy beamforming scheme is proposed, which is robust to the realistic imperfect state information of both the eavesdropping channel and the residual self-interference channel. Our objective function is that of maximizing the worst-case sum secrecy rate achieved by the BS and UT, through jointly optimizing the beamforming vector of the confidential signals and the transmit covariance matrix of the AN. However, the resulting optimization problem is non-convex and non-linear. In order to efficiently obtain the solution, we transform the non-convex problem into a sequence of convex problems by adopting the block coordinate descent algorithm. We invoke a linear matrix inequality for finding its Karush-Kuhn-Tucker (KKT) solution. In order to evaluate the achievable performance, the worst-case secrecy rate is analytically derived. Furthermore, we construct another secrecy transmission scheme using the projection matrix theory for performance comparison. Our simulation results show that the proposed robust secrecy transmission scheme achieves substantial secrecy performance gains, which verifies the efficiency of the proposed method.

arXiv:1903.10787•IEEE Transactions on Information Forensics and Security•Apr 1, 2019•48 citations

Joint Information and Jamming Beamforming for Securing IoT Networks With Ratesplitting

Bin Qiu, Wenchi Cheng, Wei Zhang

The goal of this paper is to address the physical layer (PHY) security problem for multi-user multi-input single-output (MU-MISO) Internet of Things (IoT) systems in the presence of passive eavesdroppers (Eves). To this end, we propose an artificial noise (AN)-aided rate-splitting (RS)-based secure beamforming scheme. Our design considers the dual use of common messages and places the research emphasis on hiding the private messages for secure communication. In particular, leveraging AN-aided RS-based beamforming, we aim to maximize the focused secrecy sum-rate (F-SSR) by jointly designing transmit information and AN beamforming while satisfying the desired received constraints for the private messages at IoT devices (IoDs), and per-antenna transmit power constraint at base station. Then, we proposed a two-stage algorithm to iteratively find the optimal solution. By transforming non-convex terms into linear terms, we first reformulate the original problem as a convex program. Next, we recast the optimization problem to an unconstrained problem to obtain the global optimal solutions. Utilizing the duality framework, we further develop an efficient algorithm based on a barrier interior point method to solve the reformulated problem. Simulation results validate the superior performance of our proposed schemes.

arXiv:2407.13973•IEEE Internet of Things Journal•Sep 11, 2023•9 citations

Artificial Noise-Aided Secure Multicasting Design Under Secrecy Outage Constraint

Bo Wang, Pengcheng Mu

This paper investigates the physical layer security in a multiple-input-single-output multicast channel, where a common message is transmitted to multiple receivers and only statistical channel state information of the eavesdropper is available. We consider transmitting some artificial noise (AN) along with the information-bearing signal to improve secrecy. To find the optimal AN design, we formulate a secrecy outage probability (SOP) constrained secrecy rate maximization problem. For solving this problem, we adopt a novel transformation of the intractable SOP constraint and establish an efficient algorithm which solves the transformed problem to global optimality. We also propose a low-complexity refinement method to reduce the conservatism incurred by the transformation and an efficient algorithm to find a suboptimal solution when the information-bearing signal is transmitted using single-stream beamforming. Our solution is found to be a valuable generalization of the traditional null-space AN scheme. According to our simulation results, when the number of receivers is less than that of transmit antennas, distributing AN uniformly in the null space of the legitimate channel vectors is near-optimal. When there is no valid null space, transmitting AN will interfere with some legitimate receivers, and the secrecy performance can also be improved with carefully designed AN.

IEEE Transactions on Communications•Sep 1, 2017•27 citations

Robust AN-aided Secure Beamforming for Full-Duplex Relay System with Multiple Eavesdroppers

Jiaxing Cui, Zhengmin Kong, Jing Song +2 more

In this paper, we investigate the physical layer security of a full-duplex decode-and-forward relay-aided system in the worst case, where all channel state informations are realistic imperfect. For the sake of confidentiality of signals transmitted from source to destination, a robust artificial noise (AN)-aided beamforming scheme is proposed. Explicitly, our objective function is that of maximizing the worst-case secrecy rate under the transmit power constraints, by jointly optimizing the beamforming matrix and AN at the source and the relay. To overcome the non-convexity of the robust AN-aided secure beamforming problem, we transform it into multi-block convex problems, where the semi-infinite linear matrix inequality is applied to eliminate the channel uncertainties. As a benefit, our proposed robust AN -aided secure beamforming scheme obtains substantial secrecy performance gains, which verifies the efficiency of the proposed scheme.

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)•Oct 1, 2021•0 citations
In this letter, we develop a novel layered physical layer security model to secure multiple messages simultaneously. It maintains a hierarchical security structure, in which each message transmitted from the base station has a security level, and each user in the network has a security clearance correspondingly. Focusing on the basic two-layer unicast system, we propose an artificial-noise-aided optimal beamforming scheme to maximize the higher level information security performance while adhering to the low-level information secrecy rate constraint. Due to the nonconvexity of the problem formulated, a successive convex approximation-based algorithm is proposed to earn a safe convex approximation of the original. Afterward, a low-complexity zero-forcing beamforming scheme is proposed to achieve high efficiency by reducing the computational complexity. Simulation results validate the superiority of our schemes on the promotion of the overall secrecy performance.
In this paper, we propose a novel layered physical layer security model, which is the extension of the traditional physical layer security to the domain of multiple-layer information security. It has a hierarchical information security structure that every transmitted message has a security level, while every user has a security clearance. Users can only decode the messages with security levels lower than or equal to their clearance, otherwise they will be deemed as eavesdroppers. Based on the framework of the layered information security and assuming perfect channel state information of all users, an artificial-noise-aided optimal beamforming scheme is proposed to minimize the total transmit power at the base station, while satisfying the minimum secrecy rate requirements of all secret messages. Due to the intrinsical complexity of the formulated nonconvex problem, a safe and convex reformulation based on the first-order Taylor series expansion method is proposed to generate a tractable approximation. A successive convex approximation-based algorithm is then proposed, which solves a series of second-order cone problems with convergence to the stationary point of the original problem. We also consider the imperfect channel state information case, and then propose a worst-case robust design to overcome the influence of channel uncertainties. Semi-definite relaxation method and S-procedure are utilized to get a computationally efficient lower bound of the intractable power minimization problem. Moreover, we investigate the application of the suboptimal zero-forcing-based beamforming scheme in the system to tradeoff the achievable performance and the computational complexity. Simulation results are provided to demonstrate the effectiveness of our proposed schemes.
Considering that an illegitimate user wants to eavesdrop on the messages which are broadcasted from the base station to two legitimate users, we study the robust artificial-noise-aided optimal beamforming scheme where imperfect channel state information(CSI) is assumed. Our aim is to maximize the sum of the achievable secrecy rate, subject to the sum of the power. We propose to apply S-procedure to reformulate it and employ an alternating optimization(AO) algorithm to solve the problem. Simulation results show that our proposed scheme is superior to the non-robust one.
In this paper, we investigate the physical layer security of a full-duplex base station (BS)-aided system in the worst case, where an uplink transmitter (UT) and a downlink receiver (DR) are equipped with a single antenna, while a powerful eavesdropper is equipped with multiple antennas. For securing the confidentiality of signals transmitted from the BS and UT, an artificial noise (AN)-aided secrecy beamforming scheme is proposed, which is robust to the realistic imperfect state information of both the eavesdropping channel and the residual self-interference channel. Our objective function is that of maximizing the worst-case sum secrecy rate achieved by the BS and UT, through jointly optimizing the beamforming vector of the confidential signals and the transmit covariance matrix of the AN. However, the resulting optimization problem is non-convex and non-linear. In order to efficiently obtain the solution, we transform the non-convex problem into a sequence of convex problems by adopting the block coordinate descent algorithm. We invoke a linear matrix inequality for finding its Karush-Kuhn-Tucker (KKT) solution. In order to evaluate the achievable performance, the worst-case secrecy rate is analytically derived. Furthermore, we construct another secrecy transmission scheme using the projection matrix theory for performance comparison. Our simulation results show that the proposed robust secrecy transmission scheme achieves substantial secrecy performance gains, which verifies the efficiency of the proposed method.
The goal of this paper is to address the physical layer (PHY) security problem for multi-user multi-input single-output (MU-MISO) Internet of Things (IoT) systems in the presence of passive eavesdroppers (Eves). To this end, we propose an artificial noise (AN)-aided rate-splitting (RS)-based secure beamforming scheme. Our design considers the dual use of common messages and places the research emphasis on hiding the private messages for secure communication. In particular, leveraging AN-aided RS-based beamforming, we aim to maximize the focused secrecy sum-rate (F-SSR) by jointly designing transmit information and AN beamforming while satisfying the desired received constraints for the private messages at IoT devices (IoDs), and per-antenna transmit power constraint at base station. Then, we proposed a two-stage algorithm to iteratively find the optimal solution. By transforming non-convex terms into linear terms, we first reformulate the original problem as a convex program. Next, we recast the optimization problem to an unconstrained problem to obtain the global optimal solutions. Utilizing the duality framework, we further develop an efficient algorithm based on a barrier interior point method to solve the reformulated problem. Simulation results validate the superior performance of our proposed schemes.
This paper investigates the physical layer security in a multiple-input-single-output multicast channel, where a common message is transmitted to multiple receivers and only statistical channel state information of the eavesdropper is available. We consider transmitting some artificial noise (AN) along with the information-bearing signal to improve secrecy. To find the optimal AN design, we formulate a secrecy outage probability (SOP) constrained secrecy rate maximization problem. For solving this problem, we adopt a novel transformation of the intractable SOP constraint and establish an efficient algorithm which solves the transformed problem to global optimality. We also propose a low-complexity refinement method to reduce the conservatism incurred by the transformation and an efficient algorithm to find a suboptimal solution when the information-bearing signal is transmitted using single-stream beamforming. Our solution is found to be a valuable generalization of the traditional null-space AN scheme. According to our simulation results, when the number of receivers is less than that of transmit antennas, distributing AN uniformly in the null space of the legitimate channel vectors is near-optimal. When there is no valid null space, transmitting AN will interfere with some legitimate receivers, and the secrecy performance can also be improved with carefully designed AN.
In this paper, we investigate the physical layer security of a full-duplex decode-and-forward relay-aided system in the worst case, where all channel state informations are realistic imperfect. For the sake of confidentiality of signals transmitted from source to destination, a robust artificial noise (AN)-aided beamforming scheme is proposed. Explicitly, our objective function is that of maximizing the worst-case secrecy rate under the transmit power constraints, by jointly optimizing the beamforming matrix and AN at the source and the relay. To overcome the non-convexity of the robust AN-aided secure beamforming problem, we transform it into multi-block convex problems, where the semi-infinite linear matrix inequality is applied to eliminate the channel uncertainties. As a benefit, our proposed robust AN -aided secure beamforming scheme obtains substantial secrecy performance gains, which verifies the efficiency of the proposed scheme.