Unconditional Certified Randomness without Structure

2026-08-31

AI Summary

该研究提出了一种基于量子随机预言模型的无条件认证随机性协议，使用非交互式公开验证方法，并证明了其对次指数级量子查询的安全性。

Abstract

We obtain a certified randomness protocol in the quantum random oracle model. The protocol is non-interactive and publicly verifiable with a classical verifier, and is based on Yamakawa and Zhandry's proof of quantumness [JACM'24]. We prove unconditional security of this protocol against adversaries making subexponentially-many adaptive quantum queries to the random oracle. Prior work on certified randomness relative to a random oracle additionally assumed the Aaronson--Ambainis conjecture or proved security only against low query-depth adversaries.

Problem

• certified randomness
• quantum random oracle model
• unconditional security

Innovation

• unconditional security
• quantum random oracle model
• non-interactive
• publicly verifiable