A low-latency electronic data storage method

Abstract

The present invention relates to the field of information technology, and in particular to a low-latency electronic data storage method, comprising: establishing a storage server and a plurality of execution nodes, the storage server generating a storage function; dividing the storage period T into a plurality of small periods, converting the storage function into a binary machine code and sending it to a plurality of execution nodes; connecting the data node to the storage server, and the storage server assigning a node serial number; the data node extracting the hash value of the electronic data to be stored, and sending the last N bits of the associated node serial number and timestamp to any execution node; the execution node verifies the timestamp, obtains the current small period serial number, uses the node serial number as the first serial number, uses the small period serial number as the second serial number, substitutes it into the storage function, obtains the corresponding matching number and feeds it back to the data node; the data node stores the matching number and timestamp associated with the electronic data to be stored. The substantial effect of the present invention is that the electronic data storage can be completed in a timely manner.

Description

Technical Field

[0001] The present invention relates to the field of information technology, and in particular to a low-latency electronic data storage method. Background Art

[0002] The Internet of Things refers to the use of various devices and technologies such as various information sensors, radio frequency identification technology, global positioning system, infrared sensors, laser scanners, etc. to collect any objects or processes that need to be monitored, connected, and interacted in real time, collect various required information such as sound, light, heat, electricity, mechanics, chemistry, biology, location, etc., and realize ubiquitous connection between things and things, and between things and people through various possible network access. The Internet of Things not only realizes the interconnection between things, but also has the ability to collect a large amount of monitoring data with the help of a large number of sensor devices connected to the Internet of Things. With the development of big data technology, data collection and accumulation have become one of the most important functions of the Internet of Things. However, the data of the perception layer of the Internet of Things is multi-source and has heterogeneous problems. Big data applications often require the collection and storage of data by multiple institutions and entities. The authenticity and integrity of data is an important guarantee for big data applications to achieve the expected results. Therefore, it is necessary to store the monitoring data collected and stored by multiple institutions and entities. Since the sensors and monitoring equipment in the Internet of Things will continuously generate a large amount of monitoring data, the use of the currently widely used blockchain evidence storage technology will bring huge pressure to the blockchain network. Moreover, blockchain has a long data confirmation delay and cannot timely store the monitoring data accessed by the Internet of Things. Therefore, it is necessary to study a storage technology suitable for Internet of Things monitoring data.

[0003] For example, Chinese patent CN112784311A, published on May 11, 2021, is a kind of evidence storage system and blockchain network, the evidence storage system is applied to the blockchain network, the blockchain network includes evidence storage nodes, query nodes and verification nodes; the evidence storage node is used to encrypt the certificate file, and store the encrypted certificate file and the file fingerprint of the certificate file in the blockchain network; the query node, in response to the query request submitted to the query node, verifies the legitimacy of the user's identity based on the information of the user logged in to the query interface, and returns the certificate file to the query interface after the legitimacy of the identity is verified; the verification node, in response to the verification request submitted to the verification node, verifies the legitimacy of the certificate file to be verified based on the file fingerprint of the certificate file to be verified and the file fingerprint stored in the blockchain network, and returns the file verification result to the verification interface. Its technical solution uses the blockchain network to achieve the fixation of file fingerprints. When applied to the monitoring data of the Internet of Things, there are problems of high latency and high cost. Summary of the invention

[0004] The technical problem to be solved by the present invention is: the problem of the current lack of low-latency evidence storage technology. A low-latency electronic data evidence storage method is proposed, which can complete data evidence storage under low latency conditions.

