English
Related papers

Related papers: Proof-Carrying Fair Ordering: Asymmetric Verificat…

200 papers

Transaction ordering attacks extract billions of dollars annually from decentralized finance users in the form of Maximal Extractable Value (MEV). Byzantine Fault-Tolerant (BFT) consensus protocols guarantee total order but place no…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-05-25 Marko Putnik , Jérémie Decouchant

Mission critical systems deployed in data centers today are facing more sophisticated failures. Byzantine fault tolerant (BFT) protocols are capable of masking these types of failures, but are rarely deployed due to their performance cost…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-10-25 Guangda Sun , Xin Zhe Khooi , Yunfan Li , Mingliang Jiang , Jialin Li

Existing Byzantine fault tolerance (BFT) protocols face significant challenges in the consortium blockchain scenario. On the one hand, we can make little assumptions about the reliability and security of the underlying Internet. On the…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-02-06 Peilun Li , Guosai Wang , Xiaoqi Chen , Wei Xu

Byzantine fault-tolerant (BFT) consensus algorithms are at the core of providing safety and liveness guarantees for distributed systems that must operate in the presence of arbitrary failures. Recently, numerous new BFT algorithms have been…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-12-06 Gengrui Zhang , Fei Pan , Yunhao Mao , Sofia Tijanic , Michael Dang'ana , Shashank Motepalli , Shiquan Zhang , Hans-Arno Jacobsen

Traditional Byzantine Fault Tolerance (BFT) state machine replication protocols assume a partial synchrony model, leading to a design where a leader replica drives the protocol and is replaced after a timeout. Recently, we witnessed a surge…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-07-23 Diogo S. Antunes , Afonso N. Oliveira , André Breda , Matheus Guilherme Franco , Henrique Moniz , Rodrigo Rodrigues

Byzantine Fault Tolerant (BFT) consensus exhibits higher throughput in comparison to Proof of Work (PoW) in blockchains. But BFT-based protocols suffer from scalability problems with respect to the number of replicas in the network. The…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-04-30 Mohammad M. Jalalzai , Costas Busch , Golden Richard

The rise of cryptocurrencies like Bitcoin and Ethereum has driven interest in blockchain database technology, with smart contracts enabling the growth of decentralized finance (DeFi). However, research has shown that adversaries exploit…

Databases · Computer Science 2026-01-30 Dakai Kang , Junchao Chen , Tien Tuan Anh Dinh , Mohammad Sadoghi

Many blockchain platform are subject to maximal value extraction (MEV), and users on the platform are losing money while sending transactions because the transaction order can be manipulated to extract value from them. Consensus protocols…

Cryptography and Security · Computer Science 2024-01-05 Bowen Xue , Sreeram Kannan

Financial institutions are currently looking into technologies for permissioned blockchains. A major effort in this direction is Hyperledger, an open source project hosted by the Linux Foundation and backed by a consortium of over a hundred…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-06-11 Kfir Lev-Ari , Alexander Spiegelman , Idit Keidar , Dahlia Malkhi

Multi-Byzantine Fault Tolerant (Multi-BFT) consensus allows multiple consensus instances to run in parallel, resolving the leader bottleneck problem inherent in classic BFT consensus. However, the global ordering of Multi-BFT consensus…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-03-04 Hanzheng Lyu , Shaokang Xie , Jianyu Niu , Ivan Beschastnikh , Yinqian Zhang , Mohammad Sadoghi , Chen Feng

This paper introduces a family of leaderless Byzantine fault tolerance protocols, built around a metastable mechanism via network subsampling. These protocols provide a strong probabilistic safety guarantee in the presence of Byzantine…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-08-25 Team Rocket , Maofan Yin , Kevin Sekniqi , Robbert van Renesse , Emin Gün Sirer

The surging interest in blockchain technology has revitalized the search for effective Byzantine consensus schemes. In particular, the blockchain community has been looking for ways to effectively integrate traditional Byzantine…

Cryptography and Security · Computer Science 2018-11-15 Jian Liu , Wenting Li , Ghassan O. Karame , N. Asokan

Tendermint-core blockchains (e.g. Cosmos) are considered today one of the most viable alternatives for the highly energy consuming proof-of-work blockchains such as Bitcoin and Ethereum. Their particularity is that they aim at offering…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-12-14 Yackolley Amoussou-Guenou , Antonella Del Pozzo , Maria Potop-Butucaru , Sara Tucci-Piergiovanni

Byzantine Fault Tolerant (BFT) consensus forms the foundation of many modern blockchains striving for both high throughput and low latency. A growing bottleneck is transaction execution and validation on the critical path of consensus,…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-02-25 Ignacio Amores-Sesar , Mirza Ahad Baig , Seth Gilbert , Ray Neiheiser , Michelle X. Yeo

This paper presents an adversary model and a simulation framework specifically tailored for analyzing attacks on distributed systems composed of multiple distributed protocols, with a focus on assessing the security of blockchain networks.…

Cryptography and Security · Computer Science 2025-04-18 Erwan Mahe , Rouwaida Abdallah , Pierre-Yves Piriou , Sara Tucci-Piergiovanni

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

Byzantine fault tolerance (BFT) consensus is a fundamental primitive for distributed computation. However, BFT protocols suffer from the ordering manipulation, in which an adversary can make front-running. Several protocols are proposed to…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-09-20 Guangren Wang , Liang Cai , Fangyu Gai , Jianyu Niu

Replication protocols are essential for distributed systems, ensuring consistency, reliability, and fault tolerance. Traditional Crash Fault Tolerant (CFT) protocols, which assume a fail-stop model, are inadequate for untrusted cloud…

Cryptography and Security · Computer Science 2025-02-14 Dimitra Giantsidi , Emmanouil Giortamis , Julian Pritzi , Maurice Bailleu , Manos Kapritsos , Pramod Bhatotia

Byzantine fault-tolerant (BFT) protocols allow a group of replicas to come to a consensus even when some of the replicas are Byzantine faulty. There exist multiple BFT protocols to securely tolerate an optimal number of faults $t$ under…

Cryptography and Security · Computer Science 2021-11-09 Peiyao Sheng , Gerui Wang , Kartik Nayak , Sreeram Kannan , Pramod Viswanath

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
‹ Prev 1 2 3 10 Next ›