查询受限的RAM程序及其应用
Query-Limited RAM Programs and their Applications
查看机构详情
- Fujitsu Research（富士通研究院）
- NTT Research（NTT研究所）
- Simons Institute for the Theory of Computing at UC Berkeley（加州大学伯克利分校西蒙斯理论计算研究所）
机构由 AI 辅助整理，请以论文原文为准。
浏览论文内容
中文总结 AI 辅助
本文提出查询受限RAM程序（QLP），将量子一次性计算扩展至有状态受控访问，并引入一次性程序统一签名与查询范式，实现图灵机令牌及可转让预算程序等新应用。
中文摘要 AI 辅助
量子一次性程序（Broadbent、Gutoski和Stebila，CRYPTO 2013），简称OTP，能够将一项功能编码到量子令牌中，该令牌可在单个选定输入上进行评估，之后便无法再使用。尽管这一原语功能强大，但它本质上是无状态的，并且局限于需要为电路的每次评估都签发和分发量子令牌的场景。这引出了一个自然的问题：一次性计算范式能否扩展到更丰富的、有状态的受控访问形式，并且这种扩展是否会带来超越标准OTP的固有优势？我们引入了查询受限的RAM程序（QLP），这是对量子一次性令牌程序（QOTP）的RAM泛化，支持在有界或策略驱动的访问下进行结构化、有状态的计算。QLP允许受控的评估序列，同时防止计算状态的对抗性分叉或回滚。这开启了超越无状态一次性程序的新应用，包括图灵机的量子令牌，其大小仅取决于代码长度（而非运行时间），可转让的k次或预算受限程序，以及在软件即服务等场景中用于委托计算的低通信机制。为了构建QLP，我们引入了一次性程序，将一次性签名（Amos、Georgiou、Kiayias和Zhandry，STOC 2020）与单次有效查询范式（Gupte、Liu、Raizes、Roberts和Vaikuntanathan，STOC 2025）统一起来。我们证明了一次性程序能一般性地蕴含查询受限程序，表明一次性签名增强的不可克隆性保证可转化为增强的功能性。在此过程中，我们通过通用构造阐明了签名令牌原语与量子一次性程序之间的关系，本质上表明一次性签名程序蕴含一次性通用计算。
英文摘要
Quantum one-time programs (Broadbent, Gutoski and Stebila, CRYPTO 2013) or OTPs for short, enable a functionality to be encoded into a quantum token that can be evaluated on a single chosen input and then becomes unusable. While powerful, this primitive is inherently stateless and tied to a setting in which a quantum token needs to be issued and distributed for every single evaluation of a circuit. This raises a natural question: can the one-time computation paradigm be extended to richer, stateful forms of controlled access, and would such an extension offer inherent advantages beyond standard OTPs? We introduce $\textit{query-limited RAM programs}$ (QLPs), a RAM-generalization of QOTPs that supports structured, stateful computation under bounded or policy-driven access. QLPs allow controlled sequences of evaluations while preventing adversarial forking or rollback of computational state. This enables new applications beyond stateless one-time programs, including quantum tokens for Turing Machines whose size depends only on $\textit{code length}$ (and not runtime), transferable $k$-time or budget-limited programs, and low-communication mechanisms for delegating computation in settings such as Software-as-a-Service. To construct QLPs, we introduce $\textit{one-shot programs}$, unifying one-shot signatures (Amos, Georgiou, Kiayias and Zhandry, STOC 2020) with the single effective query paradigm (Gupte, Liu, Raizes, Roberts and Vaikuntanathan, STOC 2025). We prove that one-shot programs generically imply query-limited programs, demonstrating that the strengthened unclonability guarantees of one-shot signatures translate into enhanced functionality. Along the way, we clarify the relationship between signature-token primitives and quantum one-time programs via generic constructions, essentially showing that one-time signing programs imply one-time general computation.
