Issue Downloads
Skip Table Of Content Section
INVITED ARTICLE: Distributed Computing
research-article
SECTION: Complexity Theory
research-article
Local Proofs Approaching the Witness Length
Interactive oracle proofs (IOPs) are a hybrid between interactive proofs and PCPs. In an IOP, the prover is allowed to interact with a verifier (like in an interactive proof) by sending relatively long messages to the verifier, who in turn is only allowed ...
SECTION: Quantum Complexity and Quantum Cryptography
research-article
Verifiable Quantum Advantage without Structure
We show the following hold, unconditionally unless otherwise stated, relative to a random oracle:
- There are NP search problems solvable by quantum polynomial-time (QPT) machines but not classical probabilistic polynomial-time (PPT) machines.
- There ...
SECTION: Algebraic Complexity
research-article
SECTION: Cryptography, Cryptoanalysis