# US 2023/0274271 A1 · Data management method, apparatus and system based on blockchain

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2023/0274271 A1
- Document ID: US20230274271A1
- Status: Published application
- Kind: A1
- Application number: 18/017,937
- Filed: 2021-07-26
- Published: 2023-08-31
- Earliest claimed: 2020-07-31
- Assignees: Beijing BOE Technology Development Co., Ltd.; Boe Technology Group Co., Ltd.
- Applicants: Beijing Boe Technology Development Co., Ltd.; Boe Technology Group Co., Ltd.
- Inventors: Junjie ZHAO
- Web page: https://patentgrep.com/patent/US20230274271A1

## CPC

- G06Q 20/389: {Keeping log of transactions for guaranteeing non-repudiation of a transaction}
- H04L 63/123: {received data contents, e.g. message integrity}
- G06F 16/1824: {implemented using Network-attached Storage [NAS] architecture (distributed or networked storage systems G06F3/067; protocols for distributed storage of data in a network H04L67/1097)}
- G06F 16/2365: {Ensuring data consistency and integrity}
- G06F 16/27: Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
- G06N 5/04: Inference or reasoning models
- G06Q 20/065: {using e-cash}
- G06Q 20/0658: {e-cash managed locally}
- G06Q 20/401: {Transaction verification}
- G16Y 10/25: Manufacturing
- G16Y 40/60: Positioning; Navigation
- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- H04L 67/1097: for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
- H04L 67/12: specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G16Y: INFORMATION AND COMMUNICATION TECHNOLOGY SPECIALLY ADAPTED FOR THE INTERNET OF THINGS [IoT]

## Abstract

A data management method, device and system based on blockchain. The data management method based on a blockchain is applied to a verification node. The method includes: acquiring transaction data including N pieces of digest data that are respectively generated on the basis of N pieces of data associated with the transaction data, and N is an integer greater than 1; selecting, from the N pieces of digest data, M pieces of digest data to be used for verification, M is an integer less than or equal to N and greater than or equal to 1; acquiring M pieces of storage data respectively corresponding to the M pieces of digest data; calculating 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 a blockchain.

## Claims

### Claim 1

A blockchain-based data management method, which is applied to at least one verification node, the method comprising:
acquiring transaction data, wherein the transaction data comprises N pieces of digest data, the N pieces of digest data are respectively generated on the basis of N pieces of data associated with the transaction data, 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 or equal to N and greater than or equal to 1;
acquiring M pieces of storage data respectively corresponding to the M pieces of digest data;
calculating 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.

### Claim 2 (depends on 1)

The method according to claim 1, 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, 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.

### Claim 3 (depends on 1)

The method according to claim 1, wherein the transaction data further comprises position information of the N pieces of data, and the acquiring the M pieces of storage data respectively corresponding to the M pieces of digest data comprises:
acquiring the M pieces of storage data respectively according to the position information of the M pieces of data based on which the M pieces of digest data is generated.

### Claim 4 (depends on 1)

The method according to claim 1, wherein the transaction data further comprises device identification corresponding to the N pieces of data, and/or time information corresponding to the N pieces of data.

### Claim 5 (depends on 3)

The method according to claim 3, wherein the position information of the N pieces of data comprises:
position information of a data server node storing the N pieces of data, and position information of each of the N pieces of data in the data server node.

### Claim 6 (depends on 1)

The method according to claim 1, 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.

### Claim 7

(canceled)

### Claim 8 (depends on 1)

The method according to claim 1, wherein the at least one verification node comprises a plurality of verification nodes, the digest data verified by a first type of verification node in the plurality of verification nodes comprises digest data generated on the basis of a piece of data with a shortest length in the M pieces of data that generate the M pieces of digest data .

### Claim 9 (depends on 8)

The data management method according to claim 8, wherein the M pieces of data comprise one piece of a complete data and M-1 pieces of partition data of the complete data, and a second type of verification node in the plurality of nodes verifies the digest data generated on the basis of the complete data.

### Claim 10 (depends on 8)