[0005] In order to solve the above technical problems, the technical solution adopted by the present invention is: a low-latency electronic data storage method, comprising: establishing a storage server and a plurality of execution nodes, the storage server generates a storage function, the storage function is: matching number = f (N-bit hexadecimal number, first serial number, second serial number); the storage server divides the storage period T into a plurality of small periods, the storage server converts the storage function into binary machine code and sends it to a plurality of execution nodes, and sends the start and end time of the storage period T and the duration of the small period to a plurality of execution nodes; a plurality of data nodes are connected to the storage server in succession, and the storage server assigns node serial numbers to the data nodes; the data node extracts the hash value of the electronic data to be stored, and sends the node serial number and the timestamp associated with the last N bits of the hash value to any execution node; the execution node verifies whether the difference between the timestamp sent by the data node and the local time of the execution node is within a preset range, and if the difference is within the preset range, the local time of the execution node is obtained according to the local time of the execution node. The previous small cycle number is used, the node number is used as the first number, and the small cycle number is used as the second number, which are substituted into the evidence function to obtain the corresponding matching number, and the matching number is fed back to the data node. If the difference exceeds the preset range, no operation is performed; the data node stores the matching number and timestamp associated with the electronic data to be stored; during verification, the data node extracts the hash value of the electronic data to be stored, and sends the last N bits of the hash value, the matching number, the node number and the timestamp to the evidence server. The evidence server obtains the corresponding small cycle number according to the timestamp, and substitutes the last N bits of the hash value, the matching number, the node number and the small cycle number into the evidence function. If the equation of the evidence function is established, it is determined that the electronic data has not been changed. Otherwise, it is determined that the electronic data has been changed.

[0006] Preferably, the evidence server generates multiple evidence functions, and the multiple evidence functions are sent to the execution node. After the data node sends the last N bits of the hash value associated with the node serial number to the execution node, the execution node calculates the value of the matching number obtained by each evidence function respectively, and feeds back the minimum value of the matching number to the data node. During verification, the evidence server substitutes the last N bits of the hash value, the matching number, the node serial number and the small cycle serial number into the evidence function. If any of the evidence functions is established, it is determined that the electronic data has not been changed. If all the evidence functions are not established, it is determined that the electronic data has been changed.

[0007] Preferably, the evidence function is a multivariate polynomial function, and the expression of the evidence function is: matching number = ∑∑∑aijk* N-bit hexadecimal number ^i*first serial number ^j*second serial number ^k, where aijk is the term coefficient, i, j, k∈[1,n], the value of the term coefficient is generated, and the establishment of the evidence function is completed.

[0008] Preferably, the method for generating the value of the term coefficient includes: uniformly generating sampling values ​​of N-bit hexadecimal numbers; randomly generating matching numbers within a preset value range, and associating the matching numbers with the sampling values ​​of the N-bit hexadecimal numbers; generating a polynomial function of the matching numbers with respect to the sampling values; rewriting the sampling values ​​in the polynomial function as the sum of the N-bit hexadecimal numbers, the first serial number, and the second serial number, expanding the polynomial function, and obtaining a multivariate polynomial function as a storage function.

[0009] Preferably, the evidence server generates a value table of N-digit hexadecimal numbers and matching numbers, and sends the value table to the execution node. After receiving the last N digits of the hash value and the node number sent by the data node, the execution node obtains the small cycle number according to the local time, sums the last N digits of the hash value, the node number and the small cycle number, and regards the result as an N-digit hexadecimal number. The value table is queried to obtain the corresponding matching number, and the matching number obtained from the table query is fed back to the data node.

[0010] Preferably, the evidence function is a multivariate polynomial function, and the expression of the evidence function is: matching number = ∑∑∑aijk*(Q*N-bit hexadecimal number)^i*first sequence number^j*second sequence number^k, where Q is the adjustment coefficient, Q<1, Q is a function of the second sequence number, the larger the second sequence number, the larger the value of Q, aijk is the term coefficient, i, j, k∈[1,n], the value of the term coefficient is generated, and the establishment of the evidence function is completed.

[0011] The substantial effect of the present invention is as follows: by using a unified evidence storage function between nodes, the corresponding matching number can be generated according to the hash value of the electronic data to complete the fixation of the data, without waiting for the confirmation of the system. The evidence storage delay almost only comes from the network delay, and the electronic data can be stored in a timely manner; using multiple execution nodes to execute the evidence storage, and connecting the nodes with the most unobstructed communication can speed up the efficiency of the evidence storage. BRIEF DESCRIPTION OF THE DRAWINGS

[0012] Figure 1 Schematic diagram of the electronic data storage method according to the first embodiment.

[0013] Figure 2 This is a schematic diagram of electronic data storage in Example 1.

[0014] Figure 3 This is a schematic diagram of a method for generating term coefficient values ​​according to the first embodiment.

[0015] Among them: 10, evidence server, 20, evidence function, 30, execution node, 40, data node. DETAILED DESCRIPTION

