Metraipolis › archive › dc_d0dfdad3672d
Certified Randomness without Structure Against Shallow-Query Adversaries — arXiv:2608.24832
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.24832
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T06:30:47.416Z
- SHA-256 of the archived text
a52d19955a76bb68fe14b53f9d51ee8ce349397332a56d7513cf3e3d597b9fdb- Stable URL of this page
https://metraipolis.com/documento/dc_d0dfdad3672d
How to cite
Certified Randomness without Structure Against Shallow-Query Adversaries — arXiv:2608.24832 — arXiv (en), https://arxiv.org/abs/2608.24832 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d0dfdad3672d (Metraipolis archive dc_d0dfdad3672d, sha256 a52d19955a76bb68fe14b53f9d51ee8ce349397332a56d7513cf3e3d597b9fdb)
BibTeX
@misc{dcd0dfdad3672d,
title = {Certified Randomness without Structure Against Shallow-Query Adversaries — arXiv:2608.24832},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.24832},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d0dfdad3672d; sha256 a52d19955a76bb68fe14b53f9d51ee8ce349397332a56d7513cf3e3d597b9fdb},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.24832. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In a recent breakthrough, Yamakawa and Zhandry (J. ACM 2024) constructed a proof of quantumness in the quantum random oracle model (QROM) in which the quantum prover samples a codeword preimage of a publicly computable function H. They conjectured that given any H, a successful prover must sample their preimage from a high-entropy distribution over possible answers. If true, this would give a certifiable randomness protocol in the quantum random oracle model. As partial evidence for their conjecture, Yamakawa and Zhandry proved the security of their certifiable randomness protocol assuming the Aaronson-Ambainis conjecture. We prove the security of the certifiable randomness protocol of Yamakawa-Zhandry unconditionally, without relying on the unproven Aaronson-Ambainis conjecture, against low query-depth quantum adversaries: specifically, adversaries that make up to o(\log \lambda) adaptive quantum queries to the random oracle. Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-08-26 in cs.CR). Categorie arXiv: Quantum Physics (quant-ph) ; Cryptography and Security (cs.CR). Pagina del lavoro: https://arxiv.org/abs/2608.24832 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-18T06:27:46.700Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-08-26?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).