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

IEEE Communications Letters

Security-Aware Relaying Scheme for Cooperative Networks With Untrusted Relay Nodes

Li Sun, Pinyi Ren, Qinghe Du, Yichen Wang, Zhenzhen Gao

Published Dec 22, 2014• 103 citations
Publisher

Abstract

This paper studies the problem of secure transmission in dual-hop cooperative networks with untrusted relays, where each relay acts as both a potential helper and an eavesdropper. A security-aware relaying scheme is proposed, which employs the alternate jamming and secrecy-enhanced relay selection to prevent the confidential message from being eavesdropped by the untrusted relays. To evaluate the performance of the proposed strategies, we derive the lower bound of the achievable ergodic secrecy rate (ESR), and conduct the asymptotic analysis to examine how the ESR scales as the number of relays increases.

DOI
10.1109/lcomm.2014.2385095

Related papers

Security-concern relaying scheme for amplify-and-forward network with untrusted relay nodes

Huiying Song, Yuanyuan Gao, Guozhen Zang +2 more

The Physical Layer Security (PLS) technology has been proved to be an effective way to reduce information leakage in wireless communication networks. This paper discusses the problem of secure transmission for Amplify-and-Forward (AF) cooperative network which contains both an external eavesdropper and some untrusted relays at the same time, where each relay acts as a helper of transmitting information and a potential eavesdropper. We adopt the technology of Cooperative Jamming (CJ), which yields a significant performance in terms of providing a better level of security against eavesdropping and improving the secure transmission performance of the system. First we discuss the security performance of this new system model, give the secrecy rate in theory and derive a tight lower bound of this secrecy rate. Then we propose a relay selection scheme, which avoids using the channel state information (CSI) of external eavesdropper, to transmit information. Afterward, we also discuss the problem of power allocation in order to maximize the secrecy rate.

International Conference on Computer Science and Network Technology (ICCSNT)•Dec 1, 2016•1 citation

Two-hop Secure Communication Using an Untrusted Relay

Xiang He, Aylin Yener

We consider a source-destination pair that can only communicate through an untrusted intermediate relay node. The intermediate node is willing to employ a designated relaying scheme to facilitate reliable communication between the source and the destination. Yet, the information it relays needs to be kept secret from it. In this two-hop communication scenario, where the use of the untrusted relay node is essential, we find that a positive secrecy rate is achievable. The center piece of the achievability scheme is the help provided by either the destination node with transmission capability, or an external "good samaritan" node. In either case, the helper performs cooperative jamming that confuses the eavesdropping relay and disables it from being able to decipher what it is relaying. We next derive an upper bound on the secrecy rate for this system. We observe that the gap between the upper bound and the achievable rate vanishes as the power of the relay node goes to infinity. Overall, the paper presents a case for intentional interference, i.e., cooperative jamming, as an enabler for secure communication.

arXiv:0910.2718•Oct 14, 2009•1 citation

Two-Hop Secure Communication Using an Untrusted Relay

Xiang He, Aylin Yener

We consider a source-destination pair that can only communicate through an untrusted intermediate relay node. The intermediate node is willing to employ a designated relaying scheme to facilitate reliable communication between the source and the destination. Yet, the information it relays needs to be kept secret from it. In this two-hop communication scenario, where the use of the untrusted relay node is essential, we find that a positive secrecy rate is achievable. The center piece of the achievability scheme is the help provided by either the destination node with transmission capability, or an external "good samaritan" node. In either case, the helper performs cooperative jamming that confuses the eavesdropping relay and disables it from being able to decipher what it is relaying. We next derive an upper bound on the secrecy rate for this system. We observe that the gap between the upper bound and the achievable rate vanishes as the power of the relay node goes to infinity. Overall, the paper presents a case for intentional interference, that is, cooperative jamming, as an enabler for secure communication.

EURASIP Journal on Wireless Communications and Networking•Nov 24, 2009•85 citations

Relay selection for optimized cooperative jamming scheme

Asma Mabrouk, Kamel Tourki, Noureddine Hamdi

