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

Co-Ordinated Secure Beamforming in -User Interference Channel With Multiple Eavesdroppers

Tiejun Lv, Hui Gao, Ruohan Cao, Jian Zhou

Published Jan 20, 2016• 17 citations
Publisher

Abstract

In this letter, we consider secrecy communications over multiple-input single-output K-user interference channel in the presence of multiple eavesdroppers. Each legitimate data link is wiretapped by several eavesdroppers. To keep the eavesdroppers ignorant of the confidential messages, we propose a co-ordinated secure beamforming scheme for maximizing the secrecy sum-rate subject to the individual power constraint of each transmitter. To solve the resultant nonconvex problem, we approximate it into a few semidefinite programs (SDPs) by employing the semidefinite relaxation (SDR) technique and a conservative convex approximation. It is demonstrated experimentally that the proposed algorithm converges within a few iterations. Furthermore, we prove that the SDP problem obtained via SDR always yields a rank-one solution such that the SDR is tight. Simulations show the efficacy of the proposed scheme.

DOI
10.1109/lwc.2016.2519905

Related papers

Secure beamforming design in wiretap MISO interference channels

Jian Zhou, Hui Gao, Ruohan Cao +1 more

In this paper, we study the secrecy communication in two-user MISO interference networks where an eavesdropper is only interested in one of the transmitters, i.e., transmitter 1. We propose a generalized beamforming design to maximize the achievable secrecy rate of transmitter 1 while guaranteeing the quality of service (QoS) of the other destination. The non-convex problem can be transformed into a two-stage problem. The inner stage is a semidefinite program (SDP) problem based on the semidefinite relaxation (SDR) and the outer stage is a one dimensional line search problem. It is also shown in the proof that the SDR is always tight and yields a rank-one solution. Furthermore, we also propose a low-complexity null-space beamforming design scheme in which the beamforming vectors can be obtained by solving a second-order cone program (SOCP) problem. Simulation results show the effectiveness of the two proposed schemes in improving the secrecy rate performance.

IEEE/CIC International Conference on Communications in China (ICCC)•Nov 1, 2015•0 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

Secure Beamforming Design in Wiretap MISO Interference Channels

Jian Zhou, Ruohan Cao, Hui Gao +2 more

In this paper, we study the secrecy communication in two-user MISO interference networks where an external eavesdropper is interested in the messages transmitted by both transmitters. We propose a beamforming design to maximize the achievable secrecy sum rate of the transmitters subject to the individual power constraint at each transmitter. To transform this complex non-convex problem into a convex one, we propose an iterative algorithm based on the constrained concave convex procedure (CCCP) and successive convex approximation (SCA). It is observed that the proposed algorithm converges fast to a stationary point within a few iterations. Furthermore, we also propose a low-complexity null-space beamforming design scheme in which the beamforming vectors have closed-form solutions. Simulation results show the effectiveness of the two proposed schemes in improving the secrecy sum rate performance.

IEEE Vehicular Technology Conference•May 1, 2015•6 citations

Energy-Efficiency Maximization for Secure Multiuser MIMO SWIPT Systems With CSI Uncertainty

Xuanxuan Wang, Wei Feng, Yunfei Chen +2 more

This paper studies the secure transmission issue for simultaneous wireless information and power transfer in a multiuser multiple-input-multiple-output system with multiple external eavesdroppers, where the transmitter broadcasts independent confidential messages to different legitimate receivers. Each receiver can be seen as an internal eavesdropper intended by other receivers. Our objective is to achieve the robust beamforming design under imperfect channel state information, in which the total transmission power is minimized with constraints on the achievable secrecy rate and the energy harvesting. Since the problem is nonconvex, we propose a two-level optimization scheme. For the inner problem, we investigate two conservative relaxation approaches, large-deviation inequality and Bernstein-type inequality (BTI), to reformulate the outage secrecy rate constraints into some convex ones, yielding a convex optimization by semidefinite programming (SDP) relaxation. For the outer problem, it is a K-variable optimization problem, which can be solved via the novel line-dimensional-like search method. Moreover, we characterize the rank profile of SDP relaxed solution for these two approaches. Specifically, the optimal solution is proved to be rank-one. Numerical results are provided to verify the performance of the proposed algorithms, where the LDI-based scheme outperforms the BTI-based scheme in terms of energy efficiency.

