arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2405.04072quant-phcs.CR
收藏

量子不可预测性

Quantum Unpredictability

Tomoyuki Morimae, Shogo Yamada, Takashi Yamakawa

AI总结:

本文提出量子不可预测状态生成器(UPSGs),证明其可实现PRFSs的所有已知应用(如IND-CPA加密和EUF-CMA MACs),表明量子不可预测性足以替代量子伪随机性。

摘要:

不可预测函数(UPFs)在经典密码学中扮演着重要角色,包括消息认证码(MACs)和数字签名。在本文中,我们引入了UPFs的量子类比,称之为不可预测状态生成器(UPSGs)。UPSGs可由伪随机函数类状态生成器(PRFSs)蕴含,后者是伪随机函数(PRFs)的量子类比,因此即使单向函数不存在,UPSGs也可能存在,类似于最近引入的其他原语,如伪随机状态生成器(PRSGs)、单向状态生成器(OWSGs)和EFIs。在经典密码学中,UPFs等价于PRFs,但在量子情形下,这种等价性并不明确,UPSGs可能弱于PRFSs。尽管如此,我们证明了PRFSs的所有已知应用也可由UPSGs实现,包括IND-CPA安全的私钥加密和具有不可克隆标签的EUF-CMA安全MACs。我们的研究结果表明,对于许多应用而言,量子不可预测性而非量子伪随机性就足够了。

英文摘要:

Unpredictable functions (UPFs) play essential roles in classical cryptography, including message authentication codes (MACs) and digital signatures. In this paper, we introduce a quantum analog of UPFs, which we call unpredictable state generators (UPSGs). UPSGs are implied by pseudorandom function-like states generators (PRFSs), which are a quantum analog of pseudorandom functions (PRFs), and therefore UPSGs could exist even if one-way functions do not exist, similar to other recently introduced primitives like pseudorandom state generators (PRSGs), one-way state generators (OWSGs), and EFIs. In classical cryptography, UPFs are equivalent to PRFs, but in the quantum case, the equivalence is not clear, and UPSGs could be weaker than PRFSs. Despite this, we demonstrate that all known applications of PRFSs are also achievable with UPSGs. They include IND-CPA-secure secret-key encryption and EUF-CMA-secure MACs with unclonable tags. Our findings suggest that, for many applications, quantum unpredictability, rather than quantum pseudorandomness, is sufficient.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