Browsing FAS Scholarly Articles by Keyword "Arhtur-Merlin games"
Now showing items 1-1 of 1
-
On Transformations of Interactive Proofs that Preserve the Prover's Complexity
(Association for Computing Machinery, 2000)Goldwasser and Sipser [GS89] proved that every interactive proof system can be transformed into a public-coin one (a.k.a., an Arthur-Merlin game). Their transformation has the drawback that the computational complexity of ...