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

arXiv:2512.09104

Secret-key-based physical layer security for feedback-aided unsourced random access

Ahmadi, Mohammad Javad, Rafael F. Schaefer, Farshad Rostami Ghadi, H. Vincent Poor

Published Dec 9, 2025• 0 citations
arXivHTMLPDF

Abstract

This work introduces security for unsourced random access (URA) via a physical-layer security approach. To achieve confidentiality, the proposed system opportunistically exploits intrinsic features of feedback-aided URA without altering its original structure or operational characteristics. As a result, the system preserves URA's efficiency, including low delay and minimal signaling overhead, while ensuring secure communication. To secure transmission, each user generates a secret key from a feedback signal broadcast by the BS in a previous transmission round, which depends on the BS-user channel and can thus be treated as private. Each user then encrypts its data using the secret key before transmission. Along with the encrypted data, only the parity bits of the LDPC-encoded key are transmitted, enabling secret key recovery at the legitimate receiver via Slepian-Wolf decoding with side information. We propose a receiver algorithm to recover both the encrypted data and the encoded secret key at the legitimate receiver. We further present a theoretical analysis to derive analytical error probabilities for both the legitimate receiver and the passive eavesdropper, as well as to quantify the additional load imposed by the security measures on the URA system. It is shown, based on both theoretical analysis and simulation results, that meaningful secrecy is achieved with only negligible extra overhead compared to the standard URA system.

DOI
10.48550/arxiv.2512.09104

Related papers

Metasource-Based Secret Key Generation via Low-Density Parity-Check Patterns

Quan Zhang, Yuli Yang, Jide Yuan +1 more

Recently, the concept of metasource-based secret key (MBSK) has been proposed for enhancing physical-layer security. In this paper, we propose a new approach of MBSK generation, via low-density parity-check (LDPC) patterns, where the parity-check matrix is varied and determined by the random channel gain of the legitimate link in each transmission. As there is no information on the legitimate channel gain delivered over the link between the legitimate transmitter and its desired receiver, eavesdroppers are unable to know which parity check matrix is being adopted in the legitimate LDPC encoding and, therefore, they fail to appropriately decode the confidential information protected by the MBSK via LDPC patterns. The security performance of our MBSK approach is evaluated in terms of the error rate difference between legitimate receivers and eavesdroppers. Illustrative simulation results substantiate that, even in the presence of powerful eavesdroppers possessing unlimited computing resources, our MBSK approach via LDPC patterns guarantees the physical-layer security without the aid of upper-layer encryption.

IEEE Wireless Communications and Networking Conference Workshops (WCNCW)•Apr 13, 2026•0 citations

Physical Layer Security for Channel-Aware Random Access With Opportunistic Jamming

Jinho Choi

We study the secure transmissions for channel-aware (CA) random access based on the notion of physical layer security in this paper, which might be suitable for machine type communications. Thanks to the availability of channel state information in CA random access, opportunistic jamming can be employed to improve the secrecy rate. As a result, a positive secrecy rate can be obtained even if the signal-to-noise ratio at an eavesdropper is higher than that at a legitimate receiver. Since a powerful eavesdropper equipped with multiple antennas can suppress the interference due to opportunistic jamming once jamming users are identified, it is important to know the number of received signals that allows Eve to identify them. Using the notion of unicity distance, we study this issue. Based on analysis, we find that it is necessary to keep the number of jamming users relatively small (compared with the number of ordinary active users) and use a fraction of the coherence time for secure transmissions when the coherence time is long.

IEEE Transactions on Information Forensics and Security•Jun 12, 2017•28 citations

Pragmatic Physical Layer Encryption for Achieving Perfect Secrecy

Suzhi Bi, Xiaojun Yuan, Ying–Jun Angela Zhang

