Man-in-the-middle attack resistant secret key generation via channel randomization
Publisher
Association for Computing MachineryCitation
Pan, Y., Xu, Z., Li, M., & Lazos, L. (2021). Man-in-the-middle attack resistant secret key generation via channel randomization. Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc).Journal
Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)Rights
Copyright © 2021 Copyright held by the owner/author(s). This work is licensed under a Creative Commons Attribution International 4.0 License.Collection Information
This item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at repository@u.library.arizona.edu.Abstract
Physical-layer based key generation schemes exploit the channel reciprocity for secret key extraction, which can achieve information-theoretic secrecy against eavesdroppers. Such methods, although practical, have been shown to be vulnerable against man-in-the-middle (MitM) attacks, where an active adversary, Mallory, can influence and infer part of the secret key generated between Alice and Bob by injecting her own packet upon observing highly correlated channel/RSS measurements from Alice and Bob. As all the channels remain stable within the channel coherence time, Mallory's injected packets cause Alice and Bob to measure similar RSS, which allows Mallory to successfully predict the derived key bits. To defend against such a MitM attack, we propose to utilize a reconfigurable antenna at one of the legitimate transceivers to proactively randomize the channel state across different channel probing rounds. The randomization of the antenna mode at every probing round breaks the temporal correlation of the channels from the adversary to the legitimate devices, while preserving the reciprocity of the channel between the latter. This prevents key injection from the adversary without affecting Alice and Bob's ability to measure common randomness. We theoretically analyze the security of the protocol and conduct extensive simulations and real-world experiments to evaluate its performance. Our results show that our approach eliminates the advantage of an active MitM attack by driving down the probability of successfully guessing bits of the secret key to a random guess. © 2021 Owner/Author.Note
Open access articleISBN
9781450385589Version
Final published versionae974a485f413a2113503eed53cd6c53
10.1145/3466772.3467052
Scopus Count
Collections
Except where otherwise noted, this item's license is described as Copyright © 2021 Copyright held by the owner/author(s). This work is licensed under a Creative Commons Attribution International 4.0 License.

