On Emulating Interactive Proofs with Public Coins

DOI10.1007/978-3-030-43662-9_12OpenAlexW2574182697MaRDI QIDQ5098777

Maya Leshkowitz, Oded Goldreich

Publication date: 30 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-43662-9_12

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
• On interactive proofs with a laconic prover
• Algebraic methods for interactive proof systems
• IP = PSPACE
• The knowledge complexity of interactive proof-systems
• Computational Complexity

This page was built for publication: On Emulating Interactive Proofs with Public Coins