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

arXiv:1011.5274 · IEEE Transactions on Signal Processing

Jamming Games in the MIMO Wiretap Channel With an Active Eavesdropper

Amitav Mukherjee, Arnold Lee Swindlehurst

Published Oct 3, 2012• 153 citations
arXivHTMLPDF

Abstract

This paper investigates reliable and covert transmission strategies in a multiple-input multiple-output (MIMO) wiretap channel with a transmitter, receiver and an adversarial wiretapper, each equipped with multiple antennas. In a departure from existing work, the wiretapper possesses a novel capability to act either as a passive eavesdropper or as an active jammer, under a half-duplex constraint. The transmitter therefore faces a choice between allocating all of its power for data, or broadcasting artificial interference along with the information signal in an attempt to jam the eavesdropper (assuming its instantaneous channel state is unknown). To examine the resulting trade-offs for the legitimate transmitter and the adversary, we model their interactions as a two-person zero-sum game with the ergodic MIMO secrecy rate as the payoff function. We first examine conditions for the existence of pure-strategy Nash equilibria (NE) and the structure of mixed-strategy NE for the strategic form of the game. We then derive equilibrium strategies for the extensive form of the game where players move sequentially under scenarios of perfect and imperfect information. Finally, numerical simulations are presented to examine the equilibrium outcomes of the various scenarios considered.

DOI
10.1109/tsp.2012.2222386

Related papers

Optimal strategies for countering dual-threat jamming/eavesdropping-capable adversaries in MIMO channels

Amitav Mukherjee, Arnold Lee Swindlehurst

This paper investigates transmission strategies in a MIMO wiretap channel with a transmitter, receiver and wiretapper, each equipped with multiple antennas. In a departure from existing work, the wiretapper is able to act either as a passive eavesdropper or as an active jammer per channel use, under a half-duplex constraint. The transmitter therefore faces a choice between dynamically allocating all of its power for data; or broadcasting artificial noise along with the information signal in order to selectively degrade the eavesdropper's channel. We model the network as a zero-sum game in strategic form with the MIMO secrecy rate as the payoff function. We first carry out a detailed analysis of the various rate outcomes that result from the possible actions of the agents. We then discuss the conditions for equilibrium outcomes in the strategic form of the game. Finally, numerical simulations are presented to corroborate the analytical results.

IEEE Military Communications Conference (MILCOM)•Oct 1, 2010•32 citations

Equilibrium Outcomes of Dynamic Games in MIMO Channels with Active Eavesdroppers

A. Mukherjee, Arnold Lee Swindlehurst

This paper investigates transmission strategies in a MIMO wiretap channel with a transmitter, receiver and wiretapper, each equipped with multiple antennas. The secrecy rate between the transmitter and the legitimate receiver is chosen as the performance metric. In a departure from existing work, the wiretapper is able to act either as a passive eavesdropper or as an active jammer, under a half-duplex constraint. The transmitter therefore faces a choice between allocating all of its power for data; or broadcasting artificial noise along with the information signal in order to selectively degrade the eavesdropper's channel. We model the network as a dynamic zero-sum game in extensive form with the secrecy rate as the payoff function. We first examine subgame-perfect equilibrium strategies in the extensive form of the game with perfect information. We then discuss sequential and trembling hand perfect equilibria for the case of imperfect information. Finally, numerical simulations are presented to corroborate the analytical results.

International Conference on Communications•May 1, 2010•19 citations

Wiretap Channel With Full-Duplex Proactive Eavesdropper: A Game Theoretic Approach

Wei Huang, Wei Chen, Bo Bob Bai +1 more

With the emergence of physical layer security, there has been an increasing interest toward its framework comprising a wiretap channel with a transmitter, a receiver, and an eavesdropper. In this paper, the eavesdropper operates in a full-duplex mode so as to reduce the secrecy rate of the transmitter-receiver pair through simultaneous wiretapping and jamming. On the other hand, the transmitter-receiver pair aims to increase its achievable secrecy rate. To examine the power decision processes between the transmitter and the eavesdropper, a two-player noncooperative game is proposed. We first provide sufficient conditions for the existence of the pure-strategy Nash equilibrium (NE), and then derive the closed-form NEs for two special cases, i.e., the eavesdropper close to and far away from the receiver. For discrete approximation of the game, we utilize a fictitious play-based algorithm to achieve the mixed-strategy NE. Based on the equilibrium, a switch policy is provided for the eavesdropper to determine its optimal mode between the full-duplex and half-duplex, depending on the self-interference and location. Numerical results show that this switch policy improves the monitoring performance in terms of utility, which is the linear combination of the secrecy rate and the power consumption.

IEEE Transactions on Vehicular Technology•May 15, 2018•22 citations

Cooperation for secrecy in presence of an active eavesdropper: A game-theoretic analysis

Frédéric Gabry, Ragnar Thobaben, Mikael Skoglund

