Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Conference on Consumer Electronics - Taiwan (ICCE-Taiwan)

Secure Communication with Physical Layer Coding Scheme

Jong-Shin Chen, Cheng‐Ying Yang, Jenq-Foung JF Yao, Chin-En Yen, Min‐Shiang Hwang

Published Jul 17, 2023• 0 citations
Publisher

Abstract

For a secure communication, it enables the destination could successfully release the authentic information from the sender. At the meantime, a secure system protects the transmitted information from the eavesdroppers. Traditionally, the encryption, authorization and authentication schemes could be employed for protecting the eavesdroppers. However, the unexpected attacks have been continuously developed. It could not be avoided for the undesired attacks. According to Shannon's perfect communication, there exists an error-free cryptogram that could protect for the attacker. Hence, based on the secrecy rate, it is expected that the secure communication could be practical with physical-layer coding scheme. Besides, the coding scheme is not only to obtain a critical level of security, but also to achieve a lower decoding error. For a security concern, increasing the secrecy rate leads a higher level of security ability. However, it might suffer the system performance without bandwidth efficiency. Hence, the tradeoff between the security level and coding rate is important to lead a secure communication.

DOI
10.1109/icce-taiwan58799.2023.10226772

Related papers

Implications of Coding Layers on Physical-Layer Security: A Secrecy Benefit Approach

Willie K. Harrison, Elise Beard, Scott Dye +4 more

In this work, we consider the pros and cons of using various layers of keyless coding to achieve secure and reliable communication over the Gaussian wiretap channel. We define a new approach to information theoretic security, called practical secrecy and the secrecy benefit, to be used over real-world channels and finite blocklength instantiations of coding layers, and use this new approach to show the fundamental reliability and security implications of several coding mechanisms that have traditionally been used for physical-layer security. We perform a systematic/structured analysis of the effect of error-control coding, scrambling, interleaving, and coset coding, as coding layers of a secrecy system. Using this new approach, scrambling and interleaving are shown to be of no effect in increasing information theoretic security, even when measuring the effect at the output of the eavesdropper's decoder. Error control coding is shown to present a trade-off between secrecy and reliability that is dictated by the chosen code and the signal-to-noise ratios at the legitimate and eavesdropping receivers. Finally, the benefits of secrecy coding are highlighted, and it is shown how one can shape the secrecy benefit according to system specifications using combinations of different layers of coding to achieve both reliable and secure throughput.

Entropy•Aug 1, 2019•7 citations

Evaluation of Secrecy Rate in Cooperative Communication System

Cheng‐Ying Yang, Hsinying Liang, Pin-Yen Huang Huang

Cooperative system is a tendency for future communications because of its spatial diversity to improve the system performance. However, the security is a critical issue in the wireless application with a highly private request. Although the encryption schemes have been proposed to approach the secure purpose, those schemes need a lot of computing resource. It is not practical for the applications with limited computing ability, such as IoT. According to Shannon theory of perfect secrecy, the security could be implemented on the physical layer. Based on the positive secrecy rate, the evaluation of security, secure communication could be practical. This work concentrates on the theoretical solution to the secrecy rate in the AF mode cooperative communication system. Also, the numerical results with the proposed methodology are given. It shows the effects of eavesdropper could not affect the secure communication if the number of the eavesdropper is less than that of relays in the system. The appropriate relay assignment benefits the secure communication.

EPiC series in computing•Mar 13, 2019•2 citations

A Novel Physical Layer Key Generation and Authenticated Encryption Protocol Exploiting Shared Randomness

Cornelius Onuvoye Saiki

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.

•May 5, 2016•0 citations

To avoid or not to avoid CSI leakage in physical layer secret communication systems

Ta-Yuan Liu, Pin-Hsun Lin, Shih‐Chun Lin +2 more

Physical layer secrecy has attracted much attention in recent years due to its ability to ensure communication secrecy with the use of channel coding and signal processing techniques (and without the explicit use of secret keys) in the physical layer. It serves as a promising technique for highly dynamic or ad hoc systems such as device-to-device and machine-type communication systems. However, the achievable secrecy performance depends highly on the level of CSI at the transmitter, the receiver, and the eavesdropper. In this article, we discuss how different levels of CSI resulting from conventional and unconventional ways of performing training and channel feedback may affect the confidentiality in terms of the information-theoretic (perfect) secrecy rate. The conventional approach refers to the emission of pilot signals from the transmitter and explicit channel feedback from the receiver. This approach is backward compatible with existing systems and allows the receiver to obtain accurate knowledge of the CSI, but may suffer from CSI leakage toward the eavesdropper. Unconventional approaches capitalize on reverse training to prevent CSI leakage and are shown to achieve significant improvements over conventional schemes in certain cases. For example, in a system with four transmit antennas and a single antenna at both the receiver and the eavesdropper, a secrecy rate gain of approximately 0.8 b/channel use at transmit SNR of 16 dB is observed over the full CSI case by providing CSI only to the transmitter (but not the receiver and the eavesdropper).

IEEE Communications Magazine•Dec 1, 2015•53 citations

Secure Source Coding

Paul Cuff, Curt M. Schieler

This chapter assumes that a limited amount of secret key and reliable communication are available for use in encoding and transmitting a stochastic signal. The chapter starts at the beginning, with a more general proof of Shannon's “key must be as large as the message” result that holds even for stochastic encoders. Three directions are explored. First, for lossless compression and perfect secrecy, variable length codes or key regeneration allow for a tradeoff between efficiency of compression and efficiency of secret key usage. Second, the relaxation to imperfect secrecy is studied. This is accomplished by measuring the level of secrecy either by applying a distortion metric to the eavesdropper's best possible reconstruction or by considering the eavesdropper's ability to guess the source realization. Finally, an additional relaxation is made to allow the compression of the source to be lossy. The chapter concludes by showing how the oft-used equivocation metric for information theoretic secrecy is a particular special case of the rate–distortion theory contained herein. Introduction Source coding is the process of encoding information signals for transmission through digital channels. Since efficiency is a primary concern in this process, the phrase “source coding” is often used interchangeably with “data compression.” The relationship between source coding and channel coding is that channel coding produces digital resources from natural resources (e.g., a physical medium), and source coding consumes digital resources to accomplish a task involving information, often simply moving it from one point to another. The channel coding side of information theoretic security is referred to as physical layer security. This usually involves designing a communication system for a physical wiretap channel, introduced by Wyner in [1], which produces a provably secure digital communication link. Another important challenge in physical layer security is the production of a secret key based on common observations, such as channel fading parameters or prepared quantum states. Although a key agreement protocol does not necessarily involve a channel, it is consistent with the spirit of channel coding in that the objective is the production of digital resources.

Cambridge University Press eBooks•Jun 16, 2017•0 citations

A Physical Layer Security Communication Mechanism Based on End-to-End Learning

Hengmiao Wu, Zhuo Sun, Xue Zhou

Due to the randomness of wireless channels, it is possible to achieve secure communications by designing communication systems according to the characteristics of wireless channels. In this work, a physical layer security communication mechanism based on end-to-end learning is introduced. The proposed mechanism achieves secure communications by designing the loss function of end-to-end learning. We evaluate secrecy performances of the proposed mechanism through block error rate (BLER) under three classic circumstances which different decoding models are applied by the eavesdropper. Self-training decoding model, the legitimate decoding model and unsupervised learning (K-means clustering) model are alternative for the eavesdropper. The experiments results show that K-means clustering model can get the best BLER performance for the eavesdropper with some prior information, but its BLER is still higher than 0.5. Even if the eavesdropper has a much higher than the legitimate users, there is no improvement in its BLER traditional physical layer security Es/N0. Compared to methods, the proposed mechanism can achieve secure communications without extra key extraction.

IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)•Oct 1, 2019•2 citations
For a secure communication, it enables the destination could successfully release the authentic information from the sender. At the meantime, a secure system protects the transmitted information from the eavesdroppers. Traditionally, the encryption, authorization and authentication schemes could be employed for protecting the eavesdroppers. However, the unexpected attacks have been continuously developed. It could not be avoided for the undesired attacks. According to Shannon's perfect communication, there exists an error-free cryptogram that could protect for the attacker. Hence, based on the secrecy rate, it is expected that the secure communication could be practical with physical-layer coding scheme. Besides, the coding scheme is not only to obtain a critical level of security, but also to achieve a lower decoding error. For a security concern, increasing the secrecy rate leads a higher level of security ability. However, it might suffer the system performance without bandwidth efficiency. Hence, the tradeoff between the security level and coding rate is important to lead a secure communication.
In this work, we consider the pros and cons of using various layers of keyless coding to achieve secure and reliable communication over the Gaussian wiretap channel. We define a new approach to information theoretic security, called practical secrecy and the secrecy benefit, to be used over real-world channels and finite blocklength instantiations of coding layers, and use this new approach to show the fundamental reliability and security implications of several coding mechanisms that have traditionally been used for physical-layer security. We perform a systematic/structured analysis of the effect of error-control coding, scrambling, interleaving, and coset coding, as coding layers of a secrecy system. Using this new approach, scrambling and interleaving are shown to be of no effect in increasing information theoretic security, even when measuring the effect at the output of the eavesdropper's decoder. Error control coding is shown to present a trade-off between secrecy and reliability that is dictated by the chosen code and the signal-to-noise ratios at the legitimate and eavesdropping receivers. Finally, the benefits of secrecy coding are highlighted, and it is shown how one can shape the secrecy benefit according to system specifications using combinations of different layers of coding to achieve both reliable and secure throughput.
Cooperative system is a tendency for future communications because of its spatial diversity to improve the system performance. However, the security is a critical issue in the wireless application with a highly private request. Although the encryption schemes have been proposed to approach the secure purpose, those schemes need a lot of computing resource. It is not practical for the applications with limited computing ability, such as IoT. According to Shannon theory of perfect secrecy, the security could be implemented on the physical layer. Based on the positive secrecy rate, the evaluation of security, secure communication could be practical. This work concentrates on the theoretical solution to the secrecy rate in the AF mode cooperative communication system. Also, the numerical results with the proposed methodology are given. It shows the effects of eavesdropper could not affect the secure communication if the number of the eavesdropper is less than that of relays in the system. The appropriate relay assignment benefits the secure communication.
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.
Physical layer secrecy has attracted much attention in recent years due to its ability to ensure communication secrecy with the use of channel coding and signal processing techniques (and without the explicit use of secret keys) in the physical layer. It serves as a promising technique for highly dynamic or ad hoc systems such as device-to-device and machine-type communication systems. However, the achievable secrecy performance depends highly on the level of CSI at the transmitter, the receiver, and the eavesdropper. In this article, we discuss how different levels of CSI resulting from conventional and unconventional ways of performing training and channel feedback may affect the confidentiality in terms of the information-theoretic (perfect) secrecy rate. The conventional approach refers to the emission of pilot signals from the transmitter and explicit channel feedback from the receiver. This approach is backward compatible with existing systems and allows the receiver to obtain accurate knowledge of the CSI, but may suffer from CSI leakage toward the eavesdropper. Unconventional approaches capitalize on reverse training to prevent CSI leakage and are shown to achieve significant improvements over conventional schemes in certain cases. For example, in a system with four transmit antennas and a single antenna at both the receiver and the eavesdropper, a secrecy rate gain of approximately 0.8 b/channel use at transmit SNR of 16 dB is observed over the full CSI case by providing CSI only to the transmitter (but not the receiver and the eavesdropper).
This chapter assumes that a limited amount of secret key and reliable communication are available for use in encoding and transmitting a stochastic signal. The chapter starts at the beginning, with a more general proof of Shannon's “key must be as large as the message” result that holds even for stochastic encoders. Three directions are explored. First, for lossless compression and perfect secrecy, variable length codes or key regeneration allow for a tradeoff between efficiency of compression and efficiency of secret key usage. Second, the relaxation to imperfect secrecy is studied. This is accomplished by measuring the level of secrecy either by applying a distortion metric to the eavesdropper's best possible reconstruction or by considering the eavesdropper's ability to guess the source realization. Finally, an additional relaxation is made to allow the compression of the source to be lossy. The chapter concludes by showing how the oft-used equivocation metric for information theoretic secrecy is a particular special case of the rate–distortion theory contained herein. Introduction Source coding is the process of encoding information signals for transmission through digital channels. Since efficiency is a primary concern in this process, the phrase “source coding” is often used interchangeably with “data compression.” The relationship between source coding and channel coding is that channel coding produces digital resources from natural resources (e.g., a physical medium), and source coding consumes digital resources to accomplish a task involving information, often simply moving it from one point to another. The channel coding side of information theoretic security is referred to as physical layer security. This usually involves designing a communication system for a physical wiretap channel, introduced by Wyner in [1], which produces a provably secure digital communication link. Another important challenge in physical layer security is the production of a secret key based on common observations, such as channel fading parameters or prepared quantum states. Although a key agreement protocol does not necessarily involve a channel, it is consistent with the spirit of channel coding in that the objective is the production of digital resources.
Due to the randomness of wireless channels, it is possible to achieve secure communications by designing communication systems according to the characteristics of wireless channels. In this work, a physical layer security communication mechanism based on end-to-end learning is introduced. The proposed mechanism achieves secure communications by designing the loss function of end-to-end learning. We evaluate secrecy performances of the proposed mechanism through block error rate (BLER) under three classic circumstances which different decoding models are applied by the eavesdropper. Self-training decoding model, the legitimate decoding model and unsupervised learning (K-means clustering) model are alternative for the eavesdropper. The experiments results show that K-means clustering model can get the best BLER performance for the eavesdropper with some prior information, but its BLER is still higher than 0.5. Even if the eavesdropper has a much higher than the legitimate users, there is no improvement in its BLER traditional physical layer security Es/N0. Compared to methods, the proposed mechanism can achieve secure communications without extra key extraction.