Conventionally, secrecy is achieved using cryptographic techniques beyond the physical layer. Recent studies raise the interest of performing encryption within the physical layer by exploiting some unique features of the physical wireless channel. Following this spirit, we present a novel physical layer encryption (PLE) scheme that randomizes the radio signal using a secret key extracted from the wireless channel under the assumption of channel reciprocity. Specifically, we propose to jointly design the encryption function and the secret-key generation method. On one hand, we establish a sufficient and necessary condition for the encryption function to achieve perfect secrecy. Based on that, several candidate encryption functions are proposed and compared. We show that, given the secret key available to the legitimate users, perfect secrecy can be achieved without compromising the capability of the communication channel. On the other hand, we study the practical design of the secret-key generation method based on the channel reciprocity. We show that, by introducing marginal system overhead, the key agreement between the legitimate users can be done with a high success probability. The performance advantages of the proposed PLE method is verified through comparisons against other existing PLE methods.

arXiv:1210.5599•Oct 20, 2012•3 citations

Federated Learning Improves Metasource-Based Secret Key Generation with Low-Density Parity-Check Coding

Quan Zhang, Yuli Yang, Jide Yuan +1 more

This paper develops a novel metasource-based secret key (MBSK) generation scheme achieving physical-layer security in wireless communications. The core mechanism dynamically varies the low-density parity-check (LDPC) matrix for each transmission, using the random channel gain of the legitimate link as a driving parameter. Since eavesdroppers lack access to the legitimate channel state information (CSI), they cannot identify the specific LDPC matrix employed in the legitimate link, thus failing to successfully decode. In practice, however, the legitimate transmitter and receiver perform channel estimation independently. The estimation errors might result in a mismatch between the LDPC matrices used at each end. To address this challenge, we integrate a federated learning framework to enhance the accuracy and consistency of channel estimation. This approach minimizes the mismatch probability while ensuring that eavesdroppers remain ignorant of both the CSI and the corresponding LDPC matrix. Simulation results substantiate that, even against computationally unbounded eavesdroppers, the developed MBSK scheme robustly guarantees the physical-layer security without relying on higher-layer encryption mechanisms.

IEEE Conference on Computer Communications (INFOCOM)•May 18, 2026•0 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

Secure Signal Design for Co-located Legitimate and Eavesdropping Nodes

Hongliang He, Ce Zheng

Physical-layer security relies on the channel difference between the legitimate channel and the eavesdropper’s channel. However, when the eavesdropper and the legitimate receiver have the same location, it almost has the same channel as the legitimate receiver, which brings serious challenges to security. Target at this problem, we consider a two-user multiple access scenario and propose a new feedback-aided jamming scheme in this paper. Under the help of the legitimate receiver, the proposed scheme enables two users to transmit private information via multiple access, and guarantees interference-free at the destination by self-interference cancellation. However, even if the eavesdropper receives identical signals to the legitimate destination, its complete elimination of user interference and artificial noise remains elusive. We address the problem of maximizing the secrecy rate through power allocation and determine the optimal factor for achieving the maximum secrecy rate. Finally, the numerical results verify our theoretical analysis.

