English
Related papers

Related papers: sAVSS: Scalable Asynchronous Verifiable Secret Sha…

200 papers

This paper presents TetraBFT, a novel unauthenticated Byzantine fault tolerant protocol for solving consensus in partial synchrony, eliminating the need for public key cryptography and ensuring resilience against computationally unbounded…

Cryptography and Security · Computer Science 2026-04-14 Qianyu Yu , Giuliano Losa , Xuechao Wang

Quantum key distribution (QKD) networks is expected to provide information-theoretical secured (ITS) communication over long distances. QKD networks based trusted relay architecture are now the most widely used scheme in practice. However,…

Quantum Physics · Physics 2022-04-22 Yi Luo , Hao-Kun Mao , Qiong Li

SBFT is a state of the art Byzantine fault tolerant permissioned blockchain system that addresses the challenges of scalability, decentralization and world-scale geo-replication. SBFTis optimized for decentralization and can easily handle…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-01-03 Guy Golan Gueta , Ittai Abraham , Shelly Grossman , Dahlia Malkhi , Benny Pinkas , Michael K. Reiter , Dragos-Adrian Seredinschi , Orr Tamir , Alin Tomescu

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

In this paper we present an open source, fully asynchronous, leaderless algorithm for reaching consensus in the presence of Byzantine faults in an asynchronous network. We prove the algorithm's correctness provided that less than a third of…

Cryptography and Security · Computer Science 2019-07-29 Pierre Chevalier , Bartlomiej Kaminski , Fraser Hutchison , Qi Ma , Spandan Sharma , Andreas Fackler , William J Buchanan

Byzantine consensus is a critical component in many permissioned Blockchains and distributed ledgers. We propose a new paradigm for designing BFT protocols called DQBFT that addresses three major performance and scalability challenges that…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-03-01 Balaji Arun , Binoy Ravindran

Synchronous consensus protocols offer a significant advantage over their asynchronous and partially synchronous counterparts by providing higher fault tolerance -- an essential benefit in distributed systems, like blockchains, where…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-03-14 Nenad Milošević , Daniel Cason , Zarko Milošević , Robert Soulé , Fernando Pedone

Existing Byzantine fault-tolerant (BFT) consensus protocols address only threshold failures, where the participating nodes fail independently of each other, each one fails equally likely, and the protocol's guarantees follow from a simple…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-08-04 Orestis Alpos , Christian Cachin

This paper presents LinSBFT, a Byzantine Fault Tolerance (BFT) protocol with the capacity of processing over 2000 smart contract transactions per second in production. LinSBFT applies to a permissionless, public blockchain system, in which…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-07-16 Xiaodong Qi , Yin Yang , Zhao Zhang , Cheqing Jin , Aoying Zhou

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 2022-02-07 Afonso Oliveira , Henrique Moniz , Rodrigo Rodrigues

Byzantine fault tolerant protocols enable state replication in the presence of crashed, malfunctioning, or actively malicious processes. Designing such protocols without the assistance of verification tools, however, is remarkably…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-09-23 Joel Wanner , Laurent Chuat , Adrian Perrig

Byzantine fault-tolerant (BFT) web services provide critical integrity guarantees for distributed applications but face significant latency challenges that hinder interactive user experiences. We propose a novel two-layer architecture that…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-07-14 Ahmad Zaki Akmal , Azkario Rizky Pratama , Guntur Dharma Putra

Byzantine Fault Tolerant (BFT) systems are considered by the systems research community to be state of the art with regards to providing reliability in distributed systems. BFT systems provide safety and liveness guarantees with reasonable…

Distributed, Parallel, and Cluster Computing · Computer Science 2011-10-24 Nikos Chondros , Konstantinos Kokordelis , Mema Roussopoulos

With the continuous expansion of blockchain application scenarios, consortium chains have raised higher performance and security requirements for consensus mechanisms. Unlike public blockchains, consortium chains typically implement an…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-04-20 Wen Gao , Xinhong Hei , Yichuan Wang

Cloud business intelligence is an increasingly popular choice to deliver decision support capabilities via elastic, pay-per-use resources. However, data security issues are one of the top concerns when dealing with sensitive data. In this…

Databases · Computer Science 2014-12-12 Varunya Attasena , Nouria Harbi , Jérôme Darmont

Ensuring that an AI system behaves reliably and as intended, especially in the presence of unexpected faults or adversarial conditions, is a complex challenge. Inspired by the field of Byzantine Fault Tolerance (BFT) from distributed…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-04-30 John deVadoss , Matthias Artzt

Fault-tolerant consensus has been studied extensively in the literature, because it is one of the most important distributed primitives and has wide applications in practice. This paper surveys important results on fault-tolerant consensus…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-08-30 Lewis Tseng

Byzantine Fault Tolerance (BFT) enables correct operation of distributed, i.e., replicated applications in the face of malicious take-over and faulty/buggy individual instances. Recently, BFT designs have gained traction in the context of…

Networking and Internet Architecture · Computer Science 2019-08-15 Ermin Sakic , Nemanja Deric , Endri Goshi , Wolfgang Kellerer

The parallel Byzantine Fault Tolerant (BFT) protocol is viewed as a promising solution to address the consensus scalability issue of the permissioned blockchain. One of the main challenges in parallel BFT is the view change process that…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-01-15 Yifei Xie , Btissam Er-Rahmadi , Xiao Chen , Tiejun Ma , Jane Hillston

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