Secret Key Generation Via Localization and Mobility in Wireless Networks

Authors:
  • CKC. Emre Koksal
    C. Emre Koksal

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 proposed algorithm consists of the following phases: in the first phase, legitimate node pair opportunistically exchanges beacon signals to establish localization information based on noisy observations of these beacons. Then, the nodes generate secret key bits via a public discussion and privacy amplification. 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 also characterize 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. 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.

This publication has 15 references indexed in Scilit: