Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

BFT-DSN: A Byzantine Fault Tolerant Decentralized Storage Network

Hechuan Guo, Minghui Xu, Jiahao Zhang, Chunchi Liu, Rajiv Ranjan, Dongxiao Yu, Xiuzhen Cheng

TL;DR

This work tackles verifiability gaps in erasure-coded DSNs and the need for optimal Byzantine fault-tolerant consensus by introducing BFT-DSN, which combines publicly verifiable erasure coding via homomorphic fingerprints with a storage-weighted BFT (SW-BFT) consensus. The design unifies EC, BFT consensus, and threshold signatures under a Merkle-tree based Proof of Storage, operating in a consortium DSN with $n=3f+1$ sectors and $f=floor((n-1)/3)$ potential Byzantine sectors. It is the first DSN to claim and demonstrate concurrent BFT erasure coding and BFT consensus with optimal resiliency, using a weighted voting scheme that reflects actual storage contributions. Experiments indicate BFT-DSN achieves comparable storage costs and latency to state-of-the-art DSNs while delivering superior resilience to Byzantine faults.

Abstract

With the rapid development of blockchain and its applications, the amount of data stored on decentralized storage networks (DSNs) has grown exponentially. DSNs bring together affordable storage resources from around the world to provide robust, decentralized storage services for tens of thousands of decentralized applications (dApps). However, existing DSNs do not offer verifiability when implementing erasure coding for redundant storage, making them vulnerable to Byzantine encoders. Additionally, there is a lack of Byzantine fault-tolerant consensus for optimal resilience in DSNs. This paper introduces BFT-DSN, a Byzantine fault-tolerant decentralized storage network designed to address these challenges. BFT-DSN combines storage-weighted BFT consensus with erasure coding and incorporates homomorphic fingerprints and weighted threshold signatures for decentralized verification. The implementation of BFT-DSN demonstrates its comparable performance in terms of storage cost and latency as well as superior performance in Byzantine resilience when compared to existing industrial decentralized storage networks.

BFT-DSN: A Byzantine Fault Tolerant Decentralized Storage Network

TL;DR

This work tackles verifiability gaps in erasure-coded DSNs and the need for optimal Byzantine fault-tolerant consensus by introducing BFT-DSN, which combines publicly verifiable erasure coding via homomorphic fingerprints with a storage-weighted BFT (SW-BFT) consensus. The design unifies EC, BFT consensus, and threshold signatures under a Merkle-tree based Proof of Storage, operating in a consortium DSN with sectors and potential Byzantine sectors. It is the first DSN to claim and demonstrate concurrent BFT erasure coding and BFT consensus with optimal resiliency, using a weighted voting scheme that reflects actual storage contributions. Experiments indicate BFT-DSN achieves comparable storage costs and latency to state-of-the-art DSNs while delivering superior resilience to Byzantine faults.

Abstract

With the rapid development of blockchain and its applications, the amount of data stored on decentralized storage networks (DSNs) has grown exponentially. DSNs bring together affordable storage resources from around the world to provide robust, decentralized storage services for tens of thousands of decentralized applications (dApps). However, existing DSNs do not offer verifiability when implementing erasure coding for redundant storage, making them vulnerable to Byzantine encoders. Additionally, there is a lack of Byzantine fault-tolerant consensus for optimal resilience in DSNs. This paper introduces BFT-DSN, a Byzantine fault-tolerant decentralized storage network designed to address these challenges. BFT-DSN combines storage-weighted BFT consensus with erasure coding and incorporates homomorphic fingerprints and weighted threshold signatures for decentralized verification. The implementation of BFT-DSN demonstrates its comparable performance in terms of storage cost and latency as well as superior performance in Byzantine resilience when compared to existing industrial decentralized storage networks.
Paper Structure (26 sections, 4 theorems, 10 equations, 8 figures, 1 table, 2 algorithms)

This paper contains 26 sections, 4 theorems, 10 equations, 8 figures, 1 table, 2 algorithms.

Table of Contents

  1. Introduction
  2. Related Work, Preliminaries, and Models
  3. Related Work
  4. Preliminaries
  5. Decentralized Storage Network (DSN)
  6. Erasure Coding (EC)
  7. Homomorphic Fingerprints (HF)
  8. Weighted Threshold Signature (WTS)
  9. Models and Goals
  10. System Model
  11. Threat Model
  12. Design Goals
  13. BFT-DSN Design
  14. Overview
  15. The Put Operation in BFT-DSN
  16. ...and 11 more sections

Key Result

Theorem 1

(Soundness of the PoS algorithm in BFT-DSN). A miner can generate a valid PoS for a sector if and only if it is storing the data that belongs to that sector.

Figures (8)

  • Figure 1: An attack on EC-based storage by a Byzantine encoder
  • Figure 2: An overview on BFT-DSN
  • Figure 3: The PoS scheme in BFT-DSN
  • Figure 4: The Block diagram of BFT-DSN
  • Figure 5: File availability with different proportion of storage resources controlled by Byzantine adversaries
  • ...and 3 more figures

Theorems & Definitions (8)

  • Theorem 1
  • proof
  • Theorem 2
  • proof
  • Lemma 1
  • proof
  • Theorem 3
  • proof