Secure and Efficient Asynchronous Broadcast Protocols

Cachin, Christian; Kursawe, Klaus; Petzold, Frank; Shoup, Victor

doi:10.1007/3-540-44647-8_31

Cited by 248 publications

(284 citation statements)

References 20 publications

(25 reference statements)

Supporting

Mentioning

282

Contrasting

Unclassified

Order By: Relevance

“…The reason is as follows. Most Byzantine fault tolerant protocols use reliable broadcast and validity check mechanisms [4], [5], [7], [12]. The malicious behaviors mentioned above are detected immediately by these mechanisms, and cannot have an effect on performance of the replication.…”

Section: Performance Evaluationmentioning

confidence: 99%

A Method of Parallelizing Consensuses for Accelerating Byzantine Fault Tolerance

Nakamura

Araragi

Masuzawa

et al. 2014

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYWe propose a new method that accelerates asynchronous Byzantine Fault Tolerant (BFT) protocols designed on the principle of state machine replication. State machine replication protocols ensure consistency among replicas by applying operations in the same order to all of them. A naive way to determine the application order of the operations is to repeatedly execute the BFT consensus to determine the next executed operation, but this may introduce inefficiency caused by waiting for the completion of the previous execution of the consensus protocol. To reduce this inefficiency, our method allows parallel execution of the consensuses while keeping consistency of the consensus results at the replicas. In this paper, we also prove the correctness of our method and experimentally compare it with the existing method in terms of latency and throughput. The evaluation results show that our method makes a BFT protocol three or four times faster than the existing one when some machines or message transmissions are delayed.

show abstract

Section: Performance Evaluationmentioning

confidence: 99%

A Method of Parallelizing Consensuses for Accelerating Byzantine Fault Tolerance

Nakamura

Araragi

Masuzawa

et al. 2014

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

show abstract

“…That is, due to its generality, state machine replication is constrained by fundamental impossibility results [Fischer85,Herlihy91,Jayanti98] [Cachin01]). That is, the generality of state machine replication is, in fact, detrimental to the correctness properties that can be offered for read-write storage, by inducing additional assumptions to gain liveness.…”

Section: Comparison With Pre-existing Technologymentioning

confidence: 99%

Increasing Intrusion Tolerance via Scalable Redundancy

Reiter¹,

Ganger²

2006

View full text Add to dashboard Cite

Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden to

show abstract

“…This follows from the Unpredictability property of the coin tossing scheme and P6; for more details see [10].…”

Section: Propositionmentioning

confidence: 99%

Analysing Randomized Distributed Algorithms

Norman

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, message routing and cache management. The appeal of randomized algorithms is their simplicity and elegance. However, this comes at a cost: the analysis of such systems become very complex, particularly in the context of distributed computation. This arises through the interplay between probability and nondeterminism. To prove a randomized distributed algorithm correct one usually involves two levels: classical, assertion-based reasoning, and a probabilistic analysis based on a suitable probability space on computations. In this paper we describe a number of approaches which allows us to verify the correctness of randomized distributed algorithms.

show abstract

Secure and Efficient Asynchronous Broadcast Protocols

Cited by 248 publications

References 20 publications

A Method of Parallelizing Consensuses for Accelerating Byzantine Fault Tolerance

A Method of Parallelizing Consensuses for Accelerating Byzantine Fault Tolerance

Increasing Intrusion Tolerance via Scalable Redundancy

Analysing Randomized Distributed Algorithms

Contact Info

Product

Resources

About