基于Merkle树的区块链数据修改方法研究  

Research on blockchain data modification methods based on Merkle tree

作　　者：吴梦宇 朱国胜 吴善超 Wu Mengyu;Zhu Guosheng;Wu Shanchao(School of Computer and Information Engineering,Hubei University,Wuhan Hubei 430062,China)

机构地区：[1]湖北大学计算机与信息工程学院,湖北武汉430062

出　　处：《信息通信》2020年第10期10-12,16,共4页Information & Communications

基　　金：赛尔网络下一代互联网技术创新项目(NGII20180803)。

摘　　要：当前区块链的安全依赖于其不可篡改性,但这一特性也使得存入区块链中的错误或虚假数据无法删除或修改。针对该问题,文章将区块链的区块体划分为数据区和扩展区,提出一种基于Merkle树的区块链数据修改方法。数据只存入数据区,两个区单独构建Merkle树,将两棵Merkle树的根分别存入区块头中。对于需要修改的错误数据,获得一定数量节点同意后,在扩展区中重写该数据并重新构建扩展区的Merkle树即可。实验搭建了具有6个节点的实验区块链,从数据修改和完整性验证两方面进行实验,实验结果表明该方法具有可行性。At present,the security of blockchain relies on its immutability,but this feature also makes it impossible to delete or modify the erroneous or false data stored in the blockchain.In response to this problem,the article divides the block body of the blockchain into a data area and an expansion area,and proposes a blockchain data modification method based on the Merkle tree.The data is only stored in the data area.The two areas construct Merkle trees separately,and the roots of the two Merkle trees are stored in the block headers.For erroneous data that needs to be modified,after obtaining the consent of a certain number of nodes,rewrite the data in the expansion area and rebuild the Merkle tree in the expansion area.The experiment has built an experimental blockchain with 6 nodes,and conducted experiments from two aspects of data modification and integrity verification.The experimental results show that the method is feasible.

关 键 词：区块链 数据修改 区块结构 MERKLE树 哈希算法 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]