On interactive proofs with a laconic prover

DOI10.1007/S00037-002-0169-0MaRDI QIDQ1413647zbMATH OpenOpenAlexFDO

Authors Oded Goldreich, A. Wigderson, Salil Vadhan

Publication date 17 November 2003

Published in Computational Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00037-002-0169-0

zbMATH Keywords

game theoryNPArthur-Merlin gamesInteractive proof systemssampling protocolsstatistical zero-knowledge

Mathematics Subject Classification ID

Applications of game theory (91A80) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20)

Recommendations

• scientific article; zbMATH DE number 1754603
• On the complexity of interactive proofs with bounded communication
• scientific article; zbMATH DE number 4106274
• On the power of interaction
• scientific article; zbMATH DE number 66620

Cited in

(36)

• Interactive Coding for Interactive Proofs
• On Emulating Interactive Proofs with Public Coins
• Non-interactive proofs of proximity
• On the complexity of interactive proofs with bounded communication
• Succinct non-interactive arguments via linear interactive proofs
• A hierarchy theorem for interactive proofs of proximity
• Non-interactive batch arguments for NP from standard assumptions
• ON HELPING AND INTERACTIVE PROOF SYSTEMS
• Witness-succinct universally-composable SNARKs
• On the (in)security of SNARKs in the presence of oracles
• On interactive oracle proofs for Boolean R1CS statements
• Interactive oracle proofs
• A logic of interactive proofs
• 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
• Transparent SNARKs from DARK compilers
• Lower bounds for non-black-box zero knowledge
• Succinct arguments in the quantum random oracle model
• Strong batching for non-interactive statistical zero-knowledge
• New limits to classical and quantum instance compression
• Statistical difference beyond the polarizing regime
• Constant-round interactive proofs for delegating computation
• A PCP theorem for interactive proofs and applications
• 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
• scientific article; zbMATH DE number 1555928 (Why is no real title available?)
• The hunting of the SNARK
• Constant-round arguments for batch-verification and bounded-space computations from one-way functions
• 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?)
• Encoding functions with constant online rate, or how to compress garbled circuit keys
• Succinct interactive oracle proofs: applications and limitations
• A toolbox for barriers on interactive oracle proofs

This page was built for publication: On interactive proofs with a laconic prover

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