A Byzantine Fault Tolerant Storage for Permissioned Blockchain

6Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The full-replication data storage mechanism, as commonly utilized in existing blockchains, suffers from poor scalability, since it requires every node to preserve a complete copy of the whole block data locally to tolerant potential Byzantine failures. In a hostile environment, the malicious node may discard or tamper data deliberately. Thus, existing distributed storage method, which partitions data into multiple parts and distributes them over all nodes, cannot suit for blockchains. This demonstration showcases BFT-Store, a novel distributed storage engine for blockchains to break full-replication by integrating erasure coding with Byzantine Fault Tolerance (BFT) consensus protocol. This demonstration will (\romannumeral1) allow audience members to see how BFT-Store partitions block data over all nodes to reduce the storage occupation of system, and (\romannumeral2) allow audience members to see how BFT-Store recovers blocks under distributed scenario even with Byzantine failure.

Cite

CITATION STYLE

APA

Qi, X., Chen, Z., Zhang, Z., Jin, C., Zhou, A., Zhuo, H., & Xu, Q. (2021). A Byzantine Fault Tolerant Storage for Permissioned Blockchain. In Proceedings of the ACM SIGMOD International Conference on Management of Data (pp. 2770–2774). Association for Computing Machinery. https://doi.org/10.1145/3448016.3452744

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free