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 International Symposium on Circuits and Systems proceedings

Blind channel estimation based robust physical layer key generation in MIMO networks

Ravi P. Ramachandran, Sachin S. Shetty

Published May 1, 2010• 3 citations
Publisher

Abstract

An emerging area of interest in wireless security is the generation of secret encryption keys by leveraging the features of the physical propagation channel. The shared randomness of the wireless channel between two legitimate nodes in a communication network is exploited to provide strong secrecy. The secret keys are generated based on fluctuations or evolution of the wireless channel state. However, to the best of our knowledge, little work has been performed on algorithms to exploit the increased randomness available to wireless nodes equipped with MIMO antennas. In this paper, we present a practical key generation scheme for MIMO channels based on quantization performed on blind channel estimates. Our schemes generate random keys for transmitter and receiver by simultaneously quantizing the blind channel estimates. Our schemes are simulated for a realistic fading channel model, and performance metrics for error rate and efficiency are provided.

DOI
10.1109/iscas.2010.5537122

Related papers

Key generation exploiting MIMO channel evolution: Algorithms and theoretical limits

Jon W. Wallace, Chan Chen, Michael A. Jensen

An emerging area of research in wireless communications is the generation of secret encryption keys based on the shared (or common) randomness of the wireless channel between two legitimate nodes in a communication network. However, to date, little work has appeared on methods to use the increased randomness available when the network nodes have multiple antennas. This paper provides theoretical performance bounds associated with using multi-antenna communications and proposes two practical methods for generating secret keys exploiting the increased randomness. Performance simulations reveal the efficiency of the methods.

European Conference on Antennas and Propagation•Mar 23, 2009•79 citations

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

Secret key generation via random beamforming in stationary environment

Longwang Cheng, Wei Li, Dongtang Ma

Extracting secret key from the common randomness of wireless channel has gained significant interest as a mechanism for providing secure point-to-point communications. Current works focus on the methods of exploiting channel characterizations based on Received Signal Strength Indication (RSSI), channel phase and Channel Impulse Response (CIR) under different propagation environments. However, when the channel fading is static or quasi-static, the secret key bits derived from the channel may be identical or nearly identical. In this paper, we propose a method to solve this problem in multiple-input multiple-output (MIMO) systems based on random beamforming. Compared with single antenna systems, MIMO systems offer more randomness available. Furthermore we consider the worst scenario where the eavesdropper Eve knows perfect knowledge of the legitimate channel. The quantization error probability at Eve is simulated to assess the security of the proposed method.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 1, 2015•15 citations

Secret key generation exploiting channel characteristics in wireless communications

Kui Ren, Hai Su, Qian Wang

Due to the broadcast nature of wireless channels, wireless communication is vulnerable to eavesdropping, message modification, and node impersonation. Securing the wireless communication requires the shared secret keys between the communicating entities. Traditional security schemes rely on public key infrastructures and cryptographic algorithms to manage secret keys. Recently, many physical-layer-based methods have been proposed as alternative solutions for key generation in wireless networks. These methods exploit the inherent randomness of the wireless fading channel to generate secret keys while providing information-theoretical security without intensive cryptographic computations. This article provides an overview of the existing PHY-based key generation schemes exploiting the randomness of the wireless channels. Specifically, we first introduce the fundamental and general framework of the PHY-based key generation schemes and then categorize them into two classes: received-signal-strength-based and channel- phase-based protocols. Finally, we present a performance comparison of them in terms of key disagreement probability, key generation rate, key bit randomness, scalability, and implementation issues.

IEEE Wireless Communications•Aug 1, 2011•262 citations

Secret key generation using channel quantization with SVD for reciprocal MIMO channels

Haji Muhammad Furqan, Jehad M. Hamamreh, Hüseyin Arslan

The generation of secret keys from reciprocal wireless channel by exploiting their randomness nature, is an emerging area of interest to provide secure communication. One of the main challenges in this domain is to increase the secret key length, extracted from the shared channel coefficients between two legitimate communication parties, while maintaining its randomness and uniformity. In this work, we develop a practical key generation method, based on channel quantization with singular value decomposition (CQSVD), which is capable of significantly increasing the generated secret key in MIMO systems. This is achieved through quantizing the phases and amplitudes of the estimated MIMO channel coefficient's matrix by using an alternative form of SVD, where the key sequence is extracted from the orthogonal basis functions of the decomposed channel. In this method, it is shown that for an M ×M antenna system, with M2independent channel fading coefficients, a secret key sequence of length 2M3can be generated. The extracted key sequence is transformed to a random phase sequence, which is then used to manipulate the transmitted data on a symbol level basis rather than bit level-basis, to provide more secure communication. The comparative simulation results show that the proposed CQSVD method outperforms the state of the art secret key generation methods.

International Symposium on Wireless Communication Systems•Sep 1, 2016•38 citations

MIMO Wireless Secure Communication Using Data-Carrying Artificial Noise

Andrew D. Harper, Xiaoli Ma

