基于Merkle哈希树的范围查询验证技术  

Range query integrity verification based on Merkle hash tree

作　　者：赵蒙 王雷[1,2] 匡林爱 叶松涛[1,2] 刘栋 

机构地区：[1]湘潭大学信息工程学院,湘潭411105 [2]湖南省湘潭大学智能计算与信息处理教育部重点实验室,湘潭411105

出　　处：《东南大学学报（自然科学版）》2017年第A01期118-122,共5页Journal of Southeast University：Natural Science Edition

基　　金：赛尔网络下一代互联网技术创新资助项目(NGII20160305);湖南省重点学科建设资助项目;国家自然科学基金资助项目(61640210,61672447);湘潭大学“产学研提质专项”资金支持资助项目(11KZ|KZ03051);湖南省物联网学会华为基金资助项目(KH01116);湘潭大学第九批教学改革研究资助项目(2904101)

摘　　要：由于目前在两层传感器网络中的范围查询验证技术主要基于Merkle哈希树,存在验证对象大、验证过程冗余、安全性低等问题,提出一种新颖的基于Merkle哈希树数据完整性验证方案.该方案采用部分物化的思想优化哈希树模型,首先将叶子节点分为若干组,每组构建一棵子哈希树,这些子哈希树构成第1层子树,并且只对第1层子树的根节点签名;然后按照同样的方法,将第1层子树签名的根节点分为若干组,形成第2层子树.以此类推,直到最后只有一颗哈希树为止;最后,基站通过部分签名的根节点便可验证查询结果的真实性.实验结果表明,该方案可以增强哈希树的抗攻击性,提高查询结果的验证速度,降低各节点计算hash值的复杂度.Due to that the current range query verification technique in the two-layer sensor network is mainly based on the Merkle hash tree,which has disadvantages of large verification object,redundant verification procedures and low security,a novel data integrity verification scheme based on Merkle hash tree is proposed. To optimize the hash tree model,the partial materialization theory is adopted in the scheme. First,all of the leaf nodes are divided into several groups and each group constructs a hash subtree. All the hash trees are collectively called the first layer subtree,only the root node of which is signed. Secondly,in the same way,the signed root nodes of the first layer subtree are divided into several groups forming the second layer subtree,and there exists only one hash tree at the end. Finally,the authenticity of query results is verified by the base station according to partially signed root nodes. The experimental results show that the proposed method can enhance the robustness of hash tree and improve the verification speed of query results,and reduce the computational complexity for calculating hash value of each node.

关 键 词：无线传感器网络 范围查询 完整性验证 Merkle哈希树 签名 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]