TY - GEN
T1 - Redundancy in distributed proofs
AU - Feuilloley, Laurent
AU - Fraigniaud, Pierre
AU - Hirvonen, Juho
AU - Paz, Ami
AU - Perry, Mor
N1 - Publisher Copyright:
© Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, and Mor Perry.
PY - 2018/10/1
Y1 - 2018/10/1
N2 - 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 that assigns a certificate to each node, and a distributed algorithm called 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.
AB - 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 that assigns a certificate to each node, and a distributed algorithm called 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.
KW - And phrases Distributed verification
KW - Distributed graph algorithms
KW - Non-determinism
KW - Proof-labeling schemes
KW - Space-time tradeoffs
UR - http://www.scopus.com/inward/record.url?scp=85059605425&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.DISC.2018.24
DO - 10.4230/LIPIcs.DISC.2018.24
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:85059605425
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 32nd International Symposium on Distributed Computing, DISC 2018
A2 - Schmid, Ulrich
A2 - Widder, Josef
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 32nd International Symposium on Distributed Computing, DISC 2018
Y2 - 15 October 2018 through 19 October 2018
ER -