English
Related papers

Related papers: FastPay: High-Performance Byzantine Fault Tolerant…

200 papers

Byzantine general problem is the core problem of the consensus algorithm, and many protocols are proposed recently to improve the decentralization level, the performance and the security of the blockchain. There are two challenging issues…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-07-09 Tzu-Wei Chao , Hao Chung , Po-Chun Kuo

This paper introduces Hamster, a novel synchronous Byzantine Fault Tolerance protocol that achieves better performance and has weaker dependency on synchrony. Specifically, Hamster employs coding techniques to significantly decrease…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-10-01 Ximing Fu , Mo Li , Qingming Zeng , Tianyang Li , Shenghao Yang , Yonghui Guan , Chuanyi Liu

This thesis proposes techniques aiming to make blockchain technologies and smart contract platforms practical by improving their scalability, latency, and privacy. This thesis starts by presenting the design and implementation of…

Cryptography and Security · Computer Science 2021-02-25 Alberto Sonnino

We revisit Byzantine tolerant reliable broadcast with honest dealer algorithms in multi-hop networks. To tolerate Byzantine faulty nodes arbitrarily spread over the network, previous solutions require a factorial number of messages to be…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-09-13 Silvia Bonomi , Giovanni Farina , Sébastien Tixeuil

Achieving agreement among distributed parties is a fundamental task in modern systems, underpinning applications such as consensus in blockchains, coordination in cloud infrastructure, and fault tolerance in critical services. However, this…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-02-18 Andrei Constantinescu , Marc Dufay , Anton Paramonov , Roger Wattenhofer

Recent years have witnessed a rapid development of platform economy, as it effectively addresses the trust dilemma between untrusted online buyers and merchants. However, malicious platforms can misuse users' funds and information, causing…

Cryptography and Security · Computer Science 2025-05-26 Junru Lin , Mingzhe Liu , Songze Li , Xuechao Wang

Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of information exchange to reach agreement based on the input values. The…

Distributed, Parallel, and Cluster Computing · Computer Science 2009-08-04 Ariel Daliot , Danny Dolev

We consider the problem of Byzantine fault-tolerance in the peer-to-peer (P2P) distributed gradient-descent method -- a prominent algorithm for distributed optimization in a P2P system. In this problem, the system comprises of multiple…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-02-01 Nirupam Gupta , Nitin H. Vaidya

Arma is a Byzantine Fault Tolerant (BFT) consensus system designed to achieve linear scalability across all hardware resources: network bandwidth, CPU, and disk I/O. As opposed to preceding BFT protocols, Arma separates the dissemination…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-12-22 Yacov Manevich

Byzantine agreement, the underlying core of blockchain, aims to make every node in a decentralized network reach consensus. Classical Byzantine agreements unavoidably face two major problems. One is $1/3$ fault-tolerance bound, which means…

The spectacular success of Bitcoin and Blockchain Technology in recent years has provided enough evidence that a widespread adoption of a common cryptocurrency system is not merely a distant vision, but a scenario that might come true in…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-08-30 Adam Gągol , Damian Leśniak , Damian Straszak , Michał Świętek

Arma is a Byzantine Fault Tolerant (BFT) consensus system designed to achieve horizontal scalability across all hardware resources: network bandwidth, CPU, and disk I/O. As opposed to preceding BFT protocols, Arma separates the…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-05-29 Yacov Manevich , Hagar Meir , Kaoutar Elkhiyaoui , Yoav Tock , May Buzaglo

In this study, we propose PRETRUST, a new framework to address the problem of the efficiency of payment process based on blockchain systems. PRETRUST is based on the thoughts of consortium chains, supporting fast payments. To make parties…

Cryptography and Security · Computer Science 2022-11-15 Huapeng Li , Baocheng Wang

While showing great promise, Bitcoin requires users to wait tens of minutes for transactions to commit, and even then, offering only probabilistic guarantees. This paper introduces ByzCoin, a novel Byzantine consensus protocol that…

Cryptography and Security · Computer Science 2016-08-02 Eleftherios Kokoris-Kogias , Philipp Jovanovic , Nicolas Gailly , Ismail Khoffi , Linus Gasser , Bryan Ford

To improve the overall efficiency and reliability of Byzantine protocols in large sparse networks, we propose a new system assumption for developing multi-scale fault-tolerant systems, with which several kinds of multi-scale Byzantine…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-03-08 Shaolin Yu , Jihong Zhu , Jiali Yang , Yulong Zhan

Blockchain technology offers a decentralized and secure method for storing and authenticating data, rendering it well-suited for various applications such as digital currencies, supply chain management, and voting systems. However, the…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-04-25 Mohammad R. Shakournia , Pooya Jamshidi , Hamid Reza Faragardi , Nasser Yazdani

Digital money can be implemented efficiently by avoiding consensus. However, no-consensus implementations have drawbacks, as they cannot support smart contracts, and (even more fundamentally) they cannot deal with conflicting transactions.…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-10-05 Jakub Sliwinski , Yann Vonlanthen , Roger Wattenhofer

Byzantine reliable broadcast is a powerful primitive that allows a set of processes to agree on a message from a designated sender, even if some processes (including the sender) are Byzantine. Existing broadcast protocols for this setting…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-02-21 Rachid Guerraoui , Petr Kuznetsov , Matteo Monti , Matej Pavlovic , Dragos-Adrian Seredinschi , Yann Vonlanthen

Recent Byzantine fault-tolerant (BFT) state machine replication (SMR) protocols increasingly focus on scalability to meet the requirements of distributed ledger technology (DLT). Validating the performance of scalable BFT protocol…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-10-02 Christian Berger , Sadok Ben Toumia , Hans P. Reiser

This paper describes BigBFT, a multi-leader Byzantine fault tolerance protocol that achieves high throughput and scalable consensus in blockchain systems. BigBFT achieves this by (1) enabling every node to be a leader that can propose and…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-01-25 Salem Alqahtani , Murat Demirbas