QPADL: Post-Quantum Private Spectrum Access with Verified Location and DoS Resilience

1. Problem Statement

The paper addresses critical security and privacy gaps in Spectrum Access Systems (SAS), which are essential for managing spectrum scarcity in Cognitive Radio Networks (CRNs). Current SAS implementations face four converging threats:

• Privacy & Anonymity Leakage: Regulations (e.g., FCC) require users to disclose precise location coordinates and transmission parameters to centralized databases. This exposes users to identity tracing, behavioral profiling, and location-based attacks.
• Location Spoofing: Malicious users can falsify their location to access spectrum in restricted areas or cause interference, as existing verification methods often rely on trusted infrastructure that is unavailable in rural or dynamic settings.
• Denial-of-Service (DoS) Vulnerability: The reliance on centralized databases makes SAS susceptible to DoS attacks where adversaries flood the system with illegitimate requests, exhausting computational resources.
• Quantum Threats: The rise of quantum computing threatens the classical cryptographic primitives (e.g., RSA, ECC) currently used to protect SAS, potentially allowing adversaries to break encryption, forge signatures, and compromise long-term privacy.

Existing solutions typically address these issues in isolation (e.g., only privacy or only DoS) and lack a unified framework that is secure against quantum adversaries while maintaining regulatory compliance.

2. Methodology: The QPADL Framework

The authors propose QPADL, the first Post-Quantum (PQ) secure framework that simultaneously ensures location privacy, anonymity, location verification, and DoS resilience. The system operates within a regulated SAS architecture involving a Spectrum Regulator (e.g., FCC), Private Spectrum Databases (PSDs), Clients (Secondary Users), and Access Points (APs).

Core Architectural Components:

1. PQ-Secure Anonymity (PQ-Tor):

   • QPADL employs a Post-Quantum variant of the Tor network.
   • It replaces vulnerable components with NIST-standardized algorithms: ML-KEM (Module-Lattice Key Encapsulation Mechanism) for key exchange and ML-DSA (Module-Lattice Digital Signature Algorithm) for signatures.
   • This ensures communication anonymity and unlinkability even against quantum-capable adversaries.

2. Private Spectrum Query (Multi-Server PIR):

   • To protect the user's queried location index, QPADL uses Private Information Retrieval (PIR) across multiple non-colluding PSDs.
   • Three instantiations are proposed to trade off between efficiency, robustness, and communication cost:
     • QPADL-ENS: Efficient, Information-Theoretic (IT) secure PIR assuming honest non-colluding servers.
     • QPADL-FTR: Fault-tolerant and Byzantine-robust PIR using Shamir's Secret Sharing and error-correcting codes.
     • QPADL-OOP: Optimized for large-scale deployment using Online-Offline Preprocessing (CIP-PIR), shifting heavy computation to an offline phase to minimize online latency.

3. Proximity-Backed Location Verification (PoL):

   • To prevent spoofing without a trusted central server, QPADL leverages existing WiFi/Cellular Access Points (APs).
   • Mechanism: The client requests a "Proof of Location" (PoL) from a nearby AP. The AP verifies the client's proximity via signal strength (RSS) and Round-Trip Time (RTT).
   • Cryptography: The AP signs the client's location commitment using Event-Oriented Linkable Ring Signatures (LRS).
     • Anonymity: The signature proves the client is in the ring of APs without revealing which specific AP signed it.
     • Linkability: The signature includes an Event ID (time window + beacon), allowing the system to detect if a user reuses a proof within the same window (preventing replay attacks) while preserving anonymity across different windows.

