Globecom

Experimental Evaluation of a Modular Coding Scheme for Physical Layer Security

Luis Torres-Figueroa, Ullrich J. Mönich, Johannes Voichtleitner, Anna Frank, Vlad-Costin Andrei, Moritz Wiese, Holger Boche

Published Dec 1, 2021• 12 citations

Publisher

Abstract

In this paper we use a seeded modular coding scheme for implementing physical layer security in a wiretap scenario. This modular scheme consists of a traditional coding layer and a security layer. For the traditional coding layer, we use a polar code. We evaluate the performance of the seeded modular coding scheme in an experimental setup with software defined radios and compare these results to simulation results. In order to assess the secrecy level of the scheme, we employ the distinguishing security metric. In our experiments, we compare the distinguishing error rate for different seeds and block lengths.

DOI: 10.1109/globecom46510.2021.9685785

Related papers

Implementation of a Modular Coding Scheme for Secure Communication

Anna Frank, Johannes Voichtleitner, Moritz Wiese +1 more

We experimentally verify the information-theoretic security of a seeded modular code for the AWGN wiretap channel consisting of a security layer, an error-correction layer and a modulation layer. The security layer is given by a universal family of hash functions. In the error-correction layer and the modulation layer we use polar codes and QAM, respectively. The eavesdropper uses the maximum likelihood (ML) test as an attack strategy. We analyze the security in different communication scenarios using simulations. We show that for small blocklengths the advantage (security measure) at the eavesdropper in the corresponding scenario can be close to 0 for suitable code parameters. Additional insights gathered from the simulation results include the impact of code parameters and seed choice on security.

International Conference on CommunicationsMay 16, 202210 citations

Seed analysis of universal hash functions for physical layer security in the wiretap channel

Johannes Voichtleitner, Moritz Wiese, Holger Boche

In this study, we examine different functions for the security layer of a seeded modular coding scheme for semantic security. We investigated the separation of the seed set into dispersing and non-dispersing seeds. The separation exists for all five implemented security functions in combination with all three tested error correcting codes. We show a simple procedure to reduce the probability of dispersing seeds for all security functions in two of three error correcting codes. Additionally, it was shown that Eve has an advantage in extracting information from her channel output if dispersing seeds are used. The simulations showed that this advantage can lead in special cases to a better information extraction despite larger encoding randomness. To the best of the authors’ knowledge, this is the first analytic comparison of different security functions for a seeded modular coding scheme of this kind.

GlobecomDec 8, 20252 citations

Polar code-based secure transmission with higher message rate combining channel entropy and computational entropy

Chen An, Mengjie Huang, Xianhui Lu +2 more

Abstract The existing physical layer security schemes, which are based on the key generation model and the wire-tap channel model, achieve security by utilizing channel reciprocity entropy and noise entropy, respectively. In contrast, we propose a novel secure transmission framework that combines noise entropy with reciprocity entropy, achieved by inserting reciprocity entropy into the frozen bits of polar codes. Note that in real-world scenarios, when eavesdroppers employ polynomial-time attacks, the bit error rate (BER) increases due to the introduction of computational entropy. To achieve indistinguishability security, we convert the practical physical layer security metric, BER, into the average min-entropy, a widely accepted concept in cryptography. The simulation results demonstrate that the eavesdropper’s BER can be significantly increased without compromising the communication performance of the legitimate receiver. Under concrete parameters we selected, when compared to the joint scheme of physical layer key generation and one time pad, the modular semantically-secure scheme based on the wire-tap channel model, and the simple channel entropy combination scheme, our scheme achieves a message rate approximately 1.2 times, 3.8 times, and 1.4 times better, respectively. Experimental testing validates the feasibility of our scheme.

CybersecurityMay 4, 20245 citations

Coding techniques for multi-user physical layer security

Alexandre J. Pierrot

The fast development of wireless networks, which are intrinsically exposed to eavesdropping, has created a growing concern for confidentiality. While classical cryptographic schemes require a key provided by the end-user, physical-layer security leverages the randomness of the physical communication medium as a source of secrecy. The main benefit of physical-layer security techniques is their relatively low cost and their ability to combine with any existing security mechanisms. This dissertation provides an analysis including the theoretical study of the two-way wiretap channel to obtain a better insight into how to design coding mechanisms, practical tests with experimental systems, and the design of actual codes. From a theoretical standpoint, the study confirms the benefits of combining several multi-user coding techniques including cooperative jamming, coded cooperative jamming and secret key generation. For these different mechanisms, the trade-off between reliability, secrecy and communication rate is clarified under a stringent strong secrecy metric. Regarding the design of practical codes, spatially coupled LDPC codes, which were originally designed for reliability, are modified to develop a coded cooperative jamming code. Finally, a proof-of-principle practical wireless system is provided to show how to implement a secret key generation system on experimental programmable radios. This testbed is then used to assess the realistic performance of such systems in terms of reliability, secrecy and rate.

Jul 14, 20150 citations

Testbed Implementation and Evaluation of Interleaved and Scrambled Coding for Physical-Layer Security

César Augusto da Silva Martins, Telmo Rui Fernandes, Marco A. C. Gomes +1 more

This paper presents a testbed implementation and evaluation of coding for secrecy schemes in a real environment through software defined radio platforms. These coding schemes rely on interleaving and scrambling with randomly generated keys to shuffle information before transmission. These keys are then encoded jointly with data and then hidden (erased) before transmission, thus only being retrievable through parity information resulting from encoded data. An advantage of the legitimate receiver (e.g. a better signal-to-noise ratio) on the reception of those keys provides the means to achieve secrecy against an adversary eavesdropper. Through this testbed implementation, we show the practical feasibility of coding for secrecy schemes in real-world environments, unveiling the usefulness of interleaving and scrambling with a hidden key to reduce the required advantage over an eavesdropper. We further describe and present solutions to a set of issues that appear when doing practical implementations of security schemes in software defined radio platforms.

IEEE Vehicular Technology ConferenceJun 1, 20189 citations

Finite Blocklength Secrecy Coding

Jack Pfister

Coding for physical layer security is typically evaluated as blocklengths approach infinity using information theoretic measures.This thesis presents techniques to quantify secrecy guarantees of finite blocklength wiretap codes across two common channel models.This is an important step for the field of physical layer security as secrecy guarantees are generally not quantified at finite blocklengths.From this analysis, we are able to determine the best performing linear secrecy codes for their respective blocklengths and information rates.Due to the error correcting shortcomings of wiretap codes, we also investigate the error correcting capabilities of a secrecy coding technique that uses polar codes.

May 9, 20183 citations