发表机构
University of Kentucky; Virginia Tech（肯塔基大学; 弗吉尼亚理工大学）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
针对频谱接入管理中集中式模型不透明和区块链模型隐私开销大的问题，提出zkSAS零知识证明系统，以轻量恒定时间验证实现合规且保护隐私的动态频谱共享。
AI 中文摘要
通过频谱接入系统（SAS）实现的动态频谱接入（DSA）提升了频谱效率，然而现有的集中式模型面临分配逻辑不透明和缺乏独立可验证性的问题。尽管基于区块链的SAS架构默认提供透明性和可验证性，但它们引入了严重的隐私风险和过高的链上计算开销。我们提出了zkSAS，一个实用的零知识证明（ZKP）系统，旨在解决SAS部署中的可验证性和隐私缺口，并可直接应用于现有的CBRS SAS模型和基于区块链的SAS模型。该系统包含一套ZKP电路，涵盖分配约束有效性证明和移动列表有效性证明，分别用于验证信道分配和基于移动列表的既有用户保护措施是否符合监管约束，同时不泄露敏感用户数据。我们在集中式和基于区块链两种设置下对原型进行了全面评估，结果表明，虽然证明生成随频谱用户数量扩展，但验证保持轻量且恒定时间。我们设想zkSAS为安全、可验证的动态频谱共享提供了一条可扩展且实用的路径。
英文摘要
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.
CommentsAccepted for publication at the 2026 IEEE International Symposium on Spectrum Innovation (DySPAN), Washington, DC, USA, 2026
DOI：10.1109/DySPAN69846.2026.11571163