In this paper, we study the problem of secure dual-hop transmission in the presence of an eavesdropper, where a secrecy-enhanced relay selection as well as a destination cooperation are presented to prevent the source information from being eavesdropped. Taking into account the total power budget, a power allocation scheme is investigated to optimize the destination contribution. We present the system performance in terms of secrecy capacity where we derive a closed form expression for its lower bound. Simulation results reveal that a higher power allocation to the jamming signal should be balanced by a closer placement of the relay to the source to get better system performance, and vice versa.

European Signal Processing Conference (EUSIPCO)•Aug 1, 2015•14 citations

Secure Transmission for Multiuser Relay Networks

Sung‐il Kim, Il‐Min Kim, Jun Heo

We investigate secure transmission for multiuser relay networks, where the undesired users who are not selected for data reception may overhear the source message as eavesdroppers. In this system, the secrecy performance may deteriorate as the number of users increases, since the number of eavesdroppers also increases. To address this issue, we consider a multiuser relay scheme with cooperative jamming (MUCJ). In this scheme, the desired user sends a jamming signal to the relay while the source sends its message to the relay, and then the relay amplifies and forwards the received signal to the desired user. Since the jamming can be subtracted only at the desired user, it acts as interference to prevent the eavesdroppers from intercepting the source message. We propose an optimal user selection scheme for the MUCJ, which is optimal in the sense of maximizing the secrecy rate. For the existing multiuser relay scheme (MURS) without cooperative jamming and the MUCJ, we derive the ergodic secrecy rates and analyze the asymptotic secrecy rate gains. We reveal that the ergodic secrecy rate can be increased as the number of users grows and much higher secrecy rate can be achieved by the MUCJ.

IEEE Transactions on Wireless Communications•Mar 5, 2015•50 citations

Secure cooperative untrusted-relay network with outdated CSI

Asma Mabrouk, Kamel Tourki, Noureddine Hamdi

This paper studies the secrecy performance of an untrusted amplify-and-forward relaying network where both the relaying and the direct links are used to convey the source's information. Since relays act as eavesdroppers, a source-based jamming technique is proposed to keep the source's message secret from these helper nodes. We analyze the secrecy capacity of partial relay selection based on outdated channel state information. The study is conducted analytically by deriving the lower-bound expression for the ergodic secrecy capacity (ESC). We demonstrate through the simulation results the tightness of the derived bound. The use of the direct link is shown to improve the secrecy performance of the proposed scheme. In this case, we found that ESC performance with maximum ratio combining at the destination is better than that with selection combining. The system performance worsens as the correlation coefficient decreases. Furthermore, the maximum of ESC is achieved when relays are in the middle between the source and the destination with equal power allocation between the information and the jamming signals at the source.

