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

Secret Key Generation Via Localization and Mobility in Wireless Networks

Onur Güngör, Fangzhou Chen, C. Emre Koksal

Published Dec 13, 2011• 0 citations
OpenAlex

Abstract

We consider secret key generation from relative localization information of a pair of nodes in a mobile wireless network in the presence of a mobile eavesdropper. Our problem can be categorized under the source models of information theoretic secrecy, where the distance between the legitimate nodes acts as the observed common randomness. We characterize the theoretical limits on the achievable secret key bit rate, in terms of the observation noise variance at the legitimate nodes and the eavesdropper. This work provides a framework that combines information theoretic secrecy and wireless localization, and proves that the localization information provides a significant additional resource for secret key generation in mobile wireless networks.

Related papers

Secret key generation from mobility

Onur Güngör, Fangzhou Chen, C. Emre Koksal

We consider secret key generation from relative localization information of a pair of nodes in a mobile wireless network in the presence of a mobile eavesdropper. Our scheme consists of two phases: in the first phase, legitimate node pair exchanges beacon signals to establish localization information based on noisy observations of these beacons; in the second phase, nodes generate secret key bits via a public discussion. Our problem can be categorized under the source models of information theoretic secrecy, where the distance between the legitimate nodes acts as the observed common randomness. We characterize the achievable secret key bit rate in terms of the observation noise variance at the legitimate nodes and the eavesdropper. This work provides a framework that combines information theoretic secrecy and wireless localization, and proves that the localization information provides a significant additional resource for secret key generation in mobile wireless networks.

arXiv:1112.2793•IEEE Globecom Workshops (GC Wkshps)•Dec 1, 2011•9 citations

Secret Key Generation Via Localization and Mobility

Onur Güngör, Fangzhou Chen, C. Emre Koksal

We consider secret key generation by a pair of mobile nodes utilizing observations of their relative locations in the presence of a mobile eavesdropper. In our proposed algorithm, the legitimate node pair makes noisy observations of the relative locations of each other. Based on these observations, the nodes generate secret key bits via information reconciliation, data compression, and privacy amplification. We characterize a theoretically achievable secret key bit rate in terms of the observation noise variance at the legitimate nodes and the eavesdropper and show that the performance of our algorithm is comparable to the theoretical bounds. We also test our algorithm in a vehicular setting based on observations made using wireless beacon exchange between the legitimate nodes. To achieve this, we used TelosB wireless radios mounted on the sides of the vehicles on local roads and freeways. Note that our approach relies solely on distance reciprocity, and thus, it is not restricted to the use of wireless radios and can be used with other localization systems (e.g., infrared and ultrasound systems) as well. Overall, this study proves, via both information theoretic and practical analysis, that localization information provides a significant additional resource for secret key generation in mobile networks.

IEEE Transactions on Vehicular Technology•Jul 24, 2014•32 citations

Localization-based Secret Key Agreement for Wireless Network

Qiang Wu

Due to the shared nature of wireless medium, generating secret key between legitimate nodes under the presence of eavesdroppers remains challenging in wireless network environment.In this research, a framework of secret key agreement utilizing observations of nodes' relative location is considered.While many current works concern secret key generation only for 3-nodes (2 legitimate nodes and 1 eavesdropper), this research proposes an approach and analysis for a wireless network environment with m (m≥3) legitimate nodes and 1 eavesdropper.The proposed algorithm uses the distance between a randomly selected node 1 and node 2 as the Reference Distance (RD) to establish the secret key.In order to secure the delivery of RD to other m-2 nodes, an Additive Distance Value (ADV) is used for public discussion.Further, different types of topologies are developed to accomplish secret key agreement for m node wireless network including star, chain and hybrid topologies.After the ADV distribution and RD estimation, the secret key is generated through secret bit extraction.The Maximum achievable Secret key generation Rate (MSR) based on the above network topologies is studied through theoretical analysis and mathematical estimation.Based on these analyze, the feasibility of proposed secret key xi

