Blockchain data protection based on generic account model and homomorphic encryption

A computer-implemented system, comprising:

• one or more computers;
• and
• one or more computer memory devices interoperably coupled with the one or more computers and having tangible, non-transitory, machine-readable media storing one or more instructions that, when executed by the one or more computers, perform operations comprising:
• receiving transaction data associated with a transaction between a first node and a second node within a blockchain network, the transaction data comprising:
• a first commitment that hides a first random number and a transaction amount of the transaction;
• a second commitment that hides a second random number and a change calculated based on deducting the transaction amount from a total value of a plurality of assets;
• the transaction amount and a third random number both encrypted by a public key of the second node based on a probabilistic homomorphic encryption (HE) scheme;
• the change and a fourth random number both encrypted by a public key of the first node based on the probabilistic HE scheme;
• and
• a zero-knowledge proof (ZKP);
• and
• determining, based at least on the ZKP, that the transaction is valid by determining that the first random number is equal to the third random number, the second random number is equal to the fourth random number, and the transaction amount hidden in the first commitment is equal to the transaction amount encrypted by the public key of the second node.

A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations comprising:

• receiving transaction data associated with a transaction between a first node and a second node within a blockchain network, the transaction data comprising:
• a first commitment that hides a first random number and a transaction amount of the transaction;
• a second commitment that hides a second random number and a change calculated based on deducting the transaction amount from a total value of a plurality of assets;
• the transaction amount and a third random number both encrypted by a public key of the second node based on a probabilistic homomorphic encryption (HE) scheme;
• the change and a fourth random number both encrypted by a public key of the first node based on the probabilistic HE scheme;
• and
• a zero-knowledge proof (ZKP);
• and
• determining, based at least on the ZKP, that the transaction is valid by determining that the first random number is equal to the third random number, the second random number is equal to the fourth random number, and the transaction amount hidden in the first commitment is equal to the transaction amount encrypted by the public key of the second node.