Redundancy in Distributed Proofs - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Redundancy in Distributed Proofs

(1) , (1, 2) , (1) , (1) , (3)


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.
Fichier principal
Vignette du fichier
tPLS-united_file.pdf (581.95 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01964771 , version 1 (23-12-2018)



Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry. Redundancy in Distributed Proofs. 32nd International Symposium on Distributed Computing, 2018, New Orleans, United States. ⟨10.4230/LIPIcs.DISC.2018.24⟩. ⟨hal-01964771⟩
42 View
36 Download



Gmail Facebook Twitter LinkedIn More