4. DoS Resilience (Client Puzzles & Rate Limiting):

   • QPADL integrates Client Puzzle Protocols (CPPs) to throttle malicious requests.
   • Puzzle Generation: PSDs pre-generate and sign puzzles (either Hash-based or Lattice-based) embedded in the spectrum database.
   • Two PoW Schemes:
     • QPADL-HCT (Hashcash Tree): A hash-based tree structure resistant to parallel brute-force attacks, suitable for diverse user devices.
     • QPADL-LBP (Lattice-Based PoW): A lattice-based puzzle (Shortest Vector Problem) offering quantum-resistant security for the puzzle itself.
   • Rate Limiting: The linkability of the LRS proof ensures that a user can only obtain one valid puzzle per time window, preventing massive request flooding.

3. Key Contributions

• First Unified PQ Framework: QPADL is the first system to jointly address location privacy, anonymity, spoofing resistance, and DoS resilience under post-quantum security assumptions.
• Novel Location Verification: Introduces the first use of Event-Oriented Linkable Ring Signatures (LRS) for wireless location proofs, eliminating the need for dedicated trusted infrastructure while preventing spoofing and replay attacks.
• Scalable Instantiations: Proposes three distinct PIR instantiations (ENS, FTR, OOP) and two PoW instantiations (HCT, LBP), allowing system administrators to tune the framework for specific security and performance requirements.
• Hardware Acceleration: Demonstrates the practicality of PIR in large-scale SAS by implementing GPU parallelization for database queries and puzzle generation, significantly reducing server-side latency.
• Regulatory Compliance: The framework is designed to adhere to FCC regulations (e.g., CBRS) while protecting user data, proving that privacy and regulation are not mutually exclusive.

4. Experimental Results

The authors conducted extensive analytical and empirical evaluations on a standard desktop with an NVIDIA GTX 3060 GPU.

• Performance & Scalability:
  • GPU Acceleration: GPU implementation provided significant speedups over CPU-only versions.
    • QPADL-ENS: 2.77× speedup on PSD side; 4.18× end-to-end delay reduction.
    • QPADL-FTR: 4.88× speedup on PSD side; 11.49× end-to-end delay reduction.
    • QPADL-OOP: 1.71× speedup on PSD side; 1.68× end-to-end delay reduction.
  • Latency: For a database size of $2^{16}$ entries and $2^{10}$ concurrent users, the online server cost for QPADL-OOP was 110.84 ms, compared to 323.85 ms for QPADL-ENS and 2144.63 ms for QPADL-FTR.
• Communication Overhead:
  • The framework maintains low communication overhead. Retrieved blocks are under 50 KB, and PQ-Tor communication delay is bounded at ~175 ms (circuit build time ~300 ms).
  • This is significantly lower than prior works (e.g., Trust-SAS at 1.25 MB, PACDoSQ at 605 KB).
• Location Proof Efficiency:
  • Generating a PQ-secure PoL takes 33.34 ms on the client and 49.37 ms on the AP (total ~82 ms), which is faster than existing classical solutions (e.g., 210 ms - 430 ms in related works).
• Security:
  • Formal proofs confirm resistance against QPT (Quantum Probabilistic Polynomial-Time) adversaries for all components (PIR, Tor, LRS, ML-DSA, and PoW).

5. Significance

QPADL represents a paradigm shift in securing wireless spectrum access. Its significance lies in:

1. Future-Proofing: It proactively addresses the "harvest now, decrypt later" threat by migrating SAS to Post-Quantum Cryptography.
2. Holistic Security: It breaks the silo of existing research by solving privacy, anonymity, and availability simultaneously, rather than treating them as separate problems.
3. Practicality: By leveraging existing infrastructure (WiFi APs) and optimizing for hardware acceleration (GPUs), QPADL moves theoretical privacy concepts into a deployable, large-scale reality.
4. Regulatory Viability: It demonstrates that strict location verification (required by regulators) can be achieved without compromising user anonymity, offering a blueprint for next-generation spectrum management.

In conclusion, QPADL provides a robust, scalable, and quantum-resistant architecture for Spectrum Access Systems, ensuring that the transition to 6G and beyond remains secure, private, and resilient against both classical and quantum threats.