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

International Symposium on Wireless Communication Systems

Secrecy outage probability of network-coded cooperation without channel state information

Marcos Eduardo Pivaro Monteiro, João Luiz Rebelatto, Richard Demo Souza, Ohara Kerusauskas Rayel, Guilherme Luiz Moritz, Bartolomeu Ferreira Uchoa-Filho

Published Aug 1, 2015• 0 citations
Publisher

Abstract

We evaluate the secrecy performance of a cooperative network where the destination node is wiretapped by a malicious and passive eavesdropper. We propose the application of the network coding technique as an alternative to increase the secrecy at the destination node, in a scenario without channel state information (CSI) at the transmitter side. Network coding is leveraged by assuming that the legitimate cooperative nodes are able to perform non-binary linear combinations of different frames before the transmission. Theoretic and numerical analyses show that the secrecy can be considerably increased through the use of network coding when compared to the direct transmission and traditional cooperative techniques.

DOI
10.1109/iswcs.2015.7454438

Related papers

Secrecy Outage Probability of Network-Coded Cooperative Communication

João Luiz Rebelatto, Richard Demo Souza, Rodrigo Tsuneyoshi Kaido +2 more

We evaluate the secrecy performance of a multiple access cooperative network where the destination node is wiretapped by a malicious and passive eavesdropper. We propose the application of the network coding technique as an alternative to increase the secrecy at the destination node, on the top of improving the error performance of the legitimate communication, already demonstrated in the literature. Network coding is leveraged by assuming that the legitime cooperative nodes are able to perform non-binary linear combinations of different frames before the transmission. Different scenarios with and without channel state information (CSI) at the transmitter side are evaluated. The effectiveness of the proposed schemes is evaluated in terms of secrecy outage probability through theoretic and numerical analyses. It is shown that, even when the legitimate transmitters do not have any CSI, the secrecy can be increased through the use of network coding when compared to the direct transmission and traditional cooperative techniques.

arXiv:1406.7858•Jun 30, 2014•0 citations

Network-coded cooperation for a two-user wiretap channel

Rodrigo Tsuneyoshi Kaido, Ohara Kerusauskas Rayel, João Luiz Rebelatto +1 more

We evaluate the secrecy outage probability of a two-user network-coded cooperative network in the presence of an eavesdropper. We show through theoretic and numerical analyses that the secrecy can be increased through the use of network coding when compared to the direct transmission and traditional cooperative techniques.

IEEE International Conference on Acoustics Speech and Signal Processing•May 1, 2014•2 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 outage probability analysis for cooperative communication with relay selection under non-identical distribution

Esa R. Alotaibi, Khairi Ashour Hamdi

In this paper, secrecy outage probability is analyzed in a cooperative network for an independent but non-identically distributed (i.n.i.d) Rayleigh fading channel. By using multi-trusted decode and forward relays, the model assumes direct links between a sender (Alice) and receiver nodes (Bob and an eavesdropper). The protocol employed herein selects the best relay with the highest signal-to-noise ratio (SNR) in relation to the destination (Bob). The eavesdropper's channel state information (CSI) is neither available to the sender nor to the best relay, while maximum ratio combining (MRC) is employed at Bob and the eavesdropper. Finally, the theoretical analysis is validated through simulation, and the results show that performance is enhanced with an increasing number of relays in the event of a direct link between the sender and the receiver's terminals.

IEEE Wireless Communications and Networking Conference•Apr 1, 2016•7 citations

Cooperative-Jamming-Aided Secrecy Enhancement in Wireless Networks With Passive Eavesdroppers

Lin Hu, Hong Wen, Bin Wu +3 more

This paper investigates cooperative security in wireless networks, where a source (Alice) intends to transmit a confidential message to a legitimate destination (Bob), with the help of a cooperative jammer (Charlie), coexisting with multiple passive eavesdroppers (Eves). In particular, by assuming knowledge of Bob's perfect channel state information (CSI) but only Eves’ statistical CSIs, secrecy beamforming with artificial noise (AN) is utilized for secure transmission, and cooperative jamming (CJ) is explored to further enhance secrecy. We first derive an accurate closed-form expression for the secrecy outage probability (SOP), and establish the condition under which positive secrecy rate is achievable. Then, we provide a secure transmit design for maximizing the SOP constrained secrecy rate. Moreover, based on a strict mathematical analysis, we characterize the impact of the main channel quality and the number of Eves on transmit design and secrecy performance. Specifically, optimal power allocation ratio between the information-bearing signal and the AN signal increases as the main channel quality improves, and decreases with the number of Eves. Numerical results confirm that our design achieves performance improvement in terms of both secrecy rate and secure energy efficiency, as compared to the approach without CJ.

IEEE Transactions on Vehicular Technology•Aug 25, 2017•78 citations

