From consensus to atomic broadcast Time-free byzantine-resistant protocols without signatur.pdfVIP

下载本文档

3
0
约5.5万字
约 22页
2017-04-13 发布于江苏
举报
版权申诉

From consensus to atomic broadcast Time-free byzantine-resistant protocols without signatur.pdf

1、有哪些信誉好的足球投注网站（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

From consensus to atomic broadcast Time-free byzantine-resistant protocols without signatur

From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without Signatures Miguel Correia, Nuno Ferreira Neves, Paulo Ver??ssimo DI–FCUL TR–04–5 June 2004 Departamento de Informa?tica Faculdade de Cie?ncias da Universidade de Lisboa Campo Grande, 1749–016 Lisboa Portugal Technical reports are available at http://www.di.fc.ul.pt/tech-reports. The files are stored in PDF, with the report number as filename. Alternatively, reports are available by post from the above address. From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without Signatures ? Miguel Correia Nuno Ferreira Neves Paulo Ver??ssimo Faculdade de Cie?ncias da Universidade de Lisboa Bloco C6, Piso 3, Campo Grande, 1749-016 Lisboa - Portugal {mpc,nuno,pjv}@di.fc.ul.pt Keywords: consensus, atomic broadcast, asynchronous systems, Byzantine faults, intrusion tolerance, randomization Abstract This paper proposes a hierarchy of three Byzantine-resistant protocols aimed to be used in practical distributed systems: multi-valued consensus, vector consensus and atomic broadcast. These protocols are designed as successive transformations from one to another. The first protocol, multi-valued consensus, is implemented on top of a randomized binary consensus. The protocols share a set of important structural properties. Firstly, they do not use signatures obtained with public-key cryptography, a well-known per- formance bottleneck in this kind of protocols. Secondly, they are time-free, i.e., they make no synchrony assumptions, since these assumptions are often vulnerable to subtle but effective attacks. Thirdly, they have no leaders, thus avoiding the cost of detecting corrupt processes. Fourthly, they have optimal resilience, i.e., they tolerate f = bn?13 c out of a total of n processes. The multi-valued consensus protocol terminates in a constant expected number of rounds, while the vector consensus and atomic broadcast protocols have time complexities O(f). 1 Introduction