BChain: Byzantine Replication with High Throughput and Embedded Reconfiguration

Duan, Sisi; Meling, Hein; Peisert, Sean; Zhang, Haibin

doi:10.1007/978-3-319-14472-6_7

Cited by 49 publications

(37 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Full BFT protocols, such as Shuttle [22] or BChain [10] can be used to also implement full consensus with a chain based protocol. However, other than RelBC, these protocols rely on view change and an eventually correct leader to guarantee LC2, even with a single proposer.…”

Section: The Bft-publishermentioning

confidence: 99%

See 1 more Smart Citation

Towards Byzantine fault tolerant publish/subscribe

Jehl

Meling

2013

Proceedings of the 9th Workshop on Hot Topics in Dependable Systems

Self Cite

View full text Add to dashboard Cite

More than a decade of research has gone into techniques aimed at tolerating arbitrary failures in client/server interaction, using consensus based replication. These works made Byzantine fault tolerance possible [5], competitive [18], robust [7], and feasible to apply [6]. In this paper we establish a connection between the pub/sub interaction model and consensus based replication protocols, that makes the above results applicable to the design of large scale eventbased middleware. We propose a Byzantine fault tolerant pub/sub system, on a tree-based overlay, tolerating a configurable number of failures in any part of the system, with minimal divergence from traditional pub/sub specifications and forwarding schemes.

show abstract

Section: The Bft-publishermentioning

confidence: 99%

“…Note that when more then f nodes are suspected to be Byzantine, the publisher can choose to run several different chains simultaneously with the same publication. BChain [10] develops tactics for choosing 2f +1 correct nodes out of 3f + 1.…”

Section: The Bft-publishermentioning

confidence: 99%

Towards Byzantine fault tolerant publish/subscribe

Jehl

Meling

2013

Proceedings of the 9th Workshop on Hot Topics in Dependable Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…Failure detection. Finally, FastBFT adapts a failure detection mechanism from [11] to tolerate non-primary faults. Notice that a faulty node may simply crash or send a wrong share.…”

Section: Fastbft Overviewmentioning

confidence: 99%

Scalable Byzantine Consensus via Hardware-Assisted Secret Sharing

Liu

Li²,

Karame³

et al. 2019

IEEE Trans. Comput.

177

View full text Add to dashboard Cite

The surging interest in blockchain technology has revitalized the search for effective Byzantine consensus schemes. In particular, the blockchain community has been looking for ways to effectively integrate traditional Byzantine fault-tolerant (BFT) protocols into a blockchain consensus layer allowing various financial institutions to securely agree on the order of transactions. However, existing BFT protocols can only scale to tens of nodes due to their O(n 2 ) message complexity. In this paper, we propose FastBFT, a fast and scalable BFT protocol. At the heart of FastBFT is a novel message aggregation technique that combines hardware-based trusted execution environments (TEEs) with lightweight secret sharing. Combining this technique with several other optimizations (i.e., optimistic execution, tree topology and failure detection), FastBFT achieves low latency and high throughput even for large scale networks. Via systematic analysis and experiments, we demonstrate that FastBFT has better scalability and performance than previous BFT protocols.

show abstract

“…(2) The consensus layer (see Sec. IV) deals with ordering of transactions and we divide it according to a type of the protocol used to Byzantine Fault Tolerant (e.g., [34], [13], [29], [47], [92]), Proof-of-Resource (e.g., [95], [48], [99], [89], [108]), and Proof-of-Stake (e.g., [10], [75]) protocols. (3) The replicated state machine (RSM) layer (see Sec.…”

Section: Countermeasuresmentioning

confidence: 99%

A Security Reference Architecture for Blockchains

Homoliak

Venugopalan

Hum

et al. 2019

2019 IEEE International Conference on Blockchain (Blockchain)

View full text Add to dashboard Cite

Due to their interesting features, blockchains have become popular in recent years. They are full-stack systems where security is a critical factor for their success. The main focus of this work is to systematize knowledge about security and privacy issues of blockchains. To this end, we propose a security reference architecture based on models that demonstrate the stacked hierarchy of various threats (similar to the ISO/OSI hierarchy) as well as threat-risk assessment using ISO/IEC 15408. In contrast to the previous surveys [39], [8], [139], [20], we focus on the categorization of security incidents based on their origins and using the proposed architecture we present existing prevention and mitigation techniques. The scope of our work mainly covers aspects related to decentralized nature of blockchains, while we mention common operational security issues and countermeasures only tangentially.Index Terms-blockchain • distributed ledgers • reference architecture • threat-risk assessment arXiv:1904.06898v1 [cs.CR]

show abstract

BChain: Byzantine Replication with High Throughput and Embedded Reconfiguration

Cited by 49 publications

References 26 publications

Towards Byzantine fault tolerant publish/subscribe

Towards Byzantine fault tolerant publish/subscribe

Scalable Byzantine Consensus via Hardware-Assisted Secret Sharing

A Security Reference Architecture for Blockchains

Contact Info

Product

Resources

About