[0016] The specific implementation of the present invention will be further described below through specific examples in conjunction with the accompanying drawings.

[0017] Embodiment 1:

[0018] A low-latency electronic data storage method, please see the attached Figure 1, including: Step A01) establishing a proof server 10 and a plurality of execution nodes 30, the proof server 10 generates a proof function 20, and the proof function 20 is: matching number = f (N-digit hexadecimal number, first serial number, second serial number); Step A02) The evidence server 10 divides the evidence period T into several small periods, and the evidence server 10 converts the evidence function 20 into binary machine code and sends it to several execution nodes 30, and sends the start and end time of the evidence period T and the duration of the small period to several execution nodes 30; Step A03) Several data nodes 40 are connected to the evidence server 10 in succession, and the evidence server 10 assigns node serial numbers to the data nodes 40; Step A04) The data node 40 extracts the hash value of the electronic data to be stored, and sends the last N digits of the hash value to any execution node 30, and the associated node serial number and timestamp. Step A05) The execution node 30 verifies whether the difference between the timestamp sent by the data node 40 and the local time of the execution node 30 is within the preset range. If the difference exceeds the preset range, no operation is performed; Step A06) If the difference If it is within the preset range, the current small cycle number is obtained according to the local time of the execution node 30, the node number is used as the first number, the small cycle number is used as the second number, and is substituted into the evidence function 20 to obtain the corresponding matching number, and the matching number is fed back to the data node 40; step A07) the data node 40 stores the matching number and timestamp associated with the electronic data to be stored; step A08) during verification, the data node 40 extracts the hash value of the electronic data to be stored, and sends the last N bits of the hash value, the matching number, the node number and the timestamp to the evidence server 10; step A09) the evidence server 10 obtains the corresponding small cycle number according to the timestamp, and the evidence server 10 substitutes the last N bits of the hash value, the matching number, the node number and the small cycle number into the evidence function 20; step A10) if the equation of the evidence function 20 is established, it is determined that the electronic data has not been changed, otherwise, it is determined that the electronic data has been changed. When N is 10, the probability that the last N bits of the sub-segment hash value are the same is 1 / 16^10. After the electronic data is tampered with, the probability that the last N bits do not change is an extremely small probability. With the help of blockchain for data storage, there is not only waiting time for miners to package, but also after packaging into the block, in order to confirm that the blockchain will not roll back, it is necessary to wait for a preset time and continue to produce several blocks before confirming that the storage has been completed. This leads to a long delay between the data generation time and the completion time of the storage. When the blockchain network is busy, this delay may be as long as half an hour.

[0019] Please see attached Figure 2, the evidence server 10 generates an evidence function 20, and determines the start and end time of the evidence cycle and the duration of the small cycle. After the evidence cycle ends, the evidence function 20 is regenerated to start the next evidence cycle. During the evidence cycle, the data node 40 can connect to the evidence server 10 at any time, and after obtaining the node serial number, the data can be stored. If the data node 40 continuously generates electronic data that needs to be stored, it periodically sends the last N bits of the hash value of its own electronic data to the execution node 30, and continuously stores the evidence. If the data node 40 no longer has electronic data that needs to be stored, it no longer needs to be connected to the server and the execution node 30. The period for data node 40 to store evidence is different from the small period. It is recommended that the period for data node 40 to store evidence is greater than or equal to the duration of the small period. The small period serial number is used as the second serial number. The small period serial number is automatically determined by the execution node 30 according to the current time, and the data node 40 cannot be forged. Therefore, the matching number can be associated with the timestamp. If the electronic data is tampered with later and the execution node 30 is requested to generate a matching number again, the new matching number will correspond to the new timestamp, so that the tampering of the electronic data leaves traces. The execution node 30 obtains the binary machine code, but cannot obtain the original evidence function 20, and cannot cause the leakage of the evidence function 20.

