On the complexity of interactive proofs with bounded communication

Recommendations

Interactive proofs with approximately commuting provers
scientific article; zbMATH DE number 512803
scientific article; zbMATH DE number 176552
scientific article; zbMATH DE number 31277
On the communication complexity of zero-knowledge proofs
A PCP theorem for interactive proofs and applications
Interactive proof systems and alternating time-space complexity
scientific article; zbMATH DE number 176510
On interactive proofs with a laconic prover
The Knowledge Complexity of Interactive Proof Systems

Cites work

Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
Does co-NP have short interactive proofs ?
Minimum disclosure proofs of knowledge
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
Random generation of combinatorial structures from a uniform distribution
The knowledge complexity of interactive proof-systems
Uniform generation of NP-witnesses using an NP-oracle

Cited in

(37)

scientific article; zbMATH DE number 7563815 (Why is no real title available?)
Subquadratic SNARGs in the random oracle model
Non-interactive proofs of proximity
Succinct non-interactive arguments via linear interactive proofs
Non-interactive batch arguments for NP from standard assumptions
Interactive proof systems and alternating time-space complexity
Witness-succinct universally-composable SNARKs
On the (in)security of SNARKs in the presence of oracles
Doubly efficient interactive proofs over infinite and non-commutative rings
Impossibilities in succinct arguments: black-box extraction and more
Interactive oracle proofs
On interactive proofs with a laconic prover
Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
Predictable arguments of knowledge
A direct product theorem for two-party bounded-round public-coin communication complexity
On the P versus NP intersected with co-NP question in communication complexity
Uniform generation of NP-witnesses using an NP-oracle
Succinct arguments in the quantum random oracle model
Strong batching for non-interactive statistical zero-knowledge
Incrementally verifiable computation via incremental PCPs
Constant-round interactive proofs for delegating computation
scientific article; zbMATH DE number 7250162 (Why is no real title available?)
scientific article; zbMATH DE number 1024045 (Why is no real title available?)
Constant-round arguments from one-way functions
The hunting of the SNARK
On the virtue of succinct proofs
Constant-round arguments for batch-verification and bounded-space computations from one-way functions
On transformation of interactive proofs that preserve the prover's complexity
Round complexity versus randomness complexity in interactive proofs
Polylogarithmic two-round argument systems
scientific article; zbMATH DE number 1754603 (Why is no real title available?)
Interactive proofs and the hardness of approximating cliques
The complexity of the max word problem and the power of one-way interactive proof systems
Succinct interactive oracle proofs: applications and limitations
A toolbox for barriers on interactive oracle proofs
On succinct arguments and witness encryption from groups

This page was built for publication: On the complexity of interactive proofs with bounded communication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293359)