G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. In Journal of the Association for Computing Machinery, October 1995. Home/Search Document Not in Database Summary ACM TOC Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Byzantine Fault-Tolerant Confidentiality - Yin, Venkataramani, Martin.. (2002) (3 citations) (Correct)
....approach is to use redundancy to harden services against bugs. A traditional Byzantine fault tolerant (BFT) system runs different implementations of the same service on several replicas and ensures that correct computation is performed by enough correct replicas to mask incorrect replicas [1, 2, 4, 14, 15, 16, 17]. Recent research has shown that BFT systems can be practical for several important services as they can be implemented with low overheads compared to the unreplicated services [3] However, although traditional BFT systems improve availability and integrity through redundancy, existing BFT ....
....15] in which a group of service replicas use intersection properties of quorum sets to guarantee that clients retrieve values of variables written previously. Byzantine fault tolerance for arbitrary services captured by state machines have been studied in both theoretical and practical settings. [2, 3, 4, 16, 17] In particular, Castro and Liskov [3, 4, 16] have shown that BFT systems can be practical because i) The throughput and latency of several BFT services implemented by them are comparable to unreplicated service [3] and ii) Multiple implementations of the same legacy services by different vendors ....
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. In Journal of the Association for Computing Machinery, October 1995. 4
Cynthia Dwork And Nancy Lynch - Massachusetts Institute Of (Correct)
....that p has found to be acceptable ; p decides v if it receives sufficiently many acknowledgments from others that they have changed their value to v, so that a value different from v will never be found acceptable at a later time. Similar methods have already appeared in the literature (e.g. see [2], 19] Reischuk [17] and Pinter [16] have also obtained consensus results that treat message and processor faults separately. 1.3 PARTIALLY SYNCHRONOUS COMMUNICATION AND PROCESSORS. It is easy to extend the models described in Section 1.2 to allow processors, as well as communication, to be ....
BRACHA, G., AND TOUEG, S. Asynchronous consensus and broadcast protocols. J. ACM 32, 4 (Oct. 1985), 824-840. 323
Intrusion-Tolerant Architectures: Concepts and Design - Veríssimo, Neves.. (Correct)
....has one sender process and several recipient processes. In the rest of the section, we will make the classical separation of receiving a message from the network and delivering a message the result of the protocol execution. A reliable multicast protocol enforces the following two properties [6]: 1) all correct processes deliver the same messages; 2) if a correct sender transmits a message then all correct processes deliver this message. These rules do not imply any guarantees of delivery in case of a malicious sender. However, one of two things will happen, either the correct ....
Bracha, G., Toueg, S.: Asynchronous consensus and broadcast protocols. Journal of the ACM 32 (1985) 824--840
Intrusion-Tolerant Architectures: Concepts and Design - Veríssimo, Neves.. (Correct)
....has one sender process and several recipient processes. In the rest of the section, we will make the classical separation of receiving a message from the network and delivering a message the result of the protocol execution. A reliable multicast protocol enforces the following two properties [6]: 1) all correct processes deliver the same messages; 2) if a correct sender transmits a message then all correct processes deliver this message. These rules do not imply any guarantees of delivery in case of a malicious sender. However, one of two things will happen, either the correct ....
....of the agreement later, when it receives the first message from the protocol. Then, it multicasts the message. Bracha and Toueg have shown that, assuming arbitrary faults, it is impossible to send reliable multicasts if there are more than f n 1 faulty processes in a 3 system with n processes [6]. BRM imposes constraints on the number of process failures that are similar to accidental fault tolerant protocols: for f faults, BRM requires n f 2 processes, instead of n 3f 1. In reality, BRM does not impose a minimum number of correct processes, but we say that the number of ....
Bracha, G., Toueg, S.: Asynchronous consensus and broadcast protocols. Journal of the ACM 32 (1985) 824-840
Efficient Update Diffusion in Byzantine Environments - Malkhi, Reiter (2001) (6 citations) (Correct)
....than b replicas corroborate each update must be employed. Prior studies of update diffusion in distributed systems that can suffer Byzantine failures have focused on singlesource broadcast protocols that provide reliable communication to replicas and replica agreement on the broadcast value (e.g. [LSP82, DS83, BT85, MR97]) sometimes with additional ordering guarantees on the delivery of updates from different sources (e.g. Rei94, CASD95, MM95] and [KMM98, CL99] The problem that we consider here is different from these works in the following ways. First, in these prior works, it is assumed that one replica ....
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM 32(4):824--840, October 1985.
Complete Specification of APIs and Protocols for the MAFTIA.. - Neves, (eds.) (2002) (1 citation) (Correct)
....process, in BAM, must deliver its messages in a same order. In the rest of the document, we will make the classical separation of receiving a message from the network and delivering a message the result of the protocol execution. Informally, a reliable multicast protocol enforces the following [7]: 1) all correct processes deliver the same messages, and 2) if a correct sender transmits a message then all correct processes deliver this message. For atomic multicast, total order must be added in the first assertive. These rules do not imply any guarantees of delivery in case of a malicious ....
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM, 32(4):824--840, October 1985.
Optimal Unconditional Information Diffusion - Malkhi, Pavlov, Sella (2001) (5 citations) (Correct)
....settings where the system exhibits benign failures only. Prior studies of update di usion in distributed systems that can su er Byzantine failures have focused on single source broadcast protocols that provide reliable communication to replicas and replica agreement on the broadcast value (e.g. [LSP82,DS83,BT85,MR97]) sometimes with additional ordering guarantees on the delivery of updates from di erent sources (e.g. Rei94,CASD95,MM95,KMM98,CL99] The problem that we consider here is di erent from these works in the following ways. First, in these prior works, it is assumed that one replica begins with ....
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM 32(4):824-840, October 1985.
Byzantine Fault-Tolerant Confidentiality - Jian Yin Arun (2002) (3 citations) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. In Journal of the Association for Computing Machinery, October 1995.
Fault-Scalable Byzantine Fault-Tolerant Services - Michael Abd-El-Malek Gregory (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM, 32(4):824--840. ACM, October 1985.
Low Complexity Byzantine-Resilient Consensus - Correia, Neves, Lung.. (2003) (1 citation) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM, 32(4):824--840, October 1985.
Byzantine Fault-Tolerant Confidentiality - Jian Yin Arun (2002) (3 citations) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. In Journal of the Association for Computing Machinery, October 1995.
Separating Agreement from Execution for Byzantine.. - Yin, Martin.. (2003) (3 citations) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. J. of the ACM, 32(4):824--840, October 1985.
Fault-Scalable Byzantine Fault-Tolerant Services - Michael Abd-El-Malek Gregory (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM, 32(4):824--840. ACM, October 1985.
On Fairness in Simulatability-based Cryptographic Systems - Backes, Hofheinz.. (2005) (Correct)
No context found.
Gabriel Bracha and Sam Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM, 32(4):824--840, 1985.
Byzantine Fault-Tolerant Confidentiality - Jian Yin Jean-Philippe (2002) (3 citations) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. In Journal of the Association for Computing Machinery, October 1995.
Byzantine Fault Tolerance on General Hybrid Adversary Structures - Kursawe, Freiling (2005) (1 citation) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM, 32(4):824--840, Oct. 1985.
Separating Agreement from Execution for Byzantine.. - Yin, Martin.. (2003) (3 citations) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. J. of the ACM, 32(4):824--840, October 1985.
Byzantine Fault Tolerance on General Hybrid Adversary Structures - Kursawe, Freiling (2005) (1 citation) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM, 32(4):824--840, Oct. 1985.
Reliable Broadcast in a Computational Hybrid Model with.. - Backes, Cachin (2003) (2 citations) (Correct)
No context found.
G. Bracha and S. Toueg, \Asynchronous consensus and broadcast protocols," Journal of the ACM, vol. 32, pp. 824-840, Oct. 1985.
Revisiting Liveness Properties in the Context of Secure Systems - Gärtner (2002) (Correct)
No context found.
Gabriel Bracha and Sam Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM, 32(4):824--840, October 1985.
How Dependable Are Distributed f Fault/ . . . - Sousa, Neves, Verissimo (2005) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM, 32(4):824--840, October 1985.
Low Complexity Byzantine-Resilient Consensus - Correia, Neves, Lung, Verissimo (2003) (1 citation) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM, 32(4):824--840, October 1985. 22
Project IST-1999-11583 - Malicious- And Accidental-Fault (Correct)
No context found.
G. Bracha and S. Toueg, "Asynchronous consensus and broadcast protocols," Journal of the ACM, vol. 32, pp. 824--840, Oct. 1985. 85
Low Complexity Byzantine-Resilient Consensus - Correia, Neves, Lung, Verissimo (2003) (1 citation) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM, 32(4):824--840, October 1985.
How to Tolerate Half Less One Byzantine Nodes in.. - Correia, Neves.. (2004) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM, 32(4):824-- 840, October 1985.
How to Tolerate Half Less One Byzantine Nodes in.. - Correia, Neves.. (2004) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM, 32(4):824--840, Oct. 1985.
Separating Agreement from Execution for Byzantine.. - Yin, Martin.. (2003) (3 citations) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. J. of the ACM, 32(4):824--840, October 1985.
Byzantine Fault-Tolerant Confidentiality - Jian Yin Arun (2002) (3 citations) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. In Journal of the Association for Computing Machinery, October 1995.
Formal Specification and Verification of the.. - Layouni, Hooman, Tahar (2003) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous Consensus and Broadcast Protocols. Journal of the ACM, 32(4):824--840, October 1985.
From Consensus to Atomic Broadcast: Time-Free.. - Correia, Neves.. (2004) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM, 32(4):824--840, October 1985.
Separating Agreement from Execution for - Zantine Fault Tolerant (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. J. of the ACM, 32(4):824-840, October 1985.
From Byzantine Agreement to Practical Survivability - Malkhi (2002) (1 citation) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM 32(4):824--840, October 1985.
On Diffusing Updates in a Byzantine Environment - Malkhi, Mansour, Reiter (1999) (5 citations) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM 32(4):824--840, October 1985.
Byzantine Disk Paxos: Optimal Resilience with.. - Abraham, Chockler.. (2004) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM, 32(4):824--840, October 1985.
Separating Agreement from Execution for Byzantine.. - Yin, Martin.. (2003) (3 citations) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. J. of the ACM, 32(4):824--840, October 1985.
Byzantine Fault-Tolerant Confidentiality - Yin, Martin, Venkataramani.. (2002) (3 citations) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. In Journal of the Association for Computing Machinery, October 1995.
Low Complexity Byzantine-Resilient Consensus - Correia, Neves, Lung, Verissimo (2003) (1 citation) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM, 32(4):824--840, October 1985. 22
Gossip with Malicious Parties - Malkhi, Pavlov, Sella (2003) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM 32(4):824-840, October 1985.
Revisiting Liveness Properties in the Context of Secure Systems - Gärtner (2002) (Correct)
No context found.
Gabriel Bracha and Sam Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM, 32(4):824--840, October 1985.
Byzantine Fault Detectors for Solving Consensus - Kihlstrom, Moser, Melliar-Smith (2003) (6 citations) (Correct)
No context found.
Bracha, G. and Toueg, S. (1985) Asynchronous consensus and broadcast protocols. J. ACM, 32, 824--840.
Efficient Update Diffusion in Byzantine Environments - Malkhi, Reiter, al. (2001) (6 citations) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM 32(4):824--840, October 1985.
Byzantine Disk Paxos: Optimal Resilience with.. - Abraham, Chockler.. (2004) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM, 32(4):824--840, October 1985.
Optimal Resilience Wait-Free Storage from Byzantine.. - Chockler, Keidar, Malkhi (2004) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM, 32(4):824-840, October 1985.
Byzantine Disk Paxos: Optimal Resilience with.. - Abraham, Chockler.. (2004) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM, 32(4):824--840, October 1985.
Hundreds of Impossibility Results for Distributed Computing - Fich, Ruppert (3 citations) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. J. ACM, 32(4):824--840, Oct. 1985.
Separating Agreement from Execution for Byzantine.. - Yin, Martin.. (2003) (3 citations) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. J. of the ACM, 32(4):824--840, October 1985.
Diffusion without False Rumors: On Propagating Updates in .. - Malkhi, Mansour, Reiter (2003) (3 citations) (Correct)
No context found.
G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM 32(4):824--840, October 1985.
Reliable Broadcast in a Computational Hybrid Model with.. - Backes, Cachin (2003) (2 citations) (Correct)
No context found.
G. Bracha and S. Toueg, \Asynchronous consensus and broadcast protocols," Journal of the ACM, vol. 32, pp. 824-840, Oct. 1985.
Secure Intrusion-tolerant Replication on the Internet - Christian Cachin Jonathan (2002) (18 citations) (Correct)
No context found.
G. Bracha and S. Toueg, "Asynchronous consensus and broadcast protocols," Journal of the ACM, vol. 32, pp. 824--840, Oct. 1985.
Hundreds of Impossibility Results for Distributed Computing - Fich, Ruppert (2003) (3 citations) (Correct)
No context found.
Gabriel Bracha and Sam Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM, 32(4), pages 824--840, October 1985.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC