量子随机预言模型中账本认证器的披露前终局性
Finality Before Disclosure for Ledger Authenticators in the Quantum Random Oracle Model
AI总结：
本文在量子随机预言模型中引入账本认证器与$\textsf{LAEUF}$不可伪造性实验，推导资源边界并实例化提交-闭合-披露认证器，获多用户生命周期QROM边界。
AI中文摘要：
公共账本越来越多地利用先前交易、已终局状态、时间和排序而非仅公钥、消息和可移植签名来授权状态转换。我们引入账本认证器（ledger authenticator）与$\textsf{LAEUF}$，这是针对反应式授权协议的不可伪造性实验，其公开判断算法会读取已终局的记录。该模型将认证安全性与账本活性分离，并捕获典型的转换新鲜度、自适应腐败、包含前的暴露、审查和对抗性排序。我们确定了两个条件资源边界：满足我们单事件条件的认证器会产生上下文一次性签名；在可重绑定披露类中，安全性要求计算后披露非可接纳性。若前驱准入仅使用公开计算与账本调度，则该条件通过关闭有资格使用已披露凭证的证据来强制执行；若新构造的证据在披露后仍可接纳，则审查诚实披露会产生伪造。随后我们定义联合账本与量子随机预言执行模型，其中量子状态跨经典终局切口持续存在，且通过账本进行的预言评估会被计费。对于大小至多为$K$的闭合终局目标集，我们证明边界$3\beta_{\textsf{cut}}^2+3c_{\textsf{co}}KQ^2/2^\beta+6\beta/2^\beta$，其中$\beta_{\textsf{cut}}$对应切口处已存在的新鲜开启。提交、闭合、披露认证器实例化该框架并获得多用户生命周期QROM边界。
英文摘要：
Public ledgers increasingly authorize state transitions using prior transactions, finalized state, timing, and ordering rather than only a public key, message, and portable signature. We introduce ledger authenticators and $\LAEUF$, an unforgeability experiment for reactive authorization protocols whose public judgment algorithm reads a finalized transcript. The model separates authentication safety from ledger liveness and captures canonical transition freshness, adaptive corruption, exposure before inclusion, censorship, and adversarial ordering. We identify two conditional resource boundaries. An authenticator satisfying our single event conditions yields a contextual one-time signature. Within our rebindable reveal class, safety requires computational post-disclosure non-admissibility. When precursor admission uses only public computation and ledger scheduling, this condition is enforced by closing the evidence eligible to use a disclosed credential. If newly constructed evidence remains admissible after disclosure, censoring the honest reveal gives a forgery. We then define a joint ledger and quantum random oracle execution model in which quantum state persists across classical finalization cuts and oracle evaluations made through the ledger are charged. For a closed finalized target set of size at most $K$, we prove the bound $3β_{\mathsf{cut}}^2+3c_{\mathsf{co}}KQ^2/2^λ+6\ell/2^λ$, where $β_{\mathsf{cut}}$ accounts for fresh openings already present at the cut. A commit, close, reveal authenticator instantiates the framework and obtains a multi-user lifetime QROM bound.
