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 Globecom Workshops (GC Wkshps)

Secure physical-layer key generation protocol and key encoding in wireless communications

Apirath Limmanee, Werner Henkel

Published Dec 1, 2010• 8 citations
Publisher

Abstract

Wireless communication between two nodes in a multi-path, multi-hop network does not require that the forward transmission path and the reverse one are the same. However, if a physical-layer security scheme based on mutual channel-state-information (CSI) is used, they at least have to make sure that they use the same channels for secret-key generation. A protocol is proposed in this paper to achieve that purpose in a secure manner. An information-theoretic analysis of physical-layer key generation given in states that there are vulnerable key symbols that might be estimated by eavesdroppers. In this paper, we show how to protect those key symbols by means of physical-layer key encoding. We provide necessary and sufficient conditions on the code in order to achieve perfect secrecy, even when the eavesdropper knows the code, and derive the asymptotic code rate accordingly. We also discuss how to design the code when the number of vulnerable key symbols are not known.

DOI
10.1109/glocomw.2010.5700466

Related papers

On Enhancements of Physical Layer Secret Key Generation and Its Application in Wireless Communication Systems

Kang Liu

As an alternative and appealing approach to providing information security in wireless communication systems, secret key generation at physical layer has demonstrated its potential in terms of efficiency and reliability over traditional cryptographic methods. Without the necessity of a management centre for key distribution or reliance on computational complexity, physical layer key generation protocols enable two wireless entities to extract identical and dynamic keys from the randomness of the wireless channels associated with them.\nIn this thesis, the reliability of secret key generation at the physical layer is examined in practical wireless channels with imperfect channel state information (CSI). Theoretical analyses are provided to relate key match rate with channel's signal-to-noise ratio (SNR), degrees of channel reciprocity, and iterations of information reconciliation.\nIn order to increase key match rate of physical layer secret key generation, improved schemes in the steps of channel estimation and sample quantization are proposed respectively. In the channel estimation step, multiple observations of the wireless channels are integrated with a linear processor to provide a synthesized and more accurate estimation of the wireless channel. In the sample quantization step, a magnitude based quantization method with two thresholds is proposed to quantize partial samples, where specific quantization areas are selected to reduce cross-over errors. Significant improvements in key match rate are proven for both schemes in theoretical analysis and numerical simulations. Key match rate can even achieve 100% in both schemes with the assistance of information reconciliation process.\nIn the end, a practical application of physical layer secret key generation is presented, where dynamic keys extracted from the wireless channels are utilized for securing secret data transmission and providing efficient access control.

•Jan 1, 2015•1 citation

Secure Physical Layer Key Generation Schemes: Performance and Information Theoretic Limits

Jon W. Wallace

There is growing interest in wireless security methods that provide strong or even perfect secrecy by taking advantage of features of the physical propagation channel. In advantage-based methods, high channel quality in an average or opportunistic sense is exploited between two legitimate nodes, such that nonzero secrecy capacity can be achieved. Since such methods require bounds on the quality of the eavesdropper channel, they are somewhat impractical. Secret key generation based on tracking channel evolution in time division duplex systems is a more attractive option, where two nodes generate secret key bits based on a mutually known random channel. Since the eavesdropper channel is typically independent of the legitimate channel, the key can only be broken by brute force attacks, which are difficult when new keys are continuously generated. In this paper, the information theoretic limits of key generation schemes are investigated, based on the level of estimation error, temporal correlation, and dependence of the eavesdropper and legitimate channels. Three practical candidate key generation schemes are also considered: channel quantization and channel quantization with guardband.

International Conference on Communications•Jun 1, 2009•82 citations

A Novel Physical Layer Key Generation and Authenticated Encryption Protocol Exploiting Shared Randomness

Cornelius Onuvoye Saiki

The use of wireless networks for communication has grown significantly in recent times, and continues to develop further. The broadcast nature of wireless communications makes them susceptible to a wide variety of security attacks. Unlike traditional solutions, which usually handle security at the application layer, the primary concern of this dissertation is to analyse and develop solutions for secure communication using channel coding techniques at the physical-layer. \nThe topic of physical layer authenticated encryption using high rate key generation through shared randomness is investigated in this work. First, a physical layer secret key generation scheme is discussed exploiting channel reciprocity in wireless systems. In order to address the susceptibility of this family of schemes to active attacks, a novel physical layer authentication encryption protocol is presented along with its extension to multi-node networks in the presence of active adversaries. Unlike previous work in the area of generating secret keys through shared randomness, it is demonstrated that the proposed scheme is semantically secure with respect to chosen plaintext and chosen cipher text attacks. \nSecondly, in order to increase the rate in bits per seconds at which agreed cryptographic keys are been generated, a multi-level quantization algorithm with public feedback is discussed. It is demonstrated that the proposed scheme is superior to direct information distillation approaches and can substantially increase the key generation rates even at low and medium SNRs. Furthermore, the employment of this low-overhead feedback at the information distillation process can largely simplify the information reconciliation process. \nThe proposed secret key generation schemes are tested for randomness such as required for cryptographic keys. The validation test is perfomed with the aid of National Institute of Standards and Technology (NIST) statistical test suite. The P-values obtained in each of the test carried out indicates that the key sequence generated by our algorithm is random.