[0020] The evidence server 10 generates multiple evidence functions 20, and the multiple evidence functions 20 are sent to the execution node 30. After the data node 40 sends the last N bits of the hash value associated with the node serial number to the execution node 30, the execution node 30 respectively calculates the value of the matching number obtained by each evidence function 20, and feeds back the minimum value of the matching number to the data node 40. During verification, the evidence server 10 substitutes the last N bits of the hash value, the matching number, the node serial number and the small cycle serial number into the evidence function 20. If any of the evidence functions 20 is established, it is determined that the electronic data has not been changed. If all the evidence functions 20 are not established, it is determined that the electronic data has been changed. Among the multiple evidence functions 20, the minimum value of the matching number is fed back, so that the functional relationship between the matching number and the last N bits of the hash value, the node serial number and the small cycle serial number is more complicated, and it is difficult to reversely deduce the evidence function 20, thereby protecting the security of the evidence function 20.

[0021] The evidence function 20 is a multivariate polynomial function, and the expression of the evidence function 20 is: matching number = ∑∑∑aijk* N-digit hexadecimal number ^i* first serial number ^j* second serial number ^k, where aijk is the term coefficient, i, j, k∈[1,n], and the value of the term coefficient is generated to complete the establishment of the evidence function 20. The characteristics of the multivariate polynomial function are that the change of the independent variable can significantly cause the change of the matching number, and the change rules are diverse and difficult to be reversed, so it has high security.

[0022] Please see attached Figure 3, the method for generating the value of the term coefficient includes: step B01) uniformly generating the sampling value of the N-bit hexadecimal number; step B02) randomly generating the matching number within the preset value range, and associating the matching number with the sampling value of the N-bit hexadecimal number; step B03) generating a polynomial function of the matching number to the sampling value; step B04) rewriting the sampling value in the polynomial function into the sum of the N-bit hexadecimal number, the first sequence number and the second sequence number, and expanding the polynomial function to obtain a multivariate polynomial function as the evidence function 20. Rewriting the sampling value into the sum of the N-bit hexadecimal number, the first sequence number and the second sequence number actually simplifies the multivariate polynomial function into a univariate polynomial function, simplifies the evidence function 20, and speeds up the execution efficiency of the evidence function 20. At the same time, it still has a sufficient number of changes in the increasing regularity. The sum of the N-bit hexadecimal number, the first sequence number and the second sequence number is regarded as an independent variable, and the exponential value of the highest order term of the univariate polynomial function is reduced by 1, which is the number of changes in the increase and decrease attributes of the fitting function. That is, when the highest order term in the polynomial is 6, the number of monotonic changes of the fitting function is 5. That is, it is monotonically increasing first, and then turns to monotonically decreasing, and changes repeatedly 5 times, with 5 extreme points. The position of the extreme point is the point where the first-order derivative of the polynomial function is 0. The position of the extreme point is determined by the term coefficient.

[0023] The evidence storage server 10 generates a value table of N-digit hexadecimal numbers and matching numbers, and sends the value table to the execution node 30. After receiving the last N digits of the hash value and the node sequence number sent by the data node 40, the execution node 30 obtains the small cycle sequence number according to the local time, sums the last N digits of the hash value, the node sequence number and the small cycle sequence number, and regards the result as an N-digit hexadecimal number. The value table is queried to obtain the corresponding matching number, and the matching number obtained from the table query is fed back to the data node 40. Using the value table to query the table to obtain the matching number can speed up the time of matching number feedback and further reduce delays.

[0024] The evidence function 20 is a multivariate polynomial function, and the expression of the evidence function 20 is: matching number = ∑∑∑aijk*(Q*N-bit hexadecimal number)^i*first sequence number^j*second sequence number^k, where Q is the adjustment coefficient, Q<1, Q is a function of the second sequence number, the larger the second sequence number, the larger the value of Q, aijk is the term coefficient, i, j, k∈[1,n], the value of the term coefficient is generated, and the establishment of the evidence function 20 is completed. Using the adjustment coefficient value associated with the second sequence number helps to reduce the number of changes in the increase and decrease rules of the evidence function 20 and simplify the evidence function 20.

[0025] The beneficial technical effect of this embodiment is: by using a unified evidence function 20 between nodes, the corresponding matching number is generated according to the hash value of the electronic data to complete the fixation of the data, without waiting for the confirmation of the system. The evidence delay almost only comes from the network delay, and the electronic data can be stored in time; using multiple execution nodes 30 to execute evidence, and the execution node 30 with the most unobstructed node connection communication can speed up the efficiency of evidence storage.

[0026] The above-described embodiment is only a preferred solution of the present invention and does not limit the present invention in any form. There are other variations and modifications without exceeding the technical solution described in the claims.

