From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without Signatures

Detalhes bibliográficos
Autor(a) principal: Correia, Miguel
Data de Publicação: 2005
Outros Autores: Neves, Nuno Ferreira, Veríssimo, Paulo
Tipo de documento: Relatório
Idioma: por
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10451/14219
Resumo: This paper proposes a stack 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 and a reliable broadcast protocol. The protocols share a set of important structural properties. Firstly, they do not use digital signatures constructed with public-key cryptography, a well-known performance 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 are completely decentralized, thus avoiding the cost of detecting corrupt leaders. Fourthly, they have optimal resilience, i.e., they tolerate f=|_(n-1)/3_| out of a total of n processes. In terms of time complexity, the multi-valued consensus protocol terminates in a constant expected number of rounds, while the vector consensus and atomic broadcast protocols have O(f) complexity. The paper also proves the equivalence between multi-valued consensus and atomic broadcast in the Byzantine failure model without signatures. A similar proof is given for the equivalence between multi-valued consensus and vector consensus. These two results have theoretical relevance since they show once more that consensus is a fundamental problem in distributed systems
id RCAP_6d59422fba7bc9a2be1225ea5f9395e9
oai_identifier_str oai:repositorio.ul.pt:10451/14219
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without SignaturesThis paper proposes a stack 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 and a reliable broadcast protocol. The protocols share a set of important structural properties. Firstly, they do not use digital signatures constructed with public-key cryptography, a well-known performance 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 are completely decentralized, thus avoiding the cost of detecting corrupt leaders. Fourthly, they have optimal resilience, i.e., they tolerate f=|_(n-1)/3_| out of a total of n processes. In terms of time complexity, the multi-valued consensus protocol terminates in a constant expected number of rounds, while the vector consensus and atomic broadcast protocols have O(f) complexity. The paper also proves the equivalence between multi-valued consensus and atomic broadcast in the Byzantine failure model without signatures. A similar proof is given for the equivalence between multi-valued consensus and vector consensus. These two results have theoretical relevance since they show once more that consensus is a fundamental problem in distributed systemsDepartment of Informatics, University of LisbonRepositório da Universidade de LisboaCorreia, MiguelNeves, Nuno FerreiraVeríssimo, Paulo2009-02-10T13:11:42Z2005-102005-10-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/reportapplication/pdfhttp://hdl.handle.net/10451/14219porinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-11-08T15:59:53Zoai:repositorio.ul.pt:10451/14219Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T21:36:02.810026Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without Signatures
title From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without Signatures
spellingShingle From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without Signatures
Correia, Miguel
title_short From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without Signatures
title_full From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without Signatures
title_fullStr From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without Signatures
title_full_unstemmed From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without Signatures
title_sort From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without Signatures
author Correia, Miguel
author_facet Correia, Miguel
Neves, Nuno Ferreira
Veríssimo, Paulo
author_role author
author2 Neves, Nuno Ferreira
Veríssimo, Paulo
author2_role author
author
dc.contributor.none.fl_str_mv Repositório da Universidade de Lisboa
dc.contributor.author.fl_str_mv Correia, Miguel
Neves, Nuno Ferreira
Veríssimo, Paulo
description This paper proposes a stack 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 and a reliable broadcast protocol. The protocols share a set of important structural properties. Firstly, they do not use digital signatures constructed with public-key cryptography, a well-known performance 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 are completely decentralized, thus avoiding the cost of detecting corrupt leaders. Fourthly, they have optimal resilience, i.e., they tolerate f=|_(n-1)/3_| out of a total of n processes. In terms of time complexity, the multi-valued consensus protocol terminates in a constant expected number of rounds, while the vector consensus and atomic broadcast protocols have O(f) complexity. The paper also proves the equivalence between multi-valued consensus and atomic broadcast in the Byzantine failure model without signatures. A similar proof is given for the equivalence between multi-valued consensus and vector consensus. These two results have theoretical relevance since they show once more that consensus is a fundamental problem in distributed systems
publishDate 2005
dc.date.none.fl_str_mv 2005-10
2005-10-01T00:00:00Z
2009-02-10T13:11:42Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/report
format report
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10451/14219
url http://hdl.handle.net/10451/14219
dc.language.iso.fl_str_mv por
language por
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Department of Informatics, University of Lisbon
publisher.none.fl_str_mv Department of Informatics, University of Lisbon
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1817551551812599808