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

IEICE Transactions on Communications

Multi-Antenna Secure Communications via Selective Diversity

Ling Tang, Hao Chen, Jianhui Wu

Published Jan 1, 2012• 0 citations
Publisher

Abstract

We consider secure wireless communications, where a source is communicating to a destination in the presence of K (K>1) eavesdroppers. The source and destination both are equipped with multiple antennas, while each eavesdropper has a single antenna. The source aims to maximize the communication rate to the destination, while concealing the message from all the eavesdroppers. Combined with selective diversity, we propose a heuristic secrecy transmission scheme where the multiple-input-multiple-output (MIMO) secrecy channel is simplified into a multiple-input-single-output (MISO) one with the highest orthogonality to the eavesdropper channels. Then convex optimization is applied to obtain the optimal transmit covariance matrix for this selected MISO secrecy channel. Numerical results are provided to illustrate the efficacy of the proposed scheme.

DOI
10.1587/transcom.e95.b.587

Related papers

On Secrecy Performance of Antenna-Selection-Aided MIMO Systems Against Eavesdropping

Jia Zhu, Yulong Zou, Gongpu Wang +2 more

In this paper, we consider a multiple-input-multiple-output (MIMO) system consisting of one source, one destination, and one eavesdropper, where each node is equipped with an arbitrary number of antennas. To improve the security of source-destination transmissions, we investigate the antenna selection at the source and propose the optimal antenna selection (OAS) and suboptimal antenna selection (SAS) schemes, depending on whether the source node has the global channel state information (CSI) of both the main link (from source to destination) and the wiretap link (from source to eavesdropper). Moreover, the traditional space-time transmission (STT) is studied as a benchmark. We evaluate the secrecy performance of STT, SAS, and OAS schemes in terms of the probability of zero secrecy capacity. Furthermore, we examine the generalized secrecy diversity of the STT, SAS, and OAS schemes through an asymptotic analysis of the probability of zero secrecy capacity as the ratio between the average gains of the main and wiretap channels tends to infinity. This is different from the conventional secrecy diversity that assumes an infinite signal-to-noise ratio (SNR) received at the destination under the condition that the eavesdropper has a finite received SNR. It is shown that the generalized secrecy diversity orders of the STT, SAS, and OAS schemes are the product of the number of antennas at source and destination. Additionally, numerical results show that the proposed OAS scheme strictly outperforms both the STT and the SAS schemes in terms of the probability of zero secrecy capacity.

arXiv:1501.06407•IEEE Transactions on Vehicular Technology•Jan 27, 2015•109 citations

Optimal MISO secrecy beamforming via quasi-convex programming with rank-one transmit covariance guarantee

Ling Tang, Hao Liu, Jianhui Wu

This paper studies the secrecy capacity of the multiple input single output (MISO) secrecy channel where a transmitter is communicating to a receiver in the presence of K eavesdroppers. The transmitter is equipped with multiple antennas, while the receiver and all the eavesdroppers each has a single antenna. The transmitter maximizes the communication rate, while concealing the message from all the eavesdroppers. It is known that the maximum achievable secrecy rate is obtained with the optimal transmit covariance matrix that maximizes the minimum difference between the mutual information of the secrecy user channel and those of the eavesdroppers channels. The maximum secrecy rate computation can thus be formulated as a non-convex max-min problem, which cannot be solved efficiently. This paper proposes an efficient algorithm based on quasi-convex programming, which not only leads to the optimal transmit covariance matrix, but also guarantees that it is always rank-one at any search step with finite accuracy. Such a guaranteed rank-one covariance matrix is critical to practical implementations of MISO secrecy transmission beam-forming.

International Wireless Communications and Mobile Computing Conference (IWCMC)•Jun 28, 2010•4 citations

On the optimum secrecy capacity of multiple relay networks

M. N. Y. Koli, M. Z. I. Sarkar, S. Tazrin +1 more

We consider a confidential communication system in which a source sends a confidential information to the destination in the presence of an eavesdropper. Multiple relays are used to provide cooperative diversity to the destination. The destination and the eavesdropper are equipped with multiple antennas while each relay and source are equipped with single antenna. We are interested to protect the transmitted information from eavesdropping and to find the effect of receive diversity on the secrecy capacity of the proposed model. We consider the maximal ratio combining (MRC) technique at the destination and derive the expression of combiner output signal-to-noise ratio (SNR) using optimum weighting vector so that the eavesdropper is unable to decode a single bit from the original massage. Finally, we derive the expression of optimum secrecy capacity in terms of the number of relays and the number of antennas at the destination. Our results show that the optimization of weighting vector at the receiver enhances secrecy capacity of a wiretap channel.

