A shared secret key is necessary for encrypted communications. Since Wi-Fi relies on OFDM, we suggest a method for generating such key by utilizing Wi-Fi’s channel state information (CSI). The channel is typically reciprocal but very sensitive to location: while (legitimate) Alice and Bob should observe the same CSI, an eavesdropper Eve shall observe uncorrelated CSI when positioned over 0.5 wavelength away from either node.We show that if endpoint Bob is shaken, sufficient diversity is induced in the CSI, thus rendering it a true source for randomness. We then show that the CSI among neighboring sub-carriers is correlated, so we select a small set of judiciously-spaced sub-carriers, and decide on a value based on a majority rule about each. Consequently, Alice and Bob observe a 5-15% bit mismatch rate (BMR) in the extracted bitstream while Eve experiences a BMR of around 50% even when placed 10cm away from Alice.We employ the cryptography-oriented definition of min-entropy to estimate the number of secure bits in the received bitstream, and employ the so-called Cascade algorithm of quantum-key-distribution to reconcile Alice and Bob’s bitstreams while quantifying the number of bits leaked by the algorithm. Accounting for both the min-entropy and the Cascade-based leakage we quantify the Secured Bit Generation Rate realized by our method.Extensive set of experiments have been conducted in an indoor environment revealing secure bit generation rate of 1.2–1.6 bits per packet, for endpoint distances ranging from 0.5m–9m; a (128-bit) secured shared-key is generated in 20sec of device shaking.
A shared secret key is necessary for encrypted communications. Since Wi-Fi relies on OFDM, we suggest a method for generating such key by utilizing Wi-Fi’s channel state information (CSI). The channel is typically reciprocal but very sensitive to location: while (legitimate) Alice and Bob should observe the same CSI, an eavesdropper Eve shall observe uncorrelated CSI when positioned over 0.5 wavelength away from either node.We show that if endpoint Bob is shaken, sufficient diversity is induced in the CSI, thus rendering it a true source for randomness. We then show that the CSI among neighboring sub-carriers is correlated, so we select a small set of judiciously-spaced sub-carriers, and decide on a value based on a majority rule about each. Consequently, Alice and Bob observe a 5-15% bit mismatch rate (BMR) in the extracted bitstream while Eve experiences a BMR of around 50% even when placed 10cm away from Alice.We employ the cryptography-oriented definition of min-entropy to estimate the number of secure bits in the received bitstream, and employ the so-called Cascade algorithm of quantum-key-distribution to reconcile Alice and Bob’s bitstreams while quantifying the number of bits leaked by the algorithm. Accounting for both the min-entropy and the Cascade-based leakage we quantify the Secured Bit Generation Rate realized by our method.Extensive set of experiments have been conducted in an indoor environment revealing secure bit generation rate of 1.2–1.6 bits per packet, for endpoint distances ranging from 0.5m–9m; a (128-bit) secured shared-key is generated in 20sec of device shaking.
Two legitimate parties, referred to as Alice and Bob, wish to generate secret keys from the wireless channel in the presence of an eavesdropper, referred to as Eve, in order to use such keys for encryption and decryption. In general, the secret key rate highly depends on the coherence time of the channel. In particular, a straightforward method of generating secret keys in static environments results in ultra-low rates. In order to resolve this problem, we introduce a low-complexity method called induced randomness. In this method, Alice and Bob independently generate local randomness to be used together with the uniqueness of the wireless channel coefficients in order to enable high-rate secret key generation. In this work, two scenarios are considered: first, when Alice and Bob share a direct communication channel, and second, when Alice and Bob do not have a direct link and communicate through an untrusted relay. After exchanging the induced randomness, post-processing is done by Alice and Bob to generate highly-correlated samples that are used for the key generation. Such samples are then converted into bits, disparities between the sequences generated by Alice and Bob are mitigated, and the resulting sequences are then hashed to compensate for the information leakage to the eavesdropper and to allow consistency checking of the generated key bit sequences. We utilize semantic security measures and information-theoretic inequalities to upper bound the probability of successful eavesdropping attack in terms of the mutual information measures that can be numerically computed. Given certain reasonable system parameters this bound is numerically evaluated to be 2-31and 2-10.57in the first and the second scenario, respectively.
Due to the sensitivity of the information exchanged in Vehicle to Vehicle (V2V) and Vehicle to Infrastructure (V2I) communication, generating secret keys is critical to secure these communications. As nature is open access, distributed keys are more vulnerable to attacks in the vehicular environment. Physical layer key generation methods using wireless channel characteristics show promise in preventing such attacks, generating keys independently, and removing the need for distribution. In this paper, we present a novel key generation approach in a real vehicular environment based on Channel State Information (CSI), including a new algorithm for key bit extraction. We implemented our algorithm using USRP B210 Software-Defined Radios (SDR) and the industry-standard V2X communication protocol: IEEE 802.11p. The proposed key generation protocol uses the CSI values of each sub-carrier as a source of randomness, from which bits are extracted using a new QAM demodulator quantizer (QAM-Dem-Quan). We compared our technique to state-of-the-art Received Signal Strength (RSS)-based approaches, and show that our method achieves better performance. Moreover, we reached a min-entropy of approximately 70% for the generated keys and a key generation rate of less than150μs/key for key lengths ranging from 16 to 128 bits.
Device-to-device communication is increasingly important for emerging wireless applications, including the Internet of Things and industry mobile networks. To establish a secure communication channel between multiple legitimate devices, key agreement is an essential first step. Physical layer channel information is a promising technology for achieving communication security by generating a shared channel key. In this paper, we propose an efficient and random method for generating channel keys based on channel state information (CSI). Firstly, we preprocess the available subcarriers to reduce the correlation of adjacent subcarriers. Secondly, we propose a novel quantization process to generate random and secure channel keys. The part consists of two phases: the quantization phase and the inconsistency removal phase. In the quantization stage, CSI sub carriers are grouped into small blocks, and appropriate thresholds are generated. Then, wireless users quantize the CSI subcarriers into initial bit streams of 0 and 1 with different thresholds. In the inconsistency removal phase, we design an error correction mechanism where wireless users exchange the discarded index sequences in the initial bit streams to achieve key sequence consistency. We implement the proposed scheme using off-the-shelf wireless devices and evaluate its performance. The experimental results show that each CSI packet can produce 30 bits, which have passed the NIST randomness tests.
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.
Secret key agreement in distributed low-power networks, such as Internet of Things (IoT) networks, is a major requirement for deploying cryptographic protocols to protect the security of sensitive data. However, due to the distributed nature of such networks, the devices need to be able to generate secret keys locally from some common source of randomness. The randomness in the characteristics of the physical layer channel provides such sources, however, this can be quite limited if the devices operate in a static environment and experience static or very slow fading channel. Therefore, fast secret key generation in such environments while keeping a low complexity architecture for the network nodes, such as IoT devices, remains a challenging task. We design a low-complexity protocol for fast secret key generation in static environments. To this end, we propose to use a limited number of random bits independently generated by the legitimate parties, referred to as Alice and Bob, in combination with the fading parameter to create a common source of randomness. In the proposed protocol, Alice and Bob share their random bits over the public channel, assumed to be a fading channel, and then construct a common random sequence. Then they perform several steps for recovery from errors in the shared sequence, privacy amplification to limit the chances of a successful attack, and consistency checking by exploiting universal hash functions. We characterize the reliability of the proposed protocol and provide an upper bound on the probability of accepting a mismatched key by Alice and Bob. The eavesdropper Eve is assumed to be passive and a successful attack by her is the event of guessing the key right based on her observations. We provide an analytical upper bound, that can be numerically evaluated, on the probability of a successful attack by Eve using the cryptographic notion of semantic security. In the simulations, the proposed protocol achieves a bit generation rate of 64-96 bits/packet, bit mismatch rate of 11-24%, bit error rate of 0.005%, 50% randomness efficiency, the probability of successful attack of at most 2-31, and the probability of consistency checking failure of at most 2-16.
In the recent years, a set of works have addressed inherent characteristics of the fading propagation channel in an information-theoretic framework oriented towards security. In particular, for cryptographic purposes, secure key bits can be extracted from reciprocal radio channels, seen as a shared source of randomness between any two entities. In this paper we intend to assess the impact of true radio channel features on the security performance, by quantizing the complex channel coefficients into discrete key bits. To this end, indoor channel measurements were performed and investigated in different scenarios, e.g. LOS/NLOS condition, narrowband (NB) as well as wide band (WB) targeting OFDM systems. Secret key robustness is firstly studied for the legitimate terminals in terms of key bit disagreement ratio and key randomness, and secondly by considering an eavesdropper in a wide set of positions around these terminals and by evaluating the difference between the generated keys. A simplified channel model is also analyzed in comparison with the measured channels, as regards the characteristics of generated key bits.