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

Distributed Robust Artificial-Noise-Aided Secure Precoding for Wiretap MIMO Interference Channels

Zhengmin Kong, Jing Song, Shaoshi Yang, Li Gan, Weizhi Meng, Tao Huang, Sheng Chen

Published Jan 1, 2024• 10 citations
Publisher

Abstract

We propose a distributed artificial noise-assisted precoding scheme for secure communications over wiretap multi-input multi-output (MIMO) interference channels, where K legitimate transmitter-receiver pairs communicate in the presence of a sophisticated eavesdropper having more receive-antennas than the legitimate user. Realistic constraints are considered by imposing statistical error bounds for the channel state information of both the eavesdropping and interference channels. Based on the asynchronous distributed pricing model, the proposed scheme maximizes the total utility of all the users, where each user’s utility function is defined as the secrecy rate minus the interference cost imposed on other users. Using the weighted minimum mean square error, Schur complement and sign-definiteness techniques, the original non-concave optimization problem is approximated with high accuracy as a quasi-concave problem, which can be solved by the alternating convex search method. Simulation results consolidate our theoretical analysis and show that the proposed scheme outperforms the artificial noise-assisted interference alignment and minimum total mean-square error-based schemes.

DOI
10.1109/tifs.2024.3486548

Related papers

Joint Precoder and Artificial Noise Design for MIMO Wiretap Channels With Finite-Alphabet Inputs Based on the Cut-Off Rate

Sina Rezaei Aghdam, Tolga M. Duman

We consider precoder and artificial noise (AN) design for multi-antenna wiretap channels under the finite-alphabet input assumption. We assume that the transmitter has access to the channel coefficients of the legitimate receiver and knows the statistics of the eavesdropper's channel. Accordingly, we propose a secrecy rate maximization algorithm using a gradient descent-based optimization of the precoder matrix and an exhaustive search over the power levels allocated to the AN. We also propose algorithms to reduce the complexities of direct ergodic secrecy rate maximization by: 1) maximizing a cut-off rate-based approximation for the ergodic secrecy rate, simplifying the mutual information expression, which lacks a closed-form and 2) diagonalizing the channels toward the legitimate receiver and the eavesdropper, which allows for employing a per-group precoding-based technique. Our numerical results reveal that jointly optimizing the precoder and the AN outperforms the existing solutions in the literature, which rely on the precoder optimization only. We also demonstrate that the proposed low complexity alternatives result in a small loss in performance while offering a significant reduction in computational complexity.

IEEE Transactions on Wireless Communications•Mar 31, 2017•51 citations

On the Interference Alignment Designs for Secure Multiuser MIMO Systems

Ha Hoang Kha, Thanh Tung Vu, Trung Q. Duong +1 more

In this paper, we propose two secure multiuser multiple-input multiple-output (MIMO) transmission approaches based on interference alignment (IA) in the presence of an eavesdropper. To deal with the information leakage to the eavesdropper as well as the interference signals from undesired transmitters (Txs) at desired receivers (Rxs), our approaches aim to design the transmit precoding and receive subspace matrices to minimize both the total inter-main-link interference and the wiretapped signals (WSs). The first proposed IA scheme focuses on aligning the WSs into proper subspaces while the second one imposes a new structure on the precoding matrices to force the WSs to zero. In each proposed IA scheme, the precoding matrices and the receive subspaces at the legitimate users are alternatively selected to minimize the cost function of a convex optimization problem for every iteration. We provide the feasible conditions and the proofs of convergence for both IA approaches. The simulation results indicate that our two IA approaches outperform the conventional IA algorithm in terms of the average secrecy sum rate.

arXiv:1508.00349•IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2017•5 citations

Joint Precoding and Artificial Noise Design for MU-MIMO Wiretap Channels

Eunsung Choi, Mintaek Oh, Jinseok Choi +3 more

