Node updating method of Hash tree

An update method and hash tree technology, applied in the field of information security, can solve problems affecting update performance and achieve high update performance

Inactive Publication Date: 2010-12-29
侯方勇
View PDF0 Cites 16 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] In this way, the update of the nodes in the hash tree requires the system to obtain the associated sibling nodes first; when the number of sibling nodes is large, a large amount of data needs to be read, which affects the performance of the update

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0010] The present invention will be described in detail below. This embodiment is implemented on the premise of the technical solution of the present invention, and provides detailed implementation and specific operation process; but the protection scope of the present invention is not limited to the following embodiments.

[0011] To describe this embodiment, it is assumed that the root node of the hash tree is R1; R1 has 4 subordinate nodes, which are respectively F1, F2, F3 and F4; and the F1 node has 4 subordinate nodes, which are respectively C1, C2, C3 and C4. In terms of "F1" and "C1, C2, C3, and C4", "F1" is the parent node, "C1, C2, C3, and C4" are the child nodes of "F1", and "C1, C2, C3, and C4" They are sibling nodes to each other.

[0012] When C1 changes, the hash tree needs to calculate a new current value of F1 based on the current value of C1. Generally, a commonly used hash function, such as the MD5 algorithm, is used to calculate the new value of F1 accor...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a node updating method of a Hash tree. The invention relates to an information safety technology, in particular to a method for generating check results based on the Hash tree for data. The invention aims at providing the node updating method of the Hash tree, thereby leading the data size which needs to be read by a system to be small when updating nodes. The key points of the adopted technology are as follows: the process of using the child nodes to update the father node is completed by adopting an incremental hash function; and the calculation according to the incremental hash function for obtaining the current value of the father node does not need to contrapose all the child nodes under the father node and only needs to contrapose the changed part of the child nodes under the father node.

Description

technical field [0001] The invention relates to information security technology, in particular to a method for generating a verification result based on a hash tree for data. Background technique [0002] The security protection of data involves many aspects; among them, the important point is to verify the integrity of data, that is, to prevent data corruption (ie error) or unauthorized modification. In data integrity check technology, Hash Tree (Hash Tree, or Merkle Tree; see: "R.C.Merkle.Protocols for public key cryptography.In IEEE Symposium on Security and Privacy, 1980", "M.Blum, W .Evans, P.Gemmell, S.Kannan and M.Naor.Checking the correctness of memories.IEEE Symposium on Foundations of Computer Science, 1991" and "B.Gassend, G.E.Suh, D.Clarke, M.van Dijk, and S. Devadas. Caches and merkle trees for efficient memory authentication. Ninth International Symposium on High Performance Computer Architecture, 2003") is a highly secure data integrity verification technolog...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/30
Inventor 侯方勇
Owner 侯方勇
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap