International Conference on Computer Communications and Networks (ICCCN)

Cross-layer wireless information security

Lixing Song, Shaoen Wu

Published Aug 1, 2014• 0 citations

Abstract

Wireless information security generates shared secret keys from reciprocal channel dynamics. Current solutions are mostly based on temporal per-frame channel measurements of signal strength and suffer from low key generate rate (KGR), large budget in channel probing, and poor secrecy if a channel does not temporally vary significantly. This paper designs a cross-layer solution that measures noise-free per-symbol channel dynamics across both time and frequency domain and derives keys from the highly fine-grained per-symbol reciprocal channel measurements. This solution consists of merits that: (1) the persymbol granularity improves the volume of available uncorrelated channel measurements by orders of magnitude over per-frame granularity in conventional solutions and so does KGR; 2) the solution exploits subtle channel fluctuations in frequency domain that does not force users to move to incur enough temporal variations as conventional solutions require; and (3) it measures noise-free channel response that suppresses key bit disagreement between trusted users. As a result, in every aspect, the proposed solution improves the security performance by orders of magnitude over conventional solutions. The performance has been evaluated on both a GNU SDR testbed in practice and a local GNU Radio simulator. The cross-layer solution can generate a KGR of 24.07 bits per probing frame on testbed or 19 bits in simulation, although conventional optimal solutions only has a KGR of at most one or two bit per probing frame. It also has a low key bit disagreement ratio while maintaining a high entropy rate. The derived keys show strong independence with correlation coefficients mostly less than 0.05. Furthermore, it is empirically shown that any slight physical change, e.g. a small rotation of antenna, results in fundamentally different cross-layer frequency measurements, which implies the strong secrecy and high efficiency of the proposed solution.

DOI: 10.1109/icccn.2014.6911744

Related papers

Physical layer wireless security made fast and channel independent

Shyamnath Gollakota, Dina Katabi

There is a growing interest in physical layer security. Recent work has demonstrated that wireless devices can generate a shared secret key by exploiting variations in their channel. The rate at which the secret bits are generated, however, depends heavily on how fast the channel changes. As a result, existing schemes have a low secrecy rate and are mainly applicable to mobile environments. In contrast, this paper presents a new physical-layer approach to secret key generation that is both fast and independent of channel variations. Our approach makes a receiver jam the signal in a manner that still allows it to decode the data, yet prevents other nodes from decoding. Results from a testbed implementation show that our method is significantly faster and more accurate than state of the art physical-layer secret key generation protocols. Specifically, while past work generates up to 44 secret bits/s with a 4% bit disagreement between the two devices, our design has a secrecy rate of 3-18 Kb/s with 0% bit disagreement.

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

Fast and Secure Key Generation with Channel Obfuscation in Slowly Varying Environments

Guyue Li, Haiyu Yang, Junqing Zhang +2 more

Physical-layer secret key generation has emerged as a promising solution for establishing cryptographic keys by leveraging reciprocal and time-varying wireless channels. However, existing approaches suffer from low key generation rates and vulnerabilities under various attacks in slowly varying environments. We propose a new physical-layer secret key generation approach with channel obfuscation, which improves the dynamic property of channel parameters based on random filtering and random antenna scheduling. Our approach makes one party obfuscate the channel to allow the legitimate party to obtain similar dynamic channel parameters, yet prevents a third party from inferring the obfuscation information. Our approach allows more random bits to be extracted from the obfuscated channel parameters by a joint design of the K-L transform and adaptive quantization. Results from a testbed implementation show that our approach, compared to the existing ones that we evaluate, performs the best in generating high entropy bits at a fast rate and is able to resist various attacks in slowly varying environments. Specifically, our approach can achieve a significantly faster secret bit generation rate at roughly 67 bit/pkt, and the key sequences can pass the randomness tests of the NIST test suite.

IEEE Conference on Computer Communications (INFOCOM)May 2, 202259 citations

Physical Layer Secret Key Generation Leveraging Proactive Pilot Contamination

L. Liu, Hongbo Liu, Yicong Du +3 more

Physical layer-based secret key generation has garnered significant attention due to its inherent advantages of lightweight implementation, information-theoretic security, and broad applicability for mobile devices. The reciprocal randomness of the wireless channel ensures the consistent generation of secret bits between two communicating parties. However, it also suffers from the degradation of the efficiency of key generation attributed to the adverse impact of ambient noise, despite sustained efforts to mitigate the inconsistency during quantization. We find that a slight perturbation of the pilot signal, without affecting the correct reception of data frames, induces a corresponding change in the channel response, making it possibly adaptable to the target quantization strategies, thereby reducing the probability of key mismatch. Therefore, we take a different viewpoint on proactive contamination of the pilot signals to obtain the desired channel measurements for accurate physical layer secret key generation. Specifically, we design an adaptive pilot manipulation to avoid the expected channel measurements being too close to the quantization thresholds, enabling high quantization consistency. Furthermore, we also develop a random cross-threshold mechanism to prevent attackers from inferring the quantization results by monitoring the trend of pilot signal variations. A reliable long training sequence (LTS) modification mechanism is incorporated into our method to ensure communication performance by adaptively adjusting the scale of the pilot signal. To validate the effectiveness of our proposed method, we implement a prototype by re-configuring software modules in GNU radio running on the USRP platform. Extensive experiments demonstrate that our scheme outperforms existing representative quantization schemes with better key generation performance.

