| 摘要 |
A method for processing and verifying remote dynamic data is provided. The method includes providing a radix tree structure having N levels, obtaining and recording N initial values for representing the empty radix tree structure, wherein all nodes at the same level are assigned an identical initial value. When performing a data processing operation to the radix tree structure, determining a first leaf node and calculating and recording the value of each node in a shortest path from the first leaf node to the root node. When performing a verification of a specific data, obtaining a second leaf node corresponding to the specific data, a sibling node of each node in a shortest path from the second leaf node to the root node, and generating a verification result according to a digital signature for verifying the root node, the value of each obtained sibling node, and the specific data. |
| 主权项 |
1. A method for processing and verifying remote dynamic data provided by a remote dynamic data processing and verifying system, wherein the remote dynamic data processing and verifying system comprise a data storage server and a client device, the method comprising:
providing, by a storage medium of the data storage server, a radix tree structure for data storage, the radix tree structure comprising a root node, a plurality of intermediate nodes, and a plurality of leaf nodes, and the radix tree structure has N levels, N being a positive integer; obtaining N initial values by using an equation (1):ɛL={H(ɛL+1,ɛL+1),0≤L≤N-2C,L=N-1,(1)wherein C is a predetermined constant, H(x,y) is a hash function with x and y respectively being a first input value and a second input value of the hash function, εL represents an assigned initial value of the nodes at the Lth level in the radix tree structure with no data stored, wherein the leaf nodes are located at the (N−1)th level, and the root node is located at the 0th level;
obtaining and recording, by a processor of the data storage server, the N initial values for representing the radix tree structure with no data stored, wherein all nodes at the same level are assigned an identical initial value in the radix tree structure with no data stored and the initial value of the nodes at the different level are different; when performing a data processing operation to the radix tree structure by a client device, determining a first leaf node from the plurality of leaf nodes by the processor of the data storage server, recalculating a value of each node in a shortest path from the first leaf node to the root node, and recording the value obtained from the recalculation by the processor of the data storage server; and when performing a verification of a specific data to the radix tree structure by the client device, obtaining at least one second leaf node from the plurality of leaf nodes corresponding to the specific data, obtaining a sibling node of each node in a shortest path from each of the at least one second leaf node to the root node, and generating a verification result of the specific data according to a current digital signature for verifying the root node, the value of each obtained sibling node, and the specific data by the processor of the data storage server. |
