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 Signal Processing Letters

On Secrecy Capacity of Gaussian Wiretap Channel Aided by A Cooperative Jammer

Lingxiang Li, Zhi Chen, Jun Fang

Published Jul 9, 2014• 24 citations
Publisher

Abstract

We study the secrecy capacity of Gaussian wiretap channel aided by an external jammer/helper. Both the transmitter and the intended receiver are equipped with a single antenna, while the eavesdropper and the jammer are equipped with$M$and$N$antennas, respectively. Generally, an analytical form of the secrecy capacity in this scenario is difficult to obtain. Instead, we consider a null-space jamming scheme which totally nulls out the jamming signal at the legitimate receiver, and derive lower and upper bounds on its maximal achievable secrecy rate${R_N}$. The relationship between the average secrecy capacity${\bar C_N}$of Gaussian wiretap channel and the average secrecy rate${\bar R_N}$achieved by the null-space jamming scheme is investigated, and we prove that${\bar R_N} \leq {\bar C_N} \leq {\bar R_{N + 1}}$. Based on this inequality and the derived lower and upper bounds on${R_N}$, the upper and lower bounds on the average secrecy capacity of Gaussian wiretap channel aided by an external jammer can be obtained, where our result shows that when$N > M$, the average secrecy capacity increases linearly with the total transmit power; while when$N \leq M - 1$, there exists a performance ceiling on it.

DOI
10.1109/lsp.2014.2336803

Related papers

Secrecy capacity of MISO Gaussian wiretap channel with a cooperative jammer

S. Ali. A. Fakoorian, Arnold Lee Swindlehurst

We study the Gaussian MISO wiretap channel with a transmitter, a legitimate receiver, an eavesdropper and an external helper, where the transmitter and the helper have an arbitrary number of antennas but the intended receiver and the eavesdropper have only one antenna. The transmitter sends confidential messages to its intended receiver, while the helper transmits jamming signals independent of the source message to confuse the eavesdropper. The jamming signal is assumed to be treated as noise at both the intended receiver and the eavesdropper. Assuming Gaussian signaling at the helper, we obtain the optimal beamformers at the transmitter and the helper that achieve the secrecy capacity.

IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)•Jun 1, 2011•11 citations

Solutions for the MIMO Gaussian Wiretap Channel With a Cooperative Jammer

S. Ali. A. Fakoorian, Arnold Lee Swindlehurst

We study the Gaussian MIMO wiretap channel with a transmitter, a legitimate receiver, an eavesdropper and an external helper, each equipped with multiple antennas. The transmitter sends confidential messages to its intended receiver, while the helper transmits jamming signals independent of the source message to confuse the eavesdropper. The jamming signal is assumed to be treated as noise at both the intended receiver and the eavesdropper. We obtain a closed-form expression for the structure of the artificial noise covariance matrix that guarantees a secrecy rate larger or at least equal to the secrecy capacity of the wiretap channel with no jamming signal. We also describe how to find specific realizations of this covariance matrix expression that provide good secrecy rate performance, even when there is no nontrivial null space between the helper and the intended receiver. Unlike prior work, our approach considers the general MIMO case, and is not restricted to SISO or MISO scenarios.

arXiv:1101.4435•IEEE Transactions on Signal Processing•Jul 7, 2011•131 citations

On the Secrecy Capacity of a MIMO Gaussian Wiretap Channel with a Cooperative Jammer

Lingxiang Li, Zhi Chen, Jun Fang +1 more

We study the secrecy capacity of a helper-assisted Gaussian wiretap channel with a source, a legitimate receiver, an eavesdropper and an external helper, where each terminal is equipped with multiple antennas. Determining the secrecy capacity in this scenario generally requires solving a nonconvex secrecy rate maximization (SRM) problem. To deal with this issue, we first reformulate the original SRM problem into a sequence of convex subproblems. For the special case of single-antenna legitimate receiver, we obtain the secrecy capacity via a combination of convex optimization and one-dimensional search, while for the general case of multi-antenna legitimate receiver, we propose an iterative solution. To gain more insight into how the secrecy capacity of a helper-assisted Gaussian wiretap channel behaves, we examine the achievable secure degrees of freedom (s.d.o.f.) and obtain the maximal achievable s.d.o.f. in closed-form. We also derive a closed-form solution to the original SRM problem which achieves the maximal s.d.o.f.. Numerical results are presented to illustrate the efficacy of the proposed schemes.

arXiv:1509.04624•Sep 15, 2015•2 citations

A Lower Bound on Secrecy Capacity for MIMO Wiretap Channel Aided by a Cooperative Jammer With Channel Estimation Error

Shunya Iwata, Tomoaki Otsuki Ohtsuki, Pooi‐Yuen Kam

