IEEE International Conference on Communication Systems (ICCS)

On secret key generation from multiple observations of wireless channels

Kang Liu, Serguei L. Primak, Xianbin Wang

Published Nov 1, 2014• 5 citations

Abstract

Secret key generation at physical layer has attracted more and more attentions as an emerging cryptography method. Compared to traditional security approaches, secret key generation at physical layer not only avoids the problem of key distribution, but also holds high efficiency and low complexity in application. Based on the principle of channel reciprocity, Alice and Bob both estimate the channel conditions and extract shared keys from this source of common randomness. In this paper, we first analyze the basic steps (channel estimation, sample quantization and key reconciliation) of secret key generation, key match rate with different quantization levels and key reconciliation times are also simulated. While in practical situations, different non-reciprocity factors affect the channel estimation step, key match rate can be greatly decreased and hardly meet real time cryptography requirements. In order to increase the key match rate, the unified framework of physical layer key generation has been extended to utilizing multiple observations of wireless channels to generate secret keys. An improved key generation approach with multiple observations can well deal with discrepancies between transceivers and keep increasing the key match rate. Theoretical analysis and simulation results both validate the significant improvement due to multiple observations. With an increased number of observations on both sides, the desired key match rate can be achieved much greater than with a single observation, and also the probability of key recovery by Eve can be decreased.

DOI: 10.1109/iccs.2014.7024783

Related papers

On Enhancements of Physical Layer Secret Key Generation and Its Application in Wireless Communication Systems

Kang Liu

As an alternative and appealing approach to providing information security in wireless communication systems, secret key generation at physical layer has demonstrated its potential in terms of efficiency and reliability over traditional cryptographic methods. Without the necessity of a management centre for key distribution or reliance on computational complexity, physical layer key generation protocols enable two wireless entities to extract identical and dynamic keys from the randomness of the wireless channels associated with them.\nIn this thesis, the reliability of secret key generation at the physical layer is examined in practical wireless channels with imperfect channel state information (CSI). Theoretical analyses are provided to relate key match rate with channel's signal-to-noise ratio (SNR), degrees of channel reciprocity, and iterations of information reconciliation.\nIn order to increase key match rate of physical layer secret key generation, improved schemes in the steps of channel estimation and sample quantization are proposed respectively. In the channel estimation step, multiple observations of the wireless channels are integrated with a linear processor to provide a synthesized and more accurate estimation of the wireless channel. In the sample quantization step, a magnitude based quantization method with two thresholds is proposed to quantize partial samples, where specific quantization areas are selected to reduce cross-over errors. Significant improvements in key match rate are proven for both schemes in theoretical analysis and numerical simulations. Key match rate can even achieve 100% in both schemes with the assistance of information reconciliation process.\nIn the end, a practical application of physical layer secret key generation is presented, where dynamic keys extracted from the wireless channels are utilized for securing secret data transmission and providing efficient access control.

Jan 1, 20151 citation

Physical Layer Key Generation from Wireless Channels with Non-ideal Channel Reciprocity: A Deep Learning Based Approach

Cheng Feng, Li Sun

Physical layer encryption is a promising solution to provide transmission security for Internet-of-Things (IoT). To realize physical layer encryption, channel state information (CSI) as a random source to generate secret keys should be exploited. The reciprocity of wireless channel between legitimate communication nodes which is typically assumed for time division duplex (TDD) systems, is of critical importance to ensure the consistency in generated keys at two nodes. However, in practical TDD systems, due to the asynchronous measurement of CSI, the receiver noise and the the difference in hardware, etc., the reciprocity of channel measurements between legitimate parties is hard to be guaranteed, which makes physical layer key generation approach infeasible. To address this issue, we propose a wireless key generation scheme based on deep learning techniques. Firstly, a feature extraction network, which consists of two auto-encoders trained jointly, is developed to extract the common feature from the different yet correlated channel observations at two legitimate nodes, which will be used as the source to generate keys. Then a quantizer with an adaptive guard band width is devised to output a binary secret-key sequence from the feature vector. Numerical results show that the proposed scheme achieves remarkable improvement in terms of key disagreement rate (KDR) and key generation rate (KGR) compared existing counterparts in the literature.

IEEE Vehicular Technology ConferenceJun 1, 202213 citations

Secret Key Generation Using Physical Channels with Imperfect CSI

Serguei L. Primak, Kang Liu, Xianbin Wang

Providing extra security in wireless communication networks using channel impulse response as a source of common randomness is an appealing direction in prospective systems. While some theoretical and experimental work has demonstrated its potential, a number of issues remain unexplored. This paper is concerned with the reliability of secret key generation under practical estimation requirements. We provide an analytical expression which relates the channel SNRs and degree of reciprocity to probability of key mismatch. In the next step we show how this affects key reconciliation and secrecy leaking. Finally, we consider how quantization with a protective band can help to trade the secret key rate for increased reliability and security of the scheme.

