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

International Conference on Communications

Verification of Secret Key Generation from UWB Channel Observations

Masoud Ghoreishi Madiseh, Shuai He, Michael L. McGuire, Stephen W. Neville, Xiaodai Dong

Published Jun 1, 2009• 44 citations
Publisher

Abstract

Theoretical models of ultrawideband (UWB) radio channels indicate that pairs of UWB radio transceivers measure their common radio channel with a high degree of agreement and third parties are not be able to accurately estimate the state of the common channels. These properties allow generation of secret keys to support secure communications from UWB channels measurements. In this paper, the results of UWB propagation studies are presented that validate the required properties to support secret key generation in a typical indoor environment. Key generation algorithms are employed on the measured data and key lengths on the order of thousands of bits are obtained capable of supporting most popular cryptographic systems. The paper also reports measurements of the spatial and temporal correlation of the UWB channel from which the relative privacy of the secret keys can be determined as well as the rate new secret keys may be generated.

DOI
10.1109/icc.2009.5199564

Related papers

Secret Key Extraction in Ultra Wideband Channels for Unsynchronized Radios

Masoud Ghoreishi Madiseh, Michael L. McGuire, Stephen W. Neville +1 more

Secure communications in UWB based on cryptographic keys generated from channel measurements without a trusted third party have been developed. The fine time resolution of UWB allows high levels of mutual information to be obtained by a given A and B through independent characterizations of their shared communication channel. This mutual information determines the maximum secret key rate available to A and B. Since UWB channel gains change drastically with small antenna movements, it is inherently difficult for eavesdroppers to obtain channel measurements and reduce the secret key rate. In essence, UWB can provide spatial-temporal specific secret keys. Upper bounds on the secret key rate for standard UWB channels are calculated. It is demonstrated that high secure key generation rates are possible. It is shown that these key rates can be generated over a wide range of signal to noise ratios and channel synchronization errors.

Annual Communication Networks and Services Research Conference (CNSR)•May 1, 2008•34 citations

Secret Key Generation and Agreement in UWB Communication Channels

Masoud Ghoreishi Madiseh, Michael L. McGuire, Stephen S. Neville +2 more

It has been shown that the radio channel impulse response for a pair of legitimate Ultra-wide band (UWB) transceivers can be used to generate secret keys for secure communications. Past proposed secret key generation algorithms under-exploited the available number of secret key bits from the radio channel. This paper proposes a new efficient method for generation of the shared key where the transceivers use LDPC decoders to resolve the differences in their channel impulse response measurements caused by measurement noise. To ensure secret key agreement, a method of public discussion between the two users is performed using the syndrome from Hamming (7,3) binary codes. An algorithm is proposed to check the equality of generated keys for both legitimate users, and ensure error-free secure communication. The security of this algorithm has been verified by AVISPA. Comparisons are performed with previous work on secret key generation and it has been shown that this algorithm reliably generates longer secret keys in standard UWB radio channels.

Globecom•Jan 1, 2008•54 citations

Channel Identification: Secret Sharing using Reciprocity in Ultrawideband Channels

Robert Wilson, David N. C. Tse, R.A. Scholtz

To establish a secure communications link between any two transceivers, the communicating parties require some shared secret, or key, with which to encrypt the message so that it cannot be understood by an enemy observer. Using the theory of reciprocity for antennas and electromagnetic propagation, a key distribution method is proposed that uses the ultrawideband channel pulse response between two transceivers as a source of common randomness that is not available to enemy observers in other locations. The maximum size of a key that can be shared in this way is characterized by the mutual information between the observations of two radios, and an approximation on mutual information is found for a general multipath channel and examples given for UWB channel models. Simulation results of key lengths achieved using the proposed key sharing techniques over some ultrawideband channel models are presented.

IEEE International Conference on Ultra-Wideband (ICUWB)•Sep 1, 2007•41 citations

Channel Identification: Secret Sharing Using Reciprocity in Ultrawideband Channels

Robert Wilson, David N. C. Tse, Robert A. Scholtz

