Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 22 min ago
PreprintCC BY 4.0arXiv

Unconditional Certified Randomness without Structure

  • Andrea Coladangelo
  • Dakshita Khurana
  • Saachi Mutreja
  • Bhaskar Roberts
  • Joseph Slote
  • Avishay Tal
Open at sourcePDFDOICite

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.

Related

  1. Randomness can be certified in energy-constrained semi-device-independent scenarios
    Shashank Kumar Ranu, Lewis Wooltorton, Alastair A. Abbott +1
    HALPreprintLicence not statedQuantum physics & quantum informationHAL
  2. Metasurface quantum graphs for polarization-independent certified randomness
    Xing Lin, Wenwen Liu, Wange Song +2
    arXivPreprintarXiv licenceFull textOptics & photonicsQuantum physics & quantum informationarXiv
  3. Certified Randomness with Optimal Rate
    Siddhartha Jain, Saachi Mutreja, Bhaskar Roberts
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  4. Certified Randomness Generation against Quantum Adversaries via Energy Constraints
    Thomas A. Hahn, Efrat Gerchkovitz, Ester Yehuda +1
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  5. Tight Query Lower Bounds for Quantum Sampling, with an Application to Certified Randomness
    Keshav Bhateja, Mehdi Esmaili, Atul Mantri
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv

Cite

BibTeXRIS
BibTeX
@misc{coladangelo2026unconditional,
  title = {{Unconditional Certified Randomness without Structure}},
  author = {Andrea Coladangelo and Dakshita Khurana and Saachi Mutreja and Bhaskar Roberts and Joseph Slote and Avishay Tal},
  howpublished = {arXiv},
  year = {2026},
  month = aug,
  doi = {10.48550/arxiv.2608.31112},
  eprint = {2608.31112},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2608.31112},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Unconditional Certified Randomness without Structure
AU  - Andrea Coladangelo
AU  - Dakshita Khurana
AU  - Saachi Mutreja
AU  - Bhaskar Roberts
AU  - Joseph Slote
AU  - Avishay Tal
PY  - 2026
DA  - 2026/08/31
PB  - arXiv
DO  - 10.48550/arxiv.2608.31112
UR  - https://arxiv.org/abs/2608.31112
AB  - 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.
ER  -