Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > GAL ARNON:
All reports by Author Gal Arnon:

TR19-176 | 4th December 2019
Gal Arnon, Guy Rothblum

On Prover-Efficient Public-Coin Emulation of Interactive Proofs

Revisions: 1

A central question in the study of interactive proofs is the relationship between private-coin proofs, where the verifier is allowed to hide its randomness from the prover, and public-coin proofs, where the verifier's random coins are sent to the prover.

In this work, we study transformations ... more >>>




ISSN 1433-8092 | Imprint