Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry
{"title":"Redundancy in distributed proofs.","authors":"Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry","doi":"10.1007/s00446-020-00386-z","DOIUrl":null,"url":null,"abstract":"<p><p>Distributed proofs are mechanisms that enable 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 objects distributed over the nodes (e.g., a spanning tree). We consider well known mechanisms consisting of two components: a <i>prover</i> that assigns a <i>certificate</i> to each node, and a distributed algorithm called a <i>verifier</i> 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 <i>size of the certificate</i> stored at every node, and the <i>number of rounds</i> of the verification protocol.</p>","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"34 2","pages":"113-132"},"PeriodicalIF":1.3000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00446-020-00386-z","citationCount":"22","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Distributed Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00446-020-00386-z","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2020/10/7 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 22
Abstract
Distributed proofs are mechanisms that enable 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 objects 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 a 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.
期刊介绍：
The international journal Distributed Computing provides a forum for original and significant contributions to the theory, design, specification and implementation of distributed systems.
Topics covered by the journal include but are not limited to:
design and analysis of distributed algorithms;
multiprocessor and multi-core architectures and algorithms;
synchronization protocols and concurrent programming;
distributed operating systems and middleware;
fault-tolerance, reliability and availability;
architectures and protocols for communication networks and peer-to-peer systems;
security in distributed computing, cryptographic protocols;
mobile, sensor, and ad hoc networks;
internet applications;
concurrency theory;
specification, semantics, verification, and testing of distributed systems.
In general, only original papers will be considered. By virtue of submitting a manuscript to the journal, the authors attest that it has not been published or submitted simultaneously for publication elsewhere. However, papers previously presented in conference proceedings may be submitted in enhanced form. If a paper has appeared previously, in any form, the authors must clearly indicate this and provide an account of the differences between the previously appeared form and the submission.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
