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

arXiv:1706.03444 · IEEE Transactions on Vehicular Technology

Secret-Key-Aided Scheme for Securing Untrusted DF Relaying Networks

Ahmed El Shafie, Ahmed Sultan, Asma Mabrouk, Kamel Tourki, Naofal Al‐Dhahir

Published Jan 30, 2018• 7 citations
arXivHTMLPDF

Abstract

This paper proposes a new scheme to secure the transmissions in an untrusted decode-and-forward (DF) relaying network. A legitimate source node, Alice, sends her data to a legitimate destination node, Bob, with the aid of an untrusted DF relay node, Charlie. To secure the transmissions from Charlie during relaying time slots, each data codeword is secured using a secret-key codeword that has been previously shared between Alice and Bob during the perfectly secured time slots (i.e., when the channel secrecy rate is positive). The secret-key bits exchanged between Alice and Bob are stored in a finite-length buffer and are used to secure data transmission whenever needed. We model the secret-key buffer as a queueing system and analyze its Markov chain. Our numerical results show the gains of our proposed scheme relative to benchmarks. Moreover, the proposed scheme achieves an upper bound on the secure throughput.

DOI
10.1109/tvt.2018.2799900

Related papers

Enhancing the PHY-Layer Security of MIMO Buffer-Aided Relay Networks

Ahmed El Shafie, Dusit Tao Niyato, Naofal Al‐Dhahir

We investigate the physical-layer security of a buffer-aided multiple-input multiple-output relay channel. The wireless network under investigation is composed of one legitimate source node (Alice), one legitimate half-duplex relay node, and one legitimate destination node (Bob). Alice communicates with both relay and Bob in the presence of a potential passive multi-antenna eavesdropper (Eve). Without knowing the instantaneous eavesdropper's channel state information at the legitimate nodes, we propose a precoded artificial-noise injection scheme to enhance the security of the legitimate transmissions. The relay is equipped with a finite buffer to store the unsuccessfully decoded packets at Bob. We analyze the Markov chain of the relay's queue and derive its steady-state distributions. Our optimization problem is formulated such that the average end-to-end secure throughput is maximized under the secrecy outage probability constraint on the Alice-relay link. Our numerical results demonstrate that our proposed buffer-aided relaying scheme achieves a significant improvement in the secure throughput compared with the conventional bufferless relaying scheme, where the time slot is divided equally between the source and the relay for their data transmissions.

IEEE Wireless Communications Letters•May 18, 2016•22 citations

Physical-Layer Security of a Buffer-Aided Full-Duplex Relaying System

Ahmed El Shafie, Ahmed Sultan, Naofal Al‐Dhahir

This letter proposes a novel hybrid half-duplex (HD)/full-duplex (FD) relaying scheme to enhance the relay channel security. A source node (Alice) communicates with her destination node (Bob) in the presence of a buffer-aided FD relay node (Rooney) and a potential eavesdropper (Eve). Rooney adopts two different relaying strategies, namely, randomize-and-forward and decode-and-forward relaying, to improve the security of the legitimate system. In the first relaying strategy, Rooney uses a codebook different from that used at Alice. In the second relaying strategy, Rooney and Alice use the same codebooks. In addition, Rooney switches between the HD and FD modes to further enhance the security of the legitimate system. The numerical results demonstrate that our proposed scheme achieves a significant average secrecy end-to-end throughput improvement relative to the conventional bufferless FD relaying scheme.

arXiv:1612.05881•IEEE Communications Letters•Jul 7, 2016•51 citations

Securing Untrusted RF-EH Relay Networks Using Cooperative Jamming Signals

Ahmed El Shafie, Asma Mabrouk, Kamel Tourki +2 more

We propose a new scheme to secure a wireless-powered untrusted cooperative-communication network, where a legitimate source node (Alice) transmits her information messages to a legitimate destination node (Bob) through the multiple amplify-and-forward untrusted relays. The relay nodes are assumed to be honest but curious nodes; hence, they are trusted at the service level but are untrusted at the information level. To reduce the energy consumption of the network, only one relay node is selected in each time slot to forward Alice's information signal. We assume a power-splitting-based energy-harvesting scheme, where each relay node splits its received signal into information and energy streams. Since the relay nodes are assumed to be untrusted at the information level, they attempt to decode the information intended to Bob while harvesting energy at the same time. When the relaying mode is selected, the scheme is realized over two non-overlapping time phases. To prevent any information leakage to the untrusted relay nodes, Bob and a cooperative jammer (John) inject jamming (artificial noise) signals during the first phase. During the second phase, the untrusted relay nodes that will not be forwarding the information signal must harvest energy to accumulate more energy to help Alice in future time slots. Moreover, the cooperative jammer will jam the untrusted relays to further power their batteries and prevent them from decoding the information-forwarding relay signal in case they decided to cheat and decode it. We model the battery state transitions at each relay as a finite-state Markov chain and analyze it. Our numerical results show the security gains of our proposed scheme relative to two benchmark schemes.