Secrecy Outage of Proactive Relay Selection by Eavesdropper

Sarbani Ghose, Chinmoy Kundu, Octavia A. Dobre

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 eavesdropper is also a part of network, a proactive relay selection by the eavesdropper is proposed. The best relay which maximizes the eavesdropping rate is selected by the eavesdropper. A relay selection scheme is also proposed to improve the secrecy of the system by minimizing the eavesdropping rate. Performances of these schemes are compared with two passive eavesdropping scenarios in which the eavesdropper performs selection and maximal ratio combining on the relayed links. A realistic channel model with independent non-identical links between nodes and direct links from the source to both the destination and eavesdropper are assumed. Closed- form expressions for the secrecy outage probability (SOP) of these schemes in Rayleigh fading channel are obtained. It is shown that the relay selection by the proactive eavesdropper is most detrimental to the system as not only the SOP increases with the increase in the number of relays, but its diversity also remains unchanged.

arXiv:1803.01065•Globecom•Dec 1, 2017•10 citations
We evaluate the secrecy performance of a cooperative network where the destination node is wiretapped by a malicious and passive eavesdropper. We propose the application of the network coding technique as an alternative to increase the secrecy at the destination node, in a scenario without channel state information (CSI) at the transmitter side. Network coding is leveraged by assuming that the legitimate cooperative nodes are able to perform non-binary linear combinations of different frames before the transmission. Theoretic and numerical analyses show that the secrecy can be considerably increased through the use of network coding when compared to the direct transmission and traditional cooperative techniques.
We evaluate the secrecy performance of a multiple access cooperative network where the destination node is wiretapped by a malicious and passive eavesdropper. We propose the application of the network coding technique as an alternative to increase the secrecy at the destination node, on the top of improving the error performance of the legitimate communication, already demonstrated in the literature. Network coding is leveraged by assuming that the legitime cooperative nodes are able to perform non-binary linear combinations of different frames before the transmission. Different scenarios with and without channel state information (CSI) at the transmitter side are evaluated. The effectiveness of the proposed schemes is evaluated in terms of secrecy outage probability through theoretic and numerical analyses. It is shown that, even when the legitimate transmitters do not have any CSI, the secrecy can be increased through the use of network coding when compared to the direct transmission and traditional cooperative techniques.
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.
In this paper, secrecy outage probability is analyzed in a cooperative network for an independent but non-identically distributed (i.n.i.d) Rayleigh fading channel. By using multi-trusted decode and forward relays, the model assumes direct links between a sender (Alice) and receiver nodes (Bob and an eavesdropper). The protocol employed herein selects the best relay with the highest signal-to-noise ratio (SNR) in relation to the destination (Bob). The eavesdropper's channel state information (CSI) is neither available to the sender nor to the best relay, while maximum ratio combining (MRC) is employed at Bob and the eavesdropper. Finally, the theoretical analysis is validated through simulation, and the results show that performance is enhanced with an increasing number of relays in the event of a direct link between the sender and the receiver's terminals.
This paper investigates cooperative security in wireless networks, where a source (Alice) intends to transmit a confidential message to a legitimate destination (Bob), with the help of a cooperative jammer (Charlie), coexisting with multiple passive eavesdroppers (Eves). In particular, by assuming knowledge of Bob's perfect channel state information (CSI) but only Eves’ statistical CSIs, secrecy beamforming with artificial noise (AN) is utilized for secure transmission, and cooperative jamming (CJ) is explored to further enhance secrecy. We first derive an accurate closed-form expression for the secrecy outage probability (SOP), and establish the condition under which positive secrecy rate is achievable. Then, we provide a secure transmit design for maximizing the SOP constrained secrecy rate. Moreover, based on a strict mathematical analysis, we characterize the impact of the main channel quality and the number of Eves on transmit design and secrecy performance. Specifically, optimal power allocation ratio between the information-bearing signal and the AN signal increases as the main channel quality improves, and decreases with the number of Eves. Numerical results confirm that our design achieves performance improvement in terms of both secrecy rate and secure energy efficiency, as compared to the approach without CJ.
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 eavesdropper is also a part of network, a proactive relay selection by the eavesdropper is proposed. The best relay which maximizes the eavesdropping rate is selected by the eavesdropper. A relay selection scheme is also proposed to improve the secrecy of the system by minimizing the eavesdropping rate. Performances of these schemes are compared with two passive eavesdropping scenarios in which the eavesdropper performs selection and maximal ratio combining on the relayed links. A realistic channel model with independent non-identical links between nodes and direct links from the source to both the destination and eavesdropper are assumed. Closed- form expressions for the secrecy outage probability (SOP) of these schemes in Rayleigh fading channel are obtained. It is shown that the relay selection by the proactive eavesdropper is most detrimental to the system as not only the SOP increases with the increase in the number of relays, but its diversity also remains unchanged.