DOI: 10.48550/arxiv.1803.03031
View full text | Cite
Sign up to set email alerts

Abstract: Distributed proofs are mechanisms enabling the nodes of a network to collectively and efficiently check the correctness of Boolean predicates on the structure of the network (e.g. having a specific diameter), or on data-structures distributed over the nodes (e.g. a spanning tree). We consider well known mechanisms consisting of two components: a prover assigning a certificate to each node, and a distributed algorithm called verifier that is in charge of verifying the distributed proof formed by the collection … Show more

Help me understand this report

This publication either has no citations yet, or we are still processing them

Set email alert for when this publication receives citations?

See others like this or search for similar articles