Blockchain-based transaction processing

Patent metadata

Field	Value
Publication number	US-11222011-B2
Application number	US-202016805331-A
Country	US
Kind code	B2
Filing date	Feb 28, 2020
Priority date	Jun 28, 2019
Publication date	Jan 11, 2022
Grant date	Jan 11, 2022

Abstract

This disclosure relates to blockchain-based transaction processing. In one aspect, a method includes obtaining pieces of transaction data. At least a portion of the pieces of transaction data have a respective group identifier that identifies a node group for the piece of transaction data. Each node group includes multiple blockchain nodes. Pieces of transaction data that have a same first group identifier that identifies a first node group are identified in the obtained pieces of transaction data. The pieces of transaction data are packaged into a first packaging result based on the pieces of transaction data having the same first group identifier. The first packaging result is submitted to a blockchain for storage.

First claim

What is claimed is:

1. A computer-implemented method, comprising:
obtaining, from a plurality of clients, pieces of transaction data comprising pieces of non-private transaction data visible to each blockchain node in a blockchain and pieces of private transaction data, wherein:
each piece of private transaction data has a corresponding group identifier that identifies a corresponding node group for the piece of transaction data and each piece of public transaction data does not have a corresponding group identifier;
each node group comprises a plurality of blockchain nodes; and
each piece of private transaction data is only visible to the plurality of blockchain nodes in the corresponding node group identified by the group identifier corresponding to the piece of private transaction data;

for each particular group identifier:
obscuring a quantity of transactions corresponding to the particular group identifier submitted to the blockchain, the obscuring comprising:
identifying, in the obtained pieces of transaction data, a plurality of pieces of private transaction data that have the particular group identifier that identifies a particular node group, wherein identifying the plurality of pieces of private transaction data that have the particular group identifier comprises:
collecting, in a transaction data pool, each piece of private transaction data,
identifying, as the plurality of pieces of private transaction data, the pieces of private transaction data in the transaction data pool that have the particular group identifier;

generating a respective packaging result for the particular group identifier, the generating including packaging the plurality of pieces of private transaction data having the particular group identifier into the respective packaging result in response to the plurality of pieces of private transaction data having the particular group identifier; and
submitting, to the blockchain for storage, fake transaction data comprising the particular group identifier and a hash of empty transaction content for a fake transaction;

submitting each packaging result and, for each packaging result, the particular group identifier for the packaging result, to the blockchain for storage, wherein at least one packaging result comprises pieces of private transaction data obtained from multiple clients; and
submitting each unpackaged piece of public transaction data to the blockchain for storage.

2. The computer-implemented method of claim 1 , wherein:
packaging the plurality of pieces of private transaction data having the particular group identifier into the respective packaging result comprises encrypting the plurality of pieces of private transaction data as a whole to obtain an encryption result; and
submitting each packaging result to the blockchain for storage comprises submitting the encryption result to the blockchain for storage.

3. The computer-implemented method of claim 1 , wherein:
packaging the plurality of pieces of private transaction data comprises constructing a Merkle tree based on the plurality of pieces of private transaction data, wherein the Merkle tree comprises a root node comprising a hash value; and
submitting each packaging result to the blockchain for storage comprises submitting the root node of the Merkle tree to the blockchain for storage.

4. The computer-implemented method of claim 1 , wherein submitting, to the blockchain for storage, the fake transaction data comprising the particular group identifier and the hash of the empty transaction content for the fake transaction comprises:
generating the fake transaction data;
calculating a hash value corresponding to the fake transaction data; and
in response to a predetermined condition being satisfied, submitting the hash value to the blockchain for storage.

5. The computer-implemented method of claim 1 , further comprising:
for each particular group identifier:
generating a plurality of pieces of fake transaction data, wherein each piece of fake transaction data in the plurality of pieces of fake transaction data has the particular group identifier;
packaging the plurality of pieces of fake transaction data into a second packaging result; and
in response to a predetermined condition being satisfied, submitting the second packaging result to the blockchain for storage.

6. The computer-implemented method of claim 1 , further comprising:
determining that a consensus trigger condition is satisfied;
selecting a given blockchain node as a consensus blockchain node;
obtaining, by the given blockchain node, at least one piece of transaction data from a second transaction data pool of the given blockchain node;
constructing data blocks based on the at least one piece of transaction data and the plurality of pieces of private transaction data of at least one packaging result; and
assembling the constructed data blocks onto the blockchain as new data blocks.

7. The computer-implemented method of claim 2 , wherein the method is performed by a target blockchain node, and the target blockchain node is in the particular node group, the method further comprising:
sending the encryption result and a decryption key to other blockchain nodes in the particular node group through an off-chain channel, wherein the other blockchain nodes verify the plurality of pieces of private transaction data using the decryption key.

8. The computer-implemented method of claim 3 , wherein the method is performed by a target blockchain node, and the target blockchain node is in the particular node group, the method further comprising:
sending the root node of the Merkle tree and the plurality of pieces of private transaction data to other blockchain nodes in the particular node group through an off-chain channel, wherein the other blockchain nodes verify the plurality of pieces of private transaction data using the hash value of the root node.

9. The computer-implemented method of claim 4 , wherein the predetermined condition comprises a time interval reaching a predetermined threshold, wherein the time interval begins after each blockchain node in the particular node group submits transaction data to the blockchain for a last time.

10. The computer-implemented method of claim 5 , wherein submitting the second packaging result to the blockchain for storage comprises submitting the second packaging result and the particular group identifier to the blockchain for storage.

11. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations comprising:
obtaining, from a plurality of clients, pieces of transaction data comprising pieces of non-private transaction data visible to each blockchain node in a blockchain and pieces of private transaction data, wherein:
each piece of private transaction data has a corresponding group identifier that identifies a corresponding node group for the piece of transaction data and each piece of public transaction data does not have a corresponding group identifier;
each node group comprises a plurality of blockchain nodes; and
each piece of private transaction data is only visible to the plurality of blockchain nodes in the corresponding node group identified by the group identifier corresponding to the piece of private transaction data;

for each particular group identifier:
obscuring a quantity of transactions corresponding to the particular group identifier submitted to the blockchain, the obscuring comprising:
identifying, in the obtained pieces of transaction data, a plurality of pieces of private transaction data that have the particular group identifier that identifies a particular node group,

Assignees

• Advanced New Technologies Co Ltd

Inventors

• Yang Dayi

Classifications

• H04L9/50

  using hash chains, e.g. blockchains or hash trees · CPC title

• G06F16/9024

  Graphs; Linked lists (G06F16/9027 takes precedence) · CPC title

• H04L2209/42

  Anonymization, e.g. involving pseudonyms · CPC title

• H04L9/3239 Primary

  involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD · CPC title

• H04L9/0894

  Escrow, recovery or storing of secret information, e.g. secret key escrow or cryptographic key storage · CPC title