Searcharxiv⌕ Search

arXiv · 2609.28699

zkSAS: Practical Zero-Knowledge Proofs for Verifiable Spectrum Access Management

Abstract

Dynamic Spectrum Access (DSA) through the Spectrum Access Systems (SAS) elevates spectral efficiency, yet existing centralized models face allocation logic opaqueness and a lack of independent verifiability. While blockchain-based SAS architectures offer transparency and verifiability by default, they introduce critical privacy risks and prohibitive on-chain computational overhead. We introduce zkSAS, a practical zero-knowledge proof (ZKP) system designed to address the verifiability and privacy gaps in SAS deployments, with direct applicability to both the existing CBRS SAS model and blockchain-based SAS models. The system features a suite of ZKP circuits, encompassing proofs of allocation constraint validity and proofs of move list validity to verify that channel assignments and move list-based incumbent protection measures, respectively, adhere to regulatory constraints without exposing sensitive user data. Comprehensive evaluation of our prototype in both centralized and blockchain-based settings indicates that while proof generation scales with spectrum user population, verification remains lightweight and constant-time. We envision that zkSAS offers a scalable and practical path to secure, verifiable dynamic spectrum sharing.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nishat F. Purbasha, Ifteher Alom, Eric W. Burger, Y. Thomas Hou, Wenjing Lou, Yang Xiao. 2026-09-23. zkSAS: Practical Zero-Knowledge Proofs for Verifiable Spectrum Access Management. https://doi.org/10.1109/dyspan69846.2026.11571163

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bitcoin: A Non-Continuous Time System

Bitcoin has no shared global clock. Each node sees the network from its own place and at its own time. The same block may arrive at different moments, and different blocks may briefly appear at the same historical position. Yet a common history still emerges. We describe this process as a non-continuous time system (NCTS), in which the protocol state $S_h=(C_h,U_h)$ is assigned the historical coordinate $τ(S_h)=h$. This coordinate does not measure how much physical time has passed. It marks where a state belongs in the history that later states can inherit. In this framework, history advances through accepted state transitions rather than through the passage of physical time. We examine three complementary aspects of this structure. At a fixed observation point, block arrivals occur at irregular physical intervals. Across monitors, the same block is observed at different physical times. Fork data further show that competing blocks may temporarily occupy the same historical height. Taken together, these observations support the distinction between physical observation time and the historical coordinate of the inherited state sequence. The inherited past becomes increasingly stable, while the next continuation remains open to permissionless competition. Bitcoin moves forward without a shared present by inheriting a shared past.

cs.CR↗

GoLeash: Mitigating Golang Software Supply Chain Attacks with Runtime Policy Enforcement

Modern software supply chain attacks consist of introducing new, malicious capabilities into trusted third-party software components, in order to propagate to a victim through a package dependency chain. These attacks are especially concerning for the Go language ecosystem, which is extensively used in critical cloud infrastructures. We present GoLeash, a novel system that applies the principle of least privilege at the package-level granularity, by enforcing distinct security policies for each package in the supply chain. This finer granularity enables GoLeash to detect malicious packages more precisely than traditional sandboxing that handles security policies at process- or container-level. Moreover, GoLeash remains effective under obfuscation, can overcome the limitations of static analysis, and incurs acceptable runtime overhead.

cs.CR↗

An Empirical Analysis of EOS Blockchain: Architecture, Contract, and Security

With the rapid development of blockchain technology, various blockchain systems are exhibiting vitality and potential. As a representative of Blockchain 3.0, the EOS blockchain has been regarded as a strong competitor to Ethereum. Nevertheless, compared with Bitcoin and Ethereum, academic research and in-depth analyses of EOS remain scarce. To address this gap, this study conducts a comprehensive investigation of the EOS blockchain from five key dimensions: system architecture, decentralization, performance, smart contracts, and behavioral security. The architectural analysis focuses on six core components of the EOS system, detailing their functionalities and operational workflows. The decentralization and performance evaluations, based on data from the XBlock data-sharing platform, reveal several critical issues: low account activity, limited participation in the supernode election process, minimal variation in the set of block producers, and a substantial gap between actual throughput and the claimed million-level performance. Five types of contract vulnerabilities are identified in the smart contract dimension, and four mainstream vulnerability detection platforms are introduced and comparatively analyzed. In terms of behavioral security, four real-world attacks targeting the structural characteristics of EOS are summarized. This study contributes to the ongoing development of the EOS blockchain and provides valuable insights for enhancing the security and regulatory mechanisms of blockchain ecosystems.

cs.CR↗