In this paper, we investigate a four single-antenna node network, constituted of a transmitter, a receiver, a cooperative node and a wiretapper. The wiretapper has the ability to eavesdrop the communication or disrupt the transmission by jamming. This results in both cases in the decrease of the secrecy rate. The cooperative node on the other hand aims to improve secrecy by either relaying or jamming. We investigate the secrecy performance of the decode-and-forward and cooperative jamming strategies against this kind of adversary. To model the interaction between the helper and the wiretapper, we define an extensive form game, for which we derive the pure and mixed strategies equilibria. Finally, we compare the performance of the schemes and we analyze the equilibrium outcomes through simulation results.

International Symposium on Wireless Communication Systems•Nov 1, 2011•3 citations

Friendly Jamming in a MIMO Wiretap Interference Network: A Nonconvex Game Approach

Peyman Siyari, Marwan Krunz, Diep Ngoc Nguyen

We consider joint optimization of artificial noise (AN) and information signals in a MIMO wiretap interference network, wherein the transmission of each link may be overheard by several MIMO-capable eavesdroppers. Each information signal is accompanied with AN, generated by the same user to confuse nearby eavesdroppers. Using a noncooperative game, a distributed optimization mechanism is proposed to maximize the secrecy rate of each link. The decision variables here are the covariance matrices for the information signals and ANs. However, the nonconvexity of each link's optimization problem (i.e., best response) makes conventional convex games inapplicable, even to find whether a Nash equilibrium (NE) exists. To tackle this issue, we analyze the proposed game using a relaxed equilibrium concept, called quasi-NE (QNE). Under a constraint qualification condition for each player's problem, the set of QNEs includes the NE of the proposed game. We also derive the conditions for the existence and uniqueness of the resulting QNE. It turns out that the uniqueness conditions are too restrictive, and do not always hold in typical network scenarios. Thus, the proposed game often has multiple QNEs, and convergence to a QNE is not always guaranteed. To overcome these issues, we modify the utility functions of the players by adding several specific terms to each utility function. The modified game converges to a QNE even when multiple QNEs exist. Furthermore, players have the ability to select a desired QNE that optimizes a given social objective (e.g., sum rate or secrecy sum rate). Depending on the chosen objective, the amount of signaling overhead as well as the performance of resulting QNE can be controlled. Simulations show that not only can we guarantee the convergence to a QNE, but also due to the QNE selection mechanism, we can achieve a significant improvement in terms of secrecy sum rate and power efficiency, especially in dense networks.

arXiv:1612.08069•IEEE Journal on Selected Areas in Communications•Jan 26, 2017•23 citations

A zero-sum power allocation game over OFDM Gaussian wiretap channel with dual jamming

Munnujahan Ara, Samah A. M. Ghanem

We investigate optimal power allocation strategies over a OFDM Gaussian wiretap channels where a legitimate transmitter and a legitimate receiver communicate in the presence of an eavesdropper and a jammer-who acts as unfriendly to both the legitimate parties and the eavesdropper. In particular, we formulate a zero-sum power allocation game between the transmitter and the jammer where the payoff function is the secrecy rate. We characterize the optimal power allocation strategies as well as the Nash equilibrium in some asymptotic regimes. We also provide a set of results that cast further insight into the problem.

