Name
Abstract | ||
|---|---|---|
Distributed proofs are mechanisms that enable 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 objects distributed over the nodes (e.g., a spanning tree). We consider well known mechanisms consisting of two components: aproverthat assigns acertificateto each node, and a distributed algorithm called averifierthat is in charge of verifying the distributed proof formed by the collection of all certificates. We show that many network predicates have distributed proofs offering a high level of redundancy, explicitly or implicitly. We use this remarkable property of distributed proofs to establish perfect tradeoffs between thesize of the certificatestored at every node, and thenumber of roundsof the verification protocol. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/s00446-020-00386-z | DISTRIBUTED COMPUTING |
Keywords | DocType | Volume |
Distributed verification, Distributed graph algorithms, Proof-labeling schemes, Space-time tradeoffs, Nondeterminism | Journal | 34 |
Issue | ISSN | Citations |
2 | 0178-2770 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Laurent Feuilloley | 1 | 19 | 6.49 |
| Pierre Fraigniaud | 2 | 2849 | 220.78 |
| Juho Hirvonen | 3 | 106 | 11.81 |
| Ami Paz | 4 | 18 | 3.92 |
| Mor Perry | 5 | 0 | 1.01 |