short-paper

A Byzantine Fault Tolerant Storage for Permissioned Blockchain

Authors:

Quangqing XuAuthors Info & Claims

SIGMOD '21: Proceedings of the 2021 International Conference on Management of Data

Pages 2770 - 2774

https://doi.org/10.1145/3448016.3452744

Published: 18 June 2021 Publication History

Get Access

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.

Supplementary Material

MP4 File (3448016.3452744.mp4)

Download
106.97 MB

References

[1]

REFERENCES [1] 2020. PBFT. https://github.com/rleonardco/fabric-0.6.

Google Scholar

[2]

2020. Statista. https://www.statista.com/.

Google Scholar

[3]

Dan Boneh, Craig Gentry, et al. 2003. A survey of two signature aggregation techniques. RSA cryptobytes 6, 2 (2003), 1--10.

Google Scholar

[4]

Conrad Burchert et al. 2018. Scalable funding of bitcoin micropayment channel networks. Royal Society open science (2018).

Google Scholar

[5]

Miguel Castro, Barbara Liskov, et al. 1999. Practical Byzantine fault tolerance. In OSDI.

Google Scholar

[6]

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

[7]

Sanjay Ghemawat, Howard Gobioff, and Shun-Tak Leung. 2003. The Google file system. In SOSP.

Google Scholar

[8]

Satoshi Nakamoto. 2008. Bitcoin: A peer-to-peer electronic cash system. (2008).

Google Scholar

[9]

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

[10]

I. S. Reed and G. Solomon. 1960. Polynomial Codes Over Certain Finite Fields. Journal of the Society for Industrial Applied Mathematics (1960).

Google Scholar

[11]

Hakim Weatherspoon et al. 2002. Erasure coding vs. replication: A quantitative comparison. In International Workshop on Peer-to-Peer Systems. Springer.

Google Scholar

[12]

GavinWood et al. 2014. Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper 151, 2014 (2014), 1--32.

Google Scholar

Cited By

View all

Iordache SPatilea CPaduraru C(2024)Enhancing Autonomous Vehicle Safety with Blockchain Technology: Securing Vehicle Communication and AI SystemsFuture Internet10.3390/fi1612047116:12(471)Online publication date: 18-Dec-2024
https://doi.org/10.3390/fi16120471
Tan PWang SZhou Y(2023)LDAGB: A Lightweight DAG-based Blockchain2023 3rd International Conference on Consumer Electronics and Computer Engineering (ICCECE)10.1109/ICCECE58074.2023.10135476(583-589)Online publication date: 6-Jan-2023
https://doi.org/10.1109/ICCECE58074.2023.10135476
Cai NDeng JGao Y(2023)Research on the Reasoning Credibility of Privacy Infringement Risk Monitoring System Based on Blockchain2023 International Conference on Blockchain Technology and Information Security (ICBCTIS)10.1109/ICBCTIS59921.2023.00040(217-224)Online publication date: Jun-2023
https://doi.org/10.1109/ICBCTIS59921.2023.00040
Show More Cited By

Index Terms

A Byzantine Fault Tolerant Storage for Permissioned Blockchain
1. Computing methodologies
  1. Distributed computing methodologies
    1. Distributed algorithms

Recommendations

Low-overhead byzantine fault-tolerant storage
SOSP '07

This 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, ...
ZK-BFT: A Zero-knowledge and Byzantine Fault Tolerant Consensus for Permissioned Blockchain Networks
ICBTA '23: Proceedings of the 2023 6th International Conference on Blockchain Technology and Applications

Consensus algorithms play an essential role in blockchains, directly impacting their performance. These algorithms involve validating and ordering pending transactions into new blocks, a process that exposes data to consensus nodes, raising privacy ...
Multi-Threshold Byzantine Fault Tolerance
CCS '21: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security

Classic 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 ...

Comments

Information & Contributors

Information

Published In

SIGMOD '21: Proceedings of the 2021 International Conference on Management of Data

June 2021

2969 pages

ISBN:9781450383431

DOI:10.1145/3448016

General Chairs:
Guoliang Li
Tsinghua University (China)
,
Zhanhuai Li
Northwestern Polytechnical University (China)
,
Program Chairs:
Stratos Idreos
Harvard University (USA)
,
Divesh Srivastava
AT&T (USA)

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 June 2021

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Short-paper

Funding Sources

ECNU Academic Innovation Promotion Program for Excellent Doctoral Students
National Science Foundation

Conference

SIGMOD/PODS '21

Sponsor:

SIGMOD

SIGMOD/PODS '21: International Conference on Management of Data

June 20 - 25, 2021

Virtual Event, China

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
792
Total Downloads

Downloads (Last 12 months)74
Downloads (Last 6 weeks)10

Reflects downloads up to 03 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Iordache SPatilea CPaduraru C(2024)Enhancing Autonomous Vehicle Safety with Blockchain Technology: Securing Vehicle Communication and AI SystemsFuture Internet10.3390/fi1612047116:12(471)Online publication date: 18-Dec-2024
https://doi.org/10.3390/fi16120471
Tan PWang SZhou Y(2023)LDAGB: A Lightweight DAG-based Blockchain2023 3rd International Conference on Consumer Electronics and Computer Engineering (ICCECE)10.1109/ICCECE58074.2023.10135476(583-589)Online publication date: 6-Jan-2023
https://doi.org/10.1109/ICCECE58074.2023.10135476
Cai NDeng JGao Y(2023)Research on the Reasoning Credibility of Privacy Infringement Risk Monitoring System Based on Blockchain2023 International Conference on Blockchain Technology and Information Security (ICBCTIS)10.1109/ICBCTIS59921.2023.00040(217-224)Online publication date: Jun-2023
https://doi.org/10.1109/ICBCTIS59921.2023.00040
Wang HLi HWang ZZhao FYao YChen YQin TLu PShi J(2023)Optimizing Read Performance in Lightweight Blockchain with Cooperative Storage Scheme2023 Fifth International Conference on Blockchain Computing and Applications (BCCA)10.1109/BCCA58897.2023.10338901(150-157)Online publication date: 24-Oct-2023
https://doi.org/10.1109/BCCA58897.2023.10338901
Zhu CLi JZhong ZYue CZhang M(2023)A Survey on the Integration of Blockchains and DatabasesData Science and Engineering10.1007/s41019-023-00212-z8:2(196-219)Online publication date: 24-Apr-2023
https://doi.org/10.1007/s41019-023-00212-z

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

Supplementary Material

References

Cited By

Index Terms

Recommendations

Low-overhead byzantine fault-tolerant storage

ZK-BFT: A Zero-knowledge and Byzantine Fault Tolerant Consensus for Permissioned Blockchain Networks

Multi-Threshold Byzantine Fault Tolerance

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Funding Sources

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations