Related papers: A Secure Communication Game with a Relay Helping t…
This paper investigates the performance of a legitimate surveillance system, where a legitimate monitor aims to eavesdrop on a dubious decode-and-forward relaying communication link. In order to maximize the effective eavesdropping rate,…
We present a moving target defense strategy to reduce the impact of stealthy sensor attacks on feedback systems. The defender periodically and randomly switches between thresholds from a discrete set to increase the uncertainty for the…
In this letter, we investigate the security of a single-antenna rechargeable source node in the presence of a multi-antenna rechargeable cooperative jammer and a potential single-antenna eavesdropper. The batteries at the legitimate…
This paper concerns maximizing the minimum achievable secrecy rate of a two-way relay network in the presence of an eavesdropper, in which two nodes aim to exchange messages in two hops, using a multi-antenna relay. Throughout the first…
This paper investigates the equilibrium convergence properties of a proposed algorithm for potential games with continuous strategy spaces in the presence of feedback delays, a main challenge in multi-agent systems that compromises the…
Deception plays a critical role in many interactions in communication and network security. Game-theoretic models called "cheap talk signaling games" capture the dynamic and information asymmetric nature of deceptive interactions. But…
We consider the problem of secure communications over the two-way wiretap channel under a strong secrecy criterion. We improve existing results by developing an achievable region based on strategies that exploit both the interference at the…
The existing research on physical layer security commonly assumes the number of eavesdropper antennas to be known. Although this assumption allows one to easily compute the achievable secrecy rate, it can hardly be realized in practice. In…
This paper brings the novel idea of paying the utility to the winning agents in terms of some physical entity in cooperative communications. Our setting is a secret two-way communication channel where two transmitters exchange information…
This paper considers the problem of Nash equilibrium (NE) seeking in aggregative games, where the payoff function of each player depends on an aggregate of all players' actions. We present a distributed continuous time algorithm such that…
This paper analyzes the secrecy performance of a reconfigurable intelligent surface (RIS) assisted wireless communication system with a friendly jammer in the presence of an eavesdropper. The friendly jammer enhances the secrecy by…
This work proposes a novel distributed approach for computing a Nash equilibrium in convex games with restricted strongly monotone pseudo-gradients. By leveraging the idea of the centralized operator extrapolation method presented in [4] to…
The behavior of rational and selfish players (receivers) over a multiple-input multiple-output Gaussian broadcast channel is investigated using the framework of noncooperative game theory. In contrast to the game-theoretic model of the…
We consider a Gaussian interference channel with independent direct and cross link channel gains, each of which is independent and identically distributed across time. Each transmitter-receiver user pair aims to maximize its long-term…
The basic problem of secure bidirectional relaying involves two users who want to exchange messages via an intermediate "honest-but-curious" relay node. There is no direct link between the users, all communication must take place via the…
The General Gaussian Multiple Access Wire-Tap Channel (GGMAC-WT) and the Gaussian Two-Way Wire-Tap Channel (GTW-WT) are considered. In the GGMAC-WT, multiple users communicate with an intended receiver in the presence of an eavesdropper who…
In this paper, we consider the design of a new secrecy transmission scheme for a four-node relay-eavesdropper channel. The key idea of the proposed scheme is to combine noisy network coding with the interference assisted strategy for…
We consider the basic bidirectional relaying problem, in which two users in a wireless network wish to exchange messages through an intermediate relay node. In the compute-and-forward strategy, the relay computes a function of the two…
We consider a Gaussian multiple access channel with $K$ transmitters, a (intended) receiver and an external eavesdropper. The transmitters wish to reliably communicate with the receiver while concealing their messages from the eavesdropper.…
We consider a secure communication scenario through the two-user Gaussian interference channel: each transmitter (user) has a confidential message to send reliably to its intended receiver while keeping it secret from the other receiver.…