Wireless key generation in slow fading channels is challenging because of the limited channel variation and randomness. This paper proposes a novel artificial randomness (AR) assisted approach for fast key generation in slow fading environments. It integrates user-designed randomness into the channel probing to form a fast-changing combined channel to realize information-theory security. The analytical expressions of secret key capacity are derived. We find that it is possible to improve secret key capacity by introducing AR when legitimate users have a better channel condition than that of eavesdropper. We also find that the improved secret key capacity is proportional to the channel probing number and is bounded by the noise variance and channel condition. Simulation and experimental results show that AR approach can generate secret key effectively in slow fading environments by carefully designing probing numbers. Compared to existing work in literature, the proposed approach does not rely on multiple antennas or extra helpers, and it can be applied in both single antenna and multi-antenna systems.
Wireless key generation in slow fading channels is challenging because of the limited channel variation and randomness. This paper proposes a novel artificial randomness (AR) assisted approach for fast key generation in slow fading environments. It integrates user-designed randomness into the channel probing to form a fast-changing combined channel to realize information-theory security. The analytical expressions of secret key capacity are derived. We find that it is possible to improve secret key capacity by introducing AR when legitimate users have a better channel condition than that of eavesdropper. We also find that the improved secret key capacity is proportional to the channel probing number and is bounded by the noise variance and channel condition. Simulation and experimental results show that AR approach can generate secret key effectively in slow fading environments by carefully designing probing numbers. Compared to existing work in literature, the proposed approach does not rely on multiple antennas or extra helpers, and it can be applied in both single antenna and multi-antenna systems.
This paper investigates a secret key generation problem in quasi-static wireless communication environments. To increase the key generation rate, we propose an efficient artificial randomness (AR) aided key generation approach in time division duplexing (TDD) multiple-input single-output multiple-eavesdropper (MISOME) communication systems, adopting two transmitter precoding techniques including zero-forcing (ZF) and maximum ratio transmission (MRT). We prove that the proposed approach outperforms existing key generation approaches without AR in terms of increasing achievable key rate. Furthermore, the improved key rate is derived to be bounded by the entropy of legitimate users' and eavesdroppers' channels in MRT precoded systems, while the improved key rate increases linearly with the number of channel probing rounds in ZF precoding systems. Our proposed AR-aided approach needs no extra nodes to assist in key generation and can resist eavesdroppers with multiple antennas. Numerical results show that with the increase of AR variation range, ZF obtains a higher key generation rate while the key rate of MRT tends to a lower fixed value.
This paper investigates the secret key capacity of key generation in the slow-fading wireless channel by considering the temporal correlation between channel measurements in the previous and current frame. We derive the analytical expression of secret key capacity in the slow-fading channel, and propose the design guideline for practical key generation schemes in slow fading channel environments. We systematically analyze the impact of all corresponding parameters on secret key capacity, including sampling period, sampling delay, eavesdroppers' location, signal-to-noise ratio, Doppler spread, and pilot length. Theoretical and simulation results indicate that secret key capacity in the slow fading channel is affected by frame-to-frame correlation and increasing transmission power or sampling period can suppress this effect.
Physical-layer secret key generation enables information-theoretic security by extracting secret keys from channel reciprocity. A key challenge, however, is the limited secret-key rate (SKR) in slow-fading environments. To address this, we propose a movable antenna–aided scheme in which the legitimate parties independently randomize their antenna positions at each probe, inducing channel variation even when the underlying channel parameters are fixed. We show that, with a sufficiently large movement region and many propagation paths, the resulting channel effectively emulates a Gaussian model even in a static setting. Simulations further demonstrate substantial gains in SKR outage performance, with outage probability decreasing as the number of channel probes increases.
Artificial noise (AN) is an efficient way to enhance physical layer security of multiantenna wiretap channels with a passive eavesdropper (ED) whose channel state information is unavailable. However, the AN is known to be vulnerable to the eavesdropping attack with a large antenna array. To tackle the problem, the artificial fast fading (AFF) scheme has been developed to deliberately randomize the ED's effective channel so as to disrupt its channel estimation. Some recent progress has been made for the secrecy-rate performance of the AFF scheme in the multi-input single-output wiretap channels. However, it turns out that the performance is over-estimated. In this correspondence, we provide a comprehensive analysis on the secrecy-rate of the AFF scheme in general multi-input multi-output wiretap channels. Unfortunately, our analysis reveals a negative result that the conventional AFF is no better than the AN methods, without some pre-shared information among the legitimate parties. This is in fact in stark contrast to the previous observations. Motivated by our analysis, we propose a novel cross layer design by combining the AFF in the physical layer with the secret-keys in the upper layer crypto systems. Then, we mathematically prove that our method asymptotically nullifies the information leakage to the ED in the physical layer for any number of ED antennas even without the aid of the wiretap codes, while further enhancing the upper layer security, and thus provides an enhanced security over the layers. Finally, numerical results demonstrate the accuracy of our analysis and the efficiency of the proposed scheme.
It is vitally important to generate keys and keep them secret in secure wireless communications. Due to the broadcast nature of wireless channels, secret key distribution is more vulnerable to attacks in wireless communication. An ingenious solution is to generate secret keys by using the multipath channel as a source of common randomness. To address the problems that the existing physical-based protocols have low key generation rate and high reliance on mobile nodes or environments, a fast secret key generation protocol with virtual channel approach was proposed by HUANG and WANG for static wireless networks. In this paper, we show that, in the presence of an eavesdropper with multiple antennas, the scheme does not improve the theoretical upper bound of the key generation rate with information-theory security. Thus, the protocol is not information-theory security.
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.