Claims

1. A low-latency electronic data storage method, characterized in that: include: Establish a proof server and several execution nodes, the proof server generates a proof function, the proof function is: matching number = f (N-digit hexadecimal number, first serial number, second serial number); The evidence server divides the evidence cycle T into a number of small cycles, converts the evidence function into binary machine code and sends it to a number of execution nodes, and sends the start and end times of the evidence cycle T and the duration of the small cycle to the number of execution nodes; Several data nodes are connected to the evidence storage server in sequence, and the evidence storage server assigns node serial numbers to the data nodes; The data node extracts the hash value of the electronic data to be stored, and sends the last N bits of the hash value associated with the node serial number and the timestamp to any execution node; The execution node verifies whether the difference between the timestamp sent by the data node and the local time of the execution node is within a preset range. If the difference is within the preset range, the current small cycle number is obtained according to the local time of the execution node, the node number is used as the first number, the small cycle number is used as the second number, and is substituted into the evidence storage function to obtain the corresponding matching number, and the matching number is fed back to the data node. If the difference exceeds the preset range, no operation is performed; The data node stores the electronic data to be stored in association with the matching number and the timestamp; During verification, the data node extracts the hash value of the stored electronic data, and sends the last N digits of the hash value, the number of matches, the node sequence number and the timestamp to the evidence server. The evidence server obtains the corresponding small cycle sequence number based on the timestamp. The evidence server substitutes the last N digits of the hash value, the number of matches, the node sequence number and the small cycle sequence number into the evidence function. If the evidence function equation holds, it is determined that the electronic data has not been changed. Otherwise, it is determined that the electronic data has been changed.

2. A low-latency electronic data storage method according to claim 1, characterized in that: The evidence server generates multiple evidence functions, which are sent to the execution node. After the data node sends the last N bits of the hash value associated with the node serial number to the execution node, the execution node calculates the value of the matching number obtained by each evidence function respectively, and feeds back the minimum value of the matching number to the data node. During verification, the evidence server substitutes the last N bits of the hash value, the matching number, the node serial number and the small cycle serial number into the evidence function. If any of the evidence functions is established, it is determined that the electronic data has not been changed. If all the evidence functions are not established, it is determined that the electronic data has been changed.

3. A low-latency electronic data storage method according to claim 1 or 2, characterized in that: The evidence function is a multivariate polynomial function, and the expression of the evidence function is: matching number = ∑∑∑aijk* N-bit hexadecimal number ^i*first serial number ^j*second serial number ^k, where aijk is the term coefficient, i, j, k∈[1,n], and the value of the term coefficient is generated to complete the establishment of the evidence function.

4. A low-latency electronic data storage method according to claim 3, characterized in that: Methods for generating values ​​for term coefficients include: Generate N-bit hexadecimal number sampling values ​​uniformly; Randomly generate a matching number within a preset value range, and associate the matching number with a sample value of an N-digit hexadecimal number; Generate a polynomial function matching the number of pairs of sample values; Rewrite the sampled value in the polynomial function as the sum of an N-digit hexadecimal number, the first serial number, and the second serial number, expand the polynomial function, and obtain a multivariate polynomial function as the evidence function.

5. A low-latency electronic data storage method according to claim 4, characterized in that: The evidence storage server generates a value table of N-digit hexadecimal numbers and matching numbers, and sends the value table to the execution node. After receiving the last N digits of the hash value and the node number sent by the data node, the execution node obtains the small cycle number according to the local time, sums the last N digits of the hash value, the node number and the small cycle number, and regards the result as an N-digit hexadecimal number. The value table is queried to obtain the corresponding matching number, and the matching number obtained from the table query is fed back to the data node.

6. A low-latency electronic data storage method according to claim 1 or 2, characterized in that: The evidence function is a multivariate polynomial function, and the expression of the evidence function is: matching number = ∑∑∑aijk*(Q*N-bit hexadecimal number)^i*first sequence number^j*second sequence number^k, where Q is the adjustment coefficient, Q<1, Q is a function of the second sequence number, the larger the second sequence number, the larger the value of Q, aijk is the term coefficient, i, j, k∈[1,n], the value of the term coefficient is generated, and the establishment of the evidence function is completed.

Images