331 results about "Merkle tree" patented technology

The invention discloses a block chain data comparison and consensus method used for hash value calculation of content of each transaction. By changing the random numbers, the numbers of some bits of the hash values are set not to be repeated in a time period, and can be called as unrepeated serial numbers. Accounting servers are used to compare the numbers of the preset bits of the hash values to determine whether the transactions are identical or not. The unrepeated serial number comparison can be carried out in a way of establishing the Merkle-like tree, and because the numbers of the preset bits of the hash values of the transactions are not repeated, and can be used as the serial numbers, and can be disposed in the Merkle-like tree according to the certain rule, and therefore for different accounting servers, the positions of the hash values of the same transaction on the Merkle trees are totally identical, and the differences can be found out quickly, the data transfer amount can be reduced, and the time required by the consensus can be greatly accelerated.

The invention relates to a method for constructing an electronic evidence. The method specifically comprises the following steps: generating a unique length-fixed digital abstract for electronic data of an applicant, and constructing a Merkle tree of an electronic evidence block chain system; constructing the electronic evidence block chain system with a timestamp; and setting an index number for a block by the electronic evidence block chain system, and returning the index number, the generated digital abstract and the timestamp to the applicant together. According to the method and the system disclosed by the invention, all participating parties can construct jointly, maintain jointly and supervise jointly, thereby meeting the right to know and the supervision right of each party; the identification cost of the electronic evidence is reduced, the identification efficiency is improved, and the objectivity and the reliability of the electronic evidence are enhanced.

The invention discloses a node consensus verification method under a league chain network through an asynchronous mode. Each node takes a transaction request from the head of a buffer queue to act as a transaction sequence to be submitted and then encrypts the sequence by using threshold encryption; each node broadcasts the encrypted transaction sequence, ensures the integrity of the transmitted message by using an erasure code and ensures message consistency of different nodes by using a Merkle tree; and all the nodes vote the transaction sequences by using the binary Byzantine consensus agreement to reach a consensus, each node waits for local receiving all the voted transaction sequences and then decrypts the transaction sequences by using threshold decryption so as to finally obtain the decrypted transaction information to act as the transaction request written in blocks within the period. The method is completely decentralized, the system has no timeout mechanism and the broadcast message completely depends on the network bandwidth so that the method has higher network throughput when a large number of nodes exist in the network in comparison with the conventional synchronization Byzantine fault tolerance consensus method.

The invention discloses a data storage method. The data storage method is used for solving the problem that the truth of the data cannot be guaranteed in the prior art. The method comprises the following steps: confirming a Hash value of a target file; utilizing the Hash value of the target file to construct a Hash tree and extracting a root Hash value of the Hash tree; storing the root Hash value in a block chain, thereby acquiring storage information of the truth of the target file, wherein the storage information includes a sign of a block of the Hash value of the target file, a storage time stamp of the target file and the Hash value of the target file. The invention also discloses a data storage device, a data verification method and a data verification device.

In non-volatile memory devices, the accessing of data on word line can degrade the data quality on a neighboring word line, in what is called a read disturb. Techniques are presented for determining word lines likely to suffer read disturbs by use of a hash tree for tracking the number of reads. Read counters are maintained for memory units at a relatively coarse granularity, such as a die or block. When the counter for one of these units reaches a certain level, it is subdivided into sub-units, each with their own read counter, in a process that be repeated to determine frequently read word lines with a fine level of granularity while only using a relatively modest amount of RAM on the controller to store the counters.

The invention relates to a safety metadata management method based on integrality checking, belonging to the field of storage safety. The method is characterized in that a self encryption technology for file data is used at a client to encrypt the file data, thereby improving the storage efficiency; a 64-heap hash tree is used at a safety metadata management server end to maintain the hash value of a file block, thereby providing integrality protection on the hash value of the file data block and realizing the high-efficiency verification on the user's access to file and the high-efficiency data updating; and simultaneously a root hash virtual linked list technology is used, thereby ensuring the integrality of root hash values of multiple 64-heap hash trees belonging to one file and supporting the user's concurrent access to the file to a certain extent.

