pith. sign in

arxiv: 1112.2793 · v5 · pith:4QGA65TDnew · submitted 2011-12-13 · 💻 cs.IT · math.IT

Secret Key Generation Via Localization and Mobility

classification 💻 cs.IT math.IT
keywords informationlocalizationsecretgenerationmobilenodeswirelesseavesdropper
0
0 comments X
read the original 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 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.