Total order broadcast and multicast algorithms: Taxonomy and survey

X Défago, A Schiper, P Urbán - ACM Computing Surveys (CSUR), 2004 - dl.acm.org
Total order broadcast and multicast (also called atomic broadcast/multicast) present an
important problem in distributed systems, especially with respect to fault-tolerance. In short …

[HTML][HTML] Algorand: A secure and efficient distributed ledger

J Chen, S Micali - Theoretical Computer Science, 2019 - Elsevier
A distributed ledger is a tamperproof sequence of data that can be publicly accessed and
augmented by everyone, without being maintained by a centralized party. Distributed …

Unreliable failure detectors for reliable distributed systems

TD Chandra, S Toueg - Journal of the ACM (JACM), 1996 - dl.acm.org
We introduce the concept of unreliable failure detectors and study how they can be used to
solve Consensus in asynchronous systems with crash failures. We characterise unreliable …

[图书][B] Distributed computing: fundamentals, simulations, and advanced topics

H Attiya, J Welch - 2004 - books.google.com
* Comprehensive introduction to the fundamental results in the mathematical foundations of
distributed computing* Accompanied by supporting material, such as lecture notes and …

Sok: A consensus taxonomy in the blockchain era

J Garay, A Kiayias - Topics in Cryptology–CT-RSA 2020: The …, 2020 - Springer
Consensus is arguably one of the most fundamental problems in distributed computing,
playing also an important role in the area of cryptographic protocols as the enabler of a …

The weakest failure detector for solving consensus

TD Chandra, V Hadzilacos, S Toueg - Journal of the ACM (JACM), 1996 - dl.acm.org
We determine what information about failures is necessary and sufficient to solve
Consensus in asynchronous distributed systems subject to crash failures. In Chandra and …

Random oracles in constantipole: practical asynchronous byzantine agreement using cryptography

C Cachin, K Kursawe, V Shoup - Proceedings of the nineteenth annual …, 2000 - dl.acm.org
Byzantine agreement requires a set of parties in a distributed system to agree on a value
even if some parties are corrupted. A new protocol for Byzantine agreement in a completely …

[PDF][PDF] A modular approach to fault-tolerant broadcasts and related problems

V Hadzilacos, S Toueg - 1994 - ecommons.cornell.edu
The design and verification of fault-tolerant distributed applications is widely viewed as a
complex endeavor. To a large extent this is due to the fact that the communication primitives …

[图书][B] Microwaves and metals

M Gupta, EWW Leong - 2008 - books.google.com
Using microwaves to treat metal-based materials is rapidly emerging as an energy-efficient
tool to interact with metals for a number of processes such as sintering, melting, brazing …

[PDF][PDF] Fast asynchronous Byzantine agreement with optimal resilience

R Canetti, T Rabin - Proceedings of the twenty-fifth annual ACM …, 1993 - dl.acm.org
The problem of reaching agreement in the presence of faults is one of the most fundamental
problems in the field of distributed computing. A particularly interesting variant of this …