IEEE International WIE Conference on Electrical and Computer Engineering•Dec 1, 2015•2 citations
This paper investigates reliable and covert transmission strategies in a multiple-input multiple-output (MIMO) wiretap channel with a transmitter, receiver and an adversarial wiretapper, each equipped with multiple antennas. In a departure from existing work, the wiretapper possesses a novel capability to act either as a passive eavesdropper or as an active jammer, under a half-duplex constraint. The transmitter therefore faces a choice between allocating all of its power for data, or broadcasting artificial interference along with the information signal in an attempt to jam the eavesdropper (assuming its instantaneous channel state is unknown). To examine the resulting trade-offs for the legitimate transmitter and the adversary, we model their interactions as a two-person zero-sum game with the ergodic MIMO secrecy rate as the payoff function. We first examine conditions for the existence of pure-strategy Nash equilibria (NE) and the structure of mixed-strategy NE for the strategic form of the game. We then derive equilibrium strategies for the extensive form of the game where players move sequentially under scenarios of perfect and imperfect information. Finally, numerical simulations are presented to examine the equilibrium outcomes of the various scenarios considered.
This paper investigates transmission strategies in a MIMO wiretap channel with a transmitter, receiver and wiretapper, each equipped with multiple antennas. In a departure from existing work, the wiretapper is able to act either as a passive eavesdropper or as an active jammer per channel use, under a half-duplex constraint. The transmitter therefore faces a choice between dynamically allocating all of its power for data; or broadcasting artificial noise along with the information signal in order to selectively degrade the eavesdropper's channel. We model the network as a zero-sum game in strategic form with the MIMO secrecy rate as the payoff function. We first carry out a detailed analysis of the various rate outcomes that result from the possible actions of the agents. We then discuss the conditions for equilibrium outcomes in the strategic form of the game. Finally, numerical simulations are presented to corroborate the analytical results.
This paper investigates transmission strategies in a MIMO wiretap channel with a transmitter, receiver and wiretapper, each equipped with multiple antennas. The secrecy rate between the transmitter and the legitimate receiver is chosen as the performance metric. In a departure from existing work, the wiretapper is able to act either as a passive eavesdropper or as an active jammer, under a half-duplex constraint. The transmitter therefore faces a choice between allocating all of its power for data; or broadcasting artificial noise along with the information signal in order to selectively degrade the eavesdropper's channel. We model the network as a dynamic zero-sum game in extensive form with the secrecy rate as the payoff function. We first examine subgame-perfect equilibrium strategies in the extensive form of the game with perfect information. We then discuss sequential and trembling hand perfect equilibria for the case of imperfect information. Finally, numerical simulations are presented to corroborate the analytical results.
With the emergence of physical layer security, there has been an increasing interest toward its framework comprising a wiretap channel with a transmitter, a receiver, and an eavesdropper. In this paper, the eavesdropper operates in a full-duplex mode so as to reduce the secrecy rate of the transmitter-receiver pair through simultaneous wiretapping and jamming. On the other hand, the transmitter-receiver pair aims to increase its achievable secrecy rate. To examine the power decision processes between the transmitter and the eavesdropper, a two-player noncooperative game is proposed. We first provide sufficient conditions for the existence of the pure-strategy Nash equilibrium (NE), and then derive the closed-form NEs for two special cases, i.e., the eavesdropper close to and far away from the receiver. For discrete approximation of the game, we utilize a fictitious play-based algorithm to achieve the mixed-strategy NE. Based on the equilibrium, a switch policy is provided for the eavesdropper to determine its optimal mode between the full-duplex and half-duplex, depending on the self-interference and location. Numerical results show that this switch policy improves the monitoring performance in terms of utility, which is the linear combination of the secrecy rate and the power consumption.
In this paper, we investigate a four single-antenna node network, constituted of a transmitter, a receiver, a cooperative node and a wiretapper. The wiretapper has the ability to eavesdrop the communication or disrupt the transmission by jamming. This results in both cases in the decrease of the secrecy rate. The cooperative node on the other hand aims to improve secrecy by either relaying or jamming. We investigate the secrecy performance of the decode-and-forward and cooperative jamming strategies against this kind of adversary. To model the interaction between the helper and the wiretapper, we define an extensive form game, for which we derive the pure and mixed strategies equilibria. Finally, we compare the performance of the schemes and we analyze the equilibrium outcomes through simulation results.
We consider joint optimization of artificial noise (AN) and information signals in a MIMO wiretap interference network, wherein the transmission of each link may be overheard by several MIMO-capable eavesdroppers. Each information signal is accompanied with AN, generated by the same user to confuse nearby eavesdroppers. Using a noncooperative game, a distributed optimization mechanism is proposed to maximize the secrecy rate of each link. The decision variables here are the covariance matrices for the information signals and ANs. However, the nonconvexity of each link's optimization problem (i.e., best response) makes conventional convex games inapplicable, even to find whether a Nash equilibrium (NE) exists. To tackle this issue, we analyze the proposed game using a relaxed equilibrium concept, called quasi-NE (QNE). Under a constraint qualification condition for each player's problem, the set of QNEs includes the NE of the proposed game. We also derive the conditions for the existence and uniqueness of the resulting QNE. It turns out that the uniqueness conditions are too restrictive, and do not always hold in typical network scenarios. Thus, the proposed game often has multiple QNEs, and convergence to a QNE is not always guaranteed. To overcome these issues, we modify the utility functions of the players by adding several specific terms to each utility function. The modified game converges to a QNE even when multiple QNEs exist. Furthermore, players have the ability to select a desired QNE that optimizes a given social objective (e.g., sum rate or secrecy sum rate). Depending on the chosen objective, the amount of signaling overhead as well as the performance of resulting QNE can be controlled. Simulations show that not only can we guarantee the convergence to a QNE, but also due to the QNE selection mechanism, we can achieve a significant improvement in terms of secrecy sum rate and power efficiency, especially in dense networks.
We investigate optimal power allocation strategies over a OFDM Gaussian wiretap channels where a legitimate transmitter and a legitimate receiver communicate in the presence of an eavesdropper and a jammer-who acts as unfriendly to both the legitimate parties and the eavesdropper. In particular, we formulate a zero-sum power allocation game between the transmitter and the jammer where the payoff function is the secrecy rate. We characterize the optimal power allocation strategies as well as the Nash equilibrium in some asymptotic regimes. We also provide a set of results that cast further insight into the problem.