IEEE Access•Dec 11, 2017•18 citations

Cooperative Secure Beamforming for AF Relay Networks With Multiple Eavesdroppers

Ye Yang, Qiang Li, Wing‐Kin Ma +2 more

This letter studies cooperative secure beamforming for amplify-and-forward (AF) relay networks in the presence of multiple eavesdroppers. Under both total and individual relay power constraints, we propose two schemes, namely secrecy rate maximization (SRM) beamforming and null-space beamforming. In the first scheme, our design problem is based on SRM. Using a suboptimal, but convex, technique-semidefinite relaxation (SDR), we show that this problem can be handled by performing a one-dimensional search which involves solving a sequence of semidefinite programs (SDPs). To reduce the complexity, in the second scheme, we instead maximize the information rate at the destination while completely eliminating the information leakage to all eavesdroppers. We prove that this problem can be exactly solved by SDR with one SDP only. Simulation results demonstrate the performance gains of the two proposed designs.

IEEE Signal Processing Letters•Nov 20, 2012•178 citations

Robust Secure Beamforming for Multiuser MISO Wiretap Channels

Yuchong Li, Lijian Zhang, Yuguo Wu +1 more

Physical layer security has recently emerged as a promising approach to provide secure wireless communications. Physical layer security technology is the key means to achieve security and communication integration. The built-in security mechanism based on the characteristics of wireless channel provides a feasible idea for the realization of “one secret at a time”. It has important application prospects in integrity protection of service data, Internet of things (IoT) lightweight encryption and blockchain wireless security technology. In this paper, we consider the scenario of a unicast multiuser multiple-input single-output (MISO) downlink system in the presence of multiple single-antenna passive eavesdroppers. Instead of assuming perfect channel state information (CSI), we investigate the artificial noise (AN)-aided robust transmit beamforming scheme with imperfect CSI on legitimate receivers and no CSI regarding eavesdroppers at the transmitter. Under the fixed total transmit power, the information symbol and the AN are transmitted concurrently. We aim to guarantee each legitimate receiver's signal-to-interference-and-noise ratio(SINR) outage probability below a preset level with minimum power. Hence, as much power as possible can be allocated to AN to confuse the eavesdroppers. In order to reduce the negative impact on the legitimate receivers, the AN is transmitted in the null space of the estimated legitimate channels. To deal with this nonconvex optimization problem, a rank relaxed formulation is obtained by employing semidefinite relaxation (SDR). Then we propose two approaches by using Bernstein-type inequality and S-procedure, respectively, to transform the probabilistic constraints into deterministic constraints. The optimization problem is reformulated as a convex semidefinite program (SDP). Simulation results show that the proposed approaches have better performances than the non-robust approach.

