Succinct NP Proofs from an Extractability Assumption

We prove,using a non-standard complexity assumption , that any language inNP has a1-round (that is, the verifier sends a message to the prover, and the prover sends a message to the verifier) argument system (that is, a proof system where soundness holds against polynomial-time provers) with communication complexityonly polylogarithmic in the size of the NP… (More)