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 Conference on Communications and Network Security

On full-duplex secure key generation with deterministic models

Rick Fritschek, Gerhard Wunder

Published Oct 1, 2017• 3 citations
Publisher

Abstract

The potential of full-duplex in communication design has been recently considered for emerging technologies such as 5G. Moreover, full-duplex can play a crucial role in upcoming secure communication scenarios too. However, results in the literature are limited and only explore scenarios, where the wireless channel is used either for key generation or for secure messaging. Our first contribution is the invention of a deterministic model for full-duplex communication which can analyse both scenarios, depending on the channel gain. Moreover, the properties of the model allow investigating scenarios, which were out of reach before, e.g. mixed channel gain randomness. Furthermore, it can incorporate a recently proposed scheme, called product signalling, which utilizes secure messaging and measures the channel gain bits at the same time. We demonstrate the utility of the model by investigating pilot signalling, i.e. secure key generation and secure messaging, for a two-way wiretap channel model. While pilot signalling is useful for channels with short coherence time, we will see that cooperative jamming is needed for channels with long coherence time. The bit-level nature of our model enables jamming schemes where users can jam individual levels at Eve, in contrast to previous achievable schemes where the users either send messages or jamming signals.

DOI
10.1109/cns.2017.8228687

Related papers

On-the-fly secure key generation with deterministic models

Rick Fritschek, Gerhard Wunder

It is well-known that wireless channel reciprocity together with fading can be exploited to generate a common secret key between two legitimate communication partners. This can be achieved by exchanging known deterministic pilot signals between both partners from which the random fading gains can be estimated and processed. However, the entropy and thus quality of the generated key depends on the channel coherence time. This can result in poor key generation rates in a low mobility environment, where the fading gains are nearly constant. Therefore, wide-spread deployment of wireless channel-based secret key generation is limited. To overcome these issues, we follow up on a recent idea which uses unknown random pilots and enables “on-the-fly” key generation. In addition, the scheme is able to incorporate local sources of randomness but performance bounds are hard to obtain with standard methods. In this paper, we analyse such a scheme analytically and derive achievable key rates in the Alice-Bob-Eve setting. For this purpose, we develop a novel approximation model which is inspired by the linear deterministic and the lower triangular deterministic model. We claim that our novel approach provides an intuitive and clear framework to analyse similar key generation problems.

arXiv:1705.01325•International Conference on Communications•May 1, 2017•4 citations

Secret Key Analysis of Random Pilot Full-Duplex Secret Key Generation in Static Environments

Roger Kwao Ahiadormey, Dennis Agyemanh Nana Gookyi, Michael Wilson +1 more

This paper presents a random pilot full-duplex (FD) secret key generation scheme designed to enhance security in static wireless environments. In these environments, where inherent channel randomness is limited, efficiently extracting secret keys poses a significant challenge. The proposed scheme leverages the benefits of both FD operation and random pilot transmission to overcome this limitation and enhance the physical layer security. In this scheme, one of the FD nodes transmits random pilot signals, unknown to the eavesdropper, during the channel probing phase to artificially increase the shared randomness between the legitimate communicating nodes. By considering correlated eavesdropping, we derive the lower and upper bounds for the achievable secret key rate (SKR). The results reveal that the proposed FD scheme outperforms the HD scheme even in the presence of residual SI. Furthermore, the secret key rate can be improved by better SIC channel estimation and lower eavesdropper channel correlation.

Journal of Applied Science and Information Technology•Sep 23, 2025•0 citations

The Two-Way Wiretap Channel: Achievable Regions and Experimental Results

Aly El Gamal, O. Ozan Koyluoglu, Moustafa A. Youssef +1 more

This work considers the two-way wiretap channel in which two legitimate users, Alice and Bob, wish to exchange messages securely in the presence of a passive eavesdropper Eve. In the full-duplex scenario, where each node can transmit and receive simultaneously, we obtain new achievable secrecy rate regions based on the idea of allowing the two users to jointly optimize their channel prefixing distributions and binning codebooks in addition to key sharing. The new regions are shown to be strictly larger than the known ones for a wide class of discrete memoryless and Gaussian channels. In the half-duplex case, where a user can only transmit or receive on any given degree of freedom, we introduce the idea of randomized scheduling and establish the significant gain it offers in terms of the achievable secrecy sum-rate. We further develop an experimental setup based on a IEEE 802.15.4-enabled sensor boards, and use this testbed to show that one can exploit the two-way nature of the communication, via appropriately randomizing the transmit power levels and transmission schedule, to introduce significant ambiguity at a noiseless Eve.

arXiv:1006.0778•Jun 4, 2010•3 citations

The Two Way Wiretap Channel: Theory and Practice

Aly El Gamal, O. Ozan Koyluoglu, Moustafa A. Youssef +1 more