•Jan 1, 2015•0 citations

Localization information-based secret key generation in wireless network to secure multimedia data

Qiang Wu, Jung Hwan Kim

Toward legitimate delivery of multimedia data in a wireless network, the localization information-based secret key generation algorithm for the network with more than three (m>3) nodes is proposed. Using the star topology network model, the maximum secret key generation rate (MSR) of the proposed algorithm is analytically derived and validated by computer simulation. The relationship between MSR, signal-noise ratio and size of the wireless network is also verified. Results of simulation under Gaussian noise confirm the feasibility of the proposed algorithm, which can be easily applicable to the multiple nodes mobile wireless network.

IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB)•Jun 1, 2016•2 citations

On the Security of Fast Secret Key Generation Protocol with Virtual Channel Approach

Chen Da-jian

It is vitally important to generate keys and keep them secret in secure wireless communications. Due to the broadcast nature of wireless channels, secret key distribution is more vulnerable to attacks in wireless communication. An ingenious solution is to generate secret keys by using the multipath channel as a source of common randomness. To address the problems that the existing physical-based protocols have low key generation rate and high reliance on mobile nodes or environments, a fast secret key generation protocol with virtual channel approach was proposed by HUANG and WANG for static wireless networks. In this paper, we show that, in the presence of an eavesdropper with multiple antennas, the scheme does not improve the theoretical upper bound of the key generation rate with information-theory security. Thus, the protocol is not information-theory security.

Dianzi Ke-ji Daxue xuebao•Jan 1, 2015•2 citations

A secret key establishment protocol for wireless networks using noisy channels

Albert Guan, Wen-Guey Tzeng

An efficient protocol for establishing secret keys for neighboring nodes in a wireless network is presented in this paper. The security of the key generated by our protocol is based on the unpredictability of the noises in binary symmetric communication channels. The two nodes which try to establish a common secret key receive messages from a common source of random bit strings. Due to noises in the communication channel, the messages received by them, and most importantly the messages received by the eavesdropper, are not the same. We show that the two nodes can modify their messages in an efficient way to obtain a common string which contains enough uncertainty to the eavesdropper. Then, a secure universal hash function is applied to compute a secret key for extracting randomness from the common string. We prove that the probability for the eavesdropper to know the value of the key is negligible. One advantage of our proposed protocol is that the secret key rate is better than the known scheme in other models, such as the bounded storage model. Furthermore, our proposed protocol needs only to perform exclusive-or operations and compute hash values. Thus, it is a computationally light-weight protocol and suitable for devices with limited computing resources, such as sensors in sensor networks.

