4 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
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.
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...
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...
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.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
