Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
11 tokens/sec
GPT-4o
12 tokens/sec
Gemini 2.5 Pro Pro
40 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
37 tokens/sec
DeepSeek R1 via Azure Pro
33 tokens/sec
2000 character limit reached

BFT-DSN: A Byzantine Fault Tolerant Decentralized Storage Network (2402.12889v1)

Published 20 Feb 2024 in cs.CR

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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (25)
  1. D. Vorick and L. Champine, “Sia: Simple decentralized storage,” Retrieved May, vol. 8, p. 2018, 2014.
  2. S. Wilkinson, T. Boshevski, J. Brandoff, and V. Buterin, “Storj a peer-to-peer cloud storage network,” 2014.
  3. N. Alhaddad, S. Duan, M. Varia, and H. Zhang, “Succinct erasure coding proof systems,” Cryptology ePrint Archive, Paper 2021/1500, 2021, https://eprint.iacr.org/2021/1500. [Online]. Available: https://eprint.iacr.org/2021/1500
  4. X. Qi, Z. Zhang, C. Jin, and A. Zhou, “A reliable storage partition for permissioned blockchain,” IEEE Transactions on Knowledge and Data Engineering, vol. 33, no. 1, p. 14–27, Jan. 2021.
  5. X. Wang, S. Azouvi, and M. Vukolić, “Security analysis of filecoin’s expected consensus in the byzantine vs honest model,” no. arXiv:2308.06955, Aug. 2023, arXiv:2308.06955 [cs]. [Online]. Available: http://arxiv.org/abs/2308.06955
  6. M. Castro, B. Liskov et al., “Practical byzantine fault tolerance,” in OsDI, vol. 99, no. 1999, 1999, pp. 173–186.
  7. E. Buchman, “Tendermint: Byzantine fault tolerance in the age of blockchains,” Ph.D. dissertation, University of Guelph, Jun 2016. [Online]. Available: http://hdl.handle.net/10214/9769
  8. A. Miller, Y. Xia, K. Croman, E. Shi, and D. Song, “The honey badger of bft protocols,” in Proceedings of the 2016 ACM SIGSAC conference on computer and communications security, 2016, pp. 31–42.
  9. M. Yin, D. Malkhi, M. K. Reiter, G. G. Gueta, and I. Abraham, “Hotstuff: Bft consensus with linearity and responsiveness,” in Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019, pp. 347–356.
  10. the Swarm team. (2021) Swarm: Storage and communication infrastructure for a self-sovereign digital society. [Online]. Available: https://www.ethswarm.org/swarm-whitepaper.pdf
  11. V. Buterin et al., “A next-generation smart contract and decentralized application platform,” white paper, vol. 3, no. 37, pp. 2–1, 2014.
  12. P. Labs. (2017) Filecoin: A decentralized storage network.
  13. H. Guo, M. Xu, J. Zhang, C. Liu, D. Yu, S. Dustdar, and X. Cheng, “Filedag: A multi-version decentralized storage network built on dag-based blockchain,” IEEE Transactions on Computers, 2023.
  14. I. Keidar, E. Kokoris-Kogias, O. Naor, and A. Spiegelman, “All you need is dag,” in Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, ser. PODC’21.   New York, NY, USA: Association for Computing Machinery, 2021, pp. 165–175. [Online]. Available: https://doi.org/10.1145/3465084.3467905
  15. A. G. Dimakis, V. Prabhakaran, and K. Ramchandran, “Decentralized erasure codes for distributed networked storage,” IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2809–2816, 2006.
  16. H.-Y. Lin and W.-G. Tzeng, “A secure decentralized erasure code for distributed networked storage,” IEEE transactions on Parallel and Distributed Systems, vol. 21, no. 11, pp. 1586–1594, 2010.
  17. C. Huang, M. Chen, and J. Li, “Pyramid codes: Flexible schemes to trade space for access efficiency in reliable data storage systems,” ACM Transactions on Storage, vol. 9, no. 1, p. 1–28, Mar 2013.
  18. K. V. Rashmi, N. B. Shah, and K. Ramchandran, “A piggybacking design framework for read-and download-efficient distributed storage codes,” IEEE Transactions on Information Theory, vol. 63, no. 9, p. 5802–5820, Sep 2017.
  19. M. Silberstein, L. Ganesh, Y. Wang, L. Alvisi, and M. Dahlin, “Lazy means smart: Reducing repair bandwidth costs in erasure-coded distributed storage,” in Proceedings of International Conference on Systems and Storage, ser. SYSTOR 2014.   New York, NY, USA: Association for Computing Machinery, Jun 2014, p. 1–7. [Online]. Available: https://doi.org/10.1145/2611354.2611370
  20. I. S. Reed and G. Solomon, “Polynomial codes over certain finite fields,” Journal of the society for industrial and applied mathematics, vol. 8, no. 2, pp. 300–304, 1960.
  21. J. Hendricks, G. R. Ganger, and M. K. Reiter, “Verifying distributed erasure-coded data,” in Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, ser. PODC ’07.   New York, NY, USA: Association for Computing Machinery, Aug 2007, p. 139–146. [Online]. Available: https://dl.acm.org/doi/10.1145/1281100.1281122
  22. S. Das, P. Camacho, Z. Xiang, J. Nieto, B. Bunz, and L. Ren, “Threshold signatures from inner product argument: Succinct, weighted, and multi-threshold,” Cryptology ePrint Archive, Paper 2023/598, 2023, https://eprint.iacr.org/2023/598. [Online]. Available: https://eprint.iacr.org/2023/598
  23. A. Juels and B. S. Kaliski, “Pors: proofs of retrievability for large files,” in Proceedings of the 14th ACM conference on Computer and communications security, ser. CCS ’07.   New York, NY, USA: Association for Computing Machinery, Oct. 2007, p. 584–597. [Online]. Available: https://dl.acm.org/doi/10.1145/1315245.1315317
  24. J. Kwon, “Tendermint: Consensus without mining,” Draft v. 0.6, fall, vol. 1, no. 11, pp. 1–11, 2014.
  25. M. I. Khalid, I. Ehsan, A. K. Al-Ani, J. Iqbal, S. Hussain, S. S. Ullah, and Nayab, “A comprehensive survey on blockchain-based decentralized storage networks,” IEEE Access, vol. 11, p. 10995–11015, 2023.
Citations (2)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now