arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2610.25518quant-ph
收藏

基于统计隐藏承诺的随机性认证

Randomness Certification from Statistically Hiding Commitments

The Center for Quantum Science and Technology, Weizmann Institute of Science(魏茨曼科学研究所量子科学与技术中心);School of Computer and Communication Sciences, EPFL(洛桑联邦理工学院计算机与通信科学学院)

Ilya Merkulov, Rotem Arnon

AI总结:

该研究基于计算贝尔不等式框架,利用后量子统计隐藏比特承诺,提出了一种针对量子侧信息的随机性认证协议,分离了随机性认证所需的密码属性与高效验证的额外结构。

摘要:

随机性认证旨在保证,不受信任的量子设备的输出包含真正的随机性,即使在对手持有量子侧信息的情况下,该随机性仍不可预测。对于与单个量子设备交互的经典验证者,这种保证不能依赖标准贝尔测试所基于的物理分离,而必须依赖于证明者的计算限制。基于计算贝尔不等式框架,我们区分了经典虚拟输入隐藏和量子虚拟输入隐藏,表明前者足以用于量子性证明,而后者则支持针对量子侧信息的随机性认证。我们的主要技术贡献是,针对由 Morimae 和 Yamakawa 提出的基于单向函数的量子性证明衍生的基于承诺的协议,建立量子虚拟输入隐藏。我们证明,统计隐藏性与针对量子多项式时间发送者的普通计算绑定性相结合就足够了,无需更强的量子绑定概念,如和绑定或坍缩绑定。这产生了一种基于后量子统计隐藏比特承诺的随机性认证协议。特别地,现有的基于后量子单向置换的此类承诺构造意味着后量子单向置换足以用于随机性认证。我们进一步使用量子安全陷门无爪函数实例化我们的构造,得到高效的经典验证者;并在量子随机预言模型中实例化,得到无需额外计算假设但验证者效率低下的随机性认证。这些实例化在我们基于承诺的框架内,将随机性认证所需的密码属性与高效验证所需的额外结构分离开来。

英文摘要:

Randomness certification aims to guarantee that the output of an untrusted quantum device contains genuine randomness that remains unpredictable even given quantum side information held by an adversary. For a classical verifier interacting with a single quantum device, such a guarantee cannot rely on the physical separation underlying standard Bell tests and must instead follow from computational restrictions on the prover. Building on the framework of computational Bell inequalities, we distinguish classical and quantum virtual-input hiding, showing that the former suffices for proofs of quantumness, whereas the latter enables randomness certification against quantum side information. Our main technical contribution is to establish quantum virtual-input hiding for a commitment-based protocol derived from an earlier proof of quantumness (Morimae and Yamakawa, CRYPTO, 2024). We show that statistical hiding together with ordinary computational binding against quantum polynomial-time senders suffices, without requiring stronger quantum binding notions such as sum-binding or collapse-binding. This yields a randomness-certification protocol from post-quantum statistically hiding bit commitments. We give three instantiations. The NOVY commitment from any post-quantum one-way permutation yields randomness certification in the standard model with an inefficient classical verifier. Post-quantum trapdoor claw-free functions additionally provide trapdoor inversion, enabling an efficient classical verifier. In the quantum random-oracle model, a hash-based commitment yields randomness certification without additional computational assumptions, again with an inefficient verifier. These instantiations separate the cryptographic properties sufficient for randomness certification from the additional structure required for efficient verification within our commitment-based framework.

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

↑