We consider a multiple-input multiple-output wiretap channel with one transmitter, one receiver, one cooperative jammer, and one eavesdropper whereby each node is equipped with multiple antennas. Eigenbeam-space division multiplexing (E-SDM) and cooperative jamming are known as techniques for improving secrecy rate. E-SDM enables the transmitter and the legitimate receiver to communicate with each other in parallel using channel state information known to them to maximize the legitimate receiver's mutual information. On the other hand, cooperative jamming is to jam only the eavesdropper to degrade the eavesdropper's mutual information. However, co-channel interference and residual interference from the cooperative jammer are caused by channel estimation errors, which degrade the legitimate receiver's mutual information. How these interferences affect the secrecy capacity has not been clarified. In this paper, we derive a lower bound on secrecy capacity using the legitimate receiver's mutual information in the presence of channel estimation errors and the mutual information of the eavesdropper who uses a minimum mean square error receiver. We analyze the effect of co-channel interference and residual interference from the cooperative jammer on the secrecy rate.

IEEE Access•Jan 1, 2017•22 citations

On Secrecy Capacity of the Helper-Assisted Gaussian Wiretap Channel with Multi-Antennas

Lingxiang Li, Zhi Chen, Duo Zhang +1 more

We investigate the secrecy capacity of Gaussian wiretap channel with a source, an external helper, an eavesdropper and a single-antenna legitimate receiver where the former three terminals are equipped with $N_a$, $N_j$ and $N_e$ antennas, respectively. Generally, an analytical form of the secrecy capacity in this scenario is difficult to obtain. Instead, we recast the original nonconvex secrecy rate maximization (SRM) problem into a sequence of convex optimization problems. In doing so, the secrecy capacity can be obtained using a combination of convex optimization and a one-dimensional search. On the other hand, to gain more insight into how the secrecy capacity behaves, we study the secure degrees of freedom (s.d.o.f.) and quantify its connection with system parameters, where our result proves that the s.d.o.f. equal to 1 can be achieved if and only if N_e<N_a+N_j-1. As a by-product, we give a suboptimal but closed-form solution to the original SRM problem for the scenario where N_e<N_a+N_j-1.Numerical results are presented to validate the theoretical findings and illustrate the efficacy of the proposed schemes.

Globecom•Dec 1, 2015•0 citations

Cooperative Jamming for MIMO Wiretap Channels

Shuiyin Liu, Yi Hong, Emanuele Viterbo

Abstract—This paper addresses secure communications over MIMO wiretap channels with the help of multiple cooperative jammers. The worst-case scenario for Alice, Bob and jammers is considered: Eve has the knowledge of all channel matrices, while neither her channel matrix nor her location is known to the remaining terminals. We propose an artificial noise aided cooperative jamming (AN-CJ) scheme, allowing the total jamming signals to be nulled at Bob. The new scheme is valid for the case where the eavesdropper has more antennas than the transmitter. To evaluate the performance of the AN-CJ scheme, we first derive a closed-form expression for the achievable ergodic secrecy rate with Gaussian input alphabets. Then, we show how Gaussian input alphabets achieve the ergodic secrecy capacity. I.

