Secret Key Generation Via Localization and Mobility in Wireless Networks
Authors:
- C. Emre KoksalCKC. Emre Koksal
Preprint
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.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Fundamental Limits of Wideband Localization— Part I: A General FrameworkIEEE Transactions on Information Theory, 2010
- Fundamental Limits of Wideband Localization— Part II: Cooperative NetworksIEEE Transactions on Information Theory, 2010
- High-Rate Uncorrelated Bit Extraction for Shared Secret Key Generation from Channel MeasurementsIEEE Transactions on Mobile Computing, 2009
- Position error bound for UWB localization in dense cluttered environmentsIEEE Transactions on Aerospace and Electronic Systems, 2008
- Localization via ultra-wideband radios: a look at positioning aspects for future sensor networksIEEE Signal Processing Magazine, 2005
- Secret-key agreement over unauthenticated public channels-part I: definitions and a completeness resultIEEE Transactions on Information Theory, 2003
- Unconditionally secure key agreement and the intrinsic conditional informationIEEE Transactions on Information Theory, 1999
- A general formula for channel capacityIEEE Transactions on Information Theory, 1994
- Common randomness in information theory and cryptography. I. Secret sharingIEEE Transactions on Information Theory, 1993
- Secret key agreement by public discussion from common informationIEEE Transactions on Information Theory, 1993