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:2112.14125 · Journal of Communications and Networks

Do not forget the past: A buffer-aided framework for relay based key generation

Rusni Kima Mangang, Harshan Jagadeesh

Published Feb 1, 2022• 0 citations
arXivHTMLPDF

Abstract

We address relay-assisted key generation wherein two wireless nodes, that have no direct channel between them, seek the assistance of an intermediate relay to generate secret keys. In a celebrated version of the relay-assisted protocol, as applied by Lai et al., Zhou et al., Wang et al., and Waqas et al., the relay node generates pair-wise keys with the two nodes, and then broadcasts an XOR version of the two keys. Although such protocols are simple and effective, we observe that they face reduction in key rates due to two problems. First, for confidentiality, the relay broadcasts an XOR function of the pair-wise keys thereby pruning the length of the shared key to be the minimum of the key lengths of the pair-wise keys. Secondly, the broadcast phase may also experience outages thereby not being able to share the generated key in every round of the protocol. Identifying these issues, we propose a buffer-aided relaying protocol wherein buffer is used at the relay to store unused secret bits generated in the previous rounds of the protocol so as to provide confidentiality in the subsequent rounds of broadcast. On this buffer-aided protocol, we propose a power-allocation strategy between the phases of key generation and broadcast so as to maximize the throughput and key rate. Rigorous analyses show that buffer-aided relay when implemented along with the proposed power-allocation strategy offer remarkable advantages over existing baselines.

DOI
10.23919/jcn.2021.000048

Related papers

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

Ahmed El Shafie, Ahmed Sultan, Asma Mabrouk +2 more

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.

arXiv:1706.03444•IEEE Transactions on Vehicular Technology•Jan 30, 2018•7 citations

Secret Key Generation in the Two-Way Relay Channel With Active Attackers

Heng Zhou, Lauren M. Huie, Lifeng Lai

Most of the existing work on key generation from wireless fading channels requires a direct wireless link between legitimate users so that they can obtain correlated observations from the common wireless link. This paper studies the key generation problem in the two-way relay channel, in which there is no direct channel between the key generating terminals. We propose an effective key generation scheme that achieves a substantially larger key rate than that of a direct channel mimic approach. Unlike existing schemes, there is no need for the key generating terminals to obtain correlated observations in our scheme. We also investigate the effects of an active attacker on the proposed key generation protocol. We characterize the optimal attacker's strategy that minimizes the key rate of the proposed scheme. Furthermore, we establish the maximal attacker's power under which our scheme can still achieve a nonzero key rate.

IEEE Transactions on Information Forensics and Security•Jan 31, 2014•59 citations

Key generation in two-way relay wireless channels

Heng Zhou, Lauren M. Huie, Lifeng Lai

Most of the existing work on key generation from wireless fading channels requires a direct wireless link between legitimate users so that they can obtain correlated observations from the common wireless link. This paper studies the key generation problem in the two-way relay channel, in which there is no direct channel between the key generating terminals. We propose an effective key generation scheme that achieves a substantially larger key rate than that of a direct channel mimic approach. Unlike existing schemes, there is no need for the key generating terminals to obtain correlated observations in our scheme. We then extend our study to the case of a relay with multiple antennas. For this scenario, we derive the optimal power allocation at the relay that maximizes the key rate achieved using our protocol.

Conference on Information Sciences and Systems•Mar 1, 2013•6 citations

Self-Sustainable Key Generation: Strategies and Performance Bounds under DoS Attacks

Rusni Kima Mangang, J. Harshan

Denial-of-Service (DoS) threats pose a major challenge to the idea of physical-layer key generation as the underlying wireless channels for key extraction are usually public. Identifying this vulnerability, we study the effect of DoS threats on relay-assisted key generation, and show that a reactive jamming attack on the distribution phase of relay-assisted key generation can forbid the nodes from extracting secret keys. To circumvent this problem, we propose a self-sustainable key generation model, wherein a frequency-hopping based distribution phase is employed to evade the jamming attack even though the participating nodes do not share prior credentials. A salient feature of the idea is to carve out a few bits from the key generation phase and subsequently use them to pick a frequency band at random for the broadcast phase. Interesting resource-allocation problems are formulated on how to extract maximum number of secret bits while also being able to evade the jamming attack with high probability. Tractable low-complexity solutions are also provided to the resource-allocation problems, along with insights on the feasibility of their implementation in practice.

arXiv:2309.00342•IEEE Vehicular Technology Conference•Oct 10, 2023•0 citations

PHY-based cooperative key generation in wireless networks

Lifeng Lai, Yingbin Liang, Wenliang Kevin Du

The impact of relay nodes on the secret key generation via the physical layer resources is investigated. A novel relay-assisted strategy is proposed to improve the generated secret key rate. The main idea is to exploit the random channels associated with relay nodes in the network as additional random sources for the key generation. This approach is particularly useful when the channels between legitimate nodes change slowly. Three increasingly sophisticated yet more practical scenarios are studied, for which relay-assisted key generation protocols are proposed and are shown to be optimal or order-optimal in terms of the key rate. It is also shown that the presence of relay node increases the multiplexing gain. This is in sharp contrast to scenarios with relay helping information transmission, in which the relay node does not increase the multiplexing. Furthermore, a cooperative scheme is also proposed in which relays help key generation but the generated keys are kept secure from these relays.

Allerton Conference on Communication, Control, and Computing•Sep 1, 2011•17 citations

Cooperative Key Generation in Wireless Networks

Lifeng Lai, Yingbin Liang, Wenliang Kevin Du