This work considers the two way wiretap channel in which two legitimate users, Alice and Bob, wish to exchange messages securely in the presence of a passive eavesdropper Eve. In the full duplex scenario, where each node can transmit and receive simultaneously, we obtain new achievable secrecy rate regions based on the idea of allowing the two users to jointly optimize their channel prefixing distributions and binning codebooks; in addition to key sharing. The new regions are shown to be strictly larger than the known ones for a wide class of discrete memoryless and Gaussian channels. In the half duplex case, where a user can only transmit or receive on any given degree of freedom, we introduce the idea of randomized scheduling and establish the significant gain it offers in terms of the achievable secrecy sum-rate. We further develop an experimental setup based on a IEEE 802.15.4-enabled sensor boards to validate our theoretical analysis. Using this testbed, it is shown that one can exploit the two way nature of the communication, via appropriately randomizing the transmit power levels and transmission schedule, to introduce significant ambiguity at a noiseless Eve. To the best of our knowledge, this is one of the first attempts aiming towards building practical secrecy protocols inspired by information theoretic principles.

•Jun 4, 2010•5 citations

Achievable Secrecy Rate Regions for the Two-Way Wiretap Channel

Aly El Gamal, O. Ozan Koyluoglu, Moustafa A. Youssef +1 more

The two-way wiretap channel is considered in this paper. Two legitimate users, Alice and Bob, wish to exchange messages securely in the presence of a passive eavesdropper Eve. In the full-duplex scenario, where each node can transmit and receive simultaneously, new achievable secrecy rate regions are obtained based on the idea of allowing the two users to jointly optimize their channel prefixing distributions and binning codebooks in addition to key sharing. The new regions are shown to be strictly larger than the known ones for a wide class of discrete memoryless and Gaussian channels. In the half-duplex case, where a user can only transmit or receive on any given degree of freedom, the idea of randomized scheduling is introduced and shown to offer a significant gain in terms of the achievable secrecy sum-rate. A practical setup is further developed based on a near field wireless communication scenario, and it is shown that one can exploit the two-way nature of the communication, via appropriately randomizing the transmit power levels and transmission schedule, to introduce significant ambiguity at a noiseless Eve.

IEEE Transactions on Information Theory•Sep 16, 2013•49 citations

New achievable secrecy rate regions for the two way wiretap channel

Aly El Gamal, O. Ozan Koyluoglu, Moustafa A. Youssef +1 more

This work develops new achievable rate regions for the two way wiretap channel. In our setup, Alice and Bob wish to exchange messages securely in the presence of a passive eavesdropper Eve. In the full-duplex scenario, our achievability argument relies on allowing the two users to jointly optimize their channel prefixing distributions, such that the new channel conditions are favorable compared to that of Eve. Random binning and private key sharing over the channel are then used to exploit the secrecy advantage available in the equivalent cascade channel and to distribute the available secrecy rate among users. For the half-duplex case, we introduce the idea of randomized scheduling and establish the significant gain it offers in terms of the achievable secrecy sum-rate. We also quantify the gains that can be leveraged from the proposed schemes in the modulo-2 and Gaussian channels via numerical results in certain selected scenarios.