•May 5, 2016•0 citations

Study On Physical Layer Wireless Security Techniques

S Lemya, VM Meera, A Thrupthi

Communication security is an essential and progressively difficult issue in wireless networks. Physical-layer approach to secret key generation which is each quick and independent of channel variations is taken into account. This approach makes a receiver jam the signal during a manner that also permits it to decrypt the info, nevertheless prevents alternative nodes from cryptography. Another well-known approach for achieving information-theoretic secrecy depends on deploying artificial noises to blind the intruders’ interception within the physical layer. A multiple inter-symbol obfuscation (MIO) theme is planned, that utilizes a collection of artificial vociferous symbols to alter the initial knowledge symbols within the physical layer. MIO will effectively enhance the wireless communications security.

International Journal of Computer Sciences and Engineering•Nov 11, 2025•0 citations

Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey

Amitav Mukherjee, S. Ali. A. Fakoorian, Jing Huang +1 more

This paper provides a comprehensive review of the domain of physical layer security in multiuser wireless networks. The essential premise of physical layer security is to enable the exchange of confidential messages over a wireless medium in the presence of unauthorized eavesdroppers, without relying on higher-layer encryption. This can be achieved primarily in two ways: without the need for a secret key by intelligently designing transmit coding strategies, or by exploiting the wireless communication medium to develop secret keys over public channels. The survey begins with an overview of the foundations dating back to the pioneering work of Shannon and Wyner on information-theoretic security. We then describe the evolution of secure transmission strategies from point-to-point channels to multiple-antenna systems, followed by generalizations to multiuser broadcast, multiple-access, interference, and relay networks. Secret-key generation and establishment protocols based on physical layer mechanisms are subsequently covered. Approaches for secrecy based on channel coding design are then examined, along with a description of inter-disciplinary approaches based on game theory and stochastic geometry. The associated problem of physical layer message authentication is also briefly introduced. The survey concludes with observations on potential research directions in this area.

arXiv:1011.3754•IEEE Communications Surveys & Tutorials•Jan 1, 2014•1,488 citations

Wireless Physical Layer Security: Towards Practical Assumptions and Requirements

Biao He

The current research on physical layer security is far from implementations in practical networks, arguably due to impractical assumptions in the literature and the limited applicability of physical layer security. Aiming to reduce the gap between theory and practice, this thesis focuses on wireless physical layer security towards practical assumptions and requirements. In the first half of the thesis, we reduce the dependence of physical layer security on impractical assumptions. The secrecy enhancements and analysis based on impractical assumptions cannot lead to any true guarantee of secrecy in practical networks. The current study of physical layer security was often based on the idealized assumption of perfect channel knowledge on both legitimate users and eavesdroppers. We study the impact of channel estimation errors on secure transmission designs. We investigate the practical scenarios where both the transmitter and the receiver have imperfect channel state information (CSI). Our results show how the optimal transmission design and the achievable throughput vary with the amount of knowledge on the eavesdropper's channel. Apart from the assumption of perfect CSI, the analysis of physical layer security often ideally assumed the number of eavesdropper antennas to be known. We develop an innovative approach to study secure communication systems without knowing the number of eavesdropper antennas by introducing the concept of spatial constraint into physical layer security. That is, the eavesdropper is assumed to have a limited spatial region to place (possibly an infinite number of) antennas. We show that a non-zero secrecy rate is achievable with the help of a friendly jammer, even if the eavesdropper places an infinite number of antennas in its spatial region. In the second half of the thesis, we improve the applicability of physical layer security. The current physical layer security techniques to achieve confidential broadcasting were limited to application in single-cell systems. The primary challenge to achieve confidential broadcasting in the multi-cell network is to deal with not only the inter-cell but also the intra-cell information leakage and interference. To tackle this challenge, we design linear precoders performing confidential broadcasting in multi-cell networks. We optimize the precoder designs to maximize the secrecy sum rate with based on the large-system analysis. Finally, we improve the applicability of physical layer security from a fundamental aspect. The analysis of physical layer security based on the existing secrecy metric was often not applicable in practical networks. We propose new metrics for evaluating the secrecy of transmissions over fading channels to address the practical limitations of using existing secrecy metrics for such evaluations. The first metric establishes a link between the concept of secrecy outage and the eavesdropper's ability to decode confidential messages. The second metric provides an error-probability-based secrecy metric which is often used for the practical implementation of secure wireless systems. The third metric characterizes how much or how fast the confidential information is leaked to the eavesdropper. We show that the proposed secrecy metrics enable one to appropriately design secure communication systems with different views on how secrecy is measured.

