With rapid advances made in quantum computing, information theoretic security is of paramount importance for Internet of Things (IoT), particularly for low-powered devices like sensors and actuators, where there is generally little to no room for complex security features. Common Randomness (CR) can be considered as a resource, that can be used for adding information theoretic security to the IoT systems. The most desired CR is a lengthy CR with uniform distribution. In this study, we design and implement channel reciprocity based CR using a Software Defined Radio (SDR). Furthermore, we also implement Quantum Entanglement (QE) assisted CR generation scheme and compare it against the classical channel reciprocity based scheme. The evaluation of both CR generation schemes has been carried out on the basis of National Institute for Statistical Tests (NIST) and bit discrepancy results. We show that QE assisted CR generation is more efficient compared to channel reciprocity based CR, in terms of generating uniformly distributed CR, if the latter is observing slow fading channel.
With rapid advances made in quantum computing, information theoretic security is of paramount importance for Internet of Things (IoT), particularly for low-powered devices like sensors and actuators, where there is generally little to no room for complex security features. Common Randomness (CR) can be considered as a resource, that can be used for adding information theoretic security to the IoT systems. The most desired CR is a lengthy CR with uniform distribution. In this study, we design and implement channel reciprocity based CR using a Software Defined Radio (SDR). Furthermore, we also implement Quantum Entanglement (QE) assisted CR generation scheme and compare it against the classical channel reciprocity based scheme. The evaluation of both CR generation schemes has been carried out on the basis of National Institute for Statistical Tests (NIST) and bit discrepancy results. We show that QE assisted CR generation is more efficient compared to channel reciprocity based CR, in terms of generating uniformly distributed CR, if the latter is observing slow fading channel.
Common Randomness (CR) can be considered as a resource for future communication devices and systems that not only improve the transmission capacity of identification systems but also provide robust information theoretical security. To achieve this, CR must be generated such that the reconciliation cost must be lower than the size of the key that is being generated. This can be achieved by using filters. In this live demonstration, we prepare a CR generation mechanism using Software Defined Radio (SDR) and achieve this tradeoff using multi-bit quantization and Savitzky Golay filter.
Common Randomness (CR) as a resource is gaining increasing use cases for addressing futuristic communication demands such as scalability, technological sovereignty, and trustworthiness. For instance, CR can be applied to enhance data encryption. It also enables scalable identification (ID) codes and can support up to double-exponential ID capacity. Moreover, CR strengthens wireless communication systems by providing robustness against jamming attacks. However, from the viewpoint of a communication system, two distinct terminals or devices that wish to generate CR must first observe a correlated random source. In a wireless communication system, this source can be the channel’s stochastic nature, as reflected in the received signal. Traditionally, such an attempt has already been made for physical-layer secret key generation. However, the primary objective of PLSK is to provide information-theoretic security, which does not require generating CR at a very high rate. In novel communication methods such as ID-codes, for a discrete memoryless channel, the ID capacity is lower-bounded by CR capacity. In other words, to realize the benefits of CR assisted ID codes, it is required to generate a vast number of CR bits from very few channel observations. Therefore, there is a need to re-examine the PLSK methodology and modify it so that the resulting generated CR can be adopted into novel communication concepts, such as ID codes. This thesis aims to redesign PLSK so that the resulting information-theoretic CR rate more closely approaches the CR capacity than traditional PLSK schemes. The thesis introduces an initial PLSK implementation on Software-Defined Radios (SDRs) and discusses the trade-offs of attempting to improve the rate of CR generation in the PLSK system. Subsequently, the PLSK method is redesigned to enhance the CR rate. This is achieved through a two-step process: modifying CR generation methods and improving the storage of their components. In the methods section, I combine filters with low cutoff frequencies, multi-bit quantization, and gray-code encoding with a novel functional block called randomization. In the storage section, I propose introducing a 16-bit RSSI instead of an 8-bit RSSI to enhance CR rate through a novel paradigm called engineering entropy. I demonstrate and discuss the resulting improvement in the CR rate achieved with SDRs, compared to the corresponding state-of-the-art PLSK strategy.:1 Introduction 1 1.1 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.3 Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.4 Structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2 Physical Layer Secret Key Generation for Post-Quantum Cryptography 2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 2.2 Implementation of Physical Layer Secret Key (PLSK) . . . . . . . 9 2.3 Experimental Setup . . . . . . . . . . . . . . . . . . . . . . . . . 13 2.4 Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 2.5 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 2.6 Further Development . . . . . . . . . . . . . . . . . . . . . . . . 15 3 Overview of Common Randomness Generation 17 3.1 Theoretical Foundation . . . . . . . . . . . . . . . . . . . . . . . 17 3.2 Illustrative Example for Common Randomness Generation . . . 19 4 ImprovingCommonRandomness Rate Through Functional Blocks 23 4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 4.2 Improving Common Randomness (CR) Rate . . . . . . . . . . . 26 4.3 Review of CR Generation Capacity . . . . . . . . . . . . . . . . 27 4.4 Individual Stages . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 4.5 Evaluation Metrics . . . . . . . . . . . . . . . . . . . . . . . . . . 38 4.6 The CFO-CR Testbed: The Experimental Setup . . . . . . . . . . 40 4.7 Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43 4.8 Conclusion and Future Directions . . . . . . . . . . . . . . . . . 54 5 Improving Common Randomness Rate Through RSSI Storage 59 5.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59 5.2 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59 5.3 General System Model . . . . . . . . . . . . . . . . . . . . . . . 61 5.4 Extraction Stages . . . . . . . . . . . . . . . . . . . . . . . . . . 63 5.5 Testbed . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 69 5.6 Evaluation Metrics . . . . . . . . . . . . . . . . . . . . . . . . . . 71 5.7 Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 74 5.8 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88 Conclusions 91 Bibliography 93
Common randomness (CR), as a resource, is not commonly used in existing practical communication systems. In the common randomness framework, both sender and receiver, often described as terminals, aim to generate a common random variable observable to both, perhaps with low error probability. The knowledge of this CR allows to implement correlated random protocols that could lead to faster and more efficient algorithms. We characterize CR over Gaussian channels for their practical relevance in many communication situations by deriving the CR capacity for both Gaussian Single-Input Single-Output (SISO) and Multiple-Input Multiple-Output (MIMO) cases. Furthermore, CR plays a key role in the identification scheme. In many new applications such as several machine-to-machine and human-to-machine systems and the tactile internet, which demand ultra-reliable low latency, the identification or also called post-Shannon scheme is proved to be more efficient than the classical transmission. It has been proved that through CR generation, the post-Shannon communication task allows to achieve an enormous performance gain. We consider a correlation-assisted secure identification scheme over Gaussian wiretap channels (GWC) and develop a lower bound on the corresponding secure identification capacity.
Identification is a new paradigm introduced for goal-oriented communication that verifies the semantics of the intended message rather than just transmitting the message bits, which is traditionally done in classical communication systems. One of the key techniques to improve randomized identification capacity is by introducing Common Randomness (CR). Physical Layer Secret Key (PLSK) is one such CR generation technique, where terminals generate secret keys based on changes in channel reciprocity between the wireless terminals and are mainly used for PHY layer encryption. However, the traditional way of evaluating PLSK techniques through bit discrepancies, bit generation rate, and entropy is not sufficient for evaluating their usefulness for identification. This paper proposes three key novel information theory paradigms that can be used alongside other mentioned parameters to evaluate key PLSK techniques for their usefulness in identification, i.e., CR rate, CR capacity, and cost function, followed by a supporting implementation using Software Defined Radio (SDR)s.
Internet-of-Things (IoT) networks generally contain resource-constrained devices that require an energy-efficient key generation procedure to producing secure keys at a faster rate. The physical characteristics of the wireless channel can be exploited to secure communication within IoT networks. In particular, secret keys can be generated by leveraging on the randomness of the wireless physical channel between two communicating parties. The conventional mechanism of generating keys at the physical layer, i.e., using channel probing, quantization, information reconciliation, and privacy amplification, may not be preferable for IoT devices. In addition, in some cases IoT devices may be deployed in static environments, wherein the channel coherence time is too high to generate keys at a faster rate and with the desired randomness. This study proposes a mapping table-based key distribution scheme for IoT environments, wherein multiple characteristics of the random channel are combined to improve not only the key generation rate (KGR) but also the key agreement rate (KAR) and bit error rate (BER). In the proposed scheme, both the channel magnitude and the phase are exploited in the key generation process. The proposed scheme is immune to channel estimation errors while providing sufficient randomness in the static environment. Additionally, the scheme is thoroughly investigated for different scenarios including the case of a smarter eavesdropper, which attempts to estimate the channel between the legitimate nodes. This case verifies the robustness of the proposed scheme in different settings and attack models.
Common randomness (CR) is a valuable resource for enhancing the trustworthiness of 6G communication systems. This article highlights the role of CR in improving scalability, security, and resilience in distributed 6G architectures. It provides an overview of information-theoretic two-source models for CR generation and summarizes known capacity results, together with their implications for practical systems under different communication settings, including one-way, two-way, helper-assisted, and interactive scenarios. Furthermore, the article explores CR-assisted secure identification over Gaussian channels as an application and highlights selected open research problems in CR generation for next-generation wireless systems. The article targets researchers and practitioners interested in bridging information-theoretic tools with emerging 6G communication systems.