International Conference on Computer and Information Technology (ICCIT)•Dec 1, 2014•1 citation

Achievable Rates in Gaussian MISO Channels with Secrecy Constraints

Shabnam Shafiee, Şennur Ulukuş

A Gaussian MISO (multiple input single output) channel is considered where a transmitter is communicating to a receiver in the presence of an eavesdropper. The transmitter is equipped with multiple antennas, while the receiver and the eavesdropper each have a single antenna. The transmitter maximizes the communication rate, while concealing the message from the eavesdropper. The channel input is restricted to Gaussian signalling, with no preprocessing of information. For these channel inputs, and under different channel fading assumptions, optimal transmission strategies are found, in terms of the input covariance matrices. It is shown that, the optimal communication strategy in all cases, is beamforming.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2007•311 citations

Secrecy rate maximization for MIMO wiretap channels with a cooperative jammer using alternating optimization

Hehao Niu, Bangning Zhang, Daoxing Guo +1 more

In this paper, we study the secrecy rate maximization (SRM) problem for a multiple-input-multiple-output (MIMO) secrecy channel, where a multi-antenna cooperative jammer is employed to improve secret communication in the presence of multiple multi-antenna eavesdroppers. The SRM problem are not jointly convex in terms of the transmit covariance matrices of the legitimate transmitter and the cooperative jammer. To solve the non-convexity issues, we propose an alternating optimization (AO) approach to design the transmit covariance matrix of the legitimate transmitter and the cooperative jammer. Simulation results validated the performance of the proposed algorithms.

International Conference on Electronics Instrumentation & Information Systems (EIIS)•Jun 1, 2017•2 citations

Multicast Secrecy Rate Maximization for MISO Channels with Multiple Multi-Antenna Eavesdroppers

Qiang Li, Wing‐Kin Ma

Recently, there has been growing interest in secure communication via multi-antenna physical-layer designs. In this paper, we consider a transmit covariance design for a secrecy rate maximization problem under a multicast scenario, where a multi-antenna transmitter delivers a common confidential message to multiple single-antenna receivers in the presence of multiple multi-antenna eavesdroppers. This multicast secrecy rate maximization (SRM) problem is nonconvex by nature. By resorting to a convex approximation, we provide an upper bound and lower bounds of the multicast secrecy rate by solving a semidefinite program. In particular, for the case of either i) no more than three legitimate receivers and one eavesdropper, or ii) one legitimate receiver and arbitrary number of eavesdroppers, these bounds are shown to be tight and transmit beamforming is an optimal transmit strategy. We also demonstrate by simulations that the multicast SRM problem can be accurately approximated by the proposed method.

