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

Conference on Information Sciences and Systems

A Fair Anti-Eavesdropping Strategy for Communication with Several Receivers

Andrey Garnaev, Wade K. Trappe

Published Mar 13, 2024• 0 citations
Publisher

Abstract

Wireless network communication of a transmitter with a group of receivers (nodes) is susceptible to malicious eavesdropping attacks. In this paper, motivated by the observation that maximizing the secrecy rate protocol might lead to neglecting communication with some nodes, we suggest designing a protocol to maximize fairness of the secrecy rates, specifically, α− fairness, in the transmitter’s communication with all the nodes. The problem is modeled in a non-zero-sum game-theoretical framework between a transmitter and an adversary (eavesdropper). Equilibrium strategies are derived in closed form and their uniqueness is proven which reflects the stability of the suggested transmission protocol. Moreover, although an equilibrium is established as unique for each fixed fairness coefficient, all together it results in a continuum of transmission protocols, one protocol per fairness coefficient. To deal with this issue, in this paper, we suggest using a trade-off fairness coefficient between the expected secrecy rate of the whole nodes’ group and the expected secrecy rate of the worst-off secrecy rate node, reflecting "a weak link" in the communication, as the best protocol among all such fair protocols in its application. The derived equilibria and trade-off fairness coefficient are numerically illustrated.

DOI
10.1109/ciss59072.2024.10480183

Related papers

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

Jamming Strategies for Secure Wireless Communication

Reza Sohrabi

As the technology and computing power advance day by day, physical layer security in wireless communications gains more importance. It allows the security of wireless communications based on information theoretical guarantees without the need for cryptography. One important practical challenge for physical layer security arises from the fact that no information about the passive eavesdroppers is available to the legitimate nodes. Without such information, optimizing the transmission parameters has always been a difficult task. In this study we aim to address various challenging aspects about this issue and propose a new perspective into the analysis of secrecy with a focus on jamming. We start from the case of eavesdropper's channel state information (CSI) known to users in a three-node single-antenna multi-subcarrier network and present an improved optimization algorithm compared to previous methods. Then we expand our horizon to the case of multiple-antenna nodes with eavesdropper's CSI unknown to users. We investigate a secure wireless communication scheme which combines two of the most effective strategies to combat eavesdropping, namely mixing information with artificial noise at the transmitter and jamming from a full-duplex receiver. While such setup has been investigated in related works, new and important insights are revealed in this study. We investigate the design of optimal jamming parameters to achieve higher secrecy.We then derive a closed-form expression for asymptotic normalized instantaneous secrecy rate of our model. Based on the results of the asymptotic analysis, we propose an alternative less complex tractable optimization problem for the design of optimal transmission parameters to achieve higher secrecy. We show that even with the optimal parameters, secrecy is compromised if Eve is able to increase her number of antennas. To address this issue, we provide a comprehensive analysis of a new scheme called anti-eavesdropping channel estimation (ANECE) which prevents Eve from acquiring accurate channel estimations. We show that the usage of such scheme, makes it extremely hard for Eve to drive secrecy to zero. Numerical analyses and simulations are presented to support the arguments made in this study.We then derive a closed-form expression for asymptotic normalized instantaneous secrecy rate of our model. Based on the results of the asymptotic analysis, we propose an alternative less complex tractable optimization problem for the design of optimal transmission parameters to achieve higher secrecy. We show that even with the optimal parameters, secrecy is compromised if Eve is able to increase her number of antennas. To address this issue, we provide a comprehensive analysis of a new scheme called anti-eavesdropping channel estimation (ANECE) which prevents Eve from acquiring accurate channel estimations. We show that the usage of such scheme, makes it extremely hard for Eve to drive secrecy to zero. Numerical analyses and simulations are presented to support the arguments made in this study.We then derive a closed-form expression for asymptotic normalized instantaneous secrecy rate of our model. Based on the results of the asymptotic analysis, we propose an alternative less complex tractable optimization problem for the design of optimal transmission parameters to achieve higher secrecy. We show that even with the optimal parameters, secrecy is compromised if Eve is able to increase her number of antennas. To address this issue, we provide a comprehensive analysis of a new scheme called anti-eavesdropping channel estimation (ANECE) which prevents Eve from acquiring accurate channel estimations. We show that the usage of such scheme makes it extremely hard for Eve to drive secrecy to zero. Numerical analyses and simulations are presented to support the arguments made in this study.

•Jan 1, 2018•0 citations

Secure transmission with artificial noise in the multiuser downlink: Secrecy sum-rate and optimal power allocation

Na Li, Xiaofeng Tao, Qimei Cui +1 more

