2000 character limit reached
Unconditional Certified Randomness without Structure
Published 31 Aug 2026 in quant-ph and cs.CR | (2608.31112v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper.