HAL CCSD
Redundancy in distributed proofs
Feuilloley, Laurent
Fraigniaud, Pierre
Hirvonen, Juho
Paz, Ami
Perry, Mor
Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)) ; Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité)
International audience
ISSN: 0178-2770
EISSN: 1432-0452
Distributed Computing
Springer Verlag
hal-03872299
https://cnrs.hal.science/hal-03872299
https://cnrs.hal.science/hal-03872299
Distributed Computing, 2021, 34 (2), pp.113-132. ⟨10.1007/s00446-020-00386-z⟩
DOI: 10.1007/s00446-020-00386-z
info:eu-repo/semantics/altIdentifier/doi/10.1007/s00446-020-00386-z
en
[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
[INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
info:eu-repo/semantics/article
Journal articles
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: 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.
2021-04