Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Merav Parter:

TR18-213 | 28th December 2018
Moni Naor, Merav Parter, Eylon Yogev

The Power of Distributed Verifiers in Interactive Proofs

Revisions: 1

We explore the power of interactive proofs with a distributed verifier. In this setting, the verifier consists of $n$ nodes and a graph $G$ that defines their communication pattern. The prover is a single entity that communicates with all nodes by short messages. The goal is to verify that the ... more >>>

ISSN 1433-8092 | Imprint