The data management method according to claim 8, wherein the M pieces of data comprise M pieces of partition data of one piece of a complete data, and a second type of verification node in the plurality of nodes verifies the digest data which is not verified by the first type of verification node.

### Claim 11 (depends on 9)

The data management method according to claim 9, wherein the amount of the first type of verification node is greater than the amount of the second type of verification node.

### Claim 12

A blockchain-based data management method, which is applied to a usage node, the method comprising:
acquiring M pieces of digest data from N pieces of digest data included in transaction data corresponding to a specific device and/or a time period, wherein the N pieces of digest data are respectively generated on the basis of N pieces of data associated with the transaction data, and N is an integer greater than 1, and M is an integer less than or equal to N and greater than or equal to 1;
acquiring M pieces of storage data respectively corresponding to the M pieces of digest data;
calculating respective digests of the M pieces of storage data, and
determining complete data associated with the transaction data is not tampered with when the M pieces of digest data are identical to the respective digests of the M pieces of storage data, respectively.

### Claim 13 (depends on 12)

The method according to claim 12, 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 the 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, 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 the complete data, and the M pieces of data comprise M pieces of partition data of the complete data.

### Claim 14 (depends on 12)

The method according to claim 12, wherein
at least two of the N pieces of data have different lengths, and digests of 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.

### Claim 15

(canceled)

### Claim 16

A blockchain-based data management method which is applied to an intermediate device, the method comprising:
acquiring complete data of at least one sensor device;
dividing the complete data of the at least one sensor device into P pieces of data, and generating complete digest data on the basis of the complete data of the at least one sensor device and/or generating P pieces of digest data on the basis of the P pieces of data respectively, and P is an integer greater than 1;
storing the P pieces of data and/or the complete data in a data server node; and
including P pieces of digest data and/or N pieces of digest data of the complete digest data in transaction data and sending the transaction data to a verification node of the blockchain, and N is equal to P or P+1,
wherein the verification node in the blockchain generates a block of the transaction data and writes the block into the blockchain when M pieces of digest data in the N pieces of digest data calculated by the intermediate device are identical to respective digests of M pieces of storage data corresponding to the M pieces of digest data calculated by the verification node, wherein M is an integer less than N and greater than or equal to 1.

### Claim 17 (depends on 16)

The method according to claim 16, wherein
M pieces of data based on which the M pieces of digest data is generated comprise the complete data and M-1 pieces of partition data of the complete data, or the M pieces of data comprise M pieces of partition data of the complete data.

### Claim 18 (depends on 17)

The method according to claim 17, wherein
at least two of the P 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 P pieces of data.

### Claim 19

(canceled)

### Claim 20 (depends on 17)

The method according to claim 17, wherein
data uploaded by the at least one sensor device comprises device identification and/or time information in addition to the complete data.

### Claim 21 (depends on 20)

The method according to claim 20, wherein data uploaded by a single sensor device is taken as a piece of a complete data; or a plurality of pieces of data uploaded by a single sensor device in each time period are combined as one piece of time-combined complete data; or a plurality of pieces of data uploaded by a plurality of sensor devices in each time period are combined as one piece of device-combined complete data,
wherein the dividing the complete data of the at least one sensor device into P pieces of data comprises:
dividing the complete data, the time-combined complete data or the device-combined complete data according to a preset proportion in sequence, or
dividing the time-combined complete data according to time base on the time information, or
dividing the device-combined complete data in units of sensor devices based on the device identification or in units of time periods base on the time information.

### Claim 22 (depends on 16)

The method according to claim 16, further comprising:
including position information of the P pieces of data, the device identification corresponding to the P pieces of data, and/or the time information corresponding to the P pieces of data, together with the complete digest data and/or the N pieces of digest data in the P pieces of digest data, in the transaction data and sending the transaction data to the verification node of the blockchain.

### Claim 23 (depends on 22)

The method according to claim 22, wherein the position information of the P pieces of data comprises:
position information of the data server node storing the P pieces of data and position information of each piece of storage data in the P pieces of data in the data server node.

### Claim 24

(canceled)

### Claim 25

(canceled)
