The Power of Distributed Verifiers in Interactive Proofs

SODA '20: ACM-SIAM Symposium on Discrete Algorithms Salt Lake City Utah January, 2020, pp. 1096-1115, 2020.

Cited by: 10|Bibtex|Views24|Links
EI

Abstract:

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 graph G belongs to some language in a small numbe...More

Code:

Data:

Your rating :
0

 

Tags
Comments