TY - GEN

T1 - Randomized proof-labeling schemes

AU - Baruch, Mor

AU - Fraigniaud, Pierre

AU - Patt-Shamir, Boaz

N1 - Publisher Copyright:
© Copyright 2015 ACM.

PY - 2015/7/21

Y1 - 2015/7/21

N2 - Proof-labeling schemes, introduced by Korman, Kutten and Peleg [PODC 2005], are a mechanism to certify that a network configuration satisfies a given boolean predicate. Such mechanisms find applications in many contexts, e.g., the design of fault-tolerant distributed algorithms. In a proof-labeling scheme, predicate verification consists of neighbors exchanging labels, whose contents depends on the predicate. In this paper, we introduce the notion of randomized proof-labeling schemes where messages are randomized and correctness is probabilistic. We show that randomization reduces label size exponentially while guaranteeing probability of correctness arbitrarily close to one. In addition, we present a novel label-size lower bound technique that applies to both deterministic and randomized proof-labeling schemes. Using this technique, we establish several tight bounds on the verification complexity of MST, acyclicity, connectivity, and longest cycle size.

AB - Proof-labeling schemes, introduced by Korman, Kutten and Peleg [PODC 2005], are a mechanism to certify that a network configuration satisfies a given boolean predicate. Such mechanisms find applications in many contexts, e.g., the design of fault-tolerant distributed algorithms. In a proof-labeling scheme, predicate verification consists of neighbors exchanging labels, whose contents depends on the predicate. In this paper, we introduce the notion of randomized proof-labeling schemes where messages are randomized and correctness is probabilistic. We show that randomization reduces label size exponentially while guaranteeing probability of correctness arbitrarily close to one. In addition, we present a novel label-size lower bound technique that applies to both deterministic and randomized proof-labeling schemes. Using this technique, we establish several tight bounds on the verification complexity of MST, acyclicity, connectivity, and longest cycle size.

KW - Communication complexity

KW - Distributed verfification

UR - http://www.scopus.com/inward/record.url?scp=84957659496&partnerID=8YFLogxK

U2 - 10.1145/2767386.2767421

DO - 10.1145/2767386.2767421

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84957659496

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 315

EP - 324

BT - PODC 2015 - Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing

T2 - ACM Symposium on Principles of Distributed Computing, PODC 2015

Y2 - 21 July 2015 through 23 July 2015

ER -