IEEE Access•Jan 1, 2017•19 citations

A Secure Relay Selection AN-Aided Scheme for Dual-Hop DF Relay Networks With Two-Sided Eavesdropping

Ahmed El Shafie, Asma Mabrouk, Kamel Tourki +1 more

We propose a new relay selection artificial-noise (AN)-aided scheme to enhance the security of relay networks. We assume the presence of two multi-antenna eavesdroppers where one of them is closer to the legitimate transmitter (Alice) and the other one is closer to the legitimate receiver (Bob). To improve the system's security, we optimize the transmit power allocation factor between data and AN. Moreover, we design the data and AN precoders at Alice, the AN precoder at Bob, the AN precoder at the relays, and data receive filter at Bob. We derive closed-form expressions for the links' rates and the instantaneous secrecy rate. Numerical results show that our proposed scheme achieves higher average secrecy rate than others in the literature.

IEEE Wireless Communications Letters•May 18, 2017•3 citations

Physical Layer Security in Untrusted Decode-and-Forward Relay Networks Allowing Intra-Link Errors

Xingjian Pan, Shuxin Ge, Xiaobo Zhou +1 more

In this paper, we investigate the physical layer security performance of untrusted decode-and-forward (DF) relay networks allowing intra-link errors with cooperative jamming. Different from traditional DF relaying protocol, the decoded message at the relay will always be forwarded to the destination node in decode-and-forward relaying allowing intra-link errors (DF-IE), which can be leveraged to enhance the security of relay networks with untrusted relays. To further improve the security performance of DF-IE, we allow the destination node to send jamming signals to impair the signal reception at the relay node, which is referred to as DF-IE with cooperative jamming (DF-IE-CJ). Reliable-and-secure probability (RSP) is used to evaluate the performance of the untrusted relay networks, which represents the probability that the destination node can successfully decode the original message sent from the source node while the relay node can not decode the original message. First, the RSP of DF-IE-CJ is derived from a fading scenario where all the channels between the nodes suffer from block Rayleigh fading. Next, we propose a power allocation scheme to maximize the RSP with different signal-to-noise ratios (SNRs). To verify the effectiveness of DF-IE-CJ, we compare the RSP performance of DF-IE-CJ with that of a widely used schemes, cooperative jamming (CJ). A series of numerical simulations verified the accuracy of the theoretical analysis, and the superiority of DF-IE-CJ over CJ about 5% in RSP.

International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)•Dec 1, 2019•6 citations

Cooperative jamming secure scheme for untrusted full-duplex relay system

Bolun Li, Tao Liang

In this paper, we focus on a practical communication system, an untrusted full-duplex relay (UFDR) network with a transmitter Alice and a full-duplex receiver Bob. The relay is untrusted who is supposed to forward the signal to Bob and at the same time, acts as a potential eavesdropper to intercept the message from Alice. Since there is no direct link between Alice and Bob, positive secrecy rate can not be obtained. To handle with this issue, based on the precondition that in-band full-duplex technology has been basically matured and can be applied in relay communication, we propose a destination-aided cooperative intended jamming scheme (UFDR-IJ scheme for short). We study the secure performance of the communication system model described in this paper, and obtain a closed-form expression for the secrecy outage probability which verifies the fact that the UFDR-IJ scheme can significantly enhance the secure performance while double the secrecy capacity of the communication system comparing to the traditional cooperative communication scheme.

