TY - JOUR
T1 - A Byzantine Fault Tolerant Storage for Permissioned Blockchain
AU - Qi, Xiaodong
AU - Chen, Zhihao
AU - Zhang, Zhao
AU - Jin, Cheqing
AU - Zhou, Aoying
AU - Zhuo, Haizhen
AU - Xu, Quangqing
N1 - Publisher Copyright:
© 2021 ACM.
PY - 2021
Y1 - 2021
N2 - 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.
AB - 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.
KW - blockchain
KW - erasure coding
KW - pbft
KW - storage partition
UR - https://www.scopus.com/pages/publications/85108945129
U2 - 10.1145/3448016.3452744
DO - 10.1145/3448016.3452744
M3 - 会议文章
AN - SCOPUS:85108945129
SN - 0730-8078
SP - 2770
EP - 2774
JO - Proceedings of the ACM SIGMOD International Conference on Management of Data
JF - Proceedings of the ACM SIGMOD International Conference on Management of Data
T2 - 2021 International Conference on Management of Data, SIGMOD 2021
Y2 - 20 June 2021 through 25 June 2021
ER -