Redundancy in distributed proofs

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 know...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Distributed computing Jg. 34; H. 2; S. 113 - 132
Hauptverfasser: Feuilloley, Laurent, Fraigniaud, Pierre, Hirvonen, Juho, Paz, Ami, Perry, Mor
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2021
Springer Nature B.V
Springer Verlag
Schlagworte:
Algorithms
Boolean algebra
Computer Communication Networks
Computer Hardware
Computer Science
Computer Systems Organization and Communication Networks
Data Structures and Algorithms
Distributed, Parallel, and Cluster Computing
Graph theory
Nodes
Redundancy
Software Engineering/Programming and Operating Systems
Theory of Computation
Distributed graph algorithms
Proof-labeling schemes
Space-time tradeoffs
Distributed verification
Nondeterminism
ISSN:0178-2770, 1432-0452
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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: a prover that assigns a certificate to each node, and a distributed algorithm called a verifier that 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 the size of the certificate stored at every node, and the number of rounds of the verification protocol.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0178-2770
1432-0452
DOI:10.1007/s00446-020-00386-z