Wireless communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy issues have become increasingly critical for wireless networks. This paper considers the problem of secret communication in the multiuser downlink eavesdropped by a passive eavesdropper (EVE). The well-known zero-forcing preceding is adopted at the transmitter to produce concurrent data streams to the users, and at the same time an artificial noise (AN) is generated to prevent EVE from intercepting the information. We first derive an analytical closed-form expression for the secrecy sum-rate in the large system limit. We then use it as the objective function to optimize the power allocation (PA) between the information signals and the AN to maximize the secrecy sum-rate. A simple analytical expression of the optimal PA is derived in the high transmit power regime, which proves to be a near-optimal and generic strategy. The large system results are quite accurate for finite-size systems and thus can provide useful insights into system analysis and design. Our analytical and simulation results show that the AN assisted strategy achieves the same multiplexing gain as in the multiuser downlink without eavesdropping. Moreover, more power should be allocated to AN when the system serves fewer users and EVE has more antennas.

IEEE Wireless Communications and Networking Conference•Mar 1, 2015•6 citations

Guaranteed Payoffs Resource Allocation Problem With Application to Countering Reinforced Eavesdropping

Andrey Garnaev, Wade K. Trappe

Wireless communication between a transmitter (e.g., an operator) and agents (e.g., drones) may be vulnerable to eavesdropping attacks on some or all agents. A drawback of the traditional communication approach that aims to maximize the total secrecy capacity is that it may neglect communication with specific agents, thereby leading to mission failure for those agents. To address this drawback, we develop and solve a novel guaranteed-payoffs problem that generalizes max-min optimization in a resource-restricted setting and prove that its solution combines egalitarian and water-filling properties. The developed generalization is a convenient tool for researchers to apply across different research areas. Based on this, we design an anti-eavesdropping strategy that maximizes the minimal secrecy capacity of communication with agents facing an adversary capable of reinforcing eavesdropping devices in a game-theoretic framework. Robustness of the derived anti-eavesdropping strategy is proven, and strategies are illustrated.

IEEE Communications Letters•Jan 1, 2026•0 citations

Cooperation for Secrecy in Wireless Networks

Frédéric Gabry

The growth of wireless networks has been considerable over the last decades. Due to the broadcast nature of these networks, security issues have taken a critical role in today’s communications. A promising direction towards achieving secure communications is information theoretic secrecy, which is an approach exploiting the randomness of the channels to ensure secrecy. Based on this approach, there has been a recent surge of interest in a potential cooperation between users to enhance the secrecy of communications. In this thesis we investigate the interaction between cooperation and secrecy. In particular the contributions of the thesis can be divided into two parts. In the first part, we study cooperative strategies for secrecy for wireless channels. Our goal is to evaluate the effect of fading and limited CSI on the eavesdropper’s channels. In that purpose we consider a scenario where a helper aims at increasing the secrecy of the communication between a source and destination in the presence of an eavesdropper. Several strategies are discussed for the helper, namely decode-and-forward, amplify-and-forward, and cooperative jamming. We introduce the secrecy outage probability, the conditional secrecy outage probability and the secure throughput as secrecy measures. For each measure, we investigate and compare the secrecy performance of cooperation. We furthermore elaborate a system optimization in terms of strategy selection, node positioning, power allocation and rate design. In the second part, we consider cooperation in the 4-node scenario against a more sophisticated adversary: an active eavesdropper, which can either passively eavesdrop, or jam the transmission. A game-theoretic perspective is a natural way to analyze the competitive interaction between the helper and the eavesdropper. Therefore we define several secrecy games, for which we find the Nash and Stackelberg equilibria as well as the corresponding secrecy rate outcomes. Another important consideration in this scenario is the interaction between the source and the helper, which we model and solve as a Stackelberg game, and we illustrate its impact on the achievable secrecy rates.

•Jan 1, 2012•5 citations

Secrecy Rate Optimization for Secure Multicast Communications

Kanapathippillai Cumanan, Zhiguo Ding, Mai Xu +1 more

Recently, physical layer security has been recognized as a new design paradigm to provide security in wireless networks. In contrast to the existing conventional cryptographic methods, physical layer security exploits the dynamics of fading channels to enhance security of wireless communications. This paper studies optimization frameworks for a multicasting network in which a transmitter broadcasts the same information to a group of legitimate users in the presence of multiple eavesdroppers. In particular, power minimization and secrecy rate maximization problems are investigated for a multicasting secrecy network. First, the power minimization problem is solved for different numbers of legitimate users and eavesdroppers. Next, the secrecy rate maximization problem is investigated with the help of private jammers to improve the achievable secrecy rates through a game theoretic approach. These jammers charge the transmitter for their jamming services based on the amount of interference caused to the eavesdroppers. For a fixed interference price scenario, a closed-form solution for the optimal interference requirement to maximize the revenue of the transmitter is derived. This rate maximization problem for a nonfixed interference price scenario is formulated as a Stackelberg game in which the jammers and transmitter are the leaders and follower, respectively. For the proposed game, a Stackelberg equilibrium is derived to maximize the revenues of both the transmitter and the private jammers. To support the derived theoretical results, simulation results are provided with different numbers of legitimate users and eavesdroppers. In addition, these results show that physical layer security based jamming schemes could be incorporated in emerging and future wireless networks to enhance the quality of secure communications.

