English
Related papers

Related papers: Classifying Trusted Hardware via Unidirectional Co…

200 papers

Given a network in which some pairs of nodes can communicate freely, and some subsets of the nodes could be faulty and colluding to disrupt communication, when can messages reliably be sent from one given node to another? We give a new…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-03-11 Adam Hesterberg , Andrea Lincoln , Jayson Lynch

Distributed ledgers are increasingly relied upon by industry to provide trustworthy accountability, strong integrity protection, and high availability for critical data without centralizing trust. Recently, distributed append-only logs are…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-02-06 Shubham Mishra , João Gonçalves , Chawinphat Tankuranand , Neil Giridharan , Natacha Crooks , Heidi Howard , Chris Jensen

This paper explores the territory that lies between best-effort Byzantine-Fault-Tolerant Conflict-free Replicated Data Types (BFT CRDTs) and totally ordered distributed ledgers, such as those implemented by Blockchains. It formally…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-03-11 Davide Frey , Lucie Guillou , Michel Raynal , François Taïani

Since the inception of Bitcoin, the distributed systems community has shown interest in the design of efficient blockchain systems. However, initial blockchain applications (like Bitcoin) attain very low throughput, which has promoted the…

Databases · Computer Science 2020-04-28 Suyash Gupta , Sajjad Rahnama , Mohammad Sadoghi

The practical Byzantine fault tolerant (PBFT) consensus mechanism is one of the most basic consensus algorithms (or protocols) in blockchain technologies, thus its performance evaluation is an interesting and challenging topic due to a…

Cryptography and Security · Computer Science 2021-07-02 Fan-Qi Ma , Quan-Lin Li , Yi-Han Liu , Yan-Xia Chang

The problem of Byzantine consensus has been key to designing secure distributed systems. However, it is particularly difficult, mainly due to the presence of Byzantine processes that act arbitrarily and the unknown message delays in general…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-04-20 Alejandro Ranchal-Pedrosa , Vincent Gramoli

We demonstrate a deterministic Byzantine consensus algorithm with synchronous operation in partial synchrony. It is naturally leaderless, tolerates any number of $ f<n/2 $ Byzantine processes with 2 rounds of exchange of originator-only…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-05-16 Ivan Klianev

The problem of Byzantine consensus has been key to designing secure distributed systems. However, it is particularly difficult, mainly due to the presence of Byzantine processes that act arbitrarily and the unknown message delays in general…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-05-05 Alejandro Ranchal-Pedrosa , Vincent Gramoli

Modern chained Byzantine Fault Tolerant (BFT) systems leverage a combination of pipelining and leader rotation to obtain both efficiency and fairness. These protocols, however, require a sequence of three or four consecutive honest leaders…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-01-27 Ittai Abraham , Natacha Crooks , Neil Giridharan , Heidi Howard , Florian Suri-Payer

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

Distributed ledgers are common in the industry. Some of them can use blockchains as their underlying infrastructure. A blockchain requires participants to agree on its contents. This can be achieved via a consensus protocol, and several BFT…

Performance · Computer Science 2024-11-13 J. D. Chan , Y. C. Tay , Brian R. Z. Yen

We present Carnot, a leader-based Byzantine Fault Tolerant (BFT) consensus protocol that is responsive and operates under the partially synchronous model. Responsive BFT consensus protocols exhibit wire-speed operation and deliver…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-09-04 Mohammad M. Jalalzai , Alexander Mozeika , Marcin P. Pawlowski , Ganesh Narayanaswamy

Docker container virtualization technology is being widely adopted in cloud computing environments because of its lightweight and effiency. However, it requires adequate control and management via an orchestrator. As a result, cloud…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-04-14 Gor Mack Diouf , Halima Elbiaze , Wael Jaafar

Distributed control systems require high reliability and availability guarantees despite often being deployed at the edge of network infrastructure. Edge computing resources are less secure and less reliable than centralized resources in…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-02-21 Roy Shadmon , Daniel Spencer , Owen Arden

We present a device-independent quantum scheme for the {\em Byzantine Generals} problem. The protocol is for three parties. Party $C$ is to send two identical one bit messages to parties $A$ and $B$. The receivers $A$ and $B$ may exchange…

Quantum Physics · Physics 2015-10-07 Ramij Rahaman , Marcin Wieśniak , Marek Żukowski

Blockchain technology has been proposed as a new infrastructure technology for a wide variety of novel applications. Blockchains provide an immutable record of transactions, making them useful when business actors do not trust each other.…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-08-27 Joerg Evermann , Henry Kim

In this paper we propose Aleph, a leaderless, fully asynchronous, Byzantine fault tolerant consensus protocol for ordering messages exchanged among processes. It is based on a distributed construction of a partially ordered set and the…

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

The Reliable Broadcast concept allows an honest party to send a message to all other parties and to make sure that all honest parties receive this message. In addition, it allows an honest party that received a message to know that all…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-11-17 Danny Dolev , Meir Spielrien

The popularization of blockchains leads to a resurgence of interest in Byzantine Fault-Tolerant (BFT) state machine replication protocols. However, much of the work on this topic focuses on the underlying consensus protocols, with emphasis…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-05-01 Alysson Bessani , Eduardo Alchieri , João Sousa , André Oliveira , Fernando Pedone

In order to achieve fault tolerance, highly reliable system often require the ability to detect errors as soon as they occur and prevent the speared of erroneous information throughout the system. Thus, the need for codes capable of…

Information Theory · Computer Science 2010-02-08 Muzhir Al-Ani , Qeethara Al-Shayea