Unconditional Certified Randomness without Structure
2026-08-31 • Cryptography and Security
Cryptography and Security
AI summaryⓘ
The authors created a way to generate random numbers using quantum computers that anyone can check and verify easily without back-and-forth communication. Their method works even if a hacker tries many complex quantum queries to break it. This builds on previous work that only guaranteed security under extra assumptions or simpler hacking attempts. Essentially, they showed a stronger, more reliable way to prove randomness in quantum settings.
certified randomnessquantum random oracle modelnon-interactive protocolpublic verifiabilityquantum queriesAaronson–Ambainis conjectureproof of quantumnessquantum cryptographyadaptive attacks
Authors
Andrea Coladangelo, Dakshita Khurana, Saachi Mutreja, Bhaskar Roberts, Joseph Slote, Avishay Tal
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.