This work defines and construct a proof of conditional min-entropy, which certifies optimal min-entropy even conditioned on an adversarially chosen transcript, and shows an application of this primitive to randomness beacons, where each pulse should have high min-entropy conditioned on all previous messages.
The security of the certifiable randomness protocol of Yamakawa-Zhandry unconditionally is proved, 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.
QLPs are introduced, a RAM-generalization of QOTPs that supports structured, stateful computation under bounded or policy-driven access and proves that one-shot programs generically imply query-limited programs, demonstrating that the strengthened unclonability guarantees of one-shot signatures translate into enhanced...
Jia-Hui Liu, Justin Raizes, Bhaskar Roberts et al.· 0 citations
A certified randomness protocol in the quantum random oracle model is obtained that proves unconditional security of this protocol against adversaries making subexponentially-many adaptive quantum queries to the random oracle.
A. Coladangelo, Dakshita Khurana, Saachi Mutreja et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.