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 Conference on Ultra-Wideband (ICUWB)

Channel Identification: Secret Sharing using Reciprocity in Ultrawideband Channels

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

Published Sep 1, 2007• 39 citations
Publisher

Abstract

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.

DOI
10.1109/icuwb.2007.4380954

Related papers

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

Verification of Secret Key Generation from UWB Channel Observations

Masoud Ghoreishi Madiseh, Shuai He, Michael L. McGuire +2 more

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.

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

Secret Key Generation from Common Randomness over Ultra-wideband Wireless Channels

Jing jing Huang, Ting Jiang

We develop a secret key generation scheme using phase estimation in ultra-wideband (UWB) wireless fading channels.Based on the reciprocity theorem, two terminals extract the phase of the channel as a common random source to generate secret bits.Moreover, we study the secret key rate by a pair of nodes observing correlated sources and communicating to achieve secret key agreement over public communication channels.As our main results, we establish a more practical upper bound from Cramer-Rao bound (CRB) and compare it with a universally theoretical upper bound on the shared maximum key rate from mutual information of correlated random sources.Derivation and numerical examples are presented to demonstrate the bound.Simulation studies are also provided to validate feasibility and efficiency of the proposed scheme.

KSII Transactions on Internet and Information Systems•Oct 31, 2014•2 citations

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•32 citations

Dynamic secret key generation exploiting Ultra-wideband wireless channel characteristics

Jingjing Huang, Ting Jiang

To guarantee a secure wireless communication between any two transceivers, the shared secret key is a requirement. Communication parties need to encrypt the message with the key to impede an adversary's eavesdropping. By exploiting Ultra-wideband (UWB) wireless fading channels as a source of common randomness, two transceivers with correlated observations can generate secret keys with information-theoretical security. The state of the art of existing works, however, has neglected to consider efficient channel probing. In this paper, we define a channel probing factor to adaptively change probing interval for obtaining more correlated measurements at the endpoints of wireless communicating link. We use multipath relative delay of UWB channel to generate secret keys. Simulation results show that this dynamic secret key generation mechanism extracting multipath relative delay can achieve good performance in terms of secret key generation rate, key randomness and key-mismatch probability, especially key-mismatch probability compared with received signal strength (RSS)-based method and our prior approach. Furthermore, security analysis is also provided to validate feasibility of the scheme.

IEEE Wireless Communications and Networking Conference•Mar 1, 2015•29 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•53 citations
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.
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.
We develop a secret key generation scheme using phase estimation in ultra-wideband (UWB) wireless fading channels.Based on the reciprocity theorem, two terminals extract the phase of the channel as a common random source to generate secret bits.Moreover, we study the secret key rate by a pair of nodes observing correlated sources and communicating to achieve secret key agreement over public communication channels.As our main results, we establish a more practical upper bound from Cramer-Rao bound (CRB) and compare it with a universally theoretical upper bound on the shared maximum key rate from mutual information of correlated random sources.Derivation and numerical examples are presented to demonstrate the bound.Simulation studies are also provided to validate feasibility and efficiency of the proposed scheme.
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.
To guarantee a secure wireless communication between any two transceivers, the shared secret key is a requirement. Communication parties need to encrypt the message with the key to impede an adversary's eavesdropping. By exploiting Ultra-wideband (UWB) wireless fading channels as a source of common randomness, two transceivers with correlated observations can generate secret keys with information-theoretical security. The state of the art of existing works, however, has neglected to consider efficient channel probing. In this paper, we define a channel probing factor to adaptively change probing interval for obtaining more correlated measurements at the endpoints of wireless communicating link. We use multipath relative delay of UWB channel to generate secret keys. Simulation results show that this dynamic secret key generation mechanism extracting multipath relative delay can achieve good performance in terms of secret key generation rate, key randomness and key-mismatch probability, especially key-mismatch probability compared with received signal strength (RSS)-based method and our prior approach. Furthermore, security analysis is also provided to validate feasibility of the scheme.
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.