IEEE International Conference on Distributed Computing Systems (ICDCS)Jul 23, 20242 citations

Enhancement of Physical Layer Security by Exploiting Channel Phase Randomness in Wireless Networks

Varshinee Krishnamurthy, Ranjiny Natarajan Kumar, Sivasankar Sundaram

A less expensive and more flexible solution to the problem of sharing secret keys between wireless nodes is to use the inherent randomness in the wireless channel between them as the source for extracting bits of the secret key between these nodes. We propose a new secret key distribution approach that utilizes the uniformly distributed phase information of channel responses to extract shared cryptographic keys under narrowband multipath fading models. Compared to existing approaches which only support pair wise key distribution, our scheme is highly scalable and can support efficient group key distribution. Various key distribution schemes are appraised to determine the level of security and connectivity. Simulated results show that key distribution exploiting channel phase has improved resilience against node capture. them as the source for extracting bits of the secret key between these nodes. Shared secret key distribution from channel measurements is an application which benefits from the randomnessof the multipath channel. It would not, for example, work in a truly free-space environment (such as deep space radio links). Secret sharing benefits from: • Reciprocity of the wireless radio channel: The multipath properties of the radio channel (gains, phase shifts, and delays) at any point in time and on any given frequency channel are identical on both directions of the link. • Temporal variations in the radio channel: Over time, the multipath channel changes due to movement of either end of the link, and any motion of people and objects in the environment near the link. An application may specifically request a user to move or shake the wireless device in order to generate more temporal variation. • Spatial variations: The properties of the radio channel are unique to the locations of the two endpoints of the link. An eavesdropper at a third location more than a few wavelengths from either endpoint will measure a different, uncorrelated radio channel. The proposed scheme is more flexible and can be applied in both static and mobile environments. Our scheme introduces phase randomness to bit distribution and removes the reliance on node mobility to obtain high entropy bits. We evaluate the proposed schemes through both analytical and simulation studies. The parameters of the scheme can be selected such that a desired level of key distribution accuracy and reliability is achieved with high efficiency.

International Journal of Future Computer and CommunicationJan 1, 20120 citations

A Novel Secret Key Generation Algorithm for Secure Wireless Communications

Hafsa Jahangeer, Syed Junaid Nawaz, Shurjeel Wyne +1 more

The rapid technological advancements in wireless networks have resulted in tremendous increase in the number of connected user and machine-type wireless devices. Physical Layer Security (PLS) has a strong potential for providing security to wireless links in massively connected future wireless networks. The key-based PLS methods aim at generating secret key bits for data encryption/decryption at the legitimate communication nodes by exploiting the randomness inherent in wireless channels. This work proposes a novel secret key-bits extraction algorithm named Moving-Window Wrapped-Envelope Secret Key Generation (MWWE-SKG). The proposed algorithm uses first-order statistics from a sliding temporal window of channel samples to select the channel quantization interval for each window from circularly wrapped channel envelope samples. The differences in hardware noise conditions at the legitimate nodes lead to differences in the measurement of ideally reciprocal channels, which further leads to a mismatch in the generated secret key bits, whereas the channel statistics of the same links are more likely to remain unchanged for a reasonably large length of time window over the channel samples. An extensive analysis on the performance of the proposed algorithm is conducted, where the proposed algorithm is observed to provide a promising trade-off between the critical SKG performance metrics namely the Key Generation Rate (KGR), Bit Mismatch Probability (BMP), and the Key Randomness Property (KRP). Furthermore, a comparative performance analysis of the proposed algorithm with other notable techniques is also conducted to demonstrate the superior performance of the proposed algorithm.

Mar 8, 20240 citations

Wireless Secret Key Generation for Distributed Antenna Systems: A Joint Space-Time-Frequency Perspective

Zijie Ji, Yan Zhang, Zunwen He +5 more

Wireless secret key generation has emerged as a promising technique for Internet-of-Things (IoT) systems to establish shared encryption keys between the server and legitimate mobile user. This article focuses on the use of multidomain joint information to achieve a high key generation rate (KGR) and the implementation of a reliable, low-complexity secret key generation mechanism for distributed antenna systems (DAS) with orthogonal-frequency division multiplexing (OFDM). We present a space-time-frequency channel state information (CSI)-based key generation scheme based on a two-step approach of adaptive link selection and stepwise decorrelation algorithms. The performance is evaluated in terms of KGR, key disagreement rate (KDR), randomness, and computational complexity by using both a standardized channel model and real-world measurements. Numerical results show that our proposed low-complexity algorithms effectively utilize the space-time-frequency CSI to multiply the KGR in both indoor and outdoor environments. Through adaptive link selection in DAS, the KDR is maintained within a correctable range, thereby ensuring the validity of generated keys in dynamic environments. Further applying stepwise decorrelation reduces the computational complexity by more than half while satisfying all eight key generation randomness tests in the NIST test suite.

IEEE Internet of Things JournalMay 28, 202133 citations