Metraipolis › archive › dc_7fd3cc711a3c
Certified Randomness with Optimal Rate — arXiv:2609.38945
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.38945
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T13:43:26.501Z
- SHA-256 of the archived text
781ec4554b6848cc29a6a3105c1b53b1bf24283c9f1ebafac2bf5dbfb0394682- Stable URL of this page
https://metraipolis.com/documento/dc_7fd3cc711a3c
How to cite
Certified Randomness with Optimal Rate — arXiv:2609.38945 — arXiv (en), https://arxiv.org/abs/2609.38945 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7fd3cc711a3c (Metraipolis archive dc_7fd3cc711a3c, sha256 781ec4554b6848cc29a6a3105c1b53b1bf24283c9f1ebafac2bf5dbfb0394682)
BibTeX
@misc{dc7fd3cc711a3c,
title = {Certified Randomness with Optimal Rate — arXiv:2609.38945},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.38945},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7fd3cc711a3c; sha256 781ec4554b6848cc29a6a3105c1b53b1bf24283c9f1ebafac2bf5dbfb0394682},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.38945. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The generation of certified random bits is an emerging near-term application of quantum computers. Potential applications, such as randomness beacons and CRS generation, require nearly uniform randomness, whose rate (the ratio of min-entropy to bitlength) is ~ 1. However, existing protocols for certified randomness either produce weakly random strings with rate o(1), or they require a trusted random seed. We show how to certify randomness with the optimal rate ~ 1 without requiring any trusted randomness from the verifier. Our protocol is secure unconditionally in the quantum random oracle model (QROM). This improves the result of Coladangelo et al., who certified weakly random strings unconditionally in the QROM, and answers a question posed by Aaronson and Hung. We also define and construct a proof of conditional min-entropy, which certifies optimal min-entropy even conditioned on an adversarially chosen transcript. We show an application of this primitive to randomness beacons, where each pulse should have high min-entropy conditioned on all previous messages. Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-10-01 in cs.CR). Categorie arXiv: Quantum Physics (quant-ph) ; Cryptography and Security (cs.CR). Pagina del lavoro: https://arxiv.org/abs/2609.38945 — 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-07T13:16:25.257Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).