System and method of multi-round token distribution using a blockchain network
A computer-implemented method to participate in a token transfer process for transferring a first quantity of token from a sender node to a recipient node using a blockchain is disclosed. The method comprising: joining a token transfer process as a participating node in the indirect anonymous transfer protocol; obtaining a list of indirect token transactions for which the first node is either an input node or an output node for in the indirect anonymous transfer protocol; generating, in collaboration with other participating nodes of the indirect anonymous transfer protocol, a commitment channel between the first node and each of the other participating nodes for which an indirect token transaction identified in the list obtained by the first node, and collaborating with all the other participating nodes and executing the indirect token transactions in which the first node is involved, using the generated commitment channels.
1. A computer-implemented method implemented by a first node participating in an indirect anonymous transfer protocol, the method comprising:
joining a token transfer process as a participating node in the indirect anonymous transfer protocol;
obtaining a list of indirect token transactions for which the first node is either an input node or an output node for in the indirect anonymous transfer protocol;
generating, in collaboration with other participating nodes of the indirect anonymous transfer protocol, a commitment channel between the first node and each of the other participating nodes for which an indirect token transaction identified in the list obtained by the first node,
collaborating with all the other participating nodes and executing the indirect token transactions in which the first node is involved, using the generated commitment channels.
2. The computer-implemented method of claim 1 , wherein the list of indirect token transactions comprises at least two transactions that have the input node or the output node that is different to a sender or recipient node of the respective transactions.
3. The computer-implemented method of claim 1 , wherein joining the token transfer process is implemented in a decentralized manner.
4. The computer-implemented method of claim 1 , wherein joining the token transfer process is implemented by a central authority that assembles a suitable group of participating nodes based, at least in part, on ensuring inclusion of a sufficient number of nodes in the group and one or more sender-recipient pairs wishing to transfer tokens between each other.
5. The computer-implemented method of claim 1 , wherein the list is a subset of a set of all indirect token transactions that are generated as part of the indirect anonymous transfer protocol.
6. The computer-implemented method of claim 1 , further comprising obtaining a secret share of a private key, k i , of a private key, k, wherein each indirect token transaction corresponding to a commitment channel is secured by a public key Q of the private key k such that Q=kG, where G is a basepoint on the Elliptic Curve, and wherein prior to generation of the commitment channels, the value k is unknown to any participant.
7. The computer-implemented method of claim 6 , further comprising:
collaborating with the other participating nodes to generate the public key, Q, corresponding to the private key, k, using secret share joining.
8. The computer-implemented method of claim 7 , wherein generating the commitment channel comprises creating a commitment transaction using a random value k B communicated by U B which is a counterpart in the commitment transaction, and
creating a return transaction which returns committed tokens to the first node.
9. The computer-implemented method of claim 8 , further comprising:
collaborating with the other nodes to recover the private key, k, using the secret key share, k i , and a secret sharing scheme; and
once the value of k is determined, if the participating first node is a transferee of the commitment channel, utilizing the secret value, sv B =k+k B , in a <scriptSig> of a corresponding transfer transaction in order to obtain a transferred quantity of tokens.
10. The computer-implemented method of claim 1 , wherein each of the input node and the output node addresses provided by the first participating node for the indirect transfer transactions that the node is involved with are unique in that no address of the first node is reused at any point in the indirect anonymous transfer protocol.
11. A computing device to initiate a token transfer process that includes a plurality of participating nodes, the computing device comprising:
memory;
a network interface to provide network connectivity; and
a processor configured to carry out a method comprising:
joining a token transfer process as a participating node in the indirect anonymous transfer protocol;
obtaining a list of indirect token transactions for which the first node is either an input node or an output node for in the indirect anonymous transfer protocol;
generating, in collaboration with other participating nodes of the indirect anonymous transfer protocol, a commitment channel between the first node and each of the other participating nodes for which an indirect token transaction identified in the list obtained by the first node; and
collaborating with all the other participating nodes and executing the indirect token transactions in which the first node is involved, using the generated commitment channels.
12. The computing device of claim 11 , wherein the list of indirect token transactions comprises at least two transactions that have an input node or an output node that is different to a sender or recipient node of the respective transactions.
13. The computing device of claim 11 , wherein joining the token transfer process is implemented in a decentralized manner.
14. The computing device of claim 11 , wherein joining the token transfer process is implemented by a central authority that assembles a suitable group of participating nodes based, at least in part, on ensuring inclusion of a sufficient number of nodes in the group and one or more sender-recipient pairs wishing to transfer tokens between each other.
15. The computing device of claim 11 , wherein the list is a subset of a set of all indirect token transactions that are generated as part of the indirect anonymous transfer protocol.
16. The computing device of claim 11 , further comprising obtaining a secret share of a private key, k i , of a private key, k, wherein each indirect token transaction corresponding to a commitment channel is secured by a public key Q of the private key k such that Q=kG, where G is a basepoint on the Elliptic Curve, and wherein prior to generation of the commitment channels, the value k is unknown to any participant.
17. The computing device of claim 16 , further comprising:
collaborating with the other participating nodes to generate the public key, Q, corresponding to the private key, k, using secret share joining.
18. The computing device of claim 17 , wherein generating the commitment channel comprises creating a commitment transaction using a random value k B communicated by U B which is a counterpart in the commitment transaction, and creating a return transaction which returns the committed tokens to the first node.
19. The computing device of claim 18 , further comprising:
collaborating with the other nodes to recover the private key, k, using the secret key share, k i , and a secret sharing scheme; and
once the value of k is determined, if the participating first node is a transferee of the commitment channel, utilizing the secret value, Sv B =k+k B , in a <scriptSig> of a corresponding transfer transaction in order to obtain a transferred quantity of tokens.
20. A non-transitory processor-readable medium storing processor-executable instructions to initiate a token transfer process that includes a plurality of participating nodes, wherein the processor-executable instructions, when executed by a processor, cause the processor to carry out the method claimed in claim 1 .