International Conference on Communications•Jun 1, 2011•35 citations
We consider secure wireless communications, where a source is communicating to a destination in the presence of K (K>1) eavesdroppers. The source and destination both are equipped with multiple antennas, while each eavesdropper has a single antenna. The source aims to maximize the communication rate to the destination, while concealing the message from all the eavesdroppers. Combined with selective diversity, we propose a heuristic secrecy transmission scheme where the multiple-input-multiple-output (MIMO) secrecy channel is simplified into a multiple-input-single-output (MISO) one with the highest orthogonality to the eavesdropper channels. Then convex optimization is applied to obtain the optimal transmit covariance matrix for this selected MISO secrecy channel. Numerical results are provided to illustrate the efficacy of the proposed scheme.
In this paper, we consider a multiple-input-multiple-output (MIMO) system consisting of one source, one destination, and one eavesdropper, where each node is equipped with an arbitrary number of antennas. To improve the security of source-destination transmissions, we investigate the antenna selection at the source and propose the optimal antenna selection (OAS) and suboptimal antenna selection (SAS) schemes, depending on whether the source node has the global channel state information (CSI) of both the main link (from source to destination) and the wiretap link (from source to eavesdropper). Moreover, the traditional space-time transmission (STT) is studied as a benchmark. We evaluate the secrecy performance of STT, SAS, and OAS schemes in terms of the probability of zero secrecy capacity. Furthermore, we examine the generalized secrecy diversity of the STT, SAS, and OAS schemes through an asymptotic analysis of the probability of zero secrecy capacity as the ratio between the average gains of the main and wiretap channels tends to infinity. This is different from the conventional secrecy diversity that assumes an infinite signal-to-noise ratio (SNR) received at the destination under the condition that the eavesdropper has a finite received SNR. It is shown that the generalized secrecy diversity orders of the STT, SAS, and OAS schemes are the product of the number of antennas at source and destination. Additionally, numerical results show that the proposed OAS scheme strictly outperforms both the STT and the SAS schemes in terms of the probability of zero secrecy capacity.
This paper studies the secrecy capacity of the multiple input single output (MISO) secrecy channel where a transmitter is communicating to a receiver in the presence of K eavesdroppers. The transmitter is equipped with multiple antennas, while the receiver and all the eavesdroppers each has a single antenna. The transmitter maximizes the communication rate, while concealing the message from all the eavesdroppers. It is known that the maximum achievable secrecy rate is obtained with the optimal transmit covariance matrix that maximizes the minimum difference between the mutual information of the secrecy user channel and those of the eavesdroppers channels. The maximum secrecy rate computation can thus be formulated as a non-convex max-min problem, which cannot be solved efficiently. This paper proposes an efficient algorithm based on quasi-convex programming, which not only leads to the optimal transmit covariance matrix, but also guarantees that it is always rank-one at any search step with finite accuracy. Such a guaranteed rank-one covariance matrix is critical to practical implementations of MISO secrecy transmission beam-forming.
We consider a confidential communication system in which a source sends a confidential information to the destination in the presence of an eavesdropper. Multiple relays are used to provide cooperative diversity to the destination. The destination and the eavesdropper are equipped with multiple antennas while each relay and source are equipped with single antenna. We are interested to protect the transmitted information from eavesdropping and to find the effect of receive diversity on the secrecy capacity of the proposed model. We consider the maximal ratio combining (MRC) technique at the destination and derive the expression of combiner output signal-to-noise ratio (SNR) using optimum weighting vector so that the eavesdropper is unable to decode a single bit from the original massage. Finally, we derive the expression of optimum secrecy capacity in terms of the number of relays and the number of antennas at the destination. Our results show that the optimization of weighting vector at the receiver enhances secrecy capacity of a wiretap channel.
A Gaussian MISO (multiple input single output) channel is considered where a transmitter is communicating to a receiver in the presence of an eavesdropper. The transmitter is equipped with multiple antennas, while the receiver and the eavesdropper each have a single antenna. The transmitter maximizes the communication rate, while concealing the message from the eavesdropper. The channel input is restricted to Gaussian signalling, with no preprocessing of information. For these channel inputs, and under different channel fading assumptions, optimal transmission strategies are found, in terms of the input covariance matrices. It is shown that, the optimal communication strategy in all cases, is beamforming.
In this paper, we study the secrecy rate maximization (SRM) problem for a multiple-input-multiple-output (MIMO) secrecy channel, where a multi-antenna cooperative jammer is employed to improve secret communication in the presence of multiple multi-antenna eavesdroppers. The SRM problem are not jointly convex in terms of the transmit covariance matrices of the legitimate transmitter and the cooperative jammer. To solve the non-convexity issues, we propose an alternating optimization (AO) approach to design the transmit covariance matrix of the legitimate transmitter and the cooperative jammer. Simulation results validated the performance of the proposed algorithms.
Recently, there has been growing interest in secure communication via multi-antenna physical-layer designs. In this paper, we consider a transmit covariance design for a secrecy rate maximization problem under a multicast scenario, where a multi-antenna transmitter delivers a common confidential message to multiple single-antenna receivers in the presence of multiple multi-antenna eavesdroppers. This multicast secrecy rate maximization (SRM) problem is nonconvex by nature. By resorting to a convex approximation, we provide an upper bound and lower bounds of the multicast secrecy rate by solving a semidefinite program. In particular, for the case of either i) no more than three legitimate receivers and one eavesdropper, or ii) one legitimate receiver and arbitrary number of eavesdroppers, these bounds are shown to be tight and transmit beamforming is an optimal transmit strategy. We also demonstrate by simulations that the multicast SRM problem can be accurately approximated by the proposed method.