BLA: Byzantine-Tolerant Lazy Auditing Framework for Decentralized Storage Data Integrity

With the rise of blockchain technology, the trend toward decentralization has spread to the field of remote storage, leading to the emergence of decentralized storage as a promising model. This change is highlighted by its features of open and fair access, reduced dependence on intermediaries, and strong privacy protections. However, similar to centralized storage, the decentralization of data management presents challenges, including the separation of ownership and control, along with the need for integrity auditing on externally managed data. The current popular centralized auditing model for the mainstream cloud storage cannot be directly used for decentralized storage environments. Additionally, Homomorphic Verification Tag (HVT)-based auditing models encounter significant problems such as high computational costs and inefficient auditing processes. In response to these needs, we introduce a novel Byzantine-tolerant Lazy Auditing framework (BLA) to ensure data integrity in decentralized storage settings. A key innovation is the hierarchical architecture used: the upper level employs a simplified Practical Byzantine Fault Tolerance (PBFT) protocol to help nodes reach a consensus on data integrity audits. At the lower level, nodes are grouped into clusters based on criteria such as accessibility, organized using a block design strategy. This approach reduces unnecessary information exchange during the auditing process. It maximizes parallel processing and strengthens fault tolerance and system resilience. By distributing data, it also reduces the impact of node failures. Our theoretical analyses and empirical evaluations clearly show that BLA reduces communication complexity compared with conventional PBFT protocols. Additionally, when compared with traditional HVT-based schemes, BLA demonstrates better storage efficiency and improved computational performance, making it a viable and effective solution for data integrity auditing in decentralized storage systems.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Storage
Published
2025-04-22
DOI
https://doi.org/10.1145/3731542
Citations
1
Primary Topic
Cloud Data Security Solutions
Type
article
Field-Weighted Citation Impact
3.25
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

BLA: Byzantine-Tolerant Lazy Auditing Framework for Decentralized Storage Data Integrity

Minghao Yin, Juncheng Hu, Tengfei Li
1 citations
ACM Transactions on Storage
Cloud Data Security Solutions
3.25
article

BLA: Byzantine-Tolerant Lazy Auditing Framework for Decentralized Storage Data Integrity

Minghao Yin, Juncheng Hu, Tengfei Li
article en
1 citations

Abstract

With the rise of blockchain technology, the trend toward decentralization has spread to the field of remote storage, leading to the emergence of decentralized storage as a promising model. This change is highlighted by its features of open and fair access, reduced dependence on intermediaries, and strong privacy protections. However, similar to centralized storage, the decentralization of data management presents challenges, including the separation of ownership and control, along with the need for integrity auditing on externally managed data. The current popular centralized auditing model for the mainstream cloud storage cannot be directly used for decentralized storage environments. Additionally, Homomorphic Verification Tag (HVT)-based auditing models encounter significant problems such as high computational costs and inefficient auditing processes. In response to these needs, we introduce a novel Byzantine-tolerant Lazy Auditing framework (BLA) to ensure data integrity in decentralized storage settings. A key innovation is the hierarchical architecture used: the upper level employs a simplified Practical Byzantine Fault Tolerance (PBFT) protocol to help nodes reach a consensus on data integrity audits. At the lower level, nodes are grouped into clusters based on criteria such as accessibility, organized using a block design strategy. This approach reduces unnecessary information exchange during the auditing process. It maximizes parallel processing and strengthens fault tolerance and system resilience. By distributing data, it also reduces the impact of node failures. Our theoretical analyses and empirical evaluations clearly show that BLA reduces communication complexity compared with conventional PBFT protocols. Additionally, when compared with traditional HVT-based schemes, BLA demonstrates better storage efficiency and improved computational performance, making it a viable and effective solution for data integrity auditing in decentralized storage systems.

ACM Transactions on StorageVol. 21(4)
Northeast Normal University (CN), Jilin University (CN), Jilin Medical University (CN)
Openalex Percentile: Top 10%
Cloud Data Security Solutions
3.25
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.