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 Transactions on Vehicular Technology

Secret Key Generation Via Localization and Mobility

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

Published Jul 24, 2014• 32 citations
Publisher

Abstract

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.

DOI
10.1109/tvt.2014.2342714

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 in Wireless Networks

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 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.

•Dec 13, 2011•0 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

Eliminating privacy amplification in secret key generation from wireless channels

Zhongqiang Cao, Xiaofu Wu, Wei‐Ping Zhu +1 more

The inherent randomness of wireless radio channels can be employed to extract secrets, whenever the channel reciprocity holds. Privacy amplification is an ingredient step for removing the redundancy of key, of which, the mount of information leaked to potential eavesdroppers, is often difficult to determine. In this paper, we propose a secret-key generation scheme without privacy amplification, of which the disagreement of key is coordinated through the reconciliation of sample positions as did in the level-crossing scheme. Compared to the level-crossing scheme, the proposed approach accumulates the reliable samples and further employs multi-bit quantization for improving the rate of secret-key generation. The accumulated samples should be decorrelated for generating random keys. Through extensive simulations, we find that the Karhunen-Loève transform for decorrelation is very sensitive in implementation.

International Conference on Communications and Networking in China (ChinaCom)•Aug 1, 2015•3 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

New Techniques for Localization Based Information Theoretic Secret Key Agreement

Narges Kazempour, Mahtab Mirmohseni, Mohammad Reza Aref

We consider a source model for information theoretic secret key agreement based on the distance among the nodes, in a basic system consisting of two legitimate users and an eavesdropper. The legitimate nodes try to agree on a reliable and secure key based on their noisy observation of distance between them. We propose two methods to enhance system utility: 1) Artificial Noise Forwarding (ANF), 2) transmission in different beam directions (multi-antenna transmission). In the first method artificial noise is used to worsen e a vesdropper's distance estimation and in the second method beacon signals are sent in different directions and the virtual distances in different beam directions are used as the randomness sources. We show that if eavesdropper is not equipped with multi-directional antenna, then ANF is a useful method while in the case of users equipped with multi-directional antenna, transmitting in different directions is a suitable way to increase the secret key rate.

International ISC Conference on Information Security and Cryptology (ISCISC)•Sep 1, 2017•0 citations
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.
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 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.
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
The inherent randomness of wireless radio channels can be employed to extract secrets, whenever the channel reciprocity holds. Privacy amplification is an ingredient step for removing the redundancy of key, of which, the mount of information leaked to potential eavesdroppers, is often difficult to determine. In this paper, we propose a secret-key generation scheme without privacy amplification, of which the disagreement of key is coordinated through the reconciliation of sample positions as did in the level-crossing scheme. Compared to the level-crossing scheme, the proposed approach accumulates the reliable samples and further employs multi-bit quantization for improving the rate of secret-key generation. The accumulated samples should be decorrelated for generating random keys. Through extensive simulations, we find that the Karhunen-Loève transform for decorrelation is very sensitive in implementation.
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.
We consider a source model for information theoretic secret key agreement based on the distance among the nodes, in a basic system consisting of two legitimate users and an eavesdropper. The legitimate nodes try to agree on a reliable and secure key based on their noisy observation of distance between them. We propose two methods to enhance system utility: 1) Artificial Noise Forwarding (ANF), 2) transmission in different beam directions (multi-antenna transmission). In the first method artificial noise is used to worsen e a vesdropper's distance estimation and in the second method beacon signals are sent in different directions and the virtual distances in different beam directions are used as the randomness sources. We show that if eavesdropper is not equipped with multi-directional antenna, then ANF is a useful method while in the case of users equipped with multi-directional antenna, transmitting in different directions is a suitable way to increase the secret key rate.