Localization-based Secret Key Agreement for Wireless Network

Qiang Wu

Published Jan 1, 2015• 0 citations

Abstract

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

Related papers

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, 20162 citations

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.2793IEEE Globecom Workshops (GC Wkshps)Dec 1, 20119 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, 20110 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 TechnologyJul 24, 201432 citations

GROUP SECRET KEY GENERATION FOR 5G Networks

Ali M. Allam

Key establishment method based on channel reciprocity for time division duplex (TDD) system has earned a vital consideration in the majority of recent research.While most of the cellular systems rely on frequency division duplex (FDD) systems, especially the 5G network, which is not characterized by the channel reciprocity feature.This paper realizes the generation of a group secret key for multi-terminals communicated through a wireless network in FDD mode, by utilizing the nature of the physical layer for the wireless links between them.I consider a new group key generation approach, which using bitwise XOR with a modified pairwise secret key generation approach not based on the channel reciprocity feature.Precisely, this multi-node secret key agreement technique designed for three wireless network topologies: 1) the triangle topology, 2) the multi-terminal star topology, and 3) the multi-node chain topology.Three multi-node secret key agreement protocols suggest for these wireless communication topologies in FDD mode, respectively.I determine the upper bound for the generation rate of the secret key shared among multi-node, for the three multi-terminals topologies, and give numerical cases to expose the achievement of my offered technique.

KSII Transactions on Internet and Information SystemsAug 31, 20190 citations

A Novel Secret Key Generation Algorithm for Secure Wireless Communications

Hafsa Jahangeer, Syed Junaid Nawaz, Shurjeel Wyne +1 more

The rapid technological advancements in wireless networks have resulted in tremendous increase in the number of connected user and machine-type wireless devices. Physical Layer Security (PLS) has a strong potential for providing security to wireless links in massively connected future wireless networks. The key-based PLS methods aim at generating secret key bits for data encryption/decryption at the legitimate communication nodes by exploiting the randomness inherent in wireless channels. This work proposes a novel secret key-bits extraction algorithm named Moving-Window Wrapped-Envelope Secret Key Generation (MWWE-SKG). The proposed algorithm uses first-order statistics from a sliding temporal window of channel samples to select the channel quantization interval for each window from circularly wrapped channel envelope samples. The differences in hardware noise conditions at the legitimate nodes lead to differences in the measurement of ideally reciprocal channels, which further leads to a mismatch in the generated secret key bits, whereas the channel statistics of the same links are more likely to remain unchanged for a reasonably large length of time window over the channel samples. An extensive analysis on the performance of the proposed algorithm is conducted, where the proposed algorithm is observed to provide a promising trade-off between the critical SKG performance metrics namely the Key Generation Rate (KGR), Bit Mismatch Probability (BMP), and the Key Randomness Property (KRP). Furthermore, a comparative performance analysis of the proposed algorithm with other notable techniques is also conducted to demonstrate the superior performance of the proposed algorithm.

Mar 8, 20240 citations