International Wireless Communications and Mobile Computing Conference (IWCMC)•Sep 1, 2016•8 citations
This paper studies the problem of secure transmission in dual-hop cooperative networks with untrusted relays, where each relay acts as both a potential helper and an eavesdropper. A security-aware relaying scheme is proposed, which employs the alternate jamming and secrecy-enhanced relay selection to prevent the confidential message from being eavesdropped by the untrusted relays. To evaluate the performance of the proposed strategies, we derive the lower bound of the achievable ergodic secrecy rate (ESR), and conduct the asymptotic analysis to examine how the ESR scales as the number of relays increases.
The Physical Layer Security (PLS) technology has been proved to be an effective way to reduce information leakage in wireless communication networks. This paper discusses the problem of secure transmission for Amplify-and-Forward (AF) cooperative network which contains both an external eavesdropper and some untrusted relays at the same time, where each relay acts as a helper of transmitting information and a potential eavesdropper. We adopt the technology of Cooperative Jamming (CJ), which yields a significant performance in terms of providing a better level of security against eavesdropping and improving the secure transmission performance of the system. First we discuss the security performance of this new system model, give the secrecy rate in theory and derive a tight lower bound of this secrecy rate. Then we propose a relay selection scheme, which avoids using the channel state information (CSI) of external eavesdropper, to transmit information. Afterward, we also discuss the problem of power allocation in order to maximize the secrecy rate.
We consider a source-destination pair that can only communicate through an untrusted intermediate relay node. The intermediate node is willing to employ a designated relaying scheme to facilitate reliable communication between the source and the destination. Yet, the information it relays needs to be kept secret from it. In this two-hop communication scenario, where the use of the untrusted relay node is essential, we find that a positive secrecy rate is achievable. The center piece of the achievability scheme is the help provided by either the destination node with transmission capability, or an external "good samaritan" node. In either case, the helper performs cooperative jamming that confuses the eavesdropping relay and disables it from being able to decipher what it is relaying. We next derive an upper bound on the secrecy rate for this system. We observe that the gap between the upper bound and the achievable rate vanishes as the power of the relay node goes to infinity. Overall, the paper presents a case for intentional interference, i.e., cooperative jamming, as an enabler for secure communication.
We consider a source-destination pair that can only communicate through an untrusted intermediate relay node. The intermediate node is willing to employ a designated relaying scheme to facilitate reliable communication between the source and the destination. Yet, the information it relays needs to be kept secret from it. In this two-hop communication scenario, where the use of the untrusted relay node is essential, we find that a positive secrecy rate is achievable. The center piece of the achievability scheme is the help provided by either the destination node with transmission capability, or an external "good samaritan" node. In either case, the helper performs cooperative jamming that confuses the eavesdropping relay and disables it from being able to decipher what it is relaying. We next derive an upper bound on the secrecy rate for this system. We observe that the gap between the upper bound and the achievable rate vanishes as the power of the relay node goes to infinity. Overall, the paper presents a case for intentional interference, that is, cooperative jamming, as an enabler for secure communication.
In this paper, we study the problem of secure dual-hop transmission in the presence of an eavesdropper, where a secrecy-enhanced relay selection as well as a destination cooperation are presented to prevent the source information from being eavesdropped. Taking into account the total power budget, a power allocation scheme is investigated to optimize the destination contribution. We present the system performance in terms of secrecy capacity where we derive a closed form expression for its lower bound. Simulation results reveal that a higher power allocation to the jamming signal should be balanced by a closer placement of the relay to the source to get better system performance, and vice versa.
We investigate secure transmission for multiuser relay networks, where the undesired users who are not selected for data reception may overhear the source message as eavesdroppers. In this system, the secrecy performance may deteriorate as the number of users increases, since the number of eavesdroppers also increases. To address this issue, we consider a multiuser relay scheme with cooperative jamming (MUCJ). In this scheme, the desired user sends a jamming signal to the relay while the source sends its message to the relay, and then the relay amplifies and forwards the received signal to the desired user. Since the jamming can be subtracted only at the desired user, it acts as interference to prevent the eavesdroppers from intercepting the source message. We propose an optimal user selection scheme for the MUCJ, which is optimal in the sense of maximizing the secrecy rate. For the existing multiuser relay scheme (MURS) without cooperative jamming and the MUCJ, we derive the ergodic secrecy rates and analyze the asymptotic secrecy rate gains. We reveal that the ergodic secrecy rate can be increased as the number of users grows and much higher secrecy rate can be achieved by the MUCJ.
This paper studies the secrecy performance of an untrusted amplify-and-forward relaying network where both the relaying and the direct links are used to convey the source's information. Since relays act as eavesdroppers, a source-based jamming technique is proposed to keep the source's message secret from these helper nodes. We analyze the secrecy capacity of partial relay selection based on outdated channel state information. The study is conducted analytically by deriving the lower-bound expression for the ergodic secrecy capacity (ESC). We demonstrate through the simulation results the tightness of the derived bound. The use of the direct link is shown to improve the secrecy performance of the proposed scheme. In this case, we found that ESC performance with maximum ratio combining at the destination is better than that with selection combining. The system performance worsens as the correlation coefficient decreases. Furthermore, the maximum of ESC is achieved when relays are in the middle between the source and the destination with equal power allocation between the information and the jamming signals at the source.