Secret Key Generation Via Localization and Mobility

Authors:
  • OGOnur Gungor
    Onur Gungor
  • FCFangzhou Chen
    Fangzhou Chen
  • CKC. Emre Koksal
    C. Emre Koksal

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. We propose an algorithm that consists of the following phases: In the first phase, legitimate node pair makes noisy observations of the relative locations of each other. Then, the nodes generate initial key bits by information reconciliation via public discussion. Finally, secret key is generated using the initial key by data compression and privacy amplification. 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. Finally, we 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, in local roads and freeways. Overall, this study provides a framework that combines information theoretic secrecy and localization, and proves that the localization information provides a significant additional resource for secret key generation in mobile networks.