Journal of Computer Security•Feb 24, 2017•3 citations
We consider secret key generation from relative localization information of a pair of nodes in a mobile wireless network in the presence of a mobile eavesdropper. Our problem can be categorized under the source models of information theoretic secrecy, where the distance between the legitimate nodes acts as the observed common randomness. We characterize the theoretical limits on the achievable secret key bit rate, in terms of the observation noise variance at the legitimate nodes and the eavesdropper. This work provides a framework that combines information theoretic secrecy and wireless localization, and proves that the localization information provides a significant additional resource for secret key generation in mobile wireless networks.
We consider secret key generation from relative localization information of a pair of nodes in a mobile wireless network in the presence of a mobile eavesdropper. Our scheme consists of two phases: in the first phase, legitimate node pair exchanges beacon signals to establish localization information based on noisy observations of these beacons; in the second phase, nodes generate secret key bits via a public discussion. Our problem can be categorized under the source models of information theoretic secrecy, where the distance between the legitimate nodes acts as the observed common randomness. We characterize the achievable secret key bit rate in terms of the observation noise variance at the legitimate nodes and the eavesdropper. This work provides a framework that combines information theoretic secrecy and wireless localization, and proves that the localization information provides a significant additional resource for secret key generation in mobile wireless networks.
We consider secret key generation by a pair of mobile nodes utilizing observations of their relative locations in the presence of a mobile eavesdropper. In our proposed algorithm, the legitimate node pair makes noisy observations of the relative locations of each other. Based on these observations, the nodes generate secret key bits via information reconciliation, data compression, and privacy amplification. We characterize a theoretically achievable secret key bit rate in terms of the observation noise variance at the legitimate nodes and the eavesdropper and show that the performance of our algorithm is comparable to the theoretical bounds. We also test our algorithm in a vehicular setting based on observations made using wireless beacon exchange between the legitimate nodes. To achieve this, we used TelosB wireless radios mounted on the sides of the vehicles on local roads and freeways. Note that our approach relies solely on distance reciprocity, and thus, it is not restricted to the use of wireless radios and can be used with other localization systems (e.g., infrared and ultrasound systems) as well. Overall, this study proves, via both information theoretic and practical analysis, that localization information provides a significant additional resource for secret key generation in mobile networks.
Due to the shared nature of wireless medium, generating secret key between legitimate nodes under the presence of eavesdroppers remains challenging in wireless network environment.In this research, a framework of secret key agreement utilizing observations of nodes' relative location is considered.While many current works concern secret key generation only for 3-nodes (2 legitimate nodes and 1 eavesdropper), this research proposes an approach and analysis for a wireless network environment with m (m≥3) legitimate nodes and 1 eavesdropper.The proposed algorithm uses the distance between a randomly selected node 1 and node 2 as the Reference Distance (RD) to establish the secret key.In order to secure the delivery of RD to other m-2 nodes, an Additive Distance Value (ADV) is used for public discussion.Further, different types of topologies are developed to accomplish secret key agreement for m node wireless network including star, chain and hybrid topologies.After the ADV distribution and RD estimation, the secret key is generated through secret bit extraction.The Maximum achievable Secret key generation Rate (MSR) based on the above network topologies is studied through theoretical analysis and mathematical estimation.Based on these analyze, the feasibility of proposed secret key xi
Toward legitimate delivery of multimedia data in a wireless network, the localization information-based secret key generation algorithm for the network with more than three (m>3) nodes is proposed. Using the star topology network model, the maximum secret key generation rate (MSR) of the proposed algorithm is analytically derived and validated by computer simulation. The relationship between MSR, signal-noise ratio and size of the wireless network is also verified. Results of simulation under Gaussian noise confirm the feasibility of the proposed algorithm, which can be easily applicable to the multiple nodes mobile wireless network.
It is vitally important to generate keys and keep them secret in secure wireless communications. Due to the broadcast nature of wireless channels, secret key distribution is more vulnerable to attacks in wireless communication. An ingenious solution is to generate secret keys by using the multipath channel as a source of common randomness. To address the problems that the existing physical-based protocols have low key generation rate and high reliance on mobile nodes or environments, a fast secret key generation protocol with virtual channel approach was proposed by HUANG and WANG for static wireless networks. In this paper, we show that, in the presence of an eavesdropper with multiple antennas, the scheme does not improve the theoretical upper bound of the key generation rate with information-theory security. Thus, the protocol is not information-theory security.
An efficient protocol for establishing secret keys for neighboring nodes in a wireless network is presented in this paper. The security of the key generated by our protocol is based on the unpredictability of the noises in binary symmetric communication channels. The two nodes which try to establish a common secret key receive messages from a common source of random bit strings. Due to noises in the communication channel, the messages received by them, and most importantly the messages received by the eavesdropper, are not the same. We show that the two nodes can modify their messages in an efficient way to obtain a common string which contains enough uncertainty to the eavesdropper. Then, a secure universal hash function is applied to compute a secret key for extracting randomness from the common string. We prove that the probability for the eavesdropper to know the value of the key is negligible. One advantage of our proposed protocol is that the secret key rate is better than the known scheme in other models, such as the bounded storage model. Furthermore, our proposed protocol needs only to perform exclusive-or operations and compute hash values. Thus, it is a computationally light-weight protocol and suitable for devices with limited computing resources, such as sensors in sensor networks.