The impact of relay nodes on the secret key generation via the physical layer resources is investigated. A novel relay-assisted strategy is proposed to improve the generated secret key rate. The main idea is to exploit the random channels associated with relay nodes in the network as additional random sources for the key generation. This approach is particularly useful when the channels between legitimate nodes change slowly. Four increasingly sophisticated yet more practical scenarios are studied, for which relay-assisted key generation protocols are proposed and are shown to be optimal or order-optimal in terms of the key rate. It is also shown that the multiplexing gain in the key rate scales linearly with the number of relays, which demonstrates that relay-assisted schemes substantially increase the key rate. This is in sharp contrast to scenarios with relays helping information transmission, in which the multiplexing gain does not scale with the number of relays. Furthermore, a cooperative scheme is also proposed in which relays help key generation but the generated keys are kept secure from these relays.

IEEE Journal on Selected Areas in Communications•Aug 23, 2012•94 citations
We address relay-assisted key generation wherein two wireless nodes, that have no direct channel between them, seek the assistance of an intermediate relay to generate secret keys. In a celebrated version of the relay-assisted protocol, as applied by Lai et al., Zhou et al., Wang et al., and Waqas et al., the relay node generates pair-wise keys with the two nodes, and then broadcasts an XOR version of the two keys. Although such protocols are simple and effective, we observe that they face reduction in key rates due to two problems. First, for confidentiality, the relay broadcasts an XOR function of the pair-wise keys thereby pruning the length of the shared key to be the minimum of the key lengths of the pair-wise keys. Secondly, the broadcast phase may also experience outages thereby not being able to share the generated key in every round of the protocol. Identifying these issues, we propose a buffer-aided relaying protocol wherein buffer is used at the relay to store unused secret bits generated in the previous rounds of the protocol so as to provide confidentiality in the subsequent rounds of broadcast. On this buffer-aided protocol, we propose a power-allocation strategy between the phases of key generation and broadcast so as to maximize the throughput and key rate. Rigorous analyses show that buffer-aided relay when implemented along with the proposed power-allocation strategy offer remarkable advantages over existing baselines.
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.
Most of the existing work on key generation from wireless fading channels requires a direct wireless link between legitimate users so that they can obtain correlated observations from the common wireless link. This paper studies the key generation problem in the two-way relay channel, in which there is no direct channel between the key generating terminals. We propose an effective key generation scheme that achieves a substantially larger key rate than that of a direct channel mimic approach. Unlike existing schemes, there is no need for the key generating terminals to obtain correlated observations in our scheme. We also investigate the effects of an active attacker on the proposed key generation protocol. We characterize the optimal attacker's strategy that minimizes the key rate of the proposed scheme. Furthermore, we establish the maximal attacker's power under which our scheme can still achieve a nonzero key rate.
Most of the existing work on key generation from wireless fading channels requires a direct wireless link between legitimate users so that they can obtain correlated observations from the common wireless link. This paper studies the key generation problem in the two-way relay channel, in which there is no direct channel between the key generating terminals. We propose an effective key generation scheme that achieves a substantially larger key rate than that of a direct channel mimic approach. Unlike existing schemes, there is no need for the key generating terminals to obtain correlated observations in our scheme. We then extend our study to the case of a relay with multiple antennas. For this scenario, we derive the optimal power allocation at the relay that maximizes the key rate achieved using our protocol.
Denial-of-Service (DoS) threats pose a major challenge to the idea of physical-layer key generation as the underlying wireless channels for key extraction are usually public. Identifying this vulnerability, we study the effect of DoS threats on relay-assisted key generation, and show that a reactive jamming attack on the distribution phase of relay-assisted key generation can forbid the nodes from extracting secret keys. To circumvent this problem, we propose a self-sustainable key generation model, wherein a frequency-hopping based distribution phase is employed to evade the jamming attack even though the participating nodes do not share prior credentials. A salient feature of the idea is to carve out a few bits from the key generation phase and subsequently use them to pick a frequency band at random for the broadcast phase. Interesting resource-allocation problems are formulated on how to extract maximum number of secret bits while also being able to evade the jamming attack with high probability. Tractable low-complexity solutions are also provided to the resource-allocation problems, along with insights on the feasibility of their implementation in practice.
The impact of relay nodes on the secret key generation via the physical layer resources is investigated. A novel relay-assisted strategy is proposed to improve the generated secret key rate. The main idea is to exploit the random channels associated with relay nodes in the network as additional random sources for the key generation. This approach is particularly useful when the channels between legitimate nodes change slowly. Three increasingly sophisticated yet more practical scenarios are studied, for which relay-assisted key generation protocols are proposed and are shown to be optimal or order-optimal in terms of the key rate. It is also shown that the presence of relay node increases the multiplexing gain. This is in sharp contrast to scenarios with relay helping information transmission, in which the relay node does not increase the multiplexing. Furthermore, a cooperative scheme is also proposed in which relays help key generation but the generated keys are kept secure from these relays.
The impact of relay nodes on the secret key generation via the physical layer resources is investigated. A novel relay-assisted strategy is proposed to improve the generated secret key rate. The main idea is to exploit the random channels associated with relay nodes in the network as additional random sources for the key generation. This approach is particularly useful when the channels between legitimate nodes change slowly. Four increasingly sophisticated yet more practical scenarios are studied, for which relay-assisted key generation protocols are proposed and are shown to be optimal or order-optimal in terms of the key rate. It is also shown that the multiplexing gain in the key rate scales linearly with the number of relays, which demonstrates that relay-assisted schemes substantially increase the key rate. This is in sharp contrast to scenarios with relays helping information transmission, in which the multiplexing gain does not scale with the number of relays. Furthermore, a cooperative scheme is also proposed in which relays help key generation but the generated keys are kept secure from these relays.