Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

FileDES: A Secure Scalable and Succinct Decentralized Encrypted Storage Network

Minghui Xu, Jiahao Zhang, Hechuan Guo, Xiuzhen Cheng, Dongxiao Yu, Qin Hu, Yijun Li, Yipu Wu

TL;DR

FileDES presents a privacy-preserving, scalable decentralized encrypted storage network by combining RSA/PRE-based encrypted storage, a novel Proof of Encrypted Storage (PoES) for succinct proofs, and a rollup-enabled batch verification framework. The design leverages PRE and zk-SNARKs to secure data while enabling efficient on-chain verification of storage proofs, and uses a random miner selection along with a DAG-Rider-based consensus to ensure consistency. Empirical results in WAN-scale experiments show FileDES achieving superior proof generation/verification throughput, reduced storage overhead, and better scalability compared with Filecoin, Sia, and Storj, highlighting practical impact for secure distributed storage. The work advances DSN security by addressing data privacy leakage, proof-system efficiency, and recurrent verification bottlenecks, enabling robust and auditable encrypted storage at scale.

Abstract

Decentralized Storage Network (DSN) is an emerging technology that challenges traditional cloud-based storage systems by consolidating storage capacities from independent providers and coordinating to provide decentralized storage and retrieval services. However, current DSNs face several challenges associated with data privacy and efficiency of the proof systems. To address these issues, we propose FileDES (\uline{D}ecentralized \uline{E}ncrypted \uline{S}torage), which incorporates three essential elements: privacy preservation, scalable storage proof, and batch verification. FileDES provides encrypted data storage while maintaining data availability, with a scalable Proof of Encrypted Storage (PoES) algorithm that is resilient to Sybil and Generation attacks. Additionally, we introduce a rollup-based batch verification approach to simultaneously verify multiple files using publicly verifiable succinct proofs. We conducted a comparative evaluation on FileDES, Filecoin, Storj and Sia under various conditions, including a WAN composed of up to 120 geographically dispersed nodes. Our protocol outperforms the others in terms of proof generation/verification efficiency, storage costs, and scalability.

FileDES: A Secure Scalable and Succinct Decentralized Encrypted Storage Network

TL;DR

FileDES presents a privacy-preserving, scalable decentralized encrypted storage network by combining RSA/PRE-based encrypted storage, a novel Proof of Encrypted Storage (PoES) for succinct proofs, and a rollup-enabled batch verification framework. The design leverages PRE and zk-SNARKs to secure data while enabling efficient on-chain verification of storage proofs, and uses a random miner selection along with a DAG-Rider-based consensus to ensure consistency. Empirical results in WAN-scale experiments show FileDES achieving superior proof generation/verification throughput, reduced storage overhead, and better scalability compared with Filecoin, Sia, and Storj, highlighting practical impact for secure distributed storage. The work advances DSN security by addressing data privacy leakage, proof-system efficiency, and recurrent verification bottlenecks, enabling robust and auditable encrypted storage at scale.

Abstract

Decentralized Storage Network (DSN) is an emerging technology that challenges traditional cloud-based storage systems by consolidating storage capacities from independent providers and coordinating to provide decentralized storage and retrieval services. However, current DSNs face several challenges associated with data privacy and efficiency of the proof systems. To address these issues, we propose FileDES (\uline{D}ecentralized \uline{E}ncrypted \uline{S}torage), which incorporates three essential elements: privacy preservation, scalable storage proof, and batch verification. FileDES provides encrypted data storage while maintaining data availability, with a scalable Proof of Encrypted Storage (PoES) algorithm that is resilient to Sybil and Generation attacks. Additionally, we introduce a rollup-based batch verification approach to simultaneously verify multiple files using publicly verifiable succinct proofs. We conducted a comparative evaluation on FileDES, Filecoin, Storj and Sia under various conditions, including a WAN composed of up to 120 geographically dispersed nodes. Our protocol outperforms the others in terms of proof generation/verification efficiency, storage costs, and scalability.
Paper Structure (23 sections, 3 theorems, 6 equations, 8 figures, 1 table, 2 algorithms)

This paper contains 23 sections, 3 theorems, 6 equations, 8 figures, 1 table, 2 algorithms.

Table of Contents

  1. Introduction
  2. Related Work
  3. Decentralized Storage Networks
  4. Blockchain-based Data Sharing
  5. Models and Preliminaries
  6. The DSN Model
  7. Adversary Model
  8. Preliminaries
  9. Unidirectional Proxy Re-Encryption (PRE)
  10. zk-SNARK
  11. The Design of FileDES
  12. Encrypted Storage
  13. Proof of Encrypted Storage (PoES)
  14. Batch Verification and File Retrieval
  15. Security Analysis
  16. ...and 8 more sections

Key Result

Theorem 1

An honest storage miner $\mathsf{SM}$ or rollup miner $\mathsf{RoM}$ can convince storage challengers by sending them valid $\pi_{\mathsf{POS}}$/$\pi_{\mathsf{POST}}$ or $\pi_{\mathsf{ROLL}}$; an adversary $\mathcal{A}$ without honestly storing files cannot forge a valid proof based on the public in

Figures (8)

  • Figure 1: Open challenges faced by today's DSNs.
  • Figure 2: An example of executing all protocols
  • Figure 3: The system architecture of FileDES
  • Figure 4: The proof generation time of PoS and PoSt
  • Figure 5: The storage cost of storage miners
  • ...and 3 more figures

Theorems & Definitions (8)

  • Definition 1: Sybil Attack
  • Definition 2: Generation Attack
  • Theorem 1: Unforgeability of $\pi_{\mathsf{POS}}$/$\pi_{\mathsf{POST}}/\pi_{\mathsf{ROLL}}$
  • proof
  • Theorem 2: Sybil and Generation Attack Resistance
  • proof
  • Theorem 3: Consistency
  • proof