Abstract
Mobile ad hoc networks consist of wireless nodes and can be established quickly with minimal configuration and cost, because, they do not require any infrastructure in advance. Civil and military applications are using them extensively in emergency and mission-oriented scenarios respectively as multi-party communication systems. Whereas, the multi-party secret key acquisition is one of the acute issues in these low resource wireless ad hoc networks, especially, which are based on IEEE 802.11ah and IEEE 802.11ba (low power WiFi), IEEE 802.15.4(Zigbee), BLE, IEEE 802.15.6 (body-worn or wearable) devices. In this study, a novel low cost and robust approach has been proposed and tested to establish an identical secret key in a multi-user mobile ad hoc environment. We believe, it is one of the groundbreaking contributions toward establishing a cost-effective secret key acquisition solution with respect to memory, computation, and bandwidth. We have used Bloom-Filters to cope with these resource limitations of such wireless setups. The proposed approach has been tested using IEEE 802.11 adapters in a real environment, and we found it to be highly suitable for wireless resource-limited applications.
Highlights
Wireless networks have become an indispensable part of the social, military and healthcare applications [1], [2], and greatly being used in IOTs, emergencies, mobile computing and VANETs at the same time [3]
OUR GOAL: COST EFFECTIVE SECRET KEY In this study, we have focused to establish a shared secret key among the resource considering wireless nodes operating at 2.4GHz
The model used by Maurer in [39] and Csiszer in [37], [38] for acquisition of the shared secret is based on two legitimate wireless devices Alice, Bob and an adversary Eve
Summary
Wireless networks have become an indispensable part of the social, military and healthcare applications [1], [2], and greatly being used in IOTs, emergencies, mobile computing and VANETs at the same time [3]. Alice and Bob observe a common randomness for a very short interval of time due to principal of channel reciprocity [40] It de-correlates instantly because of temporal and spatial variations [41]. Eve who is separated by a distance of λ/2 from Alice or Bob will have different observations due to quick de-correlation in channel parameters as a result of spatial and temporal variation In this scenario li, mi, and oi are independent and identically distributed (i.i.d) realizations of random variables L, M , and O respectively, whose joint probability distribution is PLMO. It means Alice and Bob can generate at least R−ε secret key bits per observation Such an information-theoretic system states I (K ; V ) ≤ ε, means Eve knows nothing or too little about key Ki to guess the entire key length. The maximum achievable rate or key capacity can be defined using Eq(1) given below; whose outcome is such a key which can be used to encipher long messages [44], [45]
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
