A Secure Storage Strategy for Blockchain Based on MCMC Algorithm

9Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.

Abstract

The exponential growth of storage space in blockchain network has become a serious problem to hinder the distribution of blockchain and the expansion of blockchain nodes. In this paper. We propose a security strategy for distributed storage blockchains, which can delete part of blockchains so that nodes only store part of a blockchain. We design a kind of semi-full node between full node and light node according to the requirement of the strategy, besides describe the process of deleting block and synchronizing block, and the running logic of the semi-full node. Finally, we perform comprehensive experiments of the truncated MCMC random algorithm. The results show that in the case of multi-node, the truncated block will not affect the block chain network. Compared with the traditional block design, our storage strategies can reduce storage requirements under most of situation, thus enable blockchains to be deployed on mobile or smaller storage computers.

Cite

CITATION STYLE

APA

Zhao, P., Cheng, H., Fang, Y., & Wang, X. (2020). A Secure Storage Strategy for Blockchain Based on MCMC Algorithm. IEEE Access, 8, 160815–160824. https://doi.org/10.1109/ACCESS.2020.3020836

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free