IEEE Information Theory Workshop (ITW)•Jan 1, 2010•11 citations
The potential of full-duplex in communication design has been recently considered for emerging technologies such as 5G. Moreover, full-duplex can play a crucial role in upcoming secure communication scenarios too. However, results in the literature are limited and only explore scenarios, where the wireless channel is used either for key generation or for secure messaging. Our first contribution is the invention of a deterministic model for full-duplex communication which can analyse both scenarios, depending on the channel gain. Moreover, the properties of the model allow investigating scenarios, which were out of reach before, e.g. mixed channel gain randomness. Furthermore, it can incorporate a recently proposed scheme, called product signalling, which utilizes secure messaging and measures the channel gain bits at the same time. We demonstrate the utility of the model by investigating pilot signalling, i.e. secure key generation and secure messaging, for a two-way wiretap channel model. While pilot signalling is useful for channels with short coherence time, we will see that cooperative jamming is needed for channels with long coherence time. The bit-level nature of our model enables jamming schemes where users can jam individual levels at Eve, in contrast to previous achievable schemes where the users either send messages or jamming signals.
It is well-known that wireless channel reciprocity together with fading can be exploited to generate a common secret key between two legitimate communication partners. This can be achieved by exchanging known deterministic pilot signals between both partners from which the random fading gains can be estimated and processed. However, the entropy and thus quality of the generated key depends on the channel coherence time. This can result in poor key generation rates in a low mobility environment, where the fading gains are nearly constant. Therefore, wide-spread deployment of wireless channel-based secret key generation is limited. To overcome these issues, we follow up on a recent idea which uses unknown random pilots and enables “on-the-fly” key generation. In addition, the scheme is able to incorporate local sources of randomness but performance bounds are hard to obtain with standard methods. In this paper, we analyse such a scheme analytically and derive achievable key rates in the Alice-Bob-Eve setting. For this purpose, we develop a novel approximation model which is inspired by the linear deterministic and the lower triangular deterministic model. We claim that our novel approach provides an intuitive and clear framework to analyse similar key generation problems.
This paper presents a random pilot full-duplex (FD) secret key generation scheme designed to enhance security in static wireless environments. In these environments, where inherent channel randomness is limited, efficiently extracting secret keys poses a significant challenge. The proposed scheme leverages the benefits of both FD operation and random pilot transmission to overcome this limitation and enhance the physical layer security. In this scheme, one of the FD nodes transmits random pilot signals, unknown to the eavesdropper, during the channel probing phase to artificially increase the shared randomness between the legitimate communicating nodes. By considering correlated eavesdropping, we derive the lower and upper bounds for the achievable secret key rate (SKR). The results reveal that the proposed FD scheme outperforms the HD scheme even in the presence of residual SI. Furthermore, the secret key rate can be improved by better SIC channel estimation and lower eavesdropper channel correlation.
This work considers the two-way wiretap channel in which two legitimate users, Alice and Bob, wish to exchange messages securely in the presence of a passive eavesdropper Eve. In the full-duplex scenario, where each node can transmit and receive simultaneously, we obtain new achievable secrecy rate regions based on the idea of allowing the two users to jointly optimize their channel prefixing distributions and binning codebooks in addition to key sharing. The new regions are shown to be strictly larger than the known ones for a wide class of discrete memoryless and Gaussian channels. In the half-duplex case, where a user can only transmit or receive on any given degree of freedom, we introduce the idea of randomized scheduling and establish the significant gain it offers in terms of the achievable secrecy sum-rate. We further develop an experimental setup based on a IEEE 802.15.4-enabled sensor boards, and use this testbed to show that one can exploit the two-way nature of the communication, via appropriately randomizing the transmit power levels and transmission schedule, to introduce significant ambiguity at a noiseless Eve.
This work considers the two way wiretap channel in which two legitimate users, Alice and Bob, wish to exchange messages securely in the presence of a passive eavesdropper Eve. In the full duplex scenario, where each node can transmit and receive simultaneously, we obtain new achievable secrecy rate regions based on the idea of allowing the two users to jointly optimize their channel prefixing distributions and binning codebooks; in addition to key sharing. The new regions are shown to be strictly larger than the known ones for a wide class of discrete memoryless and Gaussian channels. In the half duplex case, where a user can only transmit or receive on any given degree of freedom, we introduce the idea of randomized scheduling and establish the significant gain it offers in terms of the achievable secrecy sum-rate. We further develop an experimental setup based on a IEEE 802.15.4-enabled sensor boards to validate our theoretical analysis. Using this testbed, it is shown that one can exploit the two way nature of the communication, via appropriately randomizing the transmit power levels and transmission schedule, to introduce significant ambiguity at a noiseless Eve. To the best of our knowledge, this is one of the first attempts aiming towards building practical secrecy protocols inspired by information theoretic principles.
The two-way wiretap channel is considered in this paper. Two legitimate users, Alice and Bob, wish to exchange messages securely in the presence of a passive eavesdropper Eve. In the full-duplex scenario, where each node can transmit and receive simultaneously, new achievable secrecy rate regions are obtained based on the idea of allowing the two users to jointly optimize their channel prefixing distributions and binning codebooks in addition to key sharing. The new regions are shown to be strictly larger than the known ones for a wide class of discrete memoryless and Gaussian channels. In the half-duplex case, where a user can only transmit or receive on any given degree of freedom, the idea of randomized scheduling is introduced and shown to offer a significant gain in terms of the achievable secrecy sum-rate. A practical setup is further developed based on a near field wireless communication scenario, and it is shown that one can exploit the two-way nature of the communication, via appropriately randomizing the transmit power levels and transmission schedule, to introduce significant ambiguity at a noiseless Eve.
This work develops new achievable rate regions for the two way wiretap channel. In our setup, Alice and Bob wish to exchange messages securely in the presence of a passive eavesdropper Eve. In the full-duplex scenario, our achievability argument relies on allowing the two users to jointly optimize their channel prefixing distributions, such that the new channel conditions are favorable compared to that of Eve. Random binning and private key sharing over the channel are then used to exploit the secrecy advantage available in the equivalent cascade channel and to distribute the available secrecy rate among users. For the half-duplex case, we introduce the idea of randomized scheduling and establish the significant gain it offers in terms of the achievable secrecy sum-rate. We also quantify the gains that can be leveraged from the proposed schemes in the modulo-2 and Gaussian channels via numerical results in certain selected scenarios.