Proof labeling schemes

Amos Korman, Shay Kutten, David Peleg

Research output: Contribution to journalArticlepeer-review


This paper addresses the problem of locally verifying global properties. Several natural questions are studied, such as "how expensive is local verification?" and more specifically, "how expensive is local verification compared to computation?" A suitable model is introduced in which these questions are studied in terms of the number of bits a vertex needs to communicate. The model includes the definition of a proof labeling scheme (a pair of algorithmsone to assign the labels, and one to use them to verify that the global property holds). In addition, approaches are presented for the efficient construction of schemes, and upper and lower bounds are established on the bit complexity of schemes for multiple basic problems. The paper also studies the role and cost of unique identities in terms of impossibility and complexity, in the context of proof labeling schemes. Previous studies on related questions deal with distributed algorithms that simultaneously compute a configuration and verify that this configuration has a certain desired property. It turns out that this combined approach enables the verification to be less

Original languageEnglish
Pages (from-to)215-233
Number of pages19
JournalDistributed Computing
Issue number4
StatePublished - May 2010
Externally publishedYes


  • Distributed networks
  • Proof labels
  • Property verification
  • Self stabilization

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Computational Theory and Mathematics


Dive into the research topics of 'Proof labeling schemes'. Together they form a unique fingerprint.

Cite this