IEEE International Conference on Software System and Information Processing (ICSSIP)•Dec 1, 2025•0 citations
This work introduces security for unsourced random access (URA) via a physical-layer security approach. To achieve confidentiality, the proposed system opportunistically exploits intrinsic features of feedback-aided URA without altering its original structure or operational characteristics. As a result, the system preserves URA's efficiency, including low delay and minimal signaling overhead, while ensuring secure communication. To secure transmission, each user generates a secret key from a feedback signal broadcast by the BS in a previous transmission round, which depends on the BS-user channel and can thus be treated as private. Each user then encrypts its data using the secret key before transmission. Along with the encrypted data, only the parity bits of the LDPC-encoded key are transmitted, enabling secret key recovery at the legitimate receiver via Slepian-Wolf decoding with side information. We propose a receiver algorithm to recover both the encrypted data and the encoded secret key at the legitimate receiver. We further present a theoretical analysis to derive analytical error probabilities for both the legitimate receiver and the passive eavesdropper, as well as to quantify the additional load imposed by the security measures on the URA system. It is shown, based on both theoretical analysis and simulation results, that meaningful secrecy is achieved with only negligible extra overhead compared to the standard URA system.
Recently, the concept of metasource-based secret key (MBSK) has been proposed for enhancing physical-layer security. In this paper, we propose a new approach of MBSK generation, via low-density parity-check (LDPC) patterns, where the parity-check matrix is varied and determined by the random channel gain of the legitimate link in each transmission. As there is no information on the legitimate channel gain delivered over the link between the legitimate transmitter and its desired receiver, eavesdroppers are unable to know which parity check matrix is being adopted in the legitimate LDPC encoding and, therefore, they fail to appropriately decode the confidential information protected by the MBSK via LDPC patterns. The security performance of our MBSK approach is evaluated in terms of the error rate difference between legitimate receivers and eavesdroppers. Illustrative simulation results substantiate that, even in the presence of powerful eavesdroppers possessing unlimited computing resources, our MBSK approach via LDPC patterns guarantees the physical-layer security without the aid of upper-layer encryption.
We study the secure transmissions for channel-aware (CA) random access based on the notion of physical layer security in this paper, which might be suitable for machine type communications. Thanks to the availability of channel state information in CA random access, opportunistic jamming can be employed to improve the secrecy rate. As a result, a positive secrecy rate can be obtained even if the signal-to-noise ratio at an eavesdropper is higher than that at a legitimate receiver. Since a powerful eavesdropper equipped with multiple antennas can suppress the interference due to opportunistic jamming once jamming users are identified, it is important to know the number of received signals that allows Eve to identify them. Using the notion of unicity distance, we study this issue. Based on analysis, we find that it is necessary to keep the number of jamming users relatively small (compared with the number of ordinary active users) and use a fraction of the coherence time for secure transmissions when the coherence time is long.
Conventionally, secrecy is achieved using cryptographic techniques beyond the physical layer. Recent studies raise the interest of performing encryption within the physical layer by exploiting some unique features of the physical wireless channel. Following this spirit, we present a novel physical layer encryption (PLE) scheme that randomizes the radio signal using a secret key extracted from the wireless channel under the assumption of channel reciprocity. Specifically, we propose to jointly design the encryption function and the secret-key generation method. On one hand, we establish a sufficient and necessary condition for the encryption function to achieve perfect secrecy. Based on that, several candidate encryption functions are proposed and compared. We show that, given the secret key available to the legitimate users, perfect secrecy can be achieved without compromising the capability of the communication channel. On the other hand, we study the practical design of the secret-key generation method based on the channel reciprocity. We show that, by introducing marginal system overhead, the key agreement between the legitimate users can be done with a high success probability. The performance advantages of the proposed PLE method is verified through comparisons against other existing PLE methods.
This paper develops a novel metasource-based secret key (MBSK) generation scheme achieving physical-layer security in wireless communications. The core mechanism dynamically varies the low-density parity-check (LDPC) matrix for each transmission, using the random channel gain of the legitimate link as a driving parameter. Since eavesdroppers lack access to the legitimate channel state information (CSI), they cannot identify the specific LDPC matrix employed in the legitimate link, thus failing to successfully decode. In practice, however, the legitimate transmitter and receiver perform channel estimation independently. The estimation errors might result in a mismatch between the LDPC matrices used at each end. To address this challenge, we integrate a federated learning framework to enhance the accuracy and consistency of channel estimation. This approach minimizes the mismatch probability while ensuring that eavesdroppers remain ignorant of both the CSI and the corresponding LDPC matrix. Simulation results substantiate that, even against computationally unbounded eavesdroppers, the developed MBSK scheme robustly guarantees the physical-layer security without relying on higher-layer encryption mechanisms.
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 security relies on the channel difference between the legitimate channel and the eavesdropper’s channel. However, when the eavesdropper and the legitimate receiver have the same location, it almost has the same channel as the legitimate receiver, which brings serious challenges to security. Target at this problem, we consider a two-user multiple access scenario and propose a new feedback-aided jamming scheme in this paper. Under the help of the legitimate receiver, the proposed scheme enables two users to transmit private information via multiple access, and guarantees interference-free at the destination by self-interference cancellation. However, even if the eavesdropper receives identical signals to the legitimate destination, its complete elimination of user interference and artificial noise remains elusive. We address the problem of maximizing the secrecy rate through power allocation and determine the optimal factor for achieving the maximum secrecy rate. Finally, the numerical results verify our theoretical analysis.