To establish a secure communications link between any two transceivers, the communicating parties require some shared secret, or key, with which to encrypt the message so that it cannot be understood by an enemy observer. Using the theory of reciprocity for antennas and electromagnetic propagation, a key distribution method is proposed that uses the ultrawideband (UWB) channel pulse response between two transceivers as a source of common randomness that is not available to enemy observers in other locations. The maximum size of a key that can be shared in this way is characterized by the mutual information between the observations of two radios, and an approximation and upper bound on mutual information is found for a general multipath channel and examples given for UWB channel models. The exchange of some information between the parties is necessary to achieve these bounds, and various information-sharing strategies are considered and their performance is simulated. A qualitative assessment of the vulnerability of such a secret sharing system to attack from a radio in a nearby location is also given.

IEEE Transactions on Information Forensics and Security•Aug 22, 2007•332 citations

An Adaptive Quantization Algorithm for Secret Key Generation Using Radio Channel Measurements

Sana Tmar-Ben Hamida, Jean‐Benoît Pierrot, Claude Castelluccia

New approaches that generate secret keys from radio channel characteristics have been recently proposed. The security of these schemes usually relies on the reciprocity principle which states that the channel fluctuations can be a source of common randomness for two communicating peers and these fluctuations can't be measured by any eavesdropper. A validation of these properties for indoor environments is presented in this work. The shared keys are created by measuring the reciprocal channel features and converting this information to binary vectors using a quantization algorithm. This paper addresses the problem of quantization. It identifies an important weakness of existing key generation algorithms and it shows that the secret bits extraction has a significant impact on the robustness and security of these algorithms. A new adaptive quantization algorithm for secret key generation is presented. This method has the advantages to create sufficient long secret keys with a high key agreement ratio between authorized users without revealing information to the attacker. The new scheme is experimentally validated using Ultra Wide Band technology.

IFIP International Conference on New Technologies, Mobility and Security (NTMS)•Dec 1, 2009•77 citations

Secret Key Generation Using Reciprocity in Ultra-wideband Outdoor Wireless Channels

Jing Huang, Ting Jiang

To investigate schemes of secret key generation from Ultra-wideband (UWB) channel, we study a statistical characterization of UWB outdoor channel for a campus playground scenario based on extensive measurements.Moreover, an efficient secret key generation mechanism exploiting multipath relative delay is developed, and verification of this algorithm is conducted in UWB Line-of-sight (LOS) outdoor channels.For the first time, we compare key-mismatch probability of UWB indoor and outdoor environments.Simulation results demonstrate that the number of multipath proportionally affects key generation rate and key-mismatch probability.In comparison to the conventional method using received signal strength (RSS) as a common random source, our mechanism achieves better performance in terms of common secret bit generation.Simultaneously, security analysis indicates that the proposed scheme can still guarantee security even in the sparse outdoor physical environment free of many reflectors.

