AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (642.2 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Article | Open Access

Data Security Storage Mechanism Based on Blockchain Network

Jin Wang1Wei Ou1Wenhai Wang2R. Simon Sherratt3Yongjun Ren4Xiaofeng Yu5( )
School of Computer & Communication Engineering, Changsha University of Science & Technology, Changsha, 410004, China
School of Control Science and Engineering, Zhejiang University, Hangzhou, 310058, China
School of Systems Engineering, The University of Reading, Reading, RG6 6AY, UK
School of Computer, Engineering Research Center of Digital Forensics of Ministry of Education, Nanjing University of Information Science & Technology, Nanjing, 210044, China
School of Business, Nanjing University, Nanjing, 210093, China
Show Author Information

Abstract

With the rapid development of information technology, the development of blockchain technology has also been deeply impacted. When performing block verification in the blockchain network, if all transactions are verified on the chain, this will cause the accumulation of data on the chain, resulting in data storage problems. At the same time, the security of data is also challenged, which will put enormous pressure on the block, resulting in extremely low communication efficiency of the block. The traditional blockchain system uses the Merkle Tree method to store data. While verifying the integrity and correctness of the data, the amount of proof is large, and it is impossible to verify the data in batches. A large amount of data proof will greatly impact the verification efficiency, which will cause end-to-end communication delays and seriously affect the blockchain system’s stability, efficiency, and security. In order to solve this problem, this paper proposes to replace the Merkle tree with polynomial commitments, which take advantage of the properties of polynomials to reduce the proof size and communication consumption. By realizing the ingenious use of aggregated proof and smart contracts, the verification efficiency of blocks is improved, and the pressure of node communication is reduced.

References

【1】
【1】
 
 
Computers, Materials & Continua
Pages 4933-4950

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Wang J, Ou W, Wang W, et al. Data Security Storage Mechanism Based on Blockchain Network. Computers, Materials & Continua, 2023, 74(3): 4933-4950. https://doi.org/10.32604/cmc.2023.034148

112

Views

4

Downloads

4

Crossref

3

Web of Science

5

Scopus

Received: 07 July 2022
Accepted: 19 August 2022
Published: 31 March 2023
© The Author 2024.

This work is licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.