Secure precoding superimposed with artificial noise (AN) is a promising transmission technique to improve security by harnessing the superposition nature of the wireless medium. However, finding a jointly optimal precoding and AN structure is very challenging in downlink multi-user multiple-input multiple-output wiretap channels with multiple eavesdroppers. The major challenge in maximizing the secrecy rate arises from the non-convexity and non-smoothness of the rate function. Traditionally, an alternating optimization framework that identifies beamforming vectors and AN covariance matrix has been adopted; yet this alternating approach has limitations in maximizing the secrecy rate. In this paper, we put forth a novel secure precoding algorithm that jointly and simultaneously optimizes the beams and AN covariance matrix for maximizing the secrecy rate when a transmitter has either perfect or partial channel knowledge of eavesdroppers. To this end, we first establish an approximate secrecy rate in a smooth function. Then, we derive the first-order optimality condition in the form of the nonlinear eigenvalue problem (NEP). We present a computationally efficient algorithm to identify the principal eigenvector of the NEP as a suboptimal solution for secure precoding. Simulations demonstrate that the proposed methods improve secrecy rate significantly compared to the existing methods.

arXiv:2207.09823•IEEE Transactions on Communications•Dec 7, 2022•31 citations

Robust Secure Transmit Design with Artificial Noise in the Presence of Multiple Eavesdroppers

Xiaochen Liu, Yuanyuan Gao, Nan Sha +2 more

This paper studies secure wireless transmission from a multi-antenna transmitter to a single-antenna intended receiver overheard by multiple eavesdroppers with considering the imperfect channel state information (CSI) of wiretap channel.To enhance security of communication link, the artificial noise (AN) is generated at transmitter.We first design the robust joint optimal beamforming of secret signal and AN to minimize transmit power with constraints of security quality of service (QoS), i.e., minimum allowable signal-to-interference-and-noise ratio (SINR) at receiver and maximum tolerable SINR at eavesdroppers.The formulated design problem is shown to be nonconvex and we transfer it into linear matrix inequalities (LMIs).The semidefinite relaxation (SDR) technique is used and the approximated method is proved to solve the original problem exactly.To verify the robustness and tightness of proposed beamforming, we also provide a method to calculate the worst-case SINR at eavesdroppers for a designed transmit scheme using semidefinite programming (SDP).Additionally, the secrecy rate maximization is explored for fixed total transmit power.To tackle the nonconvexity of original formulation, we develop an iterative approach employing sequential parametric convex approximation (SPCA).The simulation results illustrate that the proposed robust transmit schemes can effectively improve the transmit performance.

KSII Transactions on Internet and Information Systems•Jun 30, 2021•0 citations

Iterative Distributed Minimum Total MSE Approach for Secure Communications in MIMO Interference Channels

Zhengmin Kong, Shaoshi Yang, Feilong Wu +3 more

In this paper, we consider the problem of jointly designing transmit precoding (TPC) matrix and receive filter matrix subject to both secrecy and per-transmitter power constraints in the multiple-input multiple-output (MIMO) interference channel, where K legitimate transmitter-receiver pairs communicate in the presence of an external eavesdropper. Explicitly, we jointly design the TPC and receive filter matrices based on the minimum total mean-squared error (MSE) criterion under a given and feasible information-theoretic degrees of freedom. More specifically, we formulate this problem by minimizing the total MSEs of the signals communicated between the legitimate transmitter-receiver pairs, while ensuring that the MSE of the signals decoded by the eavesdropper remains higher than a certain threshold. We demonstrate that the joint design of the TPC and receive filter matrices subject to both secrecy and transmit power constraints can be accomplished by an efficient iterative distributed algorithm. The convergence of the proposed iterative algorithm is characterized as well. Furthermore, the performance of the proposed algorithm, including both its secrecy rate and MSE, is characterized with the aid of numerical results. We demonstrate that the proposed algorithm outperforms the traditional interference alignment algorithm in terms of both the achievable secrecy rate and the MSE. As a benefit, secure communications can be guaranteed by the proposed algorithm for the MIMO interference channel even in the presence of a sophisticated/strong eavesdropper, whose number of antennas is much higher than that of each legitimate transmitter and receiver.

arXiv:1510.03857•IEEE Transactions on Information Forensics and Security•Oct 27, 2015•31 citations

Energy-efficient secrecy precoding for general MIMOME wiretap channels

Bing Fang, Zuping Qian, Zhong Wei +1 more

