On interactive proofs with a laconic prover
From MaRDI portal
Publication:1413647
DOI10.1007/s00037-002-0169-0zbMath1053.68045OpenAlexW2038202352MaRDI QIDQ1413647
Oded Goldreich, Avi Wigderson, Salil P. 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
game theoryNPArthur-Merlin gamesInteractive proof systemssampling protocolsstatistical zero-knowledge
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)
Related Items
Succinct non-interactive arguments via linear interactive proofs, New Limits to Classical and Quantum Instance Compression, Non-interactive batch arguments for NP from standard assumptions, A Hierarchy Theorem for Interactive Proofs of Proximity, On the (In)Security of SNARKs in the Presence of Oracles, Interactive Oracle 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, On Emulating Interactive Proofs with Public Coins, Witness-succinct universally-composable SNARKs, Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys, Succinct interactive oracle proofs: applications and limitations, Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs, A toolbox for barriers on interactive oracle proofs, The hunting of the SNARK, Unnamed Item, Non-interactive proofs of proximity, Predictable Arguments of Knowledge, Lower bounds for non-black-box zero knowledge, Polylogarithmic two-round argument systems, Transparent SNARKs from DARK compilers, Unnamed Item, Constant-Round Interactive Proofs for Delegating Computation