•Jan 18, 2016•6 citations
We study the secrecy capacity of Gaussian wiretap channel aided by an external jammer/helper. Both the transmitter and the intended receiver are equipped with a single antenna, while the eavesdropper and the jammer are equipped withMMMandNNNantennas, respectively. Generally, an analytical form of the secrecy capacity in this scenario is difficult to obtain. Instead, we consider a null-space jamming scheme which totally nulls out the jamming signal at the legitimate receiver, and derive lower and upper bounds on its maximal achievable secrecy rateRN{R_N}RN​. The relationship between the average secrecy capacityCˉN{\bar C_N}CˉN​of Gaussian wiretap channel and the average secrecy rateRˉN{\bar R_N}RˉN​achieved by the null-space jamming scheme is investigated, and we prove thatRˉN≤CˉN≤RˉN+1{\bar R_N} \leq {\bar C_N} \leq {\bar R_{N + 1}}RˉN​≤CˉN​≤RˉN+1​. Based on this inequality and the derived lower and upper bounds onRN{R_N}RN​, the upper and lower bounds on the average secrecy capacity of Gaussian wiretap channel aided by an external jammer can be obtained, where our result shows that whenN>MN > MN>M, the average secrecy capacity increases linearly with the total transmit power; while whenN≤M−1N \leq M - 1N≤M−1, there exists a performance ceiling on it.
We study the Gaussian MISO wiretap channel with a transmitter, a legitimate receiver, an eavesdropper and an external helper, where the transmitter and the helper have an arbitrary number of antennas but the intended receiver and the eavesdropper have only one antenna. The transmitter sends confidential messages to its intended receiver, while the helper transmits jamming signals independent of the source message to confuse the eavesdropper. The jamming signal is assumed to be treated as noise at both the intended receiver and the eavesdropper. Assuming Gaussian signaling at the helper, we obtain the optimal beamformers at the transmitter and the helper that achieve the secrecy capacity.
We study the Gaussian MIMO wiretap channel with a transmitter, a legitimate receiver, an eavesdropper and an external helper, each equipped with multiple antennas. The transmitter sends confidential messages to its intended receiver, while the helper transmits jamming signals independent of the source message to confuse the eavesdropper. The jamming signal is assumed to be treated as noise at both the intended receiver and the eavesdropper. We obtain a closed-form expression for the structure of the artificial noise covariance matrix that guarantees a secrecy rate larger or at least equal to the secrecy capacity of the wiretap channel with no jamming signal. We also describe how to find specific realizations of this covariance matrix expression that provide good secrecy rate performance, even when there is no nontrivial null space between the helper and the intended receiver. Unlike prior work, our approach considers the general MIMO case, and is not restricted to SISO or MISO scenarios.
We study the secrecy capacity of a helper-assisted Gaussian wiretap channel with a source, a legitimate receiver, an eavesdropper and an external helper, where each terminal is equipped with multiple antennas. Determining the secrecy capacity in this scenario generally requires solving a nonconvex secrecy rate maximization (SRM) problem. To deal with this issue, we first reformulate the original SRM problem into a sequence of convex subproblems. For the special case of single-antenna legitimate receiver, we obtain the secrecy capacity via a combination of convex optimization and one-dimensional search, while for the general case of multi-antenna legitimate receiver, we propose an iterative solution. To gain more insight into how the secrecy capacity of a helper-assisted Gaussian wiretap channel behaves, we examine the achievable secure degrees of freedom (s.d.o.f.) and obtain the maximal achievable s.d.o.f. in closed-form. We also derive a closed-form solution to the original SRM problem which achieves the maximal s.d.o.f.. Numerical results are presented to illustrate the efficacy of the proposed schemes.
We consider a multiple-input multiple-output wiretap channel with one transmitter, one receiver, one cooperative jammer, and one eavesdropper whereby each node is equipped with multiple antennas. Eigenbeam-space division multiplexing (E-SDM) and cooperative jamming are known as techniques for improving secrecy rate. E-SDM enables the transmitter and the legitimate receiver to communicate with each other in parallel using channel state information known to them to maximize the legitimate receiver's mutual information. On the other hand, cooperative jamming is to jam only the eavesdropper to degrade the eavesdropper's mutual information. However, co-channel interference and residual interference from the cooperative jammer are caused by channel estimation errors, which degrade the legitimate receiver's mutual information. How these interferences affect the secrecy capacity has not been clarified. In this paper, we derive a lower bound on secrecy capacity using the legitimate receiver's mutual information in the presence of channel estimation errors and the mutual information of the eavesdropper who uses a minimum mean square error receiver. We analyze the effect of co-channel interference and residual interference from the cooperative jammer on the secrecy rate.
We investigate the secrecy capacity of Gaussian wiretap channel with a source, an external helper, an eavesdropper and a single-antenna legitimate receiver where the former three terminals are equipped with NaN_aNa​, NjN_jNj​ and NeN_eNe​ antennas, respectively. Generally, an analytical form of the secrecy capacity in this scenario is difficult to obtain. Instead, we recast the original nonconvex secrecy rate maximization (SRM) problem into a sequence of convex optimization problems. In doing so, the secrecy capacity can be obtained using a combination of convex optimization and a one-dimensional search. On the other hand, to gain more insight into how the secrecy capacity behaves, we study the secure degrees of freedom (s.d.o.f.) and quantify its connection with system parameters, where our result proves that the s.d.o.f. equal to 1 can be achieved if and only if N_e<N_a+N_j-1. As a by-product, we give a suboptimal but closed-form solution to the original SRM problem for the scenario where N_e<N_a+N_j-1.Numerical results are presented to validate the theoretical findings and illustrate the efficacy of the proposed schemes.
Abstract—This paper addresses secure communications over MIMO wiretap channels with the help of multiple cooperative jammers. The worst-case scenario for Alice, Bob and jammers is considered: Eve has the knowledge of all channel matrices, while neither her channel matrix nor her location is known to the remaining terminals. We propose an artificial noise aided cooperative jamming (AN-CJ) scheme, allowing the total jamming signals to be nulled at Bob. The new scheme is valid for the case where the eavesdropper has more antennas than the transmitter. To evaluate the performance of the AN-CJ scheme, we first derive a closed-form expression for the achievable ergodic secrecy rate with Gaussian input alphabets. Then, we show how Gaussian input alphabets achieve the ergodic secrecy capacity. I.