More Like this

1. A Friendly Interference Game in Wireless Secret Communication Networks

   https://doi.org/https://doi.org/10.1007/978-3-030-87473-5_4  

   Xu, Z. ; Baykal-Gürsoy, M. ( September 2021 , 10th International Conference on NETwork Games, COntrol and OPtimization (NetGCOOP))

   Filipe, J. ; Ghosh, A. ; Prates, R. O. ; Zhou, L. (Ed.)

   This paper considers a parallel wireless network in which multiple individuals exchange confidential information through independent sender-receiver links. An eavesdropper can intercept encrypted information through a degraded channel of each sender-receiver link. A friendly jammer, by applying interference to the eavesdropping channels, can increase the level of secrecy of the network. The optimal power allocation strategy of the friendly jammer under a power constraint is derived. A convex optimization model is used when all channels are under the threat of an eavesdropping attack and a non-zero sum game model is analyzed when the eavesdropper can only attack a limited quantity of channels. 

   more » « less
2. Gaussian Multiuser Wiretap Channels in the Presence of a Jammer-Aided Eavesdropper

   https://doi.org/10.3390/e24111595  

   Chou, Rémi A. ; Yener, Aylin ( November 2022 , Entropy)

   This paper considers secure communication in the presence of an eavesdropper and a malicious jammer. The jammer is assumed to be oblivious of the communication signals emitted by the legitimate transmitter(s) but can employ any jamming strategy subject to a given power constraint and shares her jamming signal with the eavesdropper. Four such models are considered: (i) the Gaussian point-to-point wiretap channel; (ii) the Gaussian multiple-access wiretap channel; (iii) the Gaussian broadcast wiretap channel; and (iv) the Gaussian symmetric interference wiretap channel. The use of pre-shared randomness between the legitimate users is not allowed in our models. Inner and outer bounds are derived for these four models. For (i), the secrecy capacity is obtained. For (ii) and (iv) under a degraded setup, the optimal secrecy sum-rate is characterized. Finally, for (iii), ranges of model parameter values for which the inner and outer bounds coincide are identified. 

   more » « less
3. A Game-Theoretic Approach for Probabilistic Cooperative Jamming Strategies over Parallel Wireless Channels

   https://doi.org/10.1109/CNS53000.2021.9705044  

   Xu, Zhifan ; Baykal-Gursoy, Melike ; Spasojevic, Predrag ( October 2021 , 2021 IEEE Conference on Communications and Network Security (CNS))

   Considered is a network of parallel wireless channels in which individual parties are engaged in secret communication under the protection of cooperative jamming. A strategic eavesdropper selects the most vulnerable channels to attack. Existing works usually suggest the defender allocate limited cooperative jamming power to various channels. However, it usually requires some strong assumptions and complex computation to find such an optimal power control policy. This paper proposes a probabilistic cooperative jamming scheme such that the defender focuses on protecting randomly selected channels. Two different cases regarding each channel’s eavesdropping capacity are discussed. The first case studies the general scenario where each channel has different eavesdropping capacity. The second case analyzes an extreme scenario where all channels have the same eavesdropping capacity. Two non-zero-sum Nash games model the competition between the network defender and an eavesdropper in each case. Furthermore, considering the case that the defender does not know the eavesdropper’s channel state information (CSI) leads to a Bayesian game. For all three games, we derive conditions for the existence of a unique Nash equilibrium (NE), and obtain the equilibria and the value functions in closed form. 

   more » « less
4. Maintaining Information Freshness under Jamming

   https://doi.org/10.1109/INFCOMW.2019.8845146  

   Garnaev, Andrey ; Zhang, Wuyang ; Zhong, Jing ; Yates, Roy D. ( April 2019 , IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS))

   In UAV communication with a ground control station, mission success requires maintaining the freshness of the received information, especially when the communication faces hostile interference. We model this problem as a game between a UAV transmitter and an adversarial interferer. We prove that in contrast with the Nash equilibrium, multiple Stackelberg equilibria could arise. This allows us to show that reducing interference activity in the Stackelberg game is achieved by higher sensitivity of the transmitter in the Stackelberg equilibrium strategy to network parameters relative to the Nash equilibrium strategy. All the strategies are derived in closed form and we establish the condition for when multiple strategies arise. 

   more » « less
5. Secure Degrees of Freedom in Networks with User Misbehavior

   https://doi.org/10.3390/e21100945  

   Banawan, Karim ; Ulukus, Sennur ( October 2019 , Entropy)

   We investigate the secure degrees of freedom (s.d.o.f.) of three new channel models: broadcast channel with combating helpers, interference channel with selfish users, and multiple access wiretap channel with deviating users. The goal of introducing these channel models is to investigate various malicious interactions that arise in networks, including active adversaries. That is in contrast with the common assumption in the literature that the users follow a certain protocol altruistically and transmit both message-carrying and cooperative jamming signals in an optimum manner. In the first model, over a classical broadcast channel with confidential messages (BCCM), there are two helpers, each associated with one of the receivers. In the second model, over a classical interference channel with confidential messages (ICCM), there is a helper and users are selfish. By casting each problem as an extensive-form game and applying recursive real interference alignment, we show that, for the first model, the combating intentions of the helpers are neutralized and the full s.d.o.f. is retained; for the second model, selfishness precludes secure communication and no s.d.o.f. is achieved. In the third model, we consider the multiple access wiretap channel (MAC-WTC), where multiple legitimate users wish to have secure communication with a legitimate receiver in the presence of an eavesdropper. We consider the case when a subset of users deviate from the optimum protocol that attains the exact s.d.o.f. of this channel. We consider two kinds of deviation: when some of the users stop transmitting cooperative jamming signals, and when a user starts sending intentional jamming signals. For the first scenario, we investigate possible responses of the remaining users to counteract such deviation. For the second scenario, we use an extensive-form game formulation for the interactions of the deviating and well-behaving users. We prove that a deviating user can drive the s.d.o.f. to zero; however, the remaining users can exploit its intentional jamming signals as cooperative jamming signals against the eavesdropper and achieve an optimum s.d.o.f. 

   more » « less