A Reliable Distributed-Cloud Storage Based on Permissioned Blockchain

Traditional single-cloud storage suffers from single points of failure, leading to low data availability. As a result, it fails to meet users' demands for reliable cloud storage services. Therefore, the current cloud storage paradigm has shifted to distributed-cloud storage (e.g., multi-cloud storage, JointCloud storage), where users store multiple replicas of data across multiple Cloud Service Providers (CSPs). However, this imposes significant storage pressure on CSPs. To reduce costs and maximize profits, some malicious CSPs may delete user data, undermining trust in cloud services and hindering the growth of the cloud computing industry. To address this issue, we propose a novel distributed-cloud storage based on permissioned blockchain, which effectively reduces storage costs while ensuring data availability. Firstly, we integrate Byzantine Fault Tolerance in permissioned blockchain with erasure coding (EC) to replace the traditional multi-cloud multi-replica storage approach. This integration significantly reduces storage costs while providing an efficient means for data recovery. Based on blockchain, we further propose a data integrity auditing approach that eliminates reliance on semi-trusted third-party auditors and enables decentralized data integrity verification. Combined with this auditing approach, our EC-based data recovery approach ensures data availability while enhancing users' trust in distributed-cloud storage. Theoretical analysis indicates that our scheme reduces storage overhead from <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$O(n)$</tex-math></inline-formula> to <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$O(1)$</tex-math></inline-formula> with <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$n$</tex-math></inline-formula> CSPs while ensuring data availability. Meanwhile, experimental results demonstrate that computational overhead is reduced by approximately 78% compared to traditional multi-cloud multi-replica storage, achieving the cost-effective and highly reliable distributed-cloud storage.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Services Computing
Published
2025-04-29
DOI
https://doi.org/10.1109/tsc.2025.3565388
Citations
5
Primary Topic
Cloud Computing and Resource Management
Type
article
Field-Weighted Citation Impact
16.23
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Reliable Distributed-Cloud Storage Based on Permissioned Blockchain

Min Huang, Kaimin Zhang, Lin Qiu, Bo Yi et al.
5 citations
IEEE Transactions on Services Computing
Cloud Computing and Resource Management
16.23
article

A Reliable Distributed-Cloud Storage Based on Permissioned Blockchain

Min Huang, Kaimin Zhang, Lin Qiu, Bo Yi, Xingwei Wang, Jingjing Guo, Enliang Lv
article en
5 citations

Abstract

Traditional single-cloud storage suffers from single points of failure, leading to low data availability. As a result, it fails to meet users' demands for reliable cloud storage services. Therefore, the current cloud storage paradigm has shifted to distributed-cloud storage (e.g., multi-cloud storage, JointCloud storage), where users store multiple replicas of data across multiple Cloud Service Providers (CSPs). However, this imposes significant storage pressure on CSPs. To reduce costs and maximize profits, some malicious CSPs may delete user data, undermining trust in cloud services and hindering the growth of the cloud computing industry. To address this issue, we propose a novel distributed-cloud storage based on permissioned blockchain, which effectively reduces storage costs while ensuring data availability. Firstly, we integrate Byzantine Fault Tolerance in permissioned blockchain with erasure coding (EC) to replace the traditional multi-cloud multi-replica storage approach. This integration significantly reduces storage costs while providing an efficient means for data recovery. Based on blockchain, we further propose a data integrity auditing approach that eliminates reliance on semi-trusted third-party auditors and enables decentralized data integrity verification. Combined with this auditing approach, our EC-based data recovery approach ensures data availability while enhancing users' trust in distributed-cloud storage. Theoretical analysis indicates that our scheme reduces storage overhead from <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$O(n)$</tex-math></inline-formula> to <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$O(1)$</tex-math></inline-formula> with <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$n$</tex-math></inline-formula> CSPs while ensuring data availability. Meanwhile, experimental results demonstrate that computational overhead is reduced by approximately 78% compared to traditional multi-cloud multi-replica storage, achieving the cost-effective and highly reliable distributed-cloud storage.

IEEE Transactions on Services ComputingVol. 18(3)
Northeastern University (CN)
Openalex Percentile: Top 1%
Cloud Computing and Resource Management
16.23
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.