IEEE Journal of Selected Topics in Signal Processing•Aug 16, 2016•58 citations
Wireless network communication of a transmitter with a group of receivers (nodes) is susceptible to malicious eavesdropping attacks. In this paper, motivated by the observation that maximizing the secrecy rate protocol might lead to neglecting communication with some nodes, we suggest designing a protocol to maximize fairness of the secrecy rates, specifically, α− fairness, in the transmitter’s communication with all the nodes. The problem is modeled in a non-zero-sum game-theoretical framework between a transmitter and an adversary (eavesdropper). Equilibrium strategies are derived in closed form and their uniqueness is proven which reflects the stability of the suggested transmission protocol. Moreover, although an equilibrium is established as unique for each fixed fairness coefficient, all together it results in a continuum of transmission protocols, one protocol per fairness coefficient. To deal with this issue, in this paper, we suggest using a trade-off fairness coefficient between the expected secrecy rate of the whole nodes’ group and the expected secrecy rate of the worst-off secrecy rate node, reflecting "a weak link" in the communication, as the best protocol among all such fair protocols in its application. The derived equilibria and trade-off fairness coefficient are numerically illustrated.
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.
As the technology and computing power advance day by day, physical layer security in wireless communications gains more importance. It allows the security of wireless communications based on information theoretical guarantees without the need for cryptography. One important practical challenge for physical layer security arises from the fact that no information about the passive eavesdroppers is available to the legitimate nodes. Without such information, optimizing the transmission parameters has always been a difficult task. In this study we aim to address various challenging aspects about this issue and propose a new perspective into the analysis of secrecy with a focus on jamming. We start from the case of eavesdropper's channel state information (CSI) known to users in a three-node single-antenna multi-subcarrier network and present an improved optimization algorithm compared to previous methods. Then we expand our horizon to the case of multiple-antenna nodes with eavesdropper's CSI unknown to users. We investigate a secure wireless communication scheme which combines two of the most effective strategies to combat eavesdropping, namely mixing information with artificial noise at the transmitter and jamming from a full-duplex receiver. While such setup has been investigated in related works, new and important insights are revealed in this study. We investigate the design of optimal jamming parameters to achieve higher secrecy.We then derive a closed-form expression for asymptotic normalized instantaneous secrecy rate of our model. Based on the results of the asymptotic analysis, we propose an alternative less complex tractable optimization problem for the design of optimal transmission parameters to achieve higher secrecy. We show that even with the optimal parameters, secrecy is compromised if Eve is able to increase her number of antennas. To address this issue, we provide a comprehensive analysis of a new scheme called anti-eavesdropping channel estimation (ANECE) which prevents Eve from acquiring accurate channel estimations. We show that the usage of such scheme, makes it extremely hard for Eve to drive secrecy to zero. Numerical analyses and simulations are presented to support the arguments made in this study.We then derive a closed-form expression for asymptotic normalized instantaneous secrecy rate of our model. Based on the results of the asymptotic analysis, we propose an alternative less complex tractable optimization problem for the design of optimal transmission parameters to achieve higher secrecy. We show that even with the optimal parameters, secrecy is compromised if Eve is able to increase her number of antennas. To address this issue, we provide a comprehensive analysis of a new scheme called anti-eavesdropping channel estimation (ANECE) which prevents Eve from acquiring accurate channel estimations. We show that the usage of such scheme, makes it extremely hard for Eve to drive secrecy to zero. Numerical analyses and simulations are presented to support the arguments made in this study.We then derive a closed-form expression for asymptotic normalized instantaneous secrecy rate of our model. Based on the results of the asymptotic analysis, we propose an alternative less complex tractable optimization problem for the design of optimal transmission parameters to achieve higher secrecy. We show that even with the optimal parameters, secrecy is compromised if Eve is able to increase her number of antennas. To address this issue, we provide a comprehensive analysis of a new scheme called anti-eavesdropping channel estimation (ANECE) which prevents Eve from acquiring accurate channel estimations. We show that the usage of such scheme makes it extremely hard for Eve to drive secrecy to zero. Numerical analyses and simulations are presented to support the arguments made in this study.
Wireless communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy issues have become increasingly critical for wireless networks. This paper considers the problem of secret communication in the multiuser downlink eavesdropped by a passive eavesdropper (EVE). The well-known zero-forcing preceding is adopted at the transmitter to produce concurrent data streams to the users, and at the same time an artificial noise (AN) is generated to prevent EVE from intercepting the information. We first derive an analytical closed-form expression for the secrecy sum-rate in the large system limit. We then use it as the objective function to optimize the power allocation (PA) between the information signals and the AN to maximize the secrecy sum-rate. A simple analytical expression of the optimal PA is derived in the high transmit power regime, which proves to be a near-optimal and generic strategy. The large system results are quite accurate for finite-size systems and thus can provide useful insights into system analysis and design. Our analytical and simulation results show that the AN assisted strategy achieves the same multiplexing gain as in the multiuser downlink without eavesdropping. Moreover, more power should be allocated to AN when the system serves fewer users and EVE has more antennas.
Wireless communication between a transmitter (e.g., an operator) and agents (e.g., drones) may be vulnerable to eavesdropping attacks on some or all agents. A drawback of the traditional communication approach that aims to maximize the total secrecy capacity is that it may neglect communication with specific agents, thereby leading to mission failure for those agents. To address this drawback, we develop and solve a novel guaranteed-payoffs problem that generalizes max-min optimization in a resource-restricted setting and prove that its solution combines egalitarian and water-filling properties. The developed generalization is a convenient tool for researchers to apply across different research areas. Based on this, we design an anti-eavesdropping strategy that maximizes the minimal secrecy capacity of communication with agents facing an adversary capable of reinforcing eavesdropping devices in a game-theoretic framework. Robustness of the derived anti-eavesdropping strategy is proven, and strategies are illustrated.
The growth of wireless networks has been considerable over the last decades. Due to the broadcast nature of these networks, security issues have taken a critical role in today’s communications. A promising direction towards achieving secure communications is information theoretic secrecy, which is an approach exploiting the randomness of the channels to ensure secrecy. Based on this approach, there has been a recent surge of interest in a potential cooperation between users to enhance the secrecy of communications. In this thesis we investigate the interaction between cooperation and secrecy. In particular the contributions of the thesis can be divided into two parts. In the first part, we study cooperative strategies for secrecy for wireless channels. Our goal is to evaluate the effect of fading and limited CSI on the eavesdropper’s channels. In that purpose we consider a scenario where a helper aims at increasing the secrecy of the communication between a source and destination in the presence of an eavesdropper. Several strategies are discussed for the helper, namely decode-and-forward, amplify-and-forward, and cooperative jamming. We introduce the secrecy outage probability, the conditional secrecy outage probability and the secure throughput as secrecy measures. For each measure, we investigate and compare the secrecy performance of cooperation. We furthermore elaborate a system optimization in terms of strategy selection, node positioning, power allocation and rate design. In the second part, we consider cooperation in the 4-node scenario against a more sophisticated adversary: an active eavesdropper, which can either passively eavesdrop, or jam the transmission. A game-theoretic perspective is a natural way to analyze the competitive interaction between the helper and the eavesdropper. Therefore we define several secrecy games, for which we find the Nash and Stackelberg equilibria as well as the corresponding secrecy rate outcomes. Another important consideration in this scenario is the interaction between the source and the helper, which we model and solve as a Stackelberg game, and we illustrate its impact on the achievable secrecy rates.
Recently, physical layer security has been recognized as a new design paradigm to provide security in wireless networks. In contrast to the existing conventional cryptographic methods, physical layer security exploits the dynamics of fading channels to enhance security of wireless communications. This paper studies optimization frameworks for a multicasting network in which a transmitter broadcasts the same information to a group of legitimate users in the presence of multiple eavesdroppers. In particular, power minimization and secrecy rate maximization problems are investigated for a multicasting secrecy network. First, the power minimization problem is solved for different numbers of legitimate users and eavesdroppers. Next, the secrecy rate maximization problem is investigated with the help of private jammers to improve the achievable secrecy rates through a game theoretic approach. These jammers charge the transmitter for their jamming services based on the amount of interference caused to the eavesdroppers. For a fixed interference price scenario, a closed-form solution for the optimal interference requirement to maximize the revenue of the transmitter is derived. This rate maximization problem for a nonfixed interference price scenario is formulated as a Stackelberg game in which the jammers and transmitter are the leaders and follower, respectively. For the proposed game, a Stackelberg equilibrium is derived to maximize the revenues of both the transmitter and the private jammers. To support the derived theoretical results, simulation results are provided with different numbers of legitimate users and eavesdroppers. In addition, these results show that physical layer security based jamming schemes could be incorporated in emerging and future wireless networks to enhance the quality of secure communications.