Revisiting asynchronous fault tolerant computation with optimal resilience

IF 1.3 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Distributed Computing Pub Date : 2022-02-03 DOI:10.1007/s00446-021-00416-4

Ittai Abraham, Danny Dolev, Gilad Stern

{"title":"Revisiting asynchronous fault tolerant computation with optimal resilience","authors":"Ittai Abraham, Danny Dolev, Gilad Stern","doi":"10.1007/s00446-021-00416-4","DOIUrl":null,"url":null,"abstract":"The celebrated result of Fischer, Lynch and Paterson is the fundamental lower bound for asynchronous fault tolerant computation: any 1-crash resilient asynchronous agreement protocol must have some (possibly measure zero) probability of not terminating. In 1994, Ben-Or, Kelmer and Rabin published a proof-sketch of a lesser known lower bound for asynchronous fault tolerant computation with optimal resilience in face of a Byzantine adversary: if \\(n\\le 4t\\) then any t-resilient asynchronous verifiable secret sharing protocol must have some non-zero probability of not terminating. Our main contribution is to revisit this lower bound and provide a rigorous and more general proof. Our second contribution is to show how to avoid this lower bound. We provide a protocol with optimal resilience that is almost surely terminating for a strong common coin functionality. Using this new primitive we provide an almost surely terminating protocol with optimal resilience for asynchronous Byzantine agreement that has a new fair validity property. To the best of our knowledge this is the first asynchronous Byzantine agreement with fair validity in the information theoretic setting.\n","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"34 1","pages":""},"PeriodicalIF":1.3000,"publicationDate":"2022-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Distributed Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00446-021-00416-4","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

Abstract

The celebrated result of Fischer, Lynch and Paterson is the fundamental lower bound for asynchronous fault tolerant computation: any 1-crash resilient asynchronous agreement protocol must have some (possibly measure zero) probability of not terminating. In 1994, Ben-Or, Kelmer and Rabin published a proof-sketch of a lesser known lower bound for asynchronous fault tolerant computation with optimal resilience in face of a Byzantine adversary: if \(n\le 4t\) then any t-resilient asynchronous verifiable secret sharing protocol must have some non-zero probability of not terminating. Our main contribution is to revisit this lower bound and provide a rigorous and more general proof. Our second contribution is to show how to avoid this lower bound. We provide a protocol with optimal resilience that is almost surely terminating for a strong common coin functionality. Using this new primitive we provide an almost surely terminating protocol with optimal resilience for asynchronous Byzantine agreement that has a new fair validity property. To the best of our knowledge this is the first asynchronous Byzantine agreement with fair validity in the information theoretic setting.

查看原文本刊更多论文

重新审视具有最优弹性的异步容错计算

Fischer、Lynch和Paterson的著名结果是异步容错计算的基本下界:任何具有1次崩溃弹性的异步协议协议都必须具有一些不终止的概率(可能是度量零)。1994年，Ben-Or, Kelmer和Rabin发表了一个鲜为人知的针对拜占庭对手的具有最佳弹性的异步容错计算下界的证明草图:如果\(n\le 4t\)，则任何t弹性异步可验证秘密共享协议必须具有不终止的非零概率。我们的主要贡献是重新审视这个下界，并提供一个严格和更一般的证明。我们的第二个贡献是展示了如何避免这个下界。我们提供了一个具有最佳弹性的协议，几乎可以肯定，它将终止强大的通用硬币功能。使用这个新的原语，我们为异步拜占庭协议提供了一个几乎肯定的终止协议，具有最佳的弹性，具有新的公平有效性属性。据我们所知，这是信息理论中第一个具有公平有效性的异步拜占庭协议。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Distributed Computing 工程技术-计算机：理论方法

CiteScore

3.20

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： 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.