The vast majority of existing secret key generation protocols exploit the inherent randomness of the wireless channel as a common source of randomness. However, independent noise added at the receivers of the legitimate nodes affect the reciprocity of the channel. In this paper, we propose a new simple technique to generate the secret key that mitigates the effect of noise. Specifically, we exploit the estimated channel to generate a secondary random process (SRP) that is common between the two legitimate nodes. We compare the estimated channel gain and phase to a preset threshold. The moving differences between the locations at which the estimated channel gain and phase exceed the threshold are the realization of our SRP. We study the properties of our generated SRP and derive a closed form expression for the probability mass function of the realizations of our SRP. We simulate an orthogonal frequency division multiplexing (OFDM) system and show that our proposed technique provides a drastic improvement in the key bit mismatch rate (BMR) between the legitimate nodes when compared to the techniques that exploit the estimated channel gain or phase directly. In addition to that, the secret key generated through our technique is longer than that generated by conventional techniques. Moreover, we compute the conditional probabilities used to estimate the secret key capacity.
|Titolo:||Robust Secret Key Extraction from Channel Secondary Random Process|
|Data di pubblicazione:||2016|
|Digital Object Identifier (DOI):||10.1002/wcm.2695|
|Appare nelle tipologie:||1.1 Articolo in rivista|
File in questo prodotto:
|PrePrint_Wiley_Channel_Secondary_Random_Process_Wiley_Journal copy.pdf||Articolo principale||1. Pre-print||PUBBLICO - Tutti i diritti riservati||Visibile a tuttiVisualizza/Apri|
|Badawy_et_al-2016-Wireless_Communications_and_Mobile_Computing.pdf||Articolo principale||2. Post-print||Non Pubblico - Accesso privato/ristretto||Administrator Richiedi una copia|