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

Yu, H; Chen, Y; Yang, Z; Chen, Y; Yu, S

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

Yu, H Chen, Y Yang, Z Chen, Y Yu, S

Permalink

Publisher:: IEEE COMPUTER SOC
Publication Type:: Journal Article
Citation:: IEEE Transactions on Services Computing, 2024, 17, (5), pp. 2273-2286
Issue Date:: 2024-01-01

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Published versionAdobe PDF (3.19 MB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Yu, H
dc.contributor.author	Chen, Y
dc.contributor.author	Yang, Z
dc.contributor.author	Chen, Y
dc.contributor.author	Yu, S https://orcid.org/0000-0003-4485-6743
dc.date.accessioned	2024-12-02T01:41:38Z
dc.date.available	2024-12-02T01:41:38Z
dc.date.issued	2024-01-01
dc.identifier.citation	IEEE Transactions on Services Computing, 2024, 17, (5), pp. 2273-2286
dc.identifier.issn	1939-1374
dc.identifier.issn	1939-1374
dc.identifier.uri	http://hdl.handle.net/10453/182271
dc.description.abstract	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.
dc.language	English
dc.publisher	IEEE COMPUTER SOC
dc.relation.ispartof	IEEE Transactions on Services Computing
dc.relation.isbasedon	10.1109/TSC.2024.3417337
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	0803 Computer Software, 0805 Distributed Computing, 0806 Information Systems
dc.subject.classification	4606 Distributed computing and systems software
dc.subject.classification	4609 Information systems
dc.title	EDCOMA: Enabling Efficient Double Compressed Auditing for Blockchain-Based Decentralized Storage
dc.type	Journal Article
utslib.citation.volume	17
utslib.for	0803 Computer Software
utslib.for	0805 Distributed Computing
utslib.for	0806 Information Systems
pubs.organisational-group	University of Technology Sydney
pubs.organisational-group	University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	University of Technology Sydney/UTS Groups
pubs.organisational-group	University of Technology Sydney/UTS Groups/Centre for Cyber Security and Privacy (CCSP)
utslib.copyright.status	open_access	*
dc.rights.license	This work is licensed under a Creative Commons Attribution 4.0 International License (CC BY 4.0). To view a copy of this license, visit https://creativecommons.org/licenses/by/4.0/
dc.date.updated	2024-12-02T01:41:35Z
pubs.issue	5
pubs.publication-status	Published
pubs.volume	17
utslib.citation.issue	5

Abstract:

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.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/182271