IEEE Vehicular Technology ConferenceSep 1, 201419 citations

Bipartite Graph Matching Based Secret Key Generation

Hongbo Liu, Yan Wang, Yanzhi Ren +1 more

The physical layer secret key generation exploiting wireless channel reciprocity has attracted considerable attention in the past two decades. On-going research have demonstrated its viability in various radio frequency (RF) systems. Most of existing work rely on quantization technique to convert channel measurements into digital binaries that are suitable for secret key generation. However, non-simultaneous packet exchanges in time division duplex systems and noise effects in practice usually create random channel measurements between two users, leading to inconsistent quantization results and mismatched secret bits. While significant efforts were spent in recent research to mitigate such non-reciprocity, no efficient method has been found yet. Unlike existing quantization-based approaches, we take a different viewpoint and perform the secret key agreement by solving a bipartite graph matching problem. Specifically, an efficient dual-permutation secret key generation method, DP-SKG, is developed to match the randomly permuted channel measurements between a pair of users by minimizing their discrepancy holistically. DP-SKG allows two users to generate the same secret key based on the permutation order of channel measurements despite the non-reciprocity over wireless channels. Extensive experimental results show that DP-SKG could achieve error-free key agreement on received signal strength (RSS) with a low cost under various scenarios.

IEEE Conference on Computer Communications (INFOCOM)May 10, 202126 citations

A Novel Physical Layer Key Generation and Authenticated Encryption Protocol Exploiting Shared Randomness

Cornelius Onuvoye Saiki

The use of wireless networks for communication has grown significantly in recent times, and continues to develop further. The broadcast nature of wireless communications makes them susceptible to a wide variety of security attacks. Unlike traditional solutions, which usually handle security at the application layer, the primary concern of this dissertation is to analyse and develop solutions for secure communication using channel coding techniques at the physical-layer. \nThe topic of physical layer authenticated encryption using high rate key generation through shared randomness is investigated in this work. First, a physical layer secret key generation scheme is discussed exploiting channel reciprocity in wireless systems. In order to address the susceptibility of this family of schemes to active attacks, a novel physical layer authentication encryption protocol is presented along with its extension to multi-node networks in the presence of active adversaries. Unlike previous work in the area of generating secret keys through shared randomness, it is demonstrated that the proposed scheme is semantically secure with respect to chosen plaintext and chosen cipher text attacks. \nSecondly, in order to increase the rate in bits per seconds at which agreed cryptographic keys are been generated, a multi-level quantization algorithm with public feedback is discussed. It is demonstrated that the proposed scheme is superior to direct information distillation approaches and can substantially increase the key generation rates even at low and medium SNRs. Furthermore, the employment of this low-overhead feedback at the information distillation process can largely simplify the information reconciliation process. \nThe proposed secret key generation schemes are tested for randomness such as required for cryptographic keys. The validation test is perfomed with the aid of National Institute of Standards and Technology (NIST) statistical test suite. The P-values obtained in each of the test carried out indicates that the key sequence generated by our algorithm is random.

May 5, 20160 citations

Fast and scalable secret key generation exploiting channel phase randomness in wireless networks

Qian Wang, Hai Su, Kui Ren +1 more

Recently, there has been great interest in physical layer security techniques that exploit the randomness of wireless channels for securely extracting cryptographic keys. Several interesting approaches have been developed and demonstrated for their feasibility. The state-of-the-art, however, still has much room for improving their practicality. This is because i) the key bit generation rate supported by most existing approaches is very low which significantly limits their practical usage given the intermittent connectivity in mobile environments; ii) existing approaches suffer from the scalability and flexibility issues, i.e., they cannot be directly extended to support efficient group key generation and do not suit for static environments. With these observations in mind, we present a new secret key generation approach that utilizes the uniformly distributed phase information of channel responses to extract shared cryptographic keys under narrowband multipath fading models. The proposed approach enjoys a high key bit generation rate due to its efficient introduction of multiple randomized phase information within a single coherence time interval as the keying sources. The proposed approach also provides scalability and flexibility because it relies only on the transmission of periodical extensions of unmodulated sinusoidal beacons, which allows effective accumulation of channel phases across multiple nodes. The proposed scheme is thoroughly evaluated through both analytical and simulation studies. Compared to existing work that focus on pairwise key generation, our approach is highly scalable and can improve the analytical key bit generation rate by a couple of orders of magnitude.

IEEE Conference on Computer Communications (INFOCOM)Apr 1, 2011255 citations