The invention discloses a hash tree-based data dynamic operation verifiability method, which consists of three parts, i.e., a USER, a cloud data center (CDC) and a third party administrator (TPA) connected through a communication network, wherein the USER is used as a party of making a data memory service request, who hopes to store a data file owned by the party into a cloud storage space of the cloud data center, and can be both a personal user and an enterprise user; the CDC is used for responding to the data storage service request of the USER, storing the data file of the USER into the huge data center of the CDC according to a certain rule and managing and maintaining the data file; and the TPA is used as a reliable TPA and is commissioned by the USER to check the completeness and the consistency of the data file stored in the CDC data center. According to the hash tree-based data dynamic operation verifiability method, the verification problem of the completeness and the consistency of the user data file under a cloud computing environment is solved.

A method of a payment for an Internet of Things (IoT) device is provided. The method includes steps of: a payment supporting server (a) on condition that the payment supporting server has registered certificates of the IoT device, a service providing device, and a digital wallet in a first blockchain, manages their transaction IDs, has registered a representative hash value in a second blockchain, manages their transaction IDs, and manages link information between the IoT device and the digital wallet, confirming validity of a billing transaction, and (b) acquiring identification information on the digital wallet; and (c) paying the billing detail using the digital wallet, registering its payment result in the first blockchain, registering in the second blockchain, if one anchoring condition is satisfied, a first representative hash value, and transmitting the payment result to the service providing device, the IoT device, and the digital wallet.

Data segments are logically organized in groups in a data repository. Each segment is stored at an index in the data repository. In association with a write request, a hash algorithm is applied to the data segment to generate a group identifier. Each group is identifiable by a corresponding group identifier. The group identifier is applied to a hash tree to determine whether a corresponding group in the data repository exists. Each existing group in the data repository corresponds to a leaf of the hash tree. If no corresponding group exists in the data repository, the data segment is stored in a new group in the data repository. However, if a corresponding group exists, the group is further searched to determine if a data segment matching the data segment to be stored is already stored. The data segment can be stored in accordance with the results of the search.

Inventive aspects include a key value store engine including non-volatile memory configured to store key-value inode descriptors each including a key and an associated value. The key value store engine can include a volatile memory to store a key hash tree and a collision hash tree. The key hash tree can include nodes each having a hash of one of the keys. The collision hash tree can include nodes each having a collided hash associated with two or more different keys. Each of the nodes of the key hash tree can include a collision flag indicating whether two or more different hashes correspond to a collided hash. The volatile memory can store a collision linked list including linked list nodes each having a key-value inode number indicating a location of a corresponding key-value inode descriptor stored in the non-volatile memory. The key value store engine can include a key value logic section.

Transformations of digital records are used as lowest level inputs to a tree data structure having nodes computed as digital combinations of child node values up to a current calendar value. Signature vectors are generated for each of the digital records and have parameters that enable recomputation of the respective current calendar. Recomputation yields the same calendar value only if a candidate digital record is an exact version of the original digital record included in the original computation of the value. Either the current calendar value, or a function of a plurality of calendar values over a period, is encoded in a transaction value that is stored in a block of a blockchain.

A method and system for representing database and query information for multiple windows, includes defining an interval hash tree as a two-way interval tree, constructing a first interval hash tree for database windows, constructing a second interval hash tree for query windows, and matching the second and first interval hash trees node by node.

The invention discloses a dynamic verification method of cloud storage data using lattice-based linearly homomorphic signatures. The method comprises data integrity verification including: a public key and a private key of a linearly homomorphic signature algorithm on a lattice are generated, a file is divided into a plurality of data blocks, each data block is signed, the value of a root node is calculated on the basis of a Merkle hash tree, the value of the root node is signed, and the data blocks, signatures of the data blocks and a signature of the root node are sent to a cloud server; IDs of the public key and the file are provided for a third-party audit, which initiates a challenge to the cloud server to verify whether the data blocks changed or not; the cloud server provides corresponding proof for the challenge initiated by the third-party audit; and the third-party audit judges whether the data blocks are complete according to the proof provided by the cloud server and feeds a verification result to a user. The method can resist quantum attacks initiated by quantum computers in the future and support cloud dynamic operation verification while protecting user private information.

