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/CIC International Conference on Communications in China (ICCC)

Secure beamforming design in wiretap MISO interference channels

Jian Zhou, Hui Gao, Ruohan Cao, Tiejun Lv

Published Nov 1, 2015• 0 citations
Publisher

Abstract

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.

DOI
10.1109/iccchina.2015.7448620

Related papers

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

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

Tiejun Lv, Hui Gao, Ruohan Cao +1 more

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.

IEEE Wireless Communications Letters•Jan 20, 2016•17 citations

Robust MISO Beamforming With Cooperative Jamming for Secure Transmission From Perspectives of QoS and Secrecy Rate

Hui Ma, Julian Cheng, Xianfu Wang +1 more

Robust quality-of-service (QoS)-based and secrecy rate-based secure transmission designs are investigated for a multiple-input single-output system with multiple eavesdroppers and a cooperative jammer. Two scenarios are considered: (a) eavesdroppers' channel state information (ECSI) is available and (b) ECSI is unavailable. In scenario (a), a QoS-based design is considered to minimize the worst case signal-to-interference-and-noise ratio at the eavesdroppers and to guarantee the QoS of the legitimate receiver. A secrecy rate-based design is also studied where the worst case secrecy rate is maximized. In scenario (b), a QoS-based design is considered to maximize the power of jamming signals under the QoS constraint of the legitimate receiver, and the secrecy rate-based design is not applicable. In all these designs, we jointly optimize the transmit beamforming vector and the covariance matrix of jamming signals under individual power constraints. As the optimization problems are non-convex, we propose an algorithm for each problem through semidefinite relaxation. Our analysis and simulation results show that, even though the linear precoding scheme in our designs is transmit beamforming rather than the general rank transmit covariance, this does not cause any loss of optimality.

IEEE Transactions on Communications•Oct 23, 2017•39 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

Secrecy rate maximization of a miso channelwith multiple multi-antenna eavesdroppers via semidefinite programming

Qiang Li, Wing‐Kin Ma

The advances of multi-antenna techniques has recently led to renewed interest in physical-layer secrecy, a meaningful topic that enables us to prevent eavesdroppers from retrieving information intended for a legitimate user through physical layer designs. This paper address a secrecy-rate maximization problem for the scenario of a multi-input single-output channel listened by multiple multi-antenna eavesdroppers; e.g., in downlink. This problem is nonconvex and has no analytical solution. Through a careful analysis and reformulation, we show that the secrecy-rate maximization problem has a convex equivalent in form of a semidefinite program (SDP). We also prove that the respective optimal transmit covariance generally can yield a rank-one structure, implying that transmit beamforming is secrecy-rate optimal in the considered scenario. Simulation results are also provided to illustrate that the optimal transmit design solved by our SDP approach can yield significantly improved secrecy rates than an existing closed-form design.

IEEE International Conference on Acoustics Speech and Signal Processing•Mar 1, 2010•9 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
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.
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.
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.
Robust quality-of-service (QoS)-based and secrecy rate-based secure transmission designs are investigated for a multiple-input single-output system with multiple eavesdroppers and a cooperative jammer. Two scenarios are considered: (a) eavesdroppers' channel state information (ECSI) is available and (b) ECSI is unavailable. In scenario (a), a QoS-based design is considered to minimize the worst case signal-to-interference-and-noise ratio at the eavesdroppers and to guarantee the QoS of the legitimate receiver. A secrecy rate-based design is also studied where the worst case secrecy rate is maximized. In scenario (b), a QoS-based design is considered to maximize the power of jamming signals under the QoS constraint of the legitimate receiver, and the secrecy rate-based design is not applicable. In all these designs, we jointly optimize the transmit beamforming vector and the covariance matrix of jamming signals under individual power constraints. As the optimization problems are non-convex, we propose an algorithm for each problem through semidefinite relaxation. Our analysis and simulation results show that, even though the linear precoding scheme in our designs is transmit beamforming rather than the general rank transmit covariance, this does not cause any loss of optimality.
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.
The advances of multi-antenna techniques has recently led to renewed interest in physical-layer secrecy, a meaningful topic that enables us to prevent eavesdroppers from retrieving information intended for a legitimate user through physical layer designs. This paper address a secrecy-rate maximization problem for the scenario of a multi-input single-output channel listened by multiple multi-antenna eavesdroppers; e.g., in downlink. This problem is nonconvex and has no analytical solution. Through a careful analysis and reformulation, we show that the secrecy-rate maximization problem has a convex equivalent in form of a semidefinite program (SDP). We also prove that the respective optimal transmit covariance generally can yield a rank-one structure, implying that transmit beamforming is secrecy-rate optimal in the considered scenario. Simulation results are also provided to illustrate that the optimal transmit design solved by our SDP approach can yield significantly improved secrecy rates than an existing closed-form design.
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.