On the complexity of interactive proofs with bounded communication

On Interactive Proofs with a Laconic Prover

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,

On interactive proofs with a laconic prover

Computational Complexity

Foundations of cryptography: a primer

Foundations and Trends® in Theoretical Computer Science

Zero-knowledge from secure multiparty computation

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing

Separating succinct non-interactive arguments from all falsifiable assumptions

Proceedings of the forty-third annual ACM symposium on Theory of computing

From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again

Proceedings of the 3rd Innovations in Theoretical Computer Science Conference

On round-efficient argument systems

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Finding pessiland

TCC'06 Proceedings of the Third conference on Theory of Cryptography

On the power of many one-bit provers

Proceedings of the 4th conference on Innovations in Theoretical Computer Science

Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract

Proceedings of the 4th conference on Innovations in Theoretical Computer Science

Succinct non-interactive arguments via linear interactive proofs

TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography

Recursive composition and bootstrapping for SNARKS and proof-carrying data

Proceedings of the forty-fifth annual ACM symposium on Theory of computing