Related papers: A Secure Communication Game with a Relay Helping t…
We study pure Nash equilibria in infinite-duration games on graphs, with partial visibility of actions but communication (based on a graph) among the players. We show that a simple communication mechanism consisting in reporting the…
In this paper we investigate cooperative secure communications in a four-node cognitive radio network where the secondary receiver is treated as a potential eavesdropper with respect to the primary transmission. The secondary user is…
We have evaluated the optimal secrecy rate for Amplify-and-Forward (AF) relay networks with multiple eavesdroppers. Assuming i.i.d. Gaussian noise at the destination and the eavesdroppers, we have devised technique to calculate optimal…
This paper investigates the privacy-preserving distributed Nash equilibrium seeking problem for aggregative games. A novel differential privacy mechanism is designed by incorporating stochastic event-triggering with stochastic quantization,…
We investigate the behavior of two users and one jammer in an AWGN channel with and without fading when they participate in a non-cooperative zero-sum game, with the channel's input/output mutual information as the objective function. We…
In this paper, we examine the secrecy performance of two-way relaying between a multiple antenna base station (BS) and a single antenna mobile user (MU) in the presence of a multiple antenna friendly jammer (FJ). We consider the untrusted…
In this paper, we consider a novel $M$-ary sequential hypothesis testing problem in which an adversary is present and perturbs the distributions of the samples before the decision maker observes them. This problem is formulated as a…
Linking two network flows that have the same source is essential in intrusion detection or in tracing anonymous connections. To improve the performance of this process, the flow can be modified (fingerprinted) to make it more…
We study the secure lossy transmission of a vector Gaussian source to a legitimate user in the presence of an eavesdropper, where both the legitimate user and the eavesdropper have vector Gaussian side information. The aim of the…
Relay selection is considered to enhance the secrecy of a dual-hop regenerative multi-relay system with an eavesdropper. Without assuming perfect decoding at the relays, the secrecy outage probability of a single relay system is obtained…
The secrecy of a communication system in which both the legitimate receiver and an eavesdropper are allowed some distortion is investigated. The secrecy metric considered is the exponent of the probability that the eavesdropper estimates…
Current research in distributed Nash equilibrium (NE) seeking in the partial information setting assumes that information is exchanged between agents that are "truthful". However, in general noncooperative games agents may consider sending…
A visible light communication broadcast channel is considered, in which a transmitter luminaire communicates with two legitimate receivers in the presence of an external eavesdropper. A number of trusted cooperative half-duplex relay…
This paper aims to balance performance and cost in a two-hop wireless cooperative communication network where the source and relays have contradictory optimization goals and make decisions in a distributed manner. This differs from most…
In this paper, we consider an active eavesdropping scenario in a cooperative system consisting of a source, a destination, and an active eavesdropper with multiple decode-and-forward relays. Considering an existing assumption in which an…
In this paper, the secrecy of a cooperative system consisting of a single source, relay, destination and eavesdropper is analyzed. The threshold-selection decode-and-forward relay is considered, where the relay can correctly decode and…
We consider a relay-assisted wireless network, where the energy-harvesting buffer-aided relay node is powered by radio-frequency signals from a source node wishing to communicate with its destination. We propose two secure cooperative…
Bidirectional relaying, where a relay helps two user nodes to exchange equal length binary messages, has been an active area of recent research. A popular strategy involves a modified Gaussian MAC, where the relay decodes the XOR of the two…
We study the problem of computing approximate Nash equilibria of bimatrix games, in a setting where players initially know their own payoffs but not the payoffs of the other player. In order for a solution of reasonable quality to be found,…
This paper considers a Gaussian multi-input multi-output (MIMO) wiretap channel with a legitimate transmitter, a legitimate receiver (Bob), an eavesdropper (Eve), and a cooperative jammer. All nodes may be equipped with multiple antennas.…