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

Arthur-Merlin gamesgame theoryInteractive proof systemsNPsampling protocolsstatistical zero-knowledge

Mathematics Subject Classification ID

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

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

(41)

• The hunting of the SNARK
• Non-interactive proofs of proximity
• Transparent SNARKs from DARK compilers
• Succinct non-interactive arguments via linear interactive proofs
• Non-interactive batch arguments for NP from standard assumptions
• A logic of interactive proofs
• A PCP theorem for interactive proofs and applications
• Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
• Succinct arguments in the quantum random oracle model
• Statistical difference beyond the polarizing regime
• Lower bounds for non-black-box zero knowledge
• Interactive Coding for Interactive Proofs
• On the complexity of interactive proofs with bounded communication
• Encoding functions with constant online rate, or how to compress garbled circuit keys
• On the (in)security of SNARKs in the presence of oracles
• Interactive oracle proofs
• New limits to classical and quantum instance compression
• Polylogarithmic two-round argument systems
• scientific article; zbMATH DE number 1024045 (Why is no real title available?)
• scientific article; zbMATH DE number 1555928 (Why is no real title available?)
• scientific article; zbMATH DE number 1754603 (Why is no real title available?)
• A hierarchy theorem for interactive proofs of proximity
• ON HELPING AND INTERACTIVE PROOF SYSTEMS
• Constant-round interactive proofs for delegating computation
• Round complexity versus randomness complexity in interactive proofs
• On Emulating Interactive Proofs with Public Coins
• scientific article; zbMATH DE number 7250162 (Why is no real title available?)
• Predictable arguments of knowledge
• On interactive oracle proofs for Boolean R1CS statements
• Witness-succinct universally-composable SNARKs
• Succinct interactive oracle proofs: applications and limitations
• A toolbox for barriers on interactive oracle proofs
• Constant-round arguments from one-way functions
• Strong batching for non-interactive statistical zero-knowledge
• Constant-round arguments for batch-verification and bounded-space computations from one-way functions
• Rate-1 statistical non-interactive zero-knowledge
• On witness encryption and laconic zero-knowledge arguments
• Rate-1 zero-knowledge proofs from one-way functions
• Local proofs approaching the witness length
• Improved constant-sized polynomial commitment schemes without trusted setup
• Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge 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)