Skip to Main Content
A diverse child nodes hash tree method was proposed to make the digest structure more flexible, improving the data authenticity verification efficiency in regional health information network which has a great number of medical documents. The new hash tree method changes the former hash list from one-layer digest to a tree structure, using category search to enormously accelerate verification processes, and locating multi-ldquoerror filerdquo at the same time. According to the current hardware, we designed experiments to obtain the curves of ldquohash tree computing time-child nodesrdquo and ldquohash tree verification time-child nodesrdquo. Based on the two curves, a weight analysis method was proposed to determine the number of child nodes, making the entire system more efficient. By increasing a small amount of data redundancy, the diverse child nodes hash tree method greatly enhances the verification efficiency.