Providing secure communication links between devices of low computational power has been increasingly investigated during recent years. The need for fast and easy-to-implement security for computationally weak wireless devices has lead to the development of physical layer based key generation approaches. The generation of symmetric cryptographic keys out of wireless channel properties turned out to be a promising approach comprising advantages of symmetric as well as asymmetric cryptography. Numerous quantization schemes have been proposed in previous works to increase the Key Generation Rate (KGR). Also by increasing the sampling rate, the input data can be generated faster. However, due to fast sampling rates, redundancy of subsequent bits will increase. This lowers the quality, that is, the randomness of the generated secret key and makes the system more vulnerable to brute-force attacks. We present and analyze different techniques for transforming a temporally correlated sequence into a compressed sequence of decorrelated bits and, therefore, assure non-redundant key sequences.
Providing secure communication links between devices of low computational power has been increasingly investigated during recent years. The need for fast and easy-to-implement security for computationally weak wireless devices has lead to the development of physical layer based key generation approaches. The generation of symmetric cryptographic keys out of wireless channel properties turned out to be a promising approach comprising advantages of symmetric as well as asymmetric cryptography. Numerous quantization schemes have been proposed in previous works to increase the Key Generation Rate (KGR). Also by increasing the sampling rate, the input data can be generated faster. However, due to fast sampling rates, redundancy of subsequent bits will increase. This lowers the quality, that is, the randomness of the generated secret key and makes the system more vulnerable to brute-force attacks. We present and analyze different techniques for transforming a temporally correlated sequence into a compressed sequence of decorrelated bits and, therefore, assure non-redundant key sequences.
Due to the unavoidable shared nature of the wireless radio spectrum, providing security for wireless communications presents unique challenges. Cryptographic keys have been used as a primary technique for securing wireless networks but are not completely secure. The symmetric keys used for cryptographic purposes are vulnerable to man-in-the-middle and brute force attacks. More recently, PHY-layer based techniques have gained significant attention, where the principle of channel reciprocity and the natural randomness of the measured wireless channel to generate secret keys is leveraged. Although, PHY-layer secret key generation has been investigated and presented in the literature before, there has been a lack of discussion in terms of obtaining symmetric keys on both ends of the link. In this work, we present a novel PHY-layer secret key generation technique that aims for symmetric encryption keys while limiting the information leaked to an eavesdropper to ensure complete secrecy and to prevent potential intelligent attacks. Our algorithm utilizes forward and backward channel state information in a given wireless link and combats the minute differences observed in these pairs by generating channel trend information. We demonstrate our technique using experimental results from a realtime SDR testbed connected to a wireless channel emulator. Our results indicate that the algorithm is successful in generating symmetric keys under various wireless environments without revealing any information pertaining to the key via the open wireless channel. Our secret key extraction rate can reach values in excess of 17.3 Kbps.
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.
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.
Due to the broadcast nature of wireless channels, wireless communication is vulnerable to eavesdropping, message modification, and node impersonation. Securing the wireless communication requires the shared secret keys between the communicating entities. Traditional security schemes rely on public key infrastructures and cryptographic algorithms to manage secret keys. Recently, many physical-layer-based methods have been proposed as alternative solutions for key generation in wireless networks. These methods exploit the inherent randomness of the wireless fading channel to generate secret keys while providing information-theoretical security without intensive cryptographic computations. This article provides an overview of the existing PHY-based key generation schemes exploiting the randomness of the wireless channels. Specifically, we first introduce the fundamental and general framework of the PHY-based key generation schemes and then categorize them into two classes: received-signal-strength-based and channel- phase-based protocols. Finally, we present a performance comparison of them in terms of key disagreement probability, key generation rate, key bit randomness, scalability, and implementation issues.
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.
Modern networking technologies involve the interconnection of smart and intelligent physical objects to provide advanced services. These physical objects may be part of various network technologies like WLAN, wireless sensor network (WSN), Internet of Things (IoT), etc., and share data in wireless mode, which should be secured from threats. These physical devices possess many constraints like power, computational complexity and storage, and are required to have lightweight security algorithms. Traditionally, security is achieved by the higher layers of the communication model, which has high computational complexity and consumes more power. In this chapter, a secure-key-generation scheme from physical layer characteristics is introduced as a possible lightweight security alternative to traditional upper-layer security approaches. The proposed scheme is based on the wiretap-channel model and security is achieved by generating keys at both communicating ends independently, based on inherent common-channel characteristics like randomness. It is mainly based on the principle of spatial decorrelation and channel reciprocity for identical carrier frequency. There is no provision for sharing keys as in public-key cryptography, so physical-layer key generation is not vulnerable to threats like key leakage. The generated key at the transmitter encrypts plain text; the generated cipher is transmitted on the common channel and is decrypted at the receiver end using the key generated by the receiver. Key generation consists of fundamental blocks like channel probing and quantization followed by information reconciliation and privacy amplification. The physical-layer key generation is already a power-efficient security solution; this chapter aims to enhance this capacity further. This is done by introducing low-end signal conditioning in the channel-probing step using moving-window averaging. This solution not only improves system performance but also makes it suitable for limited- power applications. The performance of the key-generation system is characterised in terms of the bit-disagreement rate between the generated key sequences of communicating parties and the key randomness by means of the NIST statistical test suite.