TY - JOUR
T1 - Towards Practical Auditing of Dynamic Data in Decentralized Storage
AU - Duan, Huayi
AU - Du, Yuefeng
AU - Zheng, Leqian
AU - Wang, Cong
AU - Au, Man Ho
AU - Wang, Qian
N1 - Funding Information:
This work was supported in part by the National Key R&D Program of China under Grant 2020YFB1005500, in part by the Research Grants Council of Hong Kong under Grants CityU 11217819, CityU 11217620, CityU 11218521, N_CityU139/21, R6021-20F, and RFS2122-1S04, in part by Shenzhen Municipality Science and Technology Innovation Commission under Grant SGDX20201103093004019, in part by the National Natural Science Foundation of China under Grants 61572412, U20B2049, 61822207, 61972332, and 61822207, and in part by the Fundamental Research Funds for the Central Universities under Grant 2042021gf0006.
Publisher Copyright:
© 2004-2012 IEEE.
PY - 2023/1/1
Y1 - 2023/1/1
N2 - Decentralized storage (DS) projects such as Filecoin are gaining traction. Their openness mandates effective auditing mechanisms to assure users that their data remains intact. A blockchain is typically employed here as an unbiased public auditor. While the case for static data is relatively easy to handle, on-chain auditing of dynamic data with practical performance guarantees is still an open problem. Dynamic Proof-of-Storage (PoS) schemes developed for conventional cloud storage are not applicable to DS, since they require large storage proofs and/or large auditor states that are unmanageable by a resource-constrained blockchain. To fill the gap, we propose a family of dynamic on-chain auditing protocols that can produce concretely small auditor states while retaining the compact proofs promised by static PoS schemes. Our design revolves around a set of succinct data structures and optimization techniques for index information management. With proper instantiation and realistic parameters, our protocols can achieve 0.25MB on-chain state and 1.2KB storage proof for the auditing of 1TB data, outperforming previous dynamic PoS schemes that are adaptable for DS by orders of magnitude. As another practical contribution, we introduce a data abstraction layer that allows one to deploy the auditing protocols on arbitrary storage systems hosting dynamic data.
AB - Decentralized storage (DS) projects such as Filecoin are gaining traction. Their openness mandates effective auditing mechanisms to assure users that their data remains intact. A blockchain is typically employed here as an unbiased public auditor. While the case for static data is relatively easy to handle, on-chain auditing of dynamic data with practical performance guarantees is still an open problem. Dynamic Proof-of-Storage (PoS) schemes developed for conventional cloud storage are not applicable to DS, since they require large storage proofs and/or large auditor states that are unmanageable by a resource-constrained blockchain. To fill the gap, we propose a family of dynamic on-chain auditing protocols that can produce concretely small auditor states while retaining the compact proofs promised by static PoS schemes. Our design revolves around a set of succinct data structures and optimization techniques for index information management. With proper instantiation and realistic parameters, our protocols can achieve 0.25MB on-chain state and 1.2KB storage proof for the auditing of 1TB data, outperforming previous dynamic PoS schemes that are adaptable for DS by orders of magnitude. As another practical contribution, we introduce a data abstraction layer that allows one to deploy the auditing protocols on arbitrary storage systems hosting dynamic data.
KW - blockchain
KW - data dynamism
KW - data integrity auditing
KW - Decentralized storage
UR - http://www.scopus.com/inward/record.url?scp=85123383940&partnerID=8YFLogxK
U2 - 10.1109/TDSC.2022.3142611
DO - 10.1109/TDSC.2022.3142611
M3 - Journal article
AN - SCOPUS:85123383940
SN - 1545-5971
VL - 20
SP - 708
EP - 723
JO - IEEE Transactions on Dependable and Secure Computing
JF - IEEE Transactions on Dependable and Secure Computing
IS - 1
ER -