Skip to content

Author

Avishay Tal

We have 3 of 74 papers

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.

Aug 2026

Certified Randomness without Structure Against Shallow-Query Adversaries

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.

Dakshita Khurana, Bhaskar Roberts, Avishay Tal · 2 citations
Sep 2026

BQP ⊆ IP Does Not Relativize

It is shown that any prover-efficient classical interactive protocol for the BQP must rely on non-relativizing techniques, which might serve as a partial explanation for the lack of progress towards doubly-efficient, unconditionally sound classical verification of quantum computation.

Adam Bouland, Andrew Huang, Anand Natarajan et al. · 1 citation · ⚡1
Preprint Aug 2026

Unconditional Certified Randomness without Structure

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.