2018
DOI: 10.48550/arxiv.1803.03031
|View full text |Cite
Preprint
|
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

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 30 publications
(69 reference statements)
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?