Data Secure Storage Mechanism for Trustworthy Data Space

In today’s rapidly evolving data environment, secure and efficient storage solutions are fundamental to supporting the robust development of the data economy. Trustworthy data space serves as an innovative technological framework for addressing critical challenges in data circulation. It is specifically designed to facilitate the secure exchange in data elements and overcome trust barriers in cross-organizational data sharing. However, current decentralized storage architectures still have significant implementation gaps. Practical deployment and system integration remain substantial challenges for existing technological solutions. To address these issues, this paper first conducts a systematic analysis of existing trusted data storage methods. On this basis, it proposes a data-secure storage mechanism based on polynomial commitment. This mechanism uses polynomial commitment to implement data storage and verification, thereby ensuring data integrity and consistency. Meanwhile, it integrates homomorphic signature technology to guarantee the authenticity of data sources without disclosing original data. Additionally, a data modification recording function is introduced to ensure the traceability of all operations. Experimental results show that the proposed scheme achieves superior performance in three key aspects: communication overhead, storage efficiency, and data update costs.

Authors

Institutions

Publication Details

Journal
Electronics
Published
2025-11-06
DOI
https://doi.org/10.3390/electronics14214348
Primary Topic
Cloud Data Security Solutions
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Data Secure Storage Mechanism for Trustworthy Data Space

Qiaojie Luo, Jiang Xu, Xinyi Yang, Qinghong Cao
Electronics
Cloud Data Security Solutions
article

Data Secure Storage Mechanism for Trustworthy Data Space

Qiaojie Luo, Jiang Xu, Xinyi Yang, Qinghong Cao
article en

Abstract

In today’s rapidly evolving data environment, secure and efficient storage solutions are fundamental to supporting the robust development of the data economy. Trustworthy data space serves as an innovative technological framework for addressing critical challenges in data circulation. It is specifically designed to facilitate the secure exchange in data elements and overcome trust barriers in cross-organizational data sharing. However, current decentralized storage architectures still have significant implementation gaps. Practical deployment and system integration remain substantial challenges for existing technological solutions. To address these issues, this paper first conducts a systematic analysis of existing trusted data storage methods. On this basis, it proposes a data-secure storage mechanism based on polynomial commitment. This mechanism uses polynomial commitment to implement data storage and verification, thereby ensuring data integrity and consistency. Meanwhile, it integrates homomorphic signature technology to guarantee the authenticity of data sources without disclosing original data. Additionally, a data modification recording function is introduced to ensure the traceability of all operations. Experimental results show that the proposed scheme achieves superior performance in three key aspects: communication overhead, storage efficiency, and data update costs.

ElectronicsVol. 14(21)
Nanjing University of Information Science and Technology (CN), Guangxi Normal University (CN), Shanghai Stock Exchange (CN)
Openalex Percentile: Top 53%
Cloud Data Security Solutions
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.