Xiaodong Qi
Zhihao Chen
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.
Supplemental Material
- REFERENCES [1] 2020. PBFT. https://github.com/rleonardco/fabric-0.6.Google Scholar
- 2020. Statista. https://www.statista.com/.Google Scholar
- Dan Boneh, Craig Gentry, et al. 2003. A survey of two signature aggregation techniques. RSA cryptobytes 6, 2 (2003), 1--10.Google Scholar
- Conrad Burchert et al. 2018. Scalable funding of bitcoin micropayment channel networks. Royal Society open science (2018).Google Scholar
- Miguel Castro, Barbara Liskov, et al. 1999. Practical Byzantine fault tolerance. In OSDI.Google Scholar
- Haibo Chen et al. 2017. Efficient and available in-memory KV-store with hybrid erasure coding and replication. TOS 13, 3 (2017), 25.Google Scholar
- Sanjay Ghemawat, Howard Gobioff, and Shun-Tak Leung. 2003. The Google file system. In SOSP.Google Scholar
- Satoshi Nakamoto. 2008. Bitcoin: A peer-to-peer electronic cash system. (2008).Google Scholar
- Xiaodong Qi, Zhao Zhang, Cheqing Jin, and Aoying Zhou. 2020. A Reliable Storage Partition for Permissioned Blockchain. IEEE TKDE 33, 1 (2020), 14--27.Google Scholar
- I. S. Reed and G. Solomon. 1960. Polynomial Codes Over Certain Finite Fields. Journal of the Society for Industrial Applied Mathematics (1960).Google Scholar
- Hakim Weatherspoon et al. 2002. Erasure coding vs. replication: A quantitative comparison. In International Workshop on Peer-to-Peer Systems. Springer.Google Scholar
- GavinWood et al. 2014. Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper 151, 2014 (2014), 1--32.Google Scholar
Index Terms
- A Byzantine Fault Tolerant Storage for Permissioned Blockchain
Recommendations
Low-overhead byzantine fault-tolerant storage
SOSP '07This paper presents an erasure-coded Byzantine fault-tolerant block storage protocol that is nearly as efficient as protocols that tolerate only crashes. Previous Byzantine fault-tolerant block storage protocols have either relied upon replication, ...
Multi-Threshold Byzantine Fault Tolerance
CCS '21: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications SecurityClassic Byzantine fault tolerant (BFT) protocols are designed for a specific timing model, most often one of the following: synchronous, asynchronous or partially synchronous. It is well known that the timing model and fault tolerance threshold present ...
Low-overhead byzantine fault-tolerant storage
SOSP '07: Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principlesThis paper presents an erasure-coded Byzantine fault-tolerant block storage protocol that is nearly as efficient as protocols that tolerate only crashes. Previous Byzantine fault-tolerant block storage protocols have either relied upon replication, ...
Comments