Scalable low latency consensus for blockchains

Bibliographic Details
Main Author: Avelãs, Diogo Miguel do Carmo
Publication Date: 2021
Format: Master thesis
Language: eng
Source: Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
Download full: http://hdl.handle.net/10451/53743
Summary: Tese de mestrado, Segurança Informática, Universidade de Lisboa; Faculdade de Ciências, 2022
id RCAP_c8566bec6ec8d18afc6588c979b241c6
oai_identifier_str oai:repositorio.ulisboa.pt:10451/53743
network_acronym_str RCAP
network_name_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository_id_str https://opendoar.ac.uk/repository/7160
spelling Scalable low latency consensus for blockchainsConsensoTolerância a faltas bizantinasQuóruns probabilísticosReplicação máquina de estadosTeses de mestrado - 2022Departamento de InformáticaTese de mestrado, Segurança Informática, Universidade de Lisboa; Faculdade de Ciências, 2022State machine replication (SMR) is a classical technique to implement consistent and fault­tolerant replicated services. This type of system is usually built on top of consensus protocols that have high throughput but have problems scaling to settings with a large number of participants or wide­area sce narios due to the required number of messages exchanged to reach a consensus. We propose ProBFT (Probabilistic Byzantine Fault Tolerance), a consensus protocol specifically de signed to tackle the scalability problem of BFT protocols. ProBFT is a consensus protocol with optimal latency (three communication steps, as in PBFT) but with a reduced number of messages exchanged in each phase (O(n √ n) instead of PBFT’s O(n 2 )). ProBFT is a probabilistic protocol built on top of well­known primitives, such as probabilistic Byzantine quorums and verifiable random functions, which provides high probabilities of safety and liveness when the overwhelming majority of replicas is correct. We also propose a state machine replication protocol called PROBER (PRObabilistic ByzantinE Replication) that builds on top of two consensus protocols, ProBFT and PBFT. PROBER makes use of ProBFT to provide fast and probabilistic replies to the clients and uses PBFT to eventually determinis tically commit the history of operations guaranteeing that the system will not roll back the requests after such commit. This periodic deterministic commit allows the clients to enjoy the low latency provided by ProBFT while still having the guarantees provided by a deterministic protocol. We provide a detailed description of both protocols and analyse the probabilities for safety and live ness depending on the current number of Byzantine replicas.Bessani, Alysson Neves, 1978-Repositório da Universidade de LisboaAvelãs, Diogo Miguel do Carmo2022-07-11T08:22:06Z202220212022-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesisapplication/pdfhttp://hdl.handle.net/10451/53743TID:202995160enginfo:eu-repo/semantics/openAccessreponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiainstacron:RCAAP2025-03-17T14:47:38Zoai:repositorio.ulisboa.pt:10451/53743Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-29T03:25:01.717219Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiafalse
dc.title.none.fl_str_mv Scalable low latency consensus for blockchains
title Scalable low latency consensus for blockchains
spellingShingle Scalable low latency consensus for blockchains
Avelãs, Diogo Miguel do Carmo
Consenso
Tolerância a faltas bizantinas
Quóruns probabilísticos
Replicação máquina de estados
Teses de mestrado - 2022
Departamento de Informática
title_short Scalable low latency consensus for blockchains
title_full Scalable low latency consensus for blockchains
title_fullStr Scalable low latency consensus for blockchains
title_full_unstemmed Scalable low latency consensus for blockchains
title_sort Scalable low latency consensus for blockchains
author Avelãs, Diogo Miguel do Carmo
author_facet Avelãs, Diogo Miguel do Carmo
author_role author
dc.contributor.none.fl_str_mv Bessani, Alysson Neves, 1978-
Repositório da Universidade de Lisboa
dc.contributor.author.fl_str_mv Avelãs, Diogo Miguel do Carmo
dc.subject.por.fl_str_mv Consenso
Tolerância a faltas bizantinas
Quóruns probabilísticos
Replicação máquina de estados
Teses de mestrado - 2022
Departamento de Informática
topic Consenso
Tolerância a faltas bizantinas
Quóruns probabilísticos
Replicação máquina de estados
Teses de mestrado - 2022
Departamento de Informática
description Tese de mestrado, Segurança Informática, Universidade de Lisboa; Faculdade de Ciências, 2022
publishDate 2021
dc.date.none.fl_str_mv 2021
2022-07-11T08:22:06Z
2022
2022-01-01T00:00:00Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/masterThesis
format masterThesis
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10451/53743
TID:202995160
url http://hdl.handle.net/10451/53743
identifier_str_mv TID:202995160
dc.language.iso.fl_str_mv eng
language eng
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.source.none.fl_str_mv reponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron:RCAAP
instname_str FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron_str RCAAP
institution RCAAP
reponame_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
collection Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository.name.fl_str_mv Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
repository.mail.fl_str_mv info@rcaap.pt
_version_ 1833601691028553728

Similar Items