In MIMO wireless channels, channel estimation can provide a source of randomness common to sender and receiver that may be used to generate secret keys. These keys can provide information theoretically secure communication. Alternatively, a known MIMO channel allows transmitting artificial noise in the null space of the main channel to secure communication. In this paper, we show that both methods can be combined to further enhance secrecy. Symbols encrypted at the transmitter simultaneously act as message for the intended receiver and as noise for any potential eavesdroppers. We derive expressions for the minimum-guaranteeable secrecy rate as a function of number of symbols encrypted. Given at least one symbol can be encrypted, our proposed method outperforms the standard artificial noise scheme in terms of both secrecy rate and power expenditure. We first analyze the system assuming keys can be instantaneously extracted from channel measurements. We then derive bounds for rates assuming the overhead time required for key generation produces a Gaussian channel-estimation error.

IEEE Transactions on Wireless Communications•Sep 20, 2016•13 citations
An emerging area of interest in wireless security is the generation of secret encryption keys by leveraging the features of the physical propagation channel. The shared randomness of the wireless channel between two legitimate nodes in a communication network is exploited to provide strong secrecy. The secret keys are generated based on fluctuations or evolution of the wireless channel state. However, to the best of our knowledge, little work has been performed on algorithms to exploit the increased randomness available to wireless nodes equipped with MIMO antennas. In this paper, we present a practical key generation scheme for MIMO channels based on quantization performed on blind channel estimates. Our schemes generate random keys for transmitter and receiver by simultaneously quantizing the blind channel estimates. Our schemes are simulated for a realistic fading channel model, and performance metrics for error rate and efficiency are provided.
An emerging area of research in wireless communications is the generation of secret encryption keys based on the shared (or common) randomness of the wireless channel between two legitimate nodes in a communication network. However, to date, little work has appeared on methods to use the increased randomness available when the network nodes have multiple antennas. This paper provides theoretical performance bounds associated with using multi-antenna communications and proposes two practical methods for generating secret keys exploiting the increased randomness. Performance simulations reveal the efficiency of the methods.
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.
Extracting secret key from the common randomness of wireless channel has gained significant interest as a mechanism for providing secure point-to-point communications. Current works focus on the methods of exploiting channel characterizations based on Received Signal Strength Indication (RSSI), channel phase and Channel Impulse Response (CIR) under different propagation environments. However, when the channel fading is static or quasi-static, the secret key bits derived from the channel may be identical or nearly identical. In this paper, we propose a method to solve this problem in multiple-input multiple-output (MIMO) systems based on random beamforming. Compared with single antenna systems, MIMO systems offer more randomness available. Furthermore we consider the worst scenario where the eavesdropper Eve knows perfect knowledge of the legitimate channel. The quantization error probability at Eve is simulated to assess the security of the proposed method.
Due to the broadcast nature of wireless channels, wireless communication is vulnerable to eavesdropping, message modification, and node impersonation. Securing the wireless communication requires the shared secret keys between the communicating entities. Traditional security schemes rely on public key infrastructures and cryptographic algorithms to manage secret keys. Recently, many physical-layer-based methods have been proposed as alternative solutions for key generation in wireless networks. These methods exploit the inherent randomness of the wireless fading channel to generate secret keys while providing information-theoretical security without intensive cryptographic computations. This article provides an overview of the existing PHY-based key generation schemes exploiting the randomness of the wireless channels. Specifically, we first introduce the fundamental and general framework of the PHY-based key generation schemes and then categorize them into two classes: received-signal-strength-based and channel- phase-based protocols. Finally, we present a performance comparison of them in terms of key disagreement probability, key generation rate, key bit randomness, scalability, and implementation issues.
The generation of secret keys from reciprocal wireless channel by exploiting their randomness nature, is an emerging area of interest to provide secure communication. One of the main challenges in this domain is to increase the secret key length, extracted from the shared channel coefficients between two legitimate communication parties, while maintaining its randomness and uniformity. In this work, we develop a practical key generation method, based on channel quantization with singular value decomposition (CQSVD), which is capable of significantly increasing the generated secret key in MIMO systems. This is achieved through quantizing the phases and amplitudes of the estimated MIMO channel coefficient's matrix by using an alternative form of SVD, where the key sequence is extracted from the orthogonal basis functions of the decomposed channel. In this method, it is shown that for an M ×M antenna system, with M2independent channel fading coefficients, a secret key sequence of length 2M3can be generated. The extracted key sequence is transformed to a random phase sequence, which is then used to manipulate the transmitted data on a symbol level basis rather than bit level-basis, to provide more secure communication. The comparative simulation results show that the proposed CQSVD method outperforms the state of the art secret key generation methods.
In MIMO wireless channels, channel estimation can provide a source of randomness common to sender and receiver that may be used to generate secret keys. These keys can provide information theoretically secure communication. Alternatively, a known MIMO channel allows transmitting artificial noise in the null space of the main channel to secure communication. In this paper, we show that both methods can be combined to further enhance secrecy. Symbols encrypted at the transmitter simultaneously act as message for the intended receiver and as noise for any potential eavesdroppers. We derive expressions for the minimum-guaranteeable secrecy rate as a function of number of symbols encrypted. Given at least one symbol can be encrypted, our proposed method outperforms the standard artificial noise scheme in terms of both secrecy rate and power expenditure. We first analyze the system assuming keys can be instantaneously extracted from channel measurements. We then derive bounds for rates assuming the overhead time required for key generation produces a Gaussian channel-estimation error.