| CPC G06Q 20/389 (2013.01) [G06F 16/1824 (2019.01); G06F 16/2365 (2019.01); G06F 16/27 (2019.01); G06N 5/04 (2013.01); G06Q 20/065 (2013.01); G06Q 20/0658 (2013.01); G06Q 20/401 (2013.01); G16Y 10/25 (2020.01); G16Y 40/60 (2020.01)] | 14 Claims |

|
1. A blockchain-based data management method, which is applied to at least one verification node and performed by a processor thereof, the method comprising:
acquiring, from an intermediate device, transaction data, wherein the transaction data comprises N pieces of digest data, the N pieces of digest data are respectively generated at the intermediate device on the basis of N pieces of data associated with the transaction data using hash algorithm and encrypted, and wherein the N pieces of digest data are related to complete data uploaded from at least one sensor device to the intermediate device and N is an integer greater than 1;
selecting M pieces of digest data to be used for verification from the N pieces of digest data, wherein M is an integer which is less than N and greater than or equal to 1;
acquiring, from a data server node, M pieces of storage data respectively corresponding to the M pieces of digest data;
calculating, using the hash algorithm, respective digests of the M pieces of storage data; and
when the M pieces of digest data are identical to the respective digests of the M pieces of storage data, respectively, writing the transaction data into the blockchain,
wherein at least two of the N pieces of data have different lengths, and the M pieces of digest data comprise digest data generated on the basis of a piece of data with a shortest length in the N pieces of data,
wherein the N pieces of data comprise one piece of a complete data and N−1 pieces of partition data of the complete data, and M pieces of data based on which the M pieces of digest data is generated comprise one piece of a complete data and M−1 pieces of partition data of the complete data, wherein M and N are greater than 2, or the M pieces of data comprise M pieces of partition data of the complete data; or,
the N pieces of data comprise N pieces of partition data of one piece of a complete data, and the M pieces of data comprise M pieces of partition data of the complete data.
|