KSII Transactions on Internet and Information Systems•Feb 28, 2014•1 citation
Theoretical models of ultrawideband (UWB) radio channels indicate that pairs of UWB radio transceivers measure their common radio channel with a high degree of agreement and third parties are not be able to accurately estimate the state of the common channels. These properties allow generation of secret keys to support secure communications from UWB channels measurements. In this paper, the results of UWB propagation studies are presented that validate the required properties to support secret key generation in a typical indoor environment. Key generation algorithms are employed on the measured data and key lengths on the order of thousands of bits are obtained capable of supporting most popular cryptographic systems. The paper also reports measurements of the spatial and temporal correlation of the UWB channel from which the relative privacy of the secret keys can be determined as well as the rate new secret keys may be generated.
Secure communications in UWB based on cryptographic keys generated from channel measurements without a trusted third party have been developed. The fine time resolution of UWB allows high levels of mutual information to be obtained by a given A and B through independent characterizations of their shared communication channel. This mutual information determines the maximum secret key rate available to A and B. Since UWB channel gains change drastically with small antenna movements, it is inherently difficult for eavesdroppers to obtain channel measurements and reduce the secret key rate. In essence, UWB can provide spatial-temporal specific secret keys. Upper bounds on the secret key rate for standard UWB channels are calculated. It is demonstrated that high secure key generation rates are possible. It is shown that these key rates can be generated over a wide range of signal to noise ratios and channel synchronization errors.
It has been shown that the radio channel impulse response for a pair of legitimate Ultra-wide band (UWB) transceivers can be used to generate secret keys for secure communications. Past proposed secret key generation algorithms under-exploited the available number of secret key bits from the radio channel. This paper proposes a new efficient method for generation of the shared key where the transceivers use LDPC decoders to resolve the differences in their channel impulse response measurements caused by measurement noise. To ensure secret key agreement, a method of public discussion between the two users is performed using the syndrome from Hamming (7,3) binary codes. An algorithm is proposed to check the equality of generated keys for both legitimate users, and ensure error-free secure communication. The security of this algorithm has been verified by AVISPA. Comparisons are performed with previous work on secret key generation and it has been shown that this algorithm reliably generates longer secret keys in standard UWB radio channels.
To establish a secure communications link between any two transceivers, the communicating parties require some shared secret, or key, with which to encrypt the message so that it cannot be understood by an enemy observer. Using the theory of reciprocity for antennas and electromagnetic propagation, a key distribution method is proposed that uses the ultrawideband channel pulse response between two transceivers as a source of common randomness that is not available to enemy observers in other locations. The maximum size of a key that can be shared in this way is characterized by the mutual information between the observations of two radios, and an approximation on mutual information is found for a general multipath channel and examples given for UWB channel models. Simulation results of key lengths achieved using the proposed key sharing techniques over some ultrawideband channel models are presented.
To establish a secure communications link between any two transceivers, the communicating parties require some shared secret, or key, with which to encrypt the message so that it cannot be understood by an enemy observer. Using the theory of reciprocity for antennas and electromagnetic propagation, a key distribution method is proposed that uses the ultrawideband (UWB) channel pulse response between two transceivers as a source of common randomness that is not available to enemy observers in other locations. The maximum size of a key that can be shared in this way is characterized by the mutual information between the observations of two radios, and an approximation and upper bound on mutual information is found for a general multipath channel and examples given for UWB channel models. The exchange of some information between the parties is necessary to achieve these bounds, and various information-sharing strategies are considered and their performance is simulated. A qualitative assessment of the vulnerability of such a secret sharing system to attack from a radio in a nearby location is also given.
New approaches that generate secret keys from radio channel characteristics have been recently proposed. The security of these schemes usually relies on the reciprocity principle which states that the channel fluctuations can be a source of common randomness for two communicating peers and these fluctuations can't be measured by any eavesdropper. A validation of these properties for indoor environments is presented in this work. The shared keys are created by measuring the reciprocal channel features and converting this information to binary vectors using a quantization algorithm. This paper addresses the problem of quantization. It identifies an important weakness of existing key generation algorithms and it shows that the secret bits extraction has a significant impact on the robustness and security of these algorithms. A new adaptive quantization algorithm for secret key generation is presented. This method has the advantages to create sufficient long secret keys with a high key agreement ratio between authorized users without revealing information to the attacker. The new scheme is experimentally validated using Ultra Wide Band technology.
To investigate schemes of secret key generation from Ultra-wideband (UWB) channel, we study a statistical characterization of UWB outdoor channel for a campus playground scenario based on extensive measurements.Moreover, an efficient secret key generation mechanism exploiting multipath relative delay is developed, and verification of this algorithm is conducted in UWB Line-of-sight (LOS) outdoor channels.For the first time, we compare key-mismatch probability of UWB indoor and outdoor environments.Simulation results demonstrate that the number of multipath proportionally affects key generation rate and key-mismatch probability.In comparison to the conventional method using received signal strength (RSS) as a common random source, our mechanism achieves better performance in terms of common secret bit generation.Simultaneously, security analysis indicates that the proposed scheme can still guarantee security even in the sparse outdoor physical environment free of many reflectors.