Unconditional Certified Randomness without Structure
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 ...
Description / Details
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.
Source: arXiv:2608.31112v1 - http://arxiv.org/abs/2608.31112v1 PDF: https://arxiv.org/pdf/2608.31112v1 Original Link: http://arxiv.org/abs/2608.31112v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Sep 1, 2026
Computer Science
Cybersecurity
0