Improving Byzantine Protocols with Secure Computational Components

Detalhes bibliográficos
Autor(a) principal: Correia, Miguel
Data de Publicação: 2005
Outros Autores: Bessani, Alysson Neves, Neves, Nuno Ferreira, Lung, Lau Cheuk, 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/14220
Resumo: Byzantine-tolerant protocols are currently being used as building blocks in the construction of secure applications, therefore their performance has a practical impact. Work in message-passing distributed protocols typically considers a set of nodes interconnected by a network. This paper investigates the benefits for the performance of Byzantine-tolerant protocols of including a secure component in the nodes. We have been exploring this kind of hybrid fault models by calling these subsystems wormholes. The present paper follows this line but considers local wormholes, while in previous work wormholes were distributed, i.e., they included their own communication channel. The paper presents the architecture of systems with local wormholes and several flavors of consensus based on this model. The paper also presents the first work with asynchronous wormholes, using randomization to circumvent FLP, while also providing the first formalization of wormholes-based protocols using I/O automata. The benefits of the approach are discussed
id RCAP_e8a079b9459616d968e8f713433ce754
oai_identifier_str oai:repositorio.ul.pt:10451/14220
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 Improving Byzantine Protocols with Secure Computational ComponentsByzantine fault toleranceintrusion tolerancedistributed systems models, distributed algorithmsconsensusByzantine-tolerant protocols are currently being used as building blocks in the construction of secure applications, therefore their performance has a practical impact. Work in message-passing distributed protocols typically considers a set of nodes interconnected by a network. This paper investigates the benefits for the performance of Byzantine-tolerant protocols of including a secure component in the nodes. We have been exploring this kind of hybrid fault models by calling these subsystems wormholes. The present paper follows this line but considers local wormholes, while in previous work wormholes were distributed, i.e., they included their own communication channel. The paper presents the architecture of systems with local wormholes and several flavors of consensus based on this model. The paper also presents the first work with asynchronous wormholes, using randomization to circumvent FLP, while also providing the first formalization of wormholes-based protocols using I/O automata. The benefits of the approach are discussedDepartment of Informatics, University of LisbonRepositório da Universidade de LisboaCorreia, MiguelBessani, Alysson NevesNeves, Nuno FerreiraLung, Lau CheukVeríssimo, Paulo2009-02-10T13:11:42Z2005-122005-12-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/reporthttp://hdl.handle.net/10451/14220porinfo: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/14220Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T21:36:02.854950Repositó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 Improving Byzantine Protocols with Secure Computational Components
title Improving Byzantine Protocols with Secure Computational Components
spellingShingle Improving Byzantine Protocols with Secure Computational Components
Correia, Miguel
Byzantine fault tolerance
intrusion tolerance
distributed systems models, distributed algorithms
consensus
title_short Improving Byzantine Protocols with Secure Computational Components
title_full Improving Byzantine Protocols with Secure Computational Components
title_fullStr Improving Byzantine Protocols with Secure Computational Components
title_full_unstemmed Improving Byzantine Protocols with Secure Computational Components
title_sort Improving Byzantine Protocols with Secure Computational Components
author Correia, Miguel
author_facet Correia, Miguel
Bessani, Alysson Neves
Neves, Nuno Ferreira
Lung, Lau Cheuk
Veríssimo, Paulo
author_role author
author2 Bessani, Alysson Neves
Neves, Nuno Ferreira
Lung, Lau Cheuk
Veríssimo, Paulo
author2_role author
author
author
author
dc.contributor.none.fl_str_mv Repositório da Universidade de Lisboa
dc.contributor.author.fl_str_mv Correia, Miguel
Bessani, Alysson Neves
Neves, Nuno Ferreira
Lung, Lau Cheuk
Veríssimo, Paulo
dc.subject.por.fl_str_mv Byzantine fault tolerance
intrusion tolerance
distributed systems models, distributed algorithms
consensus
topic Byzantine fault tolerance
intrusion tolerance
distributed systems models, distributed algorithms
consensus
description Byzantine-tolerant protocols are currently being used as building blocks in the construction of secure applications, therefore their performance has a practical impact. Work in message-passing distributed protocols typically considers a set of nodes interconnected by a network. This paper investigates the benefits for the performance of Byzantine-tolerant protocols of including a secure component in the nodes. We have been exploring this kind of hybrid fault models by calling these subsystems wormholes. The present paper follows this line but considers local wormholes, while in previous work wormholes were distributed, i.e., they included their own communication channel. The paper presents the architecture of systems with local wormholes and several flavors of consensus based on this model. The paper also presents the first work with asynchronous wormholes, using randomization to circumvent FLP, while also providing the first formalization of wormholes-based protocols using I/O automata. The benefits of the approach are discussed
publishDate 2005
dc.date.none.fl_str_mv 2005-12
2005-12-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/14220
url http://hdl.handle.net/10451/14220
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.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_ 1799134259339853824

Registros relacionados