AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
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...
Quantum one-time programs (Broadbent, Gutoski and Stebila, CRYPTO 2013) or OTPs for short, enable a functionality to be encoded into a quantum token that can be evaluated on a single chosen input and then becomes unusable. While powerful, this primitive is inherently stateless and tied to a setting in which a quantum t...
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.