标题： 量子伪随机认证 显示英文标题

标题： Pseudorandom quantum authentication

摘要： 我们引入了伪随机量子认证方案（PQAS），这是一种高效的方法，用于加密量子态，且仅依赖于伪随机幺正算符（PRUs）的存在。 该方案保证，对于任何具有量子多项式时间（QPT）计算能力的窃听者来说，加密后的态与完全混合态不可区分。 此外，接收方可以验证态是否被篡改，并以渐近单位保真度恢复原始态。 我们的方案成本效益高，只需要多对数电路深度和一个共享密钥即可加密多项数量子态。 值得注意的是，即使没有量子安全的一次函数，PQAS也可能存在，它需要比语义经典密码学更弱的基本计算假设。 此外，PQAS对困扰基于QPT与哈达玛随机态不可区分性的协议的攻击具有安全性，例如选择明文攻击（CPA）以及揭示元信息（如量子资源）的攻击。 我们将泄露的元信息量与量子伪资源联系起来，赋予了这一概念实际意义。 作为一种应用，我们构建了重要的密码学原语，例如可验证的伪随机密度矩阵（VPRDM），这些矩阵在量子多项式时间内与随机混合态不可区分，但可以通过秘密密钥进行有效验证；还包括可验证的抗噪EFI对和单向态生成器（OWSG）。 我们的结果建立了一个新的量子信息处理范式，采用了更弱的计算假设。 显示英文摘要

摘要： We introduce the pseudorandom quantum authentication scheme (PQAS), an efficient method for encrypting quantum states that relies solely on the existence of pseudorandom unitaries (PRUs). The scheme guarantees that for any eavesdropper with quantum polynomial-time (QPT) computational power, the encrypted states are indistinguishable from the maximally mixed state. Furthermore, the receiver can verify that the state has not been tampered with and recover the original state with asymptotically unit fidelity. Our scheme is cost-effective, requiring only polylogarithmic circuit depth and a single shared key to encrypt a polynomial number of states. Notably, the PQAS can potentially exist even without quantum-secure one-way functions, requiring fundamentally weaker computational assumptions than semantic classical cryptography. Additionally, PQAS is secure against attacks that plague protocols based on QPT indistinguishability from Haar random states, such as chosen-plaintext attacks (CPAs) and attacks that reveal meta-information such as quantum resources. We relate the amount of meta-information that is leaked to quantum pseudoresources, giving the concept a practical meaning. As an application, we construct important cryptographic primitives, such as verifiable pseudorandom density matrices (VPRDMs), which are QPT-indistinguishable from random mixed states while being efficiently verifiable via a secret key, as well as verifiable noise-robust EFI pairs and one-way state generators (OWSGs). Our results establish a new paradigm of quantum information processing with weaker computational assumptions.