CROSS-ASSET TRADING WITHIN BLOCKCHAIN NETWORKS

• US 20190311351A1
• Filed: 06/21/2019
• Published: 10/10/2019
• Est. Priority Date: 01/31/2019
• Status: Active Grant

• Current Assignee: Advanced New Technologies Company Limited (Ant Group Co., Ltd.)
• Original Assignee: Alibaba Group Holding Ltd.
• Inventors: Zhang, Wenbin, Lei, Hao, Li, Lichun, Huang, Zhangjie
• Granted Patent: US 10,990,963 B2
• Time in Patent Office: Days
• CPC Class Codes: 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
• CPC Class Codes: G06F 16/1834 implemented based on peer-to-peer networks, e.g. gnutella p2p communication protocols H04L67/104
• CPC Class Codes: G06Q 20/065 using e-cash
• CPC Class Codes: G06Q 20/0658 e-cash managed locally
• CPC Class Codes: G06Q 20/10 specially adapted for electronic funds transfer [EFT] systems; specially adapted for home banking systems
• CPC Class Codes: G06Q 20/223 based on the use of peer-to-peer networks
• CPC Class Codes: G06Q 20/36 using electronic wallets or electronic money safes
• CPC Class Codes: G06Q 20/381 Currency conversion
• CPC Class Codes: G06Q 20/389 Keeping log of transactions for guaranteeing non-repudiation of a transaction
• CPC Class Codes: G06Q 2220/00 Business processing using cryptography
• CPC Class Codes: G06Q 40/04 Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
• CPC Class Codes: H04L 2209/56 Financial cryptography, e.g. electronic payment or e-cash
• CPC Class Codes: H04L 9/0618 Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation
• CPC Class Codes: H04L 9/0643 Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
• CPC Class Codes: H04L 9/30 Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
• CPC Class Codes: H04L 9/3218 using proof of knowledge, e.g. Fiat-Shamir, GQ, Schnorr, ornon-interactive zero-knowledge proofs
• CPC Class Codes: H04L 9/3239 involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD
• CPC Class Codes: H04L 9/3247 involving digital signatures
• CPC Class Codes: H04L 9/50 using hash chains, e.g. blockchains or hash trees

Abstract

Implementations are directed to cross-asset trading in blockchain networks, and include a first node providing transaction information based on a first value, a second value, and an exchange rate of a second node, receiving, from the second node, a first evidence set, a first range proof, and a digital signature of the second node, and submitting the transaction for verification based on the first range proof, a second range proof, the first evidence set, a second evidence set, a digital signature of the first node, and the digital signature of the second node, the transaction being executed to decrease a balance of the first node by the first value, increase a first balance of the second node by the first value, decrease a second balance of the second node by the second value, and increase a balance of the third node by the second value.

Claims

1. A computer-implemented method for private cross-asset trading in a blockchain network, the method being executed by one or more processors and comprising:

generating, by a first node in the blockchain network and using Boneh-Goh-Nissim (BGN) encryption, ciphertexts based on a first value and a second value, the second value being determined based on the first value and an exchange rate provided by a second node in the blockchain network;

transmitting, by the first node to the second node, the first value and the ciphertexts;

receiving, by the first node and from the second node, a first evidence set comprising a set of data that can be used to verify the exchange rate in a zero-knowledge proof (ZKP) routine without revealing the exchange rate;

generating, by the first node, a second evidence set comprising a set of data that can be used to verify, using the ZKP routine, that the ciphertexts are encrypted by a BGN public key of the first node;

defining, by the first node, a transaction comprising a first transaction between the first node and the second node for transfer of the first value from the first node to the second node, and a second transaction between the second node and a third node for transfer of the second value from the second node to the third node; and

transmitting, by the first node, the transaction to at least one consensus node of the blockchain network for verification and execution of the transaction, the transaction being verified based on the first evidence set and the second evidence set, and in response to verifying the transaction, executing the first transaction and the second transaction to decrease a balance of the first node by the first value, increase a first balance of the second node by the first value, decrease a second balance of the second node by the second value, and increase a balance of the third node by the second value.

2. The method of claim 1, wherein the first evidence set is provided by the second node based on the first value, a pair of random numbers provided by the first node, and the ciphertexts.

3. The method of claim 1, wherein verifying the transaction by the at least one consensus node comprises verifying a digital signature of the first node and a digital signature of the second node.

4. The method of claim 1, wherein verifying the transaction by the at least one consensus node comprises verifying a first range proof provided by the first node and a second range proof provided by the second node.

5. The method of claim 4, wherein the first range proof comprises a ZKP to prove that the first value is greater than zero, and that the balance of the first node is greater than or equal to the first value.

6. The method of claim 4, wherein the second range proof comprises a ZKP to prove that the second balance of the second node is greater than or equal to the second value.

7. The method of claim 1, wherein the transaction further comprises a data set comprising a set of ciphertexts generated using BGN encryption, the data set being used to verify the transaction by the at least one consensus node.

8. The method of claim 1, further comprising receiving, by the first node, the exchange rate from the second node through a sub-chain channel of the blockchain network.

9. The method of claim 1, wherein at least one ciphertext of the ciphertexts is provided using Pedersen Commitment.

10. The method of claim 1, wherein the set of data of the first evidence set comprises a first data value and a second data value, each of the first data value and the second data value being determined based on parameters used to generate a BGN public key of the second node.

11. The method of claim 1, wherein the set of data of the second evidence set comprises a set of ciphertexts and a set of values, each value in the set of values being based on a hash of the set of ciphertexts.

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