IEEE International Conference on Computer and Communications (ICCC)•Oct 1, 2016•6 citations
This paper proposes a new scheme to secure the transmissions in an untrusted decode-and-forward (DF) relaying network. A legitimate source node, Alice, sends her data to a legitimate destination node, Bob, with the aid of an untrusted DF relay node, Charlie. To secure the transmissions from Charlie during relaying time slots, each data codeword is secured using a secret-key codeword that has been previously shared between Alice and Bob during the perfectly secured time slots (i.e., when the channel secrecy rate is positive). The secret-key bits exchanged between Alice and Bob are stored in a finite-length buffer and are used to secure data transmission whenever needed. We model the secret-key buffer as a queueing system and analyze its Markov chain. Our numerical results show the gains of our proposed scheme relative to benchmarks. Moreover, the proposed scheme achieves an upper bound on the secure throughput.
We investigate the physical-layer security of a buffer-aided multiple-input multiple-output relay channel. The wireless network under investigation is composed of one legitimate source node (Alice), one legitimate half-duplex relay node, and one legitimate destination node (Bob). Alice communicates with both relay and Bob in the presence of a potential passive multi-antenna eavesdropper (Eve). Without knowing the instantaneous eavesdropper's channel state information at the legitimate nodes, we propose a precoded artificial-noise injection scheme to enhance the security of the legitimate transmissions. The relay is equipped with a finite buffer to store the unsuccessfully decoded packets at Bob. We analyze the Markov chain of the relay's queue and derive its steady-state distributions. Our optimization problem is formulated such that the average end-to-end secure throughput is maximized under the secrecy outage probability constraint on the Alice-relay link. Our numerical results demonstrate that our proposed buffer-aided relaying scheme achieves a significant improvement in the secure throughput compared with the conventional bufferless relaying scheme, where the time slot is divided equally between the source and the relay for their data transmissions.
This letter proposes a novel hybrid half-duplex (HD)/full-duplex (FD) relaying scheme to enhance the relay channel security. A source node (Alice) communicates with her destination node (Bob) in the presence of a buffer-aided FD relay node (Rooney) and a potential eavesdropper (Eve). Rooney adopts two different relaying strategies, namely, randomize-and-forward and decode-and-forward relaying, to improve the security of the legitimate system. In the first relaying strategy, Rooney uses a codebook different from that used at Alice. In the second relaying strategy, Rooney and Alice use the same codebooks. In addition, Rooney switches between the HD and FD modes to further enhance the security of the legitimate system. The numerical results demonstrate that our proposed scheme achieves a significant average secrecy end-to-end throughput improvement relative to the conventional bufferless FD relaying scheme.
We propose a new scheme to secure a wireless-powered untrusted cooperative-communication network, where a legitimate source node (Alice) transmits her information messages to a legitimate destination node (Bob) through the multiple amplify-and-forward untrusted relays. The relay nodes are assumed to be honest but curious nodes; hence, they are trusted at the service level but are untrusted at the information level. To reduce the energy consumption of the network, only one relay node is selected in each time slot to forward Alice's information signal. We assume a power-splitting-based energy-harvesting scheme, where each relay node splits its received signal into information and energy streams. Since the relay nodes are assumed to be untrusted at the information level, they attempt to decode the information intended to Bob while harvesting energy at the same time. When the relaying mode is selected, the scheme is realized over two non-overlapping time phases. To prevent any information leakage to the untrusted relay nodes, Bob and a cooperative jammer (John) inject jamming (artificial noise) signals during the first phase. During the second phase, the untrusted relay nodes that will not be forwarding the information signal must harvest energy to accumulate more energy to help Alice in future time slots. Moreover, the cooperative jammer will jam the untrusted relays to further power their batteries and prevent them from decoding the information-forwarding relay signal in case they decided to cheat and decode it. We model the battery state transitions at each relay as a finite-state Markov chain and analyze it. Our numerical results show the security gains of our proposed scheme relative to two benchmark schemes.
We propose a new relay selection artificial-noise (AN)-aided scheme to enhance the security of relay networks. We assume the presence of two multi-antenna eavesdroppers where one of them is closer to the legitimate transmitter (Alice) and the other one is closer to the legitimate receiver (Bob). To improve the system's security, we optimize the transmit power allocation factor between data and AN. Moreover, we design the data and AN precoders at Alice, the AN precoder at Bob, the AN precoder at the relays, and data receive filter at Bob. We derive closed-form expressions for the links' rates and the instantaneous secrecy rate. Numerical results show that our proposed scheme achieves higher average secrecy rate than others in the literature.
In this paper, we investigate the physical layer security performance of untrusted decode-and-forward (DF) relay networks allowing intra-link errors with cooperative jamming. Different from traditional DF relaying protocol, the decoded message at the relay will always be forwarded to the destination node in decode-and-forward relaying allowing intra-link errors (DF-IE), which can be leveraged to enhance the security of relay networks with untrusted relays. To further improve the security performance of DF-IE, we allow the destination node to send jamming signals to impair the signal reception at the relay node, which is referred to as DF-IE with cooperative jamming (DF-IE-CJ). Reliable-and-secure probability (RSP) is used to evaluate the performance of the untrusted relay networks, which represents the probability that the destination node can successfully decode the original message sent from the source node while the relay node can not decode the original message. First, the RSP of DF-IE-CJ is derived from a fading scenario where all the channels between the nodes suffer from block Rayleigh fading. Next, we propose a power allocation scheme to maximize the RSP with different signal-to-noise ratios (SNRs). To verify the effectiveness of DF-IE-CJ, we compare the RSP performance of DF-IE-CJ with that of a widely used schemes, cooperative jamming (CJ). A series of numerical simulations verified the accuracy of the theoretical analysis, and the superiority of DF-IE-CJ over CJ about 5% in RSP.
In this paper, we focus on a practical communication system, an untrusted full-duplex relay (UFDR) network with a transmitter Alice and a full-duplex receiver Bob. The relay is untrusted who is supposed to forward the signal to Bob and at the same time, acts as a potential eavesdropper to intercept the message from Alice. Since there is no direct link between Alice and Bob, positive secrecy rate can not be obtained. To handle with this issue, based on the precondition that in-band full-duplex technology has been basically matured and can be applied in relay communication, we propose a destination-aided cooperative intended jamming scheme (UFDR-IJ scheme for short). We study the secure performance of the communication system model described in this paper, and obtain a closed-form expression for the secrecy outage probability which verifies the fact that the UFDR-IJ scheme can significantly enhance the secure performance while double the secrecy capacity of the communication system comparing to the traditional cooperative communication scheme.