Results 201 to 210 of about 35,864 (228)
Some of the next articles are maybe not open access.
Marlin: Two-Phase BFT with Linearity
Dependable Systems and Networks, 2022As the first Byzantine fault-tolerant (BFT) protocol with linear communication complexity, HotStuff (PODC 2019) has received significant attention. HotStuff has three round-trips for both normal case operations and view change protocols.
Xiao Sui, Sisi Duan, Haibin Zhang
semanticscholar +1 more source
GradedDAG: An Asynchronous DAG-based BFT Consensus with Lower Latency
IEEE International Symposium on Reliable Distributed Systems, 2023To enable parallel processing, the Directed Acyclic Graph (DAG) structure is introduced to the design of asyn-chronous Byzantine Fault Tolerant (BFT) consensus protocols, known as DAG-based BFT.
Xiaohai Dai +5 more
semanticscholar +1 more source
PrestigeBFT: Revolutionizing View Changes in BFT Consensus Algorithms with Reputation Mechanisms
IEEE International Conference on Data Engineering, 2023Passive view-change protocols are widely employed in BFT algorithms; however, they present the risks of selecting unavailable or slow servers as leaders.
Gengrui Zhang +3 more
semanticscholar +1 more source
Flexible Advancement in Asynchronous BFT Consensus
Symposium on Operating Systems Principles, 2023Byzantine fault tolerant (BFT) consensus protocols are becoming an appealing solution to blockchains. As most blockchain systems are deployed on Wide Area Networks (WANs), with each node acting on behalf of its entity, partially synchronous BFT protocols
Shengyun Liu +9 more
semanticscholar +1 more source
Achilles: Efficient TEE-Assisted BFT Consensus via Rollback Resilient Recovery
European Conference on Computer SystemsBFT consensus that uses Trusted Execution Environments (TEEs) to improve the system tolerance and performance is gaining popularity. However, existing works suffer from TEE rollback issues, resulting in a tolerance-performance tradeoff. In this paper, we
Jianyu Niu +5 more
semanticscholar +1 more source
Shoal++: High Throughput DAG BFT Can Be Fast!
arXiv.orgToday's practical partially synchronous Byzantine Fault Tolerant (BFT) consensus protocols trade off low latency and high throughput. On the one end, traditional BFT protocols such as PBFT and its derivatives optimize for latency.
Balaji Arun +4 more
semanticscholar +1 more source
LightDAG: A Low-latency DAG-based BFT Consensus through Lightweight Broadcast
IEEE International Parallel and Distributed Processing SymposiumTo improve the throughput of Byzantine Fault Tolerance (BFT) consensus protocols, the Directed Acyclic Graph (DAG) topology has been introduced to parallel data processing, leading to the development of DAG-based BFT consensus.
Xiaohai Dai +6 more
semanticscholar +1 more source
Moonshot: Optimizing Chain-Based Rotating Leader BFT via Optimistic Proposals
arXiv.orgExisting chain-based rotating-leader BFT SMR protocols for the partially synchronous network model with constant commit latencies incur block periods of at least $2\delta$ (where $\delta$ is the message transmission latency).
Isaac Doidge +3 more
semanticscholar +1 more source
Crackle: A Fast Sector-based BFT Consensus with Sublinear Communication Complexity
IEEE Conference on Computer CommunicationsBlockchain systems widely employ Byzantine fault-tolerant (BFT) protocols to ensure consistency. Improving BFT protocols’ throughput is crucial for large-scale blockchain systems.
Hao Xu +5 more
semanticscholar +1 more source
BG: A Modular Treatment of BFT Consensus Toward a Unified Theory of BFT Replication
IEEE Transactions on Information Forensics and SecurityWe provide an expressive framework that allows analyzing and generating provably secure, state-of-the-art Byzantine fault-tolerant (BFT) protocols over graph of nodes, a notion formalized in the HotStuff protocol. Our framework is hierarchical, including
Xiao Sui, Sisi Duan, Haibin Zhang
semanticscholar +1 more source