generating, by a first node in a blockchain network and using Boneh-Goh-Nissim (BGN) encryption, ciphertexts based on a first value and a second value, the second value being determined based on the first value and an exchange rate provided by a second node in the blockchain network;

transmitting, by the first node to the second node, the first value and the ciphertexts;

receive, by the first node and from the second node, a first evidence set comprising a set of data that can be used to verify the exchange rate in a zero-knowledge proof (ZKP) routine without revealing the exchange rate;

generating, by the first node, a second evidence set comprising a set of data that can be used to verify, using the ZKP routine, that the ciphertexts are encrypted by a BGN public key of the first node;

defining, by the first node, a transaction comprising a first transaction between the first node and the second node for transfer of the first value from the first node to the second node, and a second transaction between the second node and a third node for transfer of the second value from the second node to the third node; and

transmitting, by the first node, the transaction to at least one consensus node of the blockchain network for verification and execution of the transaction, the transaction being verified based on the first evidence set and the second evidence set, and in response to verifying the transaction, executing the first transaction and the second transaction to decrease a balance of the first node by the first value, increase a first balance of the second node by the first value, decrease a second balance of the second node by the second value, and increase a balance of the third node by the second value.

13. The non-transitory, computer-readable medium of claim 12, wherein the first evidence set is provided by the second node based on the first value, a pair of random numbers provided by the first node, and the ciphertexts.

14. The non-transitory, computer-readable medium of claim 12, wherein verifying the transaction by the at least one consensus node comprises verifying a digital signature of the first node and a digital signature of the second node.

15. The non-transitory, computer-readable medium of claim 12, wherein verifying the transaction by the at least one consensus node comprises verifying a first range proof provided by the first node and a second range proof provided by the second node.

16. The non-transitory, computer-readable medium of claim 15, wherein the first range proof comprises a ZKP to prove that the first value is greater than zero, and that the balance of the first node is greater than or equal to the first value.

17. The non-transitory, computer-readable medium of claim 15, wherein the second range proof comprises a ZKP to prove that the second balance of the second node is greater than or equal to the second value.

18. The non-transitory, computer-readable medium of claim 12, wherein the transaction further comprises a data set comprising a set of ciphertexts generated using BGN encryption, the data set being used to verify the transaction by the at least one consensus node.

19. The non-transitory, computer-readable medium of claim 12, further encoded with instructions that are executable by the computer system and cause the computer system to receive, by the first node, the exchange rate from the second node through a sub-chain channel of the blockchain network.

20. The non-transitory, computer-readable medium of claim 12, wherein at least one ciphertext of the ciphertexts is provided using Pedersen Commitment.

21. The non-transitory, computer-readable medium of claim 12, wherein the set of data of the first evidence set comprises a first data value and a second data value, each of the first data value and the second data value being determined based on parameters used to generate a BGN public key of the second node.

22. The non-transitory, computer-readable medium of claim 12, wherein the set of data of the second evidence set comprises a set of ciphertexts and a set of values, each value in the set of values being based on a hash of the set of ciphertexts.

23. 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 one or more operations comprising;

generating, by a first node in a blockchain network and using Boneh-Goh-Nissim (BGN) encryption, ciphertexts based on a first value and a second value, the second value being determined based on the first value and an exchange rate provided by a second node in the blockchain network;

transmitting, by the first node to the second node, the first value and the ciphertexts;

receiving, by the first node and from the second node, a first evidence set comprising a set of data that can be used to verify the exchange rate in a zero-knowledge proof (ZKP) routine without revealing the exchange rate;

generating, by the first node, a second evidence set comprising a set of data that can be used to verify, using the ZKP routine, that the ciphertexts are encrypted by a BGN public key of the first node;

defining, by the first node, a transaction comprising a first transaction between the first node and the second node for transfer of the first value from the first node to the second node, and a second transaction between the second node and a third node for transfer of the second value from the second node to the third node; and

transmitting, by the first node, the transaction to at least one consensus node of the blockchain network for verification and execution of the transaction, the transaction being verified based on the first evidence set and the second evidence set, and in response to verifying the transaction, executing the first transaction and the second transaction to decrease a balance of the first node by the first value, increase a first balance of the second node by the first value, decrease a second balance of the second node by the second value, and increase a balance of the third node by the second value.

24. The computer-implemented system of claim 23, wherein the first evidence set is provided by the second node based on the first value, a pair of random numbers provided by the first node, and the ciphertexts.

25. The computer-implemented system of claim 23, wherein verifying the transaction by the at least one consensus node comprises verifying a digital signature of the first node and a digital signature of the second node.

26. The computer-implemented system of claim 23, wherein verifying the transaction by the at least one consensus node comprises verifying a first range proof provided by the first node and a second range proof provided by the second node.

27. The computer-implemented system of claim 26, wherein the first range proof comprises a ZKP to prove that the first value is greater than zero, and that the balance of the first node is greater than or equal to the first value.

28. The computer-implemented system of claim 26, wherein the second range proof comprises a ZKP to prove that the second balance of the second node is greater than or equal to the second value.

29. The computer-implemented system of claim 23, wherein the transaction further comprises a data set comprising a set of ciphertexts generated using BGN encryption, the data set being used to verify the transaction by the at least one consensus node.

30. The computer-implemented system of claim 23, wherein the one or more computer memory devices are further encoded with instructions that are executable by the one or more computers and cause the one or more computers to receive, by the first node, the exchange rate from the second node through a sub-chain channel of the blockchain network.