Table of Contents
Fetching ...

SURA: Secure Unsourced Random Access

Mohammad Javad Ahmadi, Rafael F. Schaefer, H. Vincent Poor

TL;DR

This work presents SURA, a secure unsourced random access scheme that harnesses downlink feedback to generate per-user secret keys and artificial-noise masking, enabling encryption and confidentiality without modifying URA's structure. Data is encrypted with a key derived from private feedback, while only the parity bits of the LDPC key are transmitted to support reconciliation, and the parity is masked to hinder eavesdroppers. A complete transmitter/receiver design is developed, along with a leakage analysis that bounds information leaked to an eavesdropper. Numerical results validate meaningful secrecy with minimal overhead, highlighting SURA’s potential for secure, low-latency URA in large-scale networks.

Abstract

This work introduces security for unsourced random access (URA) by employing wiretap-inspired physical layer techniques. To achieve confidentiality, the proposed system opportunistically exploits intrinsic features of feedback-aided URA without adding any overhead or altering its original structure or operational characteristics. As a result, the proposed system preserves the low-cost advantages of URA, including low delay and minimal signaling overhead, while providing secure communication. To secure transmission, each user generates a secret key and an artificial noise sequence from the feedback signal that the BS broadcasts in previous transmission rounds. This feedback depends on the BS-user channel, making it a private signal for each user. The secure transmission is performed by three actions: encrypting the data using the secret key, sending only the parity bits of the LDPC encoded secret key to allow the legitimate receiver to recover it, and masking these parity bits with the artificial noise. For reception, a receiver algorithm is designed for the legitimate user, and a leakage analysis is provided to quantify the information available to the eavesdropper. The simulation results show that meaningful secrecy is achieved in URA without modifying its structure and with negligible impact on standard performance.

SURA: Secure Unsourced Random Access

TL;DR

This work presents SURA, a secure unsourced random access scheme that harnesses downlink feedback to generate per-user secret keys and artificial-noise masking, enabling encryption and confidentiality without modifying URA's structure. Data is encrypted with a key derived from private feedback, while only the parity bits of the LDPC key are transmitted to support reconciliation, and the parity is masked to hinder eavesdroppers. A complete transmitter/receiver design is developed, along with a leakage analysis that bounds information leaked to an eavesdropper. Numerical results validate meaningful secrecy with minimal overhead, highlighting SURA’s potential for secure, low-latency URA in large-scale networks.

Abstract

This work introduces security for unsourced random access (URA) by employing wiretap-inspired physical layer techniques. To achieve confidentiality, the proposed system opportunistically exploits intrinsic features of feedback-aided URA without adding any overhead or altering its original structure or operational characteristics. As a result, the proposed system preserves the low-cost advantages of URA, including low delay and minimal signaling overhead, while providing secure communication. To secure transmission, each user generates a secret key and an artificial noise sequence from the feedback signal that the BS broadcasts in previous transmission rounds. This feedback depends on the BS-user channel, making it a private signal for each user. The secure transmission is performed by three actions: encrypting the data using the secret key, sending only the parity bits of the LDPC encoded secret key to allow the legitimate receiver to recover it, and masking these parity bits with the artificial noise. For reception, a receiver algorithm is designed for the legitimate user, and a leakage analysis is provided to quantify the information available to the eavesdropper. The simulation results show that meaningful secrecy is achieved in URA without modifying its structure and with negligible impact on standard performance.

Paper Structure

This paper contains 13 sections, 45 equations, 1 figure, 2 algorithms.

Figures (1)

  • Figure 1: PUPE versus normalized equivocation rate for $K_a \in \{1,25,50,75,100\}$, and $P_a/P_k \in \{1,2,3,5,7\}$ are shown.