•Jan 1, 2016•1 citation
Wireless communication between two nodes in a multi-path, multi-hop network does not require that the forward transmission path and the reverse one are the same. However, if a physical-layer security scheme based on mutual channel-state-information (CSI) is used, they at least have to make sure that they use the same channels for secret-key generation. A protocol is proposed in this paper to achieve that purpose in a secure manner. An information-theoretic analysis of physical-layer key generation given in states that there are vulnerable key symbols that might be estimated by eavesdroppers. In this paper, we show how to protect those key symbols by means of physical-layer key encoding. We provide necessary and sufficient conditions on the code in order to achieve perfect secrecy, even when the eavesdropper knows the code, and derive the asymptotic code rate accordingly. We also discuss how to design the code when the number of vulnerable key symbols are not known.
As an alternative and appealing approach to providing information security in wireless communication systems, secret key generation at physical layer has demonstrated its potential in terms of efficiency and reliability over traditional cryptographic methods. Without the necessity of a management centre for key distribution or reliance on computational complexity, physical layer key generation protocols enable two wireless entities to extract identical and dynamic keys from the randomness of the wireless channels associated with them.\nIn this thesis, the reliability of secret key generation at the physical layer is examined in practical wireless channels with imperfect channel state information (CSI). Theoretical analyses are provided to relate key match rate with channel's signal-to-noise ratio (SNR), degrees of channel reciprocity, and iterations of information reconciliation.\nIn order to increase key match rate of physical layer secret key generation, improved schemes in the steps of channel estimation and sample quantization are proposed respectively. In the channel estimation step, multiple observations of the wireless channels are integrated with a linear processor to provide a synthesized and more accurate estimation of the wireless channel. In the sample quantization step, a magnitude based quantization method with two thresholds is proposed to quantize partial samples, where specific quantization areas are selected to reduce cross-over errors. Significant improvements in key match rate are proven for both schemes in theoretical analysis and numerical simulations. Key match rate can even achieve 100% in both schemes with the assistance of information reconciliation process.\nIn the end, a practical application of physical layer secret key generation is presented, where dynamic keys extracted from the wireless channels are utilized for securing secret data transmission and providing efficient access control.
There is growing interest in wireless security methods that provide strong or even perfect secrecy by taking advantage of features of the physical propagation channel. In advantage-based methods, high channel quality in an average or opportunistic sense is exploited between two legitimate nodes, such that nonzero secrecy capacity can be achieved. Since such methods require bounds on the quality of the eavesdropper channel, they are somewhat impractical. Secret key generation based on tracking channel evolution in time division duplex systems is a more attractive option, where two nodes generate secret key bits based on a mutually known random channel. Since the eavesdropper channel is typically independent of the legitimate channel, the key can only be broken by brute force attacks, which are difficult when new keys are continuously generated. In this paper, the information theoretic limits of key generation schemes are investigated, based on the level of estimation error, temporal correlation, and dependence of the eavesdropper and legitimate channels. Three practical candidate key generation schemes are also considered: channel quantization and channel quantization with guardband.
The use of wireless networks for communication has grown significantly in recent times, and continues to develop further. The broadcast nature of wireless communications makes them susceptible to a wide variety of security attacks. Unlike traditional solutions, which usually handle security at the application layer, the primary concern of this dissertation is to analyse and develop solutions for secure communication using channel coding techniques at the physical-layer. \nThe topic of physical layer authenticated encryption using high rate key generation through shared randomness is investigated in this work. First, a physical layer secret key generation scheme is discussed exploiting channel reciprocity in wireless systems. In order to address the susceptibility of this family of schemes to active attacks, a novel physical layer authentication encryption protocol is presented along with its extension to multi-node networks in the presence of active adversaries. Unlike previous work in the area of generating secret keys through shared randomness, it is demonstrated that the proposed scheme is semantically secure with respect to chosen plaintext and chosen cipher text attacks. \nSecondly, in order to increase the rate in bits per seconds at which agreed cryptographic keys are been generated, a multi-level quantization algorithm with public feedback is discussed. It is demonstrated that the proposed scheme is superior to direct information distillation approaches and can substantially increase the key generation rates even at low and medium SNRs. Furthermore, the employment of this low-overhead feedback at the information distillation process can largely simplify the information reconciliation process. \nThe proposed secret key generation schemes are tested for randomness such as required for cryptographic keys. The validation test is perfomed with the aid of National Institute of Standards and Technology (NIST) statistical test suite. The P-values obtained in each of the test carried out indicates that the key sequence generated by our algorithm is random.
Communication security is an essential and progressively difficult issue in wireless networks. Physical-layer approach to secret key generation which is each quick and independent of channel variations is taken into account. This approach makes a receiver jam the signal during a manner that also permits it to decrypt the info, nevertheless prevents alternative nodes from cryptography. Another well-known approach for achieving information-theoretic secrecy depends on deploying artificial noises to blind the intruders’ interception within the physical layer. A multiple inter-symbol obfuscation (MIO) theme is planned, that utilizes a collection of artificial vociferous symbols to alter the initial knowledge symbols within the physical layer. MIO will effectively enhance the wireless communications security.
This paper provides a comprehensive review of the domain of physical layer security in multiuser wireless networks. The essential premise of physical layer security is to enable the exchange of confidential messages over a wireless medium in the presence of unauthorized eavesdroppers, without relying on higher-layer encryption. This can be achieved primarily in two ways: without the need for a secret key by intelligently designing transmit coding strategies, or by exploiting the wireless communication medium to develop secret keys over public channels. The survey begins with an overview of the foundations dating back to the pioneering work of Shannon and Wyner on information-theoretic security. We then describe the evolution of secure transmission strategies from point-to-point channels to multiple-antenna systems, followed by generalizations to multiuser broadcast, multiple-access, interference, and relay networks. Secret-key generation and establishment protocols based on physical layer mechanisms are subsequently covered. Approaches for secrecy based on channel coding design are then examined, along with a description of inter-disciplinary approaches based on game theory and stochastic geometry. The associated problem of physical layer message authentication is also briefly introduced. The survey concludes with observations on potential research directions in this area.
The current research on physical layer security is far from implementations in practical networks, arguably due to impractical assumptions in the literature and the limited applicability of physical layer security. Aiming to reduce the gap between theory and practice, this thesis focuses on wireless physical layer security towards practical assumptions and requirements. In the first half of the thesis, we reduce the dependence of physical layer security on impractical assumptions. The secrecy enhancements and analysis based on impractical assumptions cannot lead to any true guarantee of secrecy in practical networks. The current study of physical layer security was often based on the idealized assumption of perfect channel knowledge on both legitimate users and eavesdroppers. We study the impact of channel estimation errors on secure transmission designs. We investigate the practical scenarios where both the transmitter and the receiver have imperfect channel state information (CSI). Our results show how the optimal transmission design and the achievable throughput vary with the amount of knowledge on the eavesdropper's channel. Apart from the assumption of perfect CSI, the analysis of physical layer security often ideally assumed the number of eavesdropper antennas to be known. We develop an innovative approach to study secure communication systems without knowing the number of eavesdropper antennas by introducing the concept of spatial constraint into physical layer security. That is, the eavesdropper is assumed to have a limited spatial region to place (possibly an infinite number of) antennas. We show that a non-zero secrecy rate is achievable with the help of a friendly jammer, even if the eavesdropper places an infinite number of antennas in its spatial region. In the second half of the thesis, we improve the applicability of physical layer security. The current physical layer security techniques to achieve confidential broadcasting were limited to application in single-cell systems. The primary challenge to achieve confidential broadcasting in the multi-cell network is to deal with not only the inter-cell but also the intra-cell information leakage and interference. To tackle this challenge, we design linear precoders performing confidential broadcasting in multi-cell networks. We optimize the precoder designs to maximize the secrecy sum rate with based on the large-system analysis. Finally, we improve the applicability of physical layer security from a fundamental aspect. The analysis of physical layer security based on the existing secrecy metric was often not applicable in practical networks. We propose new metrics for evaluating the secrecy of transmissions over fading channels to address the practical limitations of using existing secrecy metrics for such evaluations. The first metric establishes a link between the concept of secrecy outage and the eavesdropper's ability to decode confidential messages. The second metric provides an error-probability-based secrecy metric which is often used for the practical implementation of secure wireless systems. The third metric characterizes how much or how fast the confidential information is leaked to the eavesdropper. We show that the proposed secrecy metrics enable one to appropriately design secure communication systems with different views on how secrecy is measured.