In this paper, we study the energy-efficient secrecy precoding problem for a general multiple-input multiple-output multiple-eavesdropper (MIMOME) wiretap channel. The system model considered here consists of a common transmitter, a legitimate receiver, and multiple eavesdroppers, all mounted with multiple antennas. In order to improve the energy efficiency (EE) performance of the proposed system, an artificial noise (AN)-aided precoding scheme is adopted. Because the formulated EE maximization problem is of huge nonconvex complexity, we solve it by employing a two-tier optimization structure. Although the outer-tier optimization problem is quite simple and can be efficiently solved by the famous golden section searching method, the inner-tier optimization problem turns out to be nonconvex and cannot be easily solved. To solve it, we relax it to a secrecy rate maximization (SRM) problem, which naturally constitutes a difference convex (DC)-type programming problem and can be iteratively solved by employing a successive convex approximation (SCA) method. Numerical simulations are further provided to demonstrate the proposed algorithms. Results show that our algorithms can converge fast to a near-optimal solution.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 1, 2015•2 citations
We propose a distributed artificial noise-assisted precoding scheme for secure communications over wiretap multi-input multi-output (MIMO) interference channels, where K legitimate transmitter-receiver pairs communicate in the presence of a sophisticated eavesdropper having more receive-antennas than the legitimate user. Realistic constraints are considered by imposing statistical error bounds for the channel state information of both the eavesdropping and interference channels. Based on the asynchronous distributed pricing model, the proposed scheme maximizes the total utility of all the users, where each user’s utility function is defined as the secrecy rate minus the interference cost imposed on other users. Using the weighted minimum mean square error, Schur complement and sign-definiteness techniques, the original non-concave optimization problem is approximated with high accuracy as a quasi-concave problem, which can be solved by the alternating convex search method. Simulation results consolidate our theoretical analysis and show that the proposed scheme outperforms the artificial noise-assisted interference alignment and minimum total mean-square error-based schemes.
We consider precoder and artificial noise (AN) design for multi-antenna wiretap channels under the finite-alphabet input assumption. We assume that the transmitter has access to the channel coefficients of the legitimate receiver and knows the statistics of the eavesdropper's channel. Accordingly, we propose a secrecy rate maximization algorithm using a gradient descent-based optimization of the precoder matrix and an exhaustive search over the power levels allocated to the AN. We also propose algorithms to reduce the complexities of direct ergodic secrecy rate maximization by: 1) maximizing a cut-off rate-based approximation for the ergodic secrecy rate, simplifying the mutual information expression, which lacks a closed-form and 2) diagonalizing the channels toward the legitimate receiver and the eavesdropper, which allows for employing a per-group precoding-based technique. Our numerical results reveal that jointly optimizing the precoder and the AN outperforms the existing solutions in the literature, which rely on the precoder optimization only. We also demonstrate that the proposed low complexity alternatives result in a small loss in performance while offering a significant reduction in computational complexity.
In this paper, we propose two secure multiuser multiple-input multiple-output (MIMO) transmission approaches based on interference alignment (IA) in the presence of an eavesdropper. To deal with the information leakage to the eavesdropper as well as the interference signals from undesired transmitters (Txs) at desired receivers (Rxs), our approaches aim to design the transmit precoding and receive subspace matrices to minimize both the total inter-main-link interference and the wiretapped signals (WSs). The first proposed IA scheme focuses on aligning the WSs into proper subspaces while the second one imposes a new structure on the precoding matrices to force the WSs to zero. In each proposed IA scheme, the precoding matrices and the receive subspaces at the legitimate users are alternatively selected to minimize the cost function of a convex optimization problem for every iteration. We provide the feasible conditions and the proofs of convergence for both IA approaches. The simulation results indicate that our two IA approaches outperform the conventional IA algorithm in terms of the average secrecy sum rate.
Secure precoding superimposed with artificial noise (AN) is a promising transmission technique to improve security by harnessing the superposition nature of the wireless medium. However, finding a jointly optimal precoding and AN structure is very challenging in downlink multi-user multiple-input multiple-output wiretap channels with multiple eavesdroppers. The major challenge in maximizing the secrecy rate arises from the non-convexity and non-smoothness of the rate function. Traditionally, an alternating optimization framework that identifies beamforming vectors and AN covariance matrix has been adopted; yet this alternating approach has limitations in maximizing the secrecy rate. In this paper, we put forth a novel secure precoding algorithm that jointly and simultaneously optimizes the beams and AN covariance matrix for maximizing the secrecy rate when a transmitter has either perfect or partial channel knowledge of eavesdroppers. To this end, we first establish an approximate secrecy rate in a smooth function. Then, we derive the first-order optimality condition in the form of the nonlinear eigenvalue problem (NEP). We present a computationally efficient algorithm to identify the principal eigenvector of the NEP as a suboptimal solution for secure precoding. Simulations demonstrate that the proposed methods improve secrecy rate significantly compared to the existing methods.
This paper studies secure wireless transmission from a multi-antenna transmitter to a single-antenna intended receiver overheard by multiple eavesdroppers with considering the imperfect channel state information (CSI) of wiretap channel.To enhance security of communication link, the artificial noise (AN) is generated at transmitter.We first design the robust joint optimal beamforming of secret signal and AN to minimize transmit power with constraints of security quality of service (QoS), i.e., minimum allowable signal-to-interference-and-noise ratio (SINR) at receiver and maximum tolerable SINR at eavesdroppers.The formulated design problem is shown to be nonconvex and we transfer it into linear matrix inequalities (LMIs).The semidefinite relaxation (SDR) technique is used and the approximated method is proved to solve the original problem exactly.To verify the robustness and tightness of proposed beamforming, we also provide a method to calculate the worst-case SINR at eavesdroppers for a designed transmit scheme using semidefinite programming (SDP).Additionally, the secrecy rate maximization is explored for fixed total transmit power.To tackle the nonconvexity of original formulation, we develop an iterative approach employing sequential parametric convex approximation (SPCA).The simulation results illustrate that the proposed robust transmit schemes can effectively improve the transmit performance.
In this paper, we consider the problem of jointly designing transmit precoding (TPC) matrix and receive filter matrix subject to both secrecy and per-transmitter power constraints in the multiple-input multiple-output (MIMO) interference channel, where K legitimate transmitter-receiver pairs communicate in the presence of an external eavesdropper. Explicitly, we jointly design the TPC and receive filter matrices based on the minimum total mean-squared error (MSE) criterion under a given and feasible information-theoretic degrees of freedom. More specifically, we formulate this problem by minimizing the total MSEs of the signals communicated between the legitimate transmitter-receiver pairs, while ensuring that the MSE of the signals decoded by the eavesdropper remains higher than a certain threshold. We demonstrate that the joint design of the TPC and receive filter matrices subject to both secrecy and transmit power constraints can be accomplished by an efficient iterative distributed algorithm. The convergence of the proposed iterative algorithm is characterized as well. Furthermore, the performance of the proposed algorithm, including both its secrecy rate and MSE, is characterized with the aid of numerical results. We demonstrate that the proposed algorithm outperforms the traditional interference alignment algorithm in terms of both the achievable secrecy rate and the MSE. As a benefit, secure communications can be guaranteed by the proposed algorithm for the MIMO interference channel even in the presence of a sophisticated/strong eavesdropper, whose number of antennas is much higher than that of each legitimate transmitter and receiver.
In this paper, we study the energy-efficient secrecy precoding problem for a general multiple-input multiple-output multiple-eavesdropper (MIMOME) wiretap channel. The system model considered here consists of a common transmitter, a legitimate receiver, and multiple eavesdroppers, all mounted with multiple antennas. In order to improve the energy efficiency (EE) performance of the proposed system, an artificial noise (AN)-aided precoding scheme is adopted. Because the formulated EE maximization problem is of huge nonconvex complexity, we solve it by employing a two-tier optimization structure. Although the outer-tier optimization problem is quite simple and can be efficiently solved by the famous golden section searching method, the inner-tier optimization problem turns out to be nonconvex and cannot be easily solved. To solve it, we relax it to a secrecy rate maximization (SRM) problem, which naturally constitutes a difference convex (DC)-type programming problem and can be iteratively solved by employing a successive convex approximation (SCA) method. Numerical simulations are further provided to demonstrate the proposed algorithms. Results show that our algorithms can converge fast to a near-optimal solution.