Local Verification of Global Proofs

Loading...
Thumbnail Image
Journal Title
Journal ISSN
Volume Title
Conference article in proceedings
This publication is imported from Aalto University research portal.
View publication in the Research portal
View/Open full text file from the Research portal
Date
2018-10-01
Major/Subject
Mcode
Degree programme
Language
en
Pages
17
1-17
Series
32nd International Symposium on Distributed Computing (DISC 2018), Leibniz International Proceedings in Informatics (LIPIcs), Volume 121
Abstract
In this work we study the cost of local and global proofs on distributed verification. In this setting the nodes of a distributed system are provided with a nondeterministic proof for the correctness of the state of the system, and the nodes need to verify this proof by looking at only their local neighborhood in the system. Previous works have studied the model where each node is given its own, possibly unique, part of the proof as input. The cost of a proof is the maximum size of an individual label. We compare this model to a model where each node has access to the same global proof, and the cost is the size of this global proof. It is easy to see that a global proof can always include all of the local proofs, and every local proof can be a copy of the global proof. We show that there exists properties that exhibit these relative proof sizes, and also properties that are somewhere in between. In addition, we introduce a new lower bound technique and use it to prove a tight lower bound on the complexity of reversing distributed decision and establish a link between communication complexity and distributed proof complexity.
Description
Keywords
proof-labeling schemes, distributed verification, non-determinism, local proofs
Other note
Citation
Feuilloley, L & Hirvonen, J 2018, Local Verification of Global Proofs . in U Schmid & J Hirvonen (eds), 32nd International Symposium on Distributed Computing (DISC 2018) . Leibniz International Proceedings in Informatics (LIPIcs), vol. 121, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, pp. 1-17, International Symposium on Distributed Computing, New Orleans, Louisiana, United States, 15/10/2018 . https://doi.org/10.4230/LIPIcs.DISC.2018.25