Secure autonomous secret key distillation (SKD) systems traditionally depend on external common randomness (CR) sources, which often suffer from instability and limited reliability over long-term operation. In this work, we propose a novel SKD architecture that synthesizes CR by combining a keystream of a shared-key keystream generator KSG(KG) with locally generated binary Bernoulli noise. This construction emulates the statistical properties of the classical Maurer satellite scenario while enabling deterministic control over key parameters such as bit error rate, entropy, and leakage rate (LR). We derive a closed-form lower bound on the equivocation of the shared-secret key KG from the viewpoint of an adversary with access to public reconciliation data. This allows us to define an admissible operational region in which the system guarantees long-term secrecy through periodic key refreshes, without relying on advantage distillation. We integrate the Winnow protocol as the information reconciliation mechanism, optimized for short block lengths (N=8), and analyze its performance in terms of efficiency, LR, and final key disagreement rate (KDR). The proposed system operates in two modes: ideal secrecy, achieving secret key rates up to 22% under stringent constraints (KDR < 10−5, LR < 10−10), and perfect secrecy mode, which approximately halves the key rate. Notably, these security guarantees are achieved autonomously, without reliance on advantage distillation or external CR sources. Theoretical findings are further supported by experimental verification demonstrating the practical viability of the proposed system under realistic conditions. This study introduces, for the first time, an autonomous CR-based SKD system with provable security performance independent of communication channels or external randomness, thus enhancing the practical viability of secure key distribution schemes.
Secure autonomous secret key distillation (SKD) systems traditionally depend on external common randomness (CR) sources, which often suffer from instability and limited reliability over long-term operation. In this work, we propose a novel SKD architecture that synthesizes CR by combining a keystream of a shared-key keystream generator KSG(KG) with locally generated binary Bernoulli noise. This construction emulates the statistical properties of the classical Maurer satellite scenario while enabling deterministic control over key parameters such as bit error rate, entropy, and leakage rate (LR). We derive a closed-form lower bound on the equivocation of the shared-secret key KG from the viewpoint of an adversary with access to public reconciliation data. This allows us to define an admissible operational region in which the system guarantees long-term secrecy through periodic key refreshes, without relying on advantage distillation. We integrate the Winnow protocol as the information reconciliation mechanism, optimized for short block lengths (N=8), and analyze its performance in terms of efficiency, LR, and final key disagreement rate (KDR). The proposed system operates in two modes: ideal secrecy, achieving secret key rates up to 22% under stringent constraints (KDR < 10−5, LR < 10−10), and perfect secrecy mode, which approximately halves the key rate. Notably, these security guarantees are achieved autonomously, without reliance on advantage distillation or external CR sources. Theoretical findings are further supported by experimental verification demonstrating the practical viability of the proposed system under realistic conditions. This study introduces, for the first time, an autonomous CR-based SKD system with provable security performance independent of communication channels or external randomness, thus enhancing the practical viability of secure key distribution schemes.
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
We study common randomness where two parties have access to i.i.d. samples from a known random source, and wish to generate a shared random key using limited (or no) communication with the largest possible probability of agreement. This problem is at the core of secret key generation in cryptography, with connections to communication under uncertainty and locality sensitive hashing. We take the approach of treating correlated sources as a critical resource, and ask whether common randomness can be generated resource-efficiently. We consider two notable sources in this setup arising from correlated bits and correlated Gaussians. We design the first explicit schemes that use only a polynomial number of samples (in the key length) so that the players can generate shared keys that agree with constant probability using optimal communication. The best previously known schemes were both non-constructive and used an exponential number of samples. In the amortized setting, we characterize the largest achievable ratio of key length to communication in terms of the external and internal information costs, two well-studied quantities in theoretical computer science. In the relaxed setting where the two parties merely wish to improve the correlation between the generated keys of length k, we show that there are no interactive protocols using o(k) bits of communication having agreement probability even as small as 2–o(k). For the related communication problem where the players wish to compute a joint function f of their inputs using i.i.d samples from a known source, we give a simultaneous message passing protocol using 2O(c) bits where c is the interactive randomized public-coin communication complexity of f. This matches the lower bound shown previously while the best previously known upper bound was doubly exponential in c. Our schemes reveal a new connection between common randomness and unbiased error-correcting codes, e.g., dual-BCH codes and their analogues in Euclidean space.
This paper presents a system for secure digital voice signal transmission over the GSM mobile network (Global System for Mobile Communication). The cryptographic part of the system is based on Vernam cipher, which requires the same speed of generating secret symmetric keys as the basic information flow in the main channel. The system for generating and distributing secret keys for Vernam cipher is realized based on the correlation properties of the locally synthesized speech signal of the transmitter and the corresponding receiving speech signal. By applying the method of sequential distillation of secret keys (SKD) on the mentioned source of common randomness, the generation speed of up to 34 kb/s is ensured, which is more than enough to maintain the absolute secrecy of Vernam cipher. The price that needs to be paid is the necessity of having an additional authenticated public channel through which the SKD protocol is performed. The privacy amplification block, as a necessary part of the SKD protocol, was implemented using machine learning methods, in order to reliably estimate the conditional Renyi entropy of the second order. According to our knowledge, this is the first autonomous, perfectly secret system for voice transmission over the GSM network without explicit prior generation and distribution of secret keys.
We propose a new high-speed secret key distillation system via public discussion based on the common randomness contained in the speech signal of the protocol participants. The proposed system consists of subsystems for quantization, advantage distillation, information reconciliation, an estimator for predicting conditional Renyi entropy, and universal hashing. The parameters of the system are optimized in order to achieve the maximum key distillation rate. By introducing a deep neural block for the prediction of conditional Renyi entropy, the lengths of the distilled secret keys are adaptively determined. The optimized system gives a key rate of over 11% and negligible information leakage to the eavesdropper, while NIST tests show the high cryptographic quality of produced secret keys. For a sampling rate of 16 kHz and quantization of input speech signals with 16 bits per sample, the system provides secret keys at a rate of 28 kb/s. This speed opens the possibility of wider application of this technology in the field of contemporary information security.
This paper presents an autonomous perfectly secure low-bit-rate voice communication system (APS-VCS) based on the mixed-excitation linear prediction voice coder (MELPe), Vernam cipher, and sequential key distillation (SKD) protocol by public discussion. An authenticated public channel can be selected in a wide range, from internet connections to specially leased radio channels. We found the source of common randomness between the locally synthesized speech signal at the transmitter and the reconstructed speech signal at the receiver side. To avoid information leakage about open input speech, the SKD protocol is not executed on the actual transmitted speech signal but on artificially synthesized speech obtained by random selection of the linear spectral pairs (LSP) parameters of the speech production model. Experimental verification of the proposed system was performed on the Vlatacom Personal Crypto Platform for Voice encryption (vPCP-V). Empirical measurements show that with an adequate selection of system parameters for voice transmission of 1.2 kb/s, a secret key rate (KR) of up to 8.8 kb/s can be achieved, with a negligible leakage rate (LR) and bit error rate (BER) of order 10−3 for various communications channels, including GSM 3G and GSM VoLTE networks. At the same time, by ensuring perfect secrecy within symmetric encryption systems, it further highlights the importance of the symmetry principle in the field of information-theoretic security. To our knowledge, this is the first autonomous, perfectly secret system for low-bit-rate voice communication that does not require explicit prior generation and distribution of secret keys.
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.