首页 | 官方网站   微博 | 高级检索  
     

基于Merkle山脉的数据可信溯源方法
引用本文:刘炜,张聪,佘维,宋轩,田钊. 基于Merkle山脉的数据可信溯源方法[J]. 计算机应用, 2022, 42(9): 2765-2771. DOI: 10.11772/j.issn.1001-9081.2021081369
作者姓名:刘炜  张聪  佘维  宋轩  田钊
作者单位:郑州大学 网络空间安全学院,郑州 450002
互联网医疗与健康服务河南省协同创新中心(郑州大学),郑州 450052
基金项目:河南省高校科技创新人才支持计划项目(21HASTIT031);河南省重大公益专项(201300210300);河南省高等学校青年骨干教师培养计划项目(2019GGJS018);河南省重点研发与推广专项(212102310039);河南省高等学校重点科研项目(20A520035)
摘    要:针对物联网(IoT)系统中海量数据存储成本大、数据溯源验证效率低等问题,提出一种基于Merkle山脉(MMR)的可信数据溯源方法MMRBCV。首先,利用IPFS存储IoT数据;其次,采用联盟链和私有链来设计一种双链结构,从而实现数据流转过程的可靠记录;最后,基于MMR设计区块结构,以实现轻量级IoT节点在数据溯源过程中的快速验证。实验结果表明,MMRBCV减少了数据溯源时所下载的数据量,且数据验证时间与MMR结构有关,当MMR可以组成一个完美二叉树时数据验证时间较短。当区块高度为200 000时,MMRBCV的最大验证时间约为10 ms,比SPV的最大验证时间(约为36 ms)缩短了约72%,可见所提方法有效提高了验证效率。

关 键 词:Merkle山脉  区块链  数据溯源  轻量级节点  验证  
收稿时间:2021-08-02
修稿时间:2021-12-03

Data trusted traceability method based on Merkle mountain range
Wei LIU,Cong ZHANG,Wei SHE,Xuan SONG,Zhao TIAN. Data trusted traceability method based on Merkle mountain range[J]. Journal of Computer Applications, 2022, 42(9): 2765-2771. DOI: 10.11772/j.issn.1001-9081.2021081369
Authors:Wei LIU  Cong ZHANG  Wei SHE  Xuan SONG  Zhao TIAN
Affiliation:School of Cyber Science and Engineering,Zhengzhou University,Zhengzhou Henan 450002,China
Henan Collaborative Innovation Center for Internet Medical and Health Services (Zhengzhou University),Zhengzhou Henan 450052,China
Abstract:Concerning the problems of the high cost of massive data storage and low efficiency of data traceability verification in the Internet of Things (IoT) system, a data trusted traceability method based on Merkel Mountain Range (MMR), named MMRBCV (Merkle Mountain Range BlockChain Verification), was proposed. Firstly, Inter-Planetary File System (IPFS) was used to realize the storage of the IoT data. Secondly, the consortium blockchains and private blockchains were adopted to design a double-blockchain structure to realize reliable recording of the data flow process. Finally, based on the MMR, a block structure was constructed to realize the rapid verification of lightweight IoT nodes in the process of data traceability. Experimental results show that MMRBCV reduces the amount of data downloaded during data tracing, and the data verification time is related to the structure of MMR. When MMR forms a perfect binary tree, the data verification time is short. When the block height is 200 000, MMRBCV’s maximum verification time is about 10 ms, which is about 72% shorter than that of Simplified Payment Verification (SPV) (about 36 ms), indicating that the proposed method improves the verification efficiency effectively.
Keywords:Merkle Mountain Range (MMR)  blockchain  data traceability  lightweight node  verification  
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号