The present invention discloses a data structure which, given an identifier for a Representational State Transfer (REST) resource, can rapidly yield a configured target and simultaneously yield all configured pattern based rules and constraints for the target. The disclosed data structure is a tree structure including nodes for URL portions. Each node is associated with a hash tree specifically grown in a manner that ensures collision occurrences are non-existent. The tree structure is effectively two or more superimposed trees; one for URL pattern matching to determine a target, another for determining constraints. A single tree traversal, which can be based on a progressive hash, can be used to concurrently determine a target and a set of constraints, which represents improved performance over conventional implementations that require multiple, distinct query/response operations to produce equivalent results.

The invention relates to a data range-based method for synchronizing data in a database. The method comprises the following steps of: segmenting the data stored in the database; determining a data segment with changed content; and updating the original content of the data segment. In the data range-based method for synchronizing data in database, provided in the invention, the data are segmented and then calculated by utilizing a Merkle Tree algorithm, compared and restored; the contents are synchronized among different data storage nodes in a large distributed data storage system to achieve the final data consistency.

An apparatus for authentication of fragments using hash trees may include a processor. The processor may be configured to provide one or more data fragments and a hash tree representing the one or more fragments, send at least one first fragment accompanied by any nodes of the hash tree necessary to authenticate the one or more first sent fragments, and send one or more subsequent fragments accompanied by only some, but not all, of the nodes of the hash tree necessary to authenticate the one or more subsequent fragments with the other nodes that are not sent but are necessary for authentication having been previously sent in conjunction with a prior fragment.

The invention relates to a block chain spatio-temporal data query method and system and electronic equipment. The method comprises the following steps of: a, inserting spatio-temporal data in a blockchain system into a Merkle tree and kd tree combined tree index structure, storing the spatio-temporal data in a block chain module, and for each block in the block chain module, importing tempon information in a block head; b, giving a corresponding time range and a corresponding space range for the spatio-temporal data, and searching blocks according with the time range in a topological structure G of a directed acyclic graph by utilizing the tempon information in the block head of each block in the block chain module; and c, reading root node information, in the block heads of the blocks according with the time range, of the Merkle tree and kd tree combined tree index structure, searching key data according with the spce range, and obtaining corresponding spatio-temporal data accordingto the key data. The method is efficient and is capable of rapidly returning results according with given requirements in an online manner.

The invention discloses an agricultural product quality information system based on a block chain. The agricultural product quality information system comprises a data acquisition module, a block information construction module, a storage sharing module, an evaluation module, and a query module. The data acquisition module is used to acquire soil information and agricultural product type information, and is used to transmit the acquired information in a structured data form to the block information construction module. The block information construction module is used to allocate identity labels for the agricultural products, is used to construct a Merkle tree by using the received structured data, and is used to form block information by carrying out digital signature and time stamp service, and then the p2p transmission of the block information is carried out after work load proof. The storage sharing module is used for the work load verification of the received block information, and after data check, the block information is broadcasted. The evaluation module is used to carrying out the quality evaluation of the agricultural products to acquire quality scores. The query module is used to receive the block information and the quality scores to generate query two-dimensional codes. By introducing the block chain technology, the authoritative and unified agricultural product quality information system is constructed.

The present disclosure relates to accessing data stored in a secure manner in an unsecure memory, based on signatures forming an integrity check tree comprising a root signature stored in a secure storage space, and lower-level signatures stored in the unsecure memory. One embodiment calculates a first-level signature from the data in a group comprising a changed datum, and temporarily stores the signature calculated in a secure memory. The embodiment calculates a signature to check the integrity of a lower-level signature by using the signature to be checked and a second signature belonging to a same group as the signature to be checked, read as a priority in the secure memory and in the unsecure memory if it has different values in the secure and unsecure memories.

A distributed hash tree-based authentication system for digital input records has more than one upper-level core node, each of which receives at least one uppermost value from aggregators. Communicating with each other about which aggregator values they have received, the nodes try to reach agreement as to which of these values should be included in duplicated current intra-node hash tree evaluations so as to form a consistent top-level value used as the basis for digital signatures associated with the digital input records.