DeepAI AI Chat
Log In Sign Up

Introduction to local certification

by   Laurent Feuilloley, et al.

Local certification is an concept that has been defined and studied recently by the distributed computing community. It is the following mechanism, known under various names such as distributed verification, distributed proof or proof-labeling scheme. The nodes of a graph want to decide collectively whether the graph has some given property, but they only know a local neighborhood, e.g. their neighbors in the graph. The nodes are then given a distributed proof that certifies that the graph has the property, and they have to collectively check that this proof is correct. We believe that local certification is a concept that anyone interested in algorithms or graphs could be interested in. This document is an introduction to this domain, that does not require any knowledge of distributed computing. It also contains a review of the recent works and a list of open problems.


page 1

page 2

page 3

page 4


Twenty-Two New Approximate Proof Labeling Schemes (Full Version)

Introduced by Korman, Kutten, and Peleg (Distributed Computing 2005), a ...

Note on distributed certification of minimum spanning trees

A distributed proof (also known as local certification, or proof-labelin...

Locally Restricted Proof Labeling Schemes (Full Version)

Introduced by Korman, Kutten, and Peleg (PODC 2005), a proof labeling sc...

Distributed Verifiers in PCP

Traditional proof systems involve a resource-bounded verifier communicat...

Verifier Theory and Unverifiability

Despite significant developments in Proof Theory, surprisingly little at...

Local verification of global proofs

In this work we study the cost of local and global proofs on distributed...

Reactive Proof Labeling Schemes for Distributed Decision

We generalize the definition of Proof Labeling Schemes to reactive syste...