arrow
返回

EDCOMA: Enabling Efficient Double Compressed Auditing for Blockchain-Based Decentralized Storage

delete2024-09-01
delete2
delete
OA
AI
于
于海阳 (Haiyang Yu)
Y
Yurun Chen
杨震 封面图
杨震 (Zhen Yang) *
陈渝文 封面图
陈渝文 (Yuwen Chen)
S
Shui Yu
DOI:10.1109/TSC.2024.3417337delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Blockchain technology, known for its decentralized and immutable nature, serves as the foundation for various applications. As a prominent application of blockchain, decentralized storage is powered by blockchain technology and is expected to provide a reliable and cost-effective alternative to traditional centralized storage. A major challenge in blockchain-powered decentralized storage is how to guarantee the quality of storage services in decentralized storage nodes (DSNs). Storage auditing can ensure the integrity and security of the stored data. Unfortunately, it incurs additional computational costs for data owners and extra storage overheads for DSNs, which thereby cannot be directly applied to decentralized storage networks consisting of nodes with various computation and storage capacity. In this article, we overcome these problems and minimize additional burdens in storage auditing. We propose EDCOMA, a computation and storage efficient auditing scheme for blockchain-based decentralized storage, in which a double compression method is designed to compress data authenticators using both data and polynomial commitment. To prevent replay attacks on double compression launched by DSNs, we introduce zero knowledge proof and design a compression arithmetic circuit to guarantee the execution of compression operations in DSNs. We analyze the security of EDCOMA under the random oracle model and conduct extensive experiments to evaluate the performance of EDCOMA. Experimental results affirm that EDCOMA outperforms state-of-the-art approaches in both computational and storage efficiency.
Keyword:
Blockchains
Peer-to-peer computing
Cloud computing
Costs
Smart contracts
Data integrity
Computational efficiency
Decentralized storage
auditing
double compression
blockchain

期刊

IEEE Transactions on Services Computing 封面图
IEEE Transactions on Services Computing
IF:
5.8
论文数:
2.2K
被引数:
6.5K

机构

U
university of technology sydney
学者数:
1.6W
论文数: 2.0W
被引数: 25
B
Beijing University of Technology
学者数:
2.8W
论文数: 2.1W
被引数: 2.7W
引用论文

引用论文

A previously undescribed scene-selective site is the key to encoding ego-motion in naturalistic environments
err2024-03-20
err0
errOAAI
errBryan Kennedy; Sarala N Malladi; Roger BH Tootell; Shahin Nasr
err分享
err收藏
err分享
err收藏
Blockchain-based public auditing for big data in cloud storage
err2020-11-01
err135
PREAI
errLi, Jiaxing; Wu, Jigang; Jiang, Guiyuan; Srikanthan, Thambipillai
err分享
err收藏
Towards Practical Auditing of Dynamic Data in Decentralized Storage
err2023-01-01
err12
PREAI
errDuan, Huayi; Du, Yuefeng; Zheng, Leqian; Wang, Cong; Au, Man Ho; Wang, Qian
err分享
err收藏
学者 查看更多内容