International Conference on Smart BlockChain (SmartBlock)•Oct 1, 2020•3 citations
In this letter, we consider secrecy communications over multiple-input single-output K-user interference channel in the presence of multiple eavesdroppers. Each legitimate data link is wiretapped by several eavesdroppers. To keep the eavesdroppers ignorant of the confidential messages, we propose a co-ordinated secure beamforming scheme for maximizing the secrecy sum-rate subject to the individual power constraint of each transmitter. To solve the resultant nonconvex problem, we approximate it into a few semidefinite programs (SDPs) by employing the semidefinite relaxation (SDR) technique and a conservative convex approximation. It is demonstrated experimentally that the proposed algorithm converges within a few iterations. Furthermore, we prove that the SDP problem obtained via SDR always yields a rank-one solution such that the SDR is tight. Simulations show the efficacy of the proposed scheme.
In this paper, we study the secrecy communication in two-user MISO interference networks where an eavesdropper is only interested in one of the transmitters, i.e., transmitter 1. We propose a generalized beamforming design to maximize the achievable secrecy rate of transmitter 1 while guaranteeing the quality of service (QoS) of the other destination. The non-convex problem can be transformed into a two-stage problem. The inner stage is a semidefinite program (SDP) problem based on the semidefinite relaxation (SDR) and the outer stage is a one dimensional line search problem. It is also shown in the proof that the SDR is always tight and yields a rank-one solution. Furthermore, we also propose a low-complexity null-space beamforming design scheme in which the beamforming vectors can be obtained by solving a second-order cone program (SOCP) problem. Simulation results show the effectiveness of the two proposed schemes in improving the secrecy rate performance.
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 study the secrecy communication in two-user MISO interference networks where an external eavesdropper is interested in the messages transmitted by both transmitters. We propose a beamforming design to maximize the achievable secrecy sum rate of the transmitters subject to the individual power constraint at each transmitter. To transform this complex non-convex problem into a convex one, we propose an iterative algorithm based on the constrained concave convex procedure (CCCP) and successive convex approximation (SCA). It is observed that the proposed algorithm converges fast to a stationary point within a few iterations. Furthermore, we also propose a low-complexity null-space beamforming design scheme in which the beamforming vectors have closed-form solutions. Simulation results show the effectiveness of the two proposed schemes in improving the secrecy sum rate performance.
This paper studies the secure transmission issue for simultaneous wireless information and power transfer in a multiuser multiple-input-multiple-output system with multiple external eavesdroppers, where the transmitter broadcasts independent confidential messages to different legitimate receivers. Each receiver can be seen as an internal eavesdropper intended by other receivers. Our objective is to achieve the robust beamforming design under imperfect channel state information, in which the total transmission power is minimized with constraints on the achievable secrecy rate and the energy harvesting. Since the problem is nonconvex, we propose a two-level optimization scheme. For the inner problem, we investigate two conservative relaxation approaches, large-deviation inequality and Bernstein-type inequality (BTI), to reformulate the outage secrecy rate constraints into some convex ones, yielding a convex optimization by semidefinite programming (SDP) relaxation. For the outer problem, it is a K-variable optimization problem, which can be solved via the novel line-dimensional-like search method. Moreover, we characterize the rank profile of SDP relaxed solution for these two approaches. Specifically, the optimal solution is proved to be rank-one. Numerical results are provided to verify the performance of the proposed algorithms, where the LDI-based scheme outperforms the BTI-based scheme in terms of energy efficiency.
This letter studies cooperative secure beamforming for amplify-and-forward (AF) relay networks in the presence of multiple eavesdroppers. Under both total and individual relay power constraints, we propose two schemes, namely secrecy rate maximization (SRM) beamforming and null-space beamforming. In the first scheme, our design problem is based on SRM. Using a suboptimal, but convex, technique-semidefinite relaxation (SDR), we show that this problem can be handled by performing a one-dimensional search which involves solving a sequence of semidefinite programs (SDPs). To reduce the complexity, in the second scheme, we instead maximize the information rate at the destination while completely eliminating the information leakage to all eavesdroppers. We prove that this problem can be exactly solved by SDR with one SDP only. Simulation results demonstrate the performance gains of the two proposed designs.
Physical layer security has recently emerged as a promising approach to provide secure wireless communications. Physical layer security technology is the key means to achieve security and communication integration. The built-in security mechanism based on the characteristics of wireless channel provides a feasible idea for the realization of “one secret at a time”. It has important application prospects in integrity protection of service data, Internet of things (IoT) lightweight encryption and blockchain wireless security technology. In this paper, we consider the scenario of a unicast multiuser multiple-input single-output (MISO) downlink system in the presence of multiple single-antenna passive eavesdroppers. Instead of assuming perfect channel state information (CSI), we investigate the artificial noise (AN)-aided robust transmit beamforming scheme with imperfect CSI on legitimate receivers and no CSI regarding eavesdroppers at the transmitter. Under the fixed total transmit power, the information symbol and the AN are transmitted concurrently. We aim to guarantee each legitimate receiver's signal-to-interference-and-noise ratio(SINR) outage probability below a preset level with minimum power. Hence, as much power as possible can be allocated to AN to confuse the eavesdroppers. In order to reduce the negative impact on the legitimate receivers, the AN is transmitted in the null space of the estimated legitimate channels. To deal with this nonconvex optimization problem, a rank relaxed formulation is obtained by employing semidefinite relaxation (SDR). Then we propose two approaches by using Bernstein-type inequality and S-procedure, respectively, to transform the probabilistic constraints into deterministic constraints. The optimization problem is reformulated as a convex semidefinite program (SDP). Simulation results show that the proposed approaches have better performances than the non-robust approach.