System and method for multi-round token distribution using a blockchain network
The method for multi-round token distribution in blockchain networks uses indirect transactions and commitment channels with secret sharing to ensure secure and complete token transfers, addressing the challenge of decentralized networks without central authorities.
Patent Information
- Application Number
- JP2023002428
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Priority Date
- 2017-06-20
- Filing Date
- 2023-01-11
- Publication Date
- 2024-11-20
- Estimated Expiration
- 2038-06-19
AI Technical Summary
Existing token distribution protocols in decentralized blockchain networks face challenges in ensuring secure and complete token transfers without relying on centralized authorities, leading to potential loss or theft and difficulties in preventing partial transaction completion.
A method and system for multi-round token distribution using indirect token transactions between multiple participating nodes, involving commitment channels and secret sharing to ensure secure and deterministic token transfers, ensuring completion without a centralized authority.
The solution provides secure, decentralized token transfers that prevent loss and theft, ensuring all transactions are completed as intended, maintaining network integrity and anonymity.
Smart Images

Figure 0007587607000008 
Figure 0007587607000009 
Figure 0007587607000010
Abstract
Description
[Technical field]
[0001] The present invention relates generally to blockchain transactions, and more particularly to methods and apparatus for structuring and executing transactions in which outputs and inputs are not linked while ensuring security and full completion of a set of transactions. In particular, the present application provides a method and system for multiple input nodes to cooperate to distribute tokens to multiple output nodes in a secure and deterministic manner that prevents token loss and theft while maintaining a trustless network structure. [Background technology]
[0002] In this document, we use the term "blockchain" to include all forms of electronic, computer-based, distributed ledgers, including, but not limited to, blockchain and transaction chain technologies, permissioned and permissionless ledgers, shared ledgers, and variations thereof. The most widely known application of blockchain technology is the Bitcoin ledger, although other blockchain implementations have been proposed and developed. For convenience and illustrative purposes, this document may refer to Bitcoin, but it is noted that the invention is not limited to use with the Bitcoin blockchain, and alternative blockchain implementations and protocols are within the scope of the invention.
[0003] A blockchain is a consensus-based electronic ledger implemented as a computer-based decentralized and distributed system that is composed of blocks, which in turn are composed of transactions. Each transaction is a data structure that encodes the transfer of control of digital assets between participants in the blockchain system and contains at least one input and at least one output. Each block contains a hash of the previous block, which allows blocks to be chained together to create a permanent, immutable record of all transactions written to the blockchain since its inception. Transactions contain small programs, known as scripts, embedded in their inputs and outputs that specify how and by whom the transaction's outputs can be accessed. In the Bitcoin platform, these scripts are written using a stack-based scripting language.
[0004] In order for a transaction to be written to the blockchain, it must be “verified.” Network nodes (miners) perform work to ensure that each transaction is valid, and invalid transactions are rejected from the network. A software client installed on the node performs this validation work on unspent transactions (UTXOs) by executing locking and unlocking scripts. If the locking and unlocking scripts are executed and evaluate to true, the transaction is valid and the transaction is written to the blockchain. Thus, for a transaction to be written to the blockchain, it must i) be verified by the first node that receives it. If the transaction is verified, the node relays it to other nodes in the network. Furthermore, the transaction must ii) be added to a new block constructed by miners and iii) be mined, i.e., added to the public ledger of past transactions.
[0005] A transaction involves the transfer of one or more tokens from one node to another. A token may represent future control over network resources. In some cases, a token may represent an asset or value, but not necessarily. For example, in some cases, a token may be understood as a cryptocurrency. However, this application is not limited to implementation in the context of cryptocurrencies, but may be understood more broadly as relating to blockchain networks for decentralized transfer of control tokens.
[0006] One of the recognized advantages of blockchain technologies like Bitcoin is the anonymity of transactions. Personal information of Bitcoin users is not formally and explicitly attached to Bitcoin addresses, and the blockchain Bitcoin ledger only contains public address information. However, using secondary data (e.g., shipping addresses required to complete a transaction) and analytics, interested third parties may be able to combine publicly available information to link a user's identity to a specific Bitcoin address.
[0007] To facilitate a higher level of anonymity in the Bitcoin protocol, mixing solutions may be implemented. In centralized mixing, a set of participants transfer their tokens to a central pool governed by a mixing service provider if at least one participant is moving blockchain tokens from one address to another. The service provider then distributes those tokens from the central pool to the appropriate output addresses. Mixing protocols rely on the service provider being trustworthy with knowledge of the input-output relationships of other participants. This centralized structure can be problematic because (1) dishonest mixing services may attempt to steal users' tokens and (2) mixing services may be pressured by regulators or other stakeholders to disclose the mapping of input and output addresses. More generally, mixing is a specific type of distribution protocol in which multiple input nodes distribute control over multiple tokens among multiple output nodes. Summary of the Invention [Problem to be solved by the invention]
[0008] Many token distribution services and potential protocols may suffer from either poor delinking or compromised security. For a distribution protocol to be effective in the context of a decentralized blockchain network, it must be designed and operated to minimize reliance on a centralized authority while still ensuring completion by all participating nodes in order to avoid malicious or asymmetric outcomes in the token distribution. It is therefore desirable to provide improved methods and apparatus for facilitating token distribution while avoiding lost or stolen tokens and ensuring that the process is implemented to be “trustless.” Implementing such a process in a decentralized blockchain network without the use of a centralized authority presents significant technical challenges. In a multi-round token distribution process, it is particularly difficult to ensure that the prescribed token distribution is achieved and to prevent intentional or accidental misallocation of tokens due, for example, to offline participant nodes during one or more rounds of the process.
[0009] Such an improved solution has now been devised. [Means for solving the problem]
[0010] Thus, in accordance with the present invention there is provided a method and apparatus as defined in the appended claims.
[0011] The present invention may provide a computer-implemented method and corresponding system. The method / system may be described as a blockchain-implemented method / system. The present invention may be described as a security method or a cryptographic method / system. The present invention may provide a secure transfer of a digital asset, such as a portion or amount of cryptocurrency. Additionally or alternatively, the present invention may provide a control mechanism for controlling the transfer of a digital asset, such as a portion or amount of cryptocurrency.
[0012] This application describes a computer-implemented method for participating in a token transfer process for transferring a first amount of tokens from a sender node to a receiver node using a blockchain. The token transfer process includes a plurality of participating nodes and the execution of a set of indirect token transactions between a plurality of pairs of participating nodes. The sender node and the receiver node are included in the token transfer process as participating nodes. The method implemented in the participating nodes includes: obtaining a subset of the set of indirect token transactions, the subset including transactions in which the participating node is either an input node or an output node, the set of indirect token transactions being generated based on the first amount of tokens and a predetermined number of transaction rounds in the token transfer process; for each indirect token transaction in the subset, in cooperation with each second participating node included in the indirect token transaction, generating a commitment channel for the indirect token transaction between the participating node and the second participating node; and in cooperation with all other participating nodes in executing the indirect token transactions of the subset using the generated commitment channel.
[0013] In some implementations, generating a commitment channel for the indirect token transaction includes: cooperating with the second participating node to generate a first blockchain transaction (T c ) and a second blockchain transaction (T r,0 ) to effect the transfer of the committed indirect amount of tokens to the output address of the indirect token transaction; t )
[0014] In some implementations, the first blockchain transaction (T c ) is the second blockchain transaction (T r,0 ) is signed by the output node of the indirect token transaction and then submitted to the blockchain.
[0015] In some implementations, a second blockchain transaction (T r,0 ) then contains a transaction parameter (nLockTime) that specifies when the second blockchain transaction becomes eligible for submission to the blockchain.
[0016] In some implementations, the method further comprises generating a key share (k) of the first private key (k). i ), where the first private key (k) is unknown to all of the participating nodes, and collaborating in deriving a first public key (Q) corresponding to the first private key (k) using a secret shared bond.
[0017] In some implementations, a third blockchain transaction (T t) includes an unlock script that includes a secret value (sv) that is based on a first secret key (k).
[0018] In some implementations, collaborating with all other participating nodes in performing the indirect token transactions of the subset includes collaborating with all other participating nodes in deriving a first private key (k) using the key shares.
[0019] In some implementations, the secret value is the sum of the first secret key (k) and a random number provided by the output node of the indirect token transaction.
[0020] In some implementations, the method uses a publicly verifiable secret sharing scheme (PVSS) to compile key shares (k i ) and its compatibility with the first public key (Q).
[0021] In some implementations, collaborating in deriving the first public key (Q) includes calculating a term of a first Lagrangian polynomial interpolation that includes the key share and adding that term with a term of the first Lagrangian polynomial provided by all other participating nodes.
[0022] In some implementations, the set of indirect token transactions is based on a predefined number of transactions per transaction round.
[0023] In some implementations, the participating nodes include a plurality of sender-receiver pairs, and the set of indirect token transactions is generated based on respective amounts of tokens associated with the plurality of sender-receiver pairs.
[0024] In some implementations, for each indirect token transaction in the set, the indirect amount of tokens for that indirect token transaction is less than a threshold that depends on the committed amount of tokens made available by the transferor.
[0025] The present application further describes a computing device for performing the described methods, where the computing device includes at least one processor, a memory, a network interface, and a blockchain application including processor-executable instructions that, when executed, cause the processor to perform the described operations of one or more of the methods described herein.
[0026] The present application further describes a non-transitory processor-readable medium storing processor-executable instructions for participating in a token transfer process between a plurality of participating nodes, where the processor-executable instructions, when executed by a processor at one of the participating nodes, cause the processor to perform operations of one or more of the methods described herein.
[0027] The present application further describes a computer-implemented method for initiating a token transfer process for transferring a respective first amount of tokens between a plurality of pairs of sender nodes and respective recipient nodes using a blockchain, the method including: determining a number of transaction rounds in a token transfer process; generating a set of indirect token transactions (TT) based on the respective first amounts of tokens and the number of transaction rounds, where execution of all of the indirect token transactions in the set results in a net transfer of the respective amount of tokens from the sender node to each recipient node, the set of indirect token transactions including randomized pairings of sender nodes and recipient nodes, where each node may be an input node or an output node for a particular indirect token transaction; and for each of the sender nodes and recipient nodes, sending a subset of the set of indirect token transactions to the node, the subset including transactions where the node is either the input node or the output node.
[0028] In some implementations, the set of indirect token transactions includes a first group of randomly generated transactions, each transaction in the first group specifying a respective indirect token amount for transfer between a pair of randomly selected participating nodes.
[0029] In some implementations, the indirect token amount is selected randomly.
[0030] In some implementations, the amount of indirect tokens is determined from a probability distribution.
[0031] In some implementations, the amount of indirect tokens is less than or equal to a threshold amount.
[0032] In some implementations, the set of indirect token transactions further includes a second group of transactions for reconciling a net token transfer resulting from the first group of transactions with a net transfer of the first amount of tokens between a sender node and a recipient node.
[0033] In some implementations, sending the subset to the participating nodes includes sending an encrypted message including the subset to the participating nodes, the message encrypted using a public key associated with the participating nodes.
[0034] In some implementations, the set of indirect token transactions is generated based on a number of transactions per round (q).
[0035] The present application further describes a computing device for initiating a token transfer process involving a plurality of participating nodes, the computing device including a memory, a network interface for providing network connectivity, and a processor configured to perform the methods described herein.
[0036] The present application further describes a non-transitory processor-readable medium storing processor-executable instructions for initiating a token transfer process between a plurality of participating nodes, the processor-executable instructions, when executed by a processor, causing the processor to perform operations of one or more of the methods described herein.
[0037] Any feature described in relation to one aspect or embodiment of the invention may also be used in relation to one or more other aspects / embodiments. These and other aspects of the invention will be apparent from and elucidated with reference to the embodiments described herein. Certain embodiments of the invention will now be described, by way of example only, with reference to the accompanying drawings, in which: [Brief description of the drawings]
[0038] [Figure 1] 1 illustrates an exemplary blockchain network of nodes. [Diagram 2] A schematic diagram of a commitment channel established between a payer node and a payee node is shown. [Diagram 3] 1 illustrates, in flow chart form, an exemplary method for participating in a token transfer process for transferring tokens between a transferor-transferee pair, according to certain embodiments of the present application. [Figure 4] 1 illustrates, in flow chart form, another exemplary method for participating in a token transfer process for transferring tokens between a transferor-transferee pair, in accordance with certain embodiments of the present application. [Diagram 5] 1 illustrates, in flowchart form, another exemplary process for establishing a commitment channel between a transferor node and a transferee node in an indirect anonymous transfer protocol. [Figure 6] 1 shows a block diagram of a simplified participating node. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0039] In this application, the term "and / or" is intended to cover all possible combinations and subcombinations of the listed elements, including any of the listed elements alone, any subcombination, or all of the elements, without necessarily excluding additional elements.
[0040] As used herein, the phrase "at least one of ... or ..." is intended to cover any one or more of the listed elements, including any of the listed elements alone, any subcombination, or all of the elements, without necessarily excluding additional elements, and without necessarily requiring all of the elements.
[0041] Reference is first made to FIG. 1, which illustrates in block diagram form an exemplary blockchain network 100 associated with blockchain. A blockchain network is a peer-to-peer open membership network in which anyone can join without an invitation or consent from other members. Distributed electronic devices running an instance of the blockchain protocol under which the blockchain network 100 operates may participate in the blockchain network 100. Such distributed electronic devices may be referred to as nodes 102. The blockchain protocol may be, for example, the Bitcoin protocol, or other cryptocurrency.
[0042] The electronic devices that run the blockchain protocol and constitute the nodes 102 of the blockchain network 100 may be of various types, including computers or other electronic devices, such as, for example, a desktop computer, a laptop computer, a tablet computer, a server, a mobile device such as a smartphone, a wearable computer such as a smartwatch, etc.
[0043] The nodes 102 of the blockchain network 100 are coupled to each other using suitable communication technologies, which may include wired and wireless communication technologies. Often, the blockchain network 100 is implemented at least in part on the Internet, and some of the individual nodes 102 may be located in geographically distributed locations.
[0044] Nodes 102 maintain a global ledger of all transactions on the blockchain. The global ledger is a distributed ledger, and each node 102 may store a full or partial copy of the global ledger. Transactions by nodes 102 that affect the global ledger are verified by other nodes 102, thereby maintaining the validity of the global ledger. Details of the implementation and operation of blockchain networks, such as those using the Bitcoin protocol, will be understood by those skilled in the art.
[0045] Each transaction typically has one or more inputs and one or more outputs. Scripts embedded in the inputs and outputs specify how the transaction's outputs can be accessed and by whom. A transaction's output may be an address to which tokens are transferred as a result of the transaction. Those tokens are then associated with that output address as available transaction outputs. In the context of cryptocurrencies such as Bitcoin, available transaction outputs are sometimes called unspent transaction outputs (UTXOs). Subsequent transactions may then reference that address as an input to transfer those tokens to one or more other addresses.
[0046] Transactions are pseudo-anonymous in that no personal information is included in the transactions on the blockchain ledger, but it is possible to track the transfer of tokens in the chain of transactions and, in some cases, link tokens to individuals using external data. To increase anonymity, mixed transactions can be used to pool inputs from diverse sources and then split and assign the pooled tokens to different outputs. If all inputs and outputs are of the same size, it is difficult to associate a specific input with a specific output. However, in such a transaction, at least one participating node recognizes the link between the input address and the output address specified by another participating node. In such mixed transactions, such as the CoinJoin operation in the Bitcoin protocol, a single transaction with multiple inputs and multiple outputs is used to mix tokens.
[0047] Several other anonymization techniques are used to try to avoid disclosing the link between inputs and outputs, such as ring signatures and stealth addresses, with varying degrees of effectiveness. Stealth addresses attempt to decouple the output address to which tokens are sent from a specific user. Ring signatures attempt to make the source untraceable by making it equally likely that any one of a group of possible signers was the one who signed / authorized a particular transaction. Unfortunately, ring signatures have proven problematic to implement in some protocols, such as Bitcoin. Some other cryptocurrencies, such as Monero, are specifically designed to allow for ring signatures.
[0048] The present disclosure provides a token transfer protocol for disguising the movement of tokens between a transferor and a transferee by using a set of indirect token transactions between participants of the protocol. Specifically, the described security mechanism requires that the set of indirect token transactions of the token transfer protocol be validated by all participating nodes of the protocol before any of those transactions can be executed. Such a security mechanism prevents the remaining participating nodes from being adversely affected if one or more malicious participating nodes do not execute their assigned operations under the protocol. The set of indirect token transactions includes multiple transfers of varying amounts between various randomized pairs of participating nodes of the protocol. Upon completion of the indirect token transactions prescribed by the protocol, the specified tokens have been indirectly transferred from the transferor to the transferee.
[0049] More generally, the present disclosure provides a protocol that may be implemented to effectuate desired token transfers between multiple transferor-transferee pairs. The protocol may include multiple participating nodes, each of which may perform one or more token transfers to other participating nodes and / or receive one or more token transfers from other participating nodes. The desired transfers of tokens for a transferor-transferee pair may be implemented using a set of indirect token transactions between various pairs of participating nodes in the protocol. The indirect token transactions are implemented in a manner that ensures completion of the protocol and avoids failure of the protocol after only a portion of those transfers have been performed, thereby ensuring that the appropriate token transfers arrive at their respective intended destinations. In some implementations, a commitment channel is used to facilitate the indirect token transactions. As described below, participating nodes may be able to check that the commitment channel has been constructed in accordance with the protocol requirements. In this manner, the protocol provides a secure way to ensure that the protocol is fully implemented without the risk of partial completion and thus failing to achieve the desired final allocation of tokens.
[0050] In this description, the terms “input node”, “output node”, “participating node”, “input address” and “output address” may be used. References to the “address” of a node are not intended to refer to the network address of a physical node. Instead, the “address” is an address specified in a transaction on the blockchain that has an allocation of tokens that the physical node can claim ownership of by having a key corresponding to a signature on the transaction. In this sense, an “output address” is not the address of a participating node, but rather a blockchain transaction output address owned or associated with a participating output node. Similarly, an “input address” is the address of an available transaction output (UXTO in cryptocurrency parlance) owned or associated with a participating input node.
[0051] Commitment Channel Various blockchain technologies, such as Bitcoin, sometimes utilize "commitment channels" in constructing pairwise transactions between participating nodes. Commitment channels are designed to allow nodes to conduct multiple transactions without committing all of the transactions to the blockchain. Once a commitment channel is established between a pair of participating nodes, the nodes can engage in any number of transactions they wish within a given period of time, with only two of those transactions ultimately being added to the blockchain. As a result, the use of commitment channels can lead to a reduction in the number of transactions that need to be added to the blockchain and associated transaction costs. Commitment channels also provide the transferor node with the flexibility to get tokens back if certain criteria are not met by the transferee node, or if either the transferor or transferee node decides to terminate the process after a set of transfers.
[0052] In at least one embodiment of the commitment channel implementation, a pair of participating nodes U A and U B They work together to create three blockchain transactions: c ), return transaction (T r,0 ), and a transfer transaction (Tt). Figure 2 shows the transferor node U A and the transferee node U B Commitment channel between A →U B A schematic diagram of a commitment transaction T cis the commitment component of the commitment channel, and the transferor U A But U B Sends / commits a specified set of tokens x for transfer to T. In some embodiments, the commitment transaction may be a 2-of-2 multi-signature pay-to-script-hash (P2SH) transaction. r,0 is the transferee node U B If U fails to complete the predefined criteria for a commitment transaction within the allotted time, U will withdraw the previously committed tokens x. A A return transaction is a transaction that returns a shard to the transferor node U. A return transaction becomes eligible for submission to the blockchain after a certain time, nLockTime, has expired. For a return transaction to be successfully executed, the transferor node U A and the transferee node U B The transfer transaction T pay transfers the committed token x to the transferee node U B A transfer transaction is executed when certain conditions are met by the transferee node U. B For example, for a transfer transaction to be successfully submitted to the blockchain, there must be at least one transferee node U B A digital signature of the
[0053] Secret sharing Techniques called "secret sharing" have been developed to allow the division of a secret into shares and the distribution of those shares among a set of participating nodes. With this technique, any subset of the set of participating nodes can reconstruct the secret as long as the subset's cardinality is greater than a specified threshold t. If the subset has fewer than t members, no information about the secret is revealed. This means that at least t participating nodes must cooperate to sign with the shared secret. The distribution of key shares among participating nodes may be done using a central dealer that assigns the key shares or through a dealerless distribution system. Each solution has advantages and disadvantages, and the requirements of the system to be implemented must be carefully considered when choosing between the distribution methods.
[0054] In at least one embodiment, the technique may involve embedding a secret into a polynomial of degree t. Each of the n participating nodes is assigned a point on the currently unknown polynomial, so that with t+1 participating nodes, the polynomial can be exactly reconstructed using Lagrange polynomial interpolation.
[0055] An application called threshold signature schemes has been developed where m out of n participating nodes, each owning an individual key share, can cooperate to perform a cryptographic computation, where the secret cannot be reconstructed / disclosed to any of the individual participating nodes, and it takes 2t+1 participating nodes to generate a signature.
[0056] A threshold signature scheme may in some cases rely on Lagrange polynomial interpolation, which is a function f(x) of degree t that is interpolated into t+1 points p={(x 1 ,f(x 1 )),(x 2 ,f(x 2 )),…,(x t+1 ,f(x t+1 ))}.
number
[0057] It should be noted that a variety of other techniques, such as those using elliptic curves and bilinear pairing or matrix projection, may be suitable for use in a threshold signature scheme.
[0058] One element of a threshold signature computation is the determination of x × G, where x is a private key and G is a point on an elliptic curve. Given a private key x, whose key shares are "divided" among n participating nodes: Any secret x is a point f(0) on the polynomial f(x). Share x (of key x) 1 ,x 2 ,…,x n is f(x 1 ),f(x 2 ),…,f(x n ) If f(x) is a t-th degree polynomial, then the secret x is
number
[0059] π is the individual share x i A group of t+1 participants who collaborate to compute x × G without revealing t, where x is the x=0 point on the t-th degree polynomial. Each participant i has part b i,π x i Calculate ×G. All participants in π add their parts together (reconstructing the secret x by Lagrange interpolation),
number
[0060] This process is called "Secret Share Joining."
[0061] Indirect Anonymous Transfer Protocol This application describes a method and apparatus for transferring tokens between one or more transferor-transferee pairs. In particular, this application proposes a token transfer protocol (Indirect Anonymous Transfer Protocol or IATP) that seeks to disguise the transferor-transferee relationship by using a set of indirect transactions between different pairs of participating nodes of the protocol while avoiding the risk of partial completion of the transaction. The indirect transactions are designed such that the connection between the transferor and the associated transferee is not easily identifiable from the blockchain data. The set of indirect transactions, if executed, results in the original desired allocation of tokens (i.e., the transactions agreed upon at the start of the protocol) for the participating transferor-transferee node pairs.
[0062] An IATP includes multiple participating nodes, each of which belongs to a transferor-transferee pair. In particular, an IATP is suitable for groups of three or more participating nodes, where at least one node in the group performs one or more token transfers to another node in the group or receives one or more token transfers from another node. To avoid ambiguity in the following description, the terms "sender" and "receiver" may be used to refer to a transferor node and associated transferee node, respectively, participating in the IATP.
[0063] Reference is now made to FIG. 3, which illustrates, in flow chart form, an exemplary method 200 for participating in a token transfer process to transfer an amount of tokens from a sender node to a receiver node using the blockchain. Multiple nodes corresponding to multiple sender-receiver pairs participate in the IATP. The nodes participate in U 1 ,U 2 ,…,U n A "node" may be referred to herein as a member or participant or participating node. In some implementations, each node is a wallet or other such blockchain entity.
[0064] For simplicity, the description of IATP uses the example of a single sender-receiver pair wishing to transact an amount Δ*, which is accomplished via multiple indirect token transactions between n participating nodes. As explained below, this logic is easily extended to multiple sender-receiver pairs. That is, the use case of IATP to perform a transfer Δ* between a single pair of participating nodes can be easily extended to a use case of performing a transfer Δ* between multiple pairs of participating nodes. i *This can be easily generalized to do the following:
[0065] Method 200 is implemented by nodes participating in an IATP, the set of participating nodes including at least one pair of sender and receiver nodes and a plurality of nodes distinct from the sender and receiver nodes, which are used to conduct a plurality of pairwise indirect token transactions to disguise intended transfers between the at least one sender-receiver pair. In particular, the behavior of the sender and receiver nodes is governed in the same manner as any other participating node in the IATP.
[0066] Method 200 begins with a node joining a token transfer process at operation 202. The joining process is not detailed herein and may be implemented in a decentralized manner or through a central authority that brings together a suitable group of participating nodes. This is based, at least in part, on ensuring that there are a sufficient number of nodes in the group and one or more sender-receiver pairs that wish to transfer tokens between each other. In some embodiments, multiple sender-receiver pairs may join together to cooperatively participate in the IATP.
[0067] In operation 204, a participating node obtains a list of indirect token transactions in which it is either an input node or an output node, i.e., the participating node is informed of the indirect token transactions it is involved in. The list obtained by a participating node is a subset of the set of all indirect token transactions generated as part of the IATP.
[0068] Here, we describe a process for constructing a set of indirect token transactions in which an intended amount of tokens is transferred between sender-receiver pairs. IATP is based on the concept of disguising or mixing transfers of tokens between sender-receiver pairs by making these transfers occur indirectly through a set of “indirect token transactions”, where the set of “indirect token transactions” has various amounts of tokens between different pairs of participating nodes. In particular, an indirect token transaction includes at least two transactions that are different from a direct transfer of a desired amount of tokens from a sender to a receiver. That is, a set of indirect token transactions includes at least two transactions, each of which has its input and / or output nodes different from said sender and receiver nodes, respectively.
[0069] The process of constructing this set of indirect token transactions is initiated by an initiator U, who may be randomly selected by the participating nodes of the IATP. 0 One or more participating nodes in the protocol define the following: The number of rounds in the protocol, r, and the number of transactions per round, q The initial amount of tokens available to be used in the protocol. This is the vector
number
number
[0070] The initiator node, which may be one of the participating nodes, transmits the protocol parameters (r, q, m(0), and m(T r ) and generates a set of indirect token transactions between different pairs of participating nodes based on the received parameters. One exemplary embodiment of this construction procedure is detailed below.
[0071] First Phase For t=1,…,r-1: a. The initiator node randomly selects q pairs (i,j), where i ≠ j. bU i The token amount m i But, 0<Δ i ≦min(m i (t),m j (t)), the probability distribution Φ iA random increment Δ from i is increased by cU j is Δ j = Δ i is reduced by d. At each step, vector m(t) = (m 1 (t),…,m n (t)) is updated.
[0072] In the first phase, the initiator node generates multiple or a first group of random transactions that result in the transfer of tokens between multiple pairs of participating nodes. For each round of the protocol (i.e., rounds 1 to r-1), q pairs of participating nodes are randomly generated, and each of the q pairs transfers a certain amount of tokens between them, or an indirect token quantity Δ i After each round, the amount of tokens allocated to each participant node is updated to reflect those q transfer transactions (i.e., indirect token transactions). The amount of tokens transferred in a round between each pair of q pairs, Δ i is restricted to lie within a prescribed range. In particular, the condition 0<Δ i ≦min(m i (t),m j (t)) is designed to ensure that for each pair of q pairs, the amount transferred is (1) positive and (2) less than the smaller of the allocated amounts of tokens associated with the nodes in that pair. In this way, the amount of tokens allocated to IATP participating nodes remains positive throughout protocol rounds. Δ i The values are selected from a probability distribution (e.g., a discrete uniform distribution). Without loss of generality, the same probability distribution may be used for all participating nodes in the protocol.
[0073] Second Phase For the final round, t=r, a series or second group of "final transactions" are generated that enforce the final conditions reflecting the desired token transfer between the sender-receiver pair to be reached. To generate the sequence of final transactions required to complete the protocol, the initiator node: a. Difference
number
number
[0074] In the second phase, a sequence of “final transactions” is generated to reconcile the value of the vector m(r-1) from the penultimate round of the protocol with the desired final state m(r). That is, the second group of transactions is used to reconcile the net token transfer resulting from the first group of transactions with the net transfer of the desired amount of tokens between the sender and receiver node pairs. In the final state, all participating nodes belonging to at least one sender-receiver pair have their allocated token amount increased or decreased by the originally specified amount. That is, if all participating nodes in the IATP are senders and / or receivers, the allocated tokens associated (owned) by the participating nodes are adjusted according to the resulting value of the desired token transfer. The token amounts associated with the sender-receiver nodes in the final state reflect the desired token transfer between the sender-receiver pair. In particular, the desired amount of tokens for transfer between the sender-receiver pair is reflected in the final state, and thus this amount is taken into account when generating the final transactions. That is, a set of indirect token transactions is generated based, at least in part, on the desired amount of tokens to be transferred between sender-receiver pairs.
[0075] In the case of multiple sender-receiver pairs among participating nodes, the final transaction will depend on the respective amounts of tokens transferred between those sender-receiver pairs. More specifically, the final state m(r) reflects the transfers for multiple sender-receiver pairs.
[0076] It should be noted that in a real-world scenario, it is not possible to "keep track" of the tokens held by each participating node, but rather it is possible to track gains or losses per protocol step by monitoring the transactions broadcast on the blockchain. References to "stored" or "allocated" tokens in the description are for clarity in illustrating the protocol steps. With IATP, sender-receiver pairs allocate a randomized amount of tokens, Δ, across multiple pairs of participating nodes over a multi-round process. i By moving
[0077] After the set of indirect token transactions is generated by the initiator node, each participating node is notified of the transactions in which they are involved. In particular, for each participating node in the IATP, the initiator node determines a subset of the set of all indirect token transactions that includes only transactions for which the participating node is either an input node (i.e., transferor) or an output node (i.e., transferee). The initiator node sends a message to each participating node identifying the subset of transactions. In some embodiments, the initiator node may encrypt a message including the subset of transactions using the participating node's public key.
[0078] In an IATP, indirect token transactions are generated sequentially throughout r rounds of the protocol and can be represented as an ordered sequence of vectors containing one or more transactions, but transactions can be completed in random order. The order of those vectors and the order in which transactions within the vectors are executed does not affect the final desired net token allocation for each participant. In essence, the indirect transactions executed to move tokens between participants can be done in any order. The only requirement for a correct transfer between a sender-receiver pair is that all of the indirect token transactions generated as part of the IATP are executed.
[0079] Returning to FIG. 2, in operation 206, for each indirect token transaction identified in the subset obtained by the participating node, the node collaborates with each second participating node to generate a commitment channel for the transaction between itself and the second participating node. In other words, for each indirect token transaction in which the participating node is involved, a commitment channel is constructed to facilitate the transaction. The commitment channel is used in the IATP to facilitate secure individual transactions between pairs of participating nodes for a set of indirect token transactions. In operation 208, the node collaborates with all other participating nodes in the IATP to execute the indirect token transactions in which it is involved using the generated commitment channel. This collaboration among all participating nodes to execute the token transactions helps ensure that all corresponding commitment channels are properly created and completed without allowing one node to revoke or negate any of the transactions midway. Techniques for collaborating to execute indirect token transactions are described in more detail below with reference to FIG. 4.
[0080] Reference is now made to FIG. 4, which illustrates, in flow chart form, an exemplary method 300 for participating in a token transfer process to transfer an amount of tokens between a sender-receiver pair. Method 300 is performed by a node participating in a protocol for indirect anonymous transfers, such as IATP, described herein. Operations 302 and 304 correspond to operations 202 and 204 of method 200 shown in FIG. 3. Specifically, in operation 302, a node participates in a token transfer process, and in operation 304, the node obtains (e.g., from the initiator node of the protocol) a list / subset of indirect token transactions in which it is involved.
[0081] The method 300 incorporates a security protocol that governs the creation and execution of indirect token transactions in the IATP. As described above, the IATP involves multiple pairwise token transfers between participating nodes. As the protocol transactions are executed, some participants may receive tokens that result in a temporary gain in their allocated tokens relative to the initial amount of tokens committed by that node to the protocol. That is, a participating node may be "locally" better off in possession of stewardship tokens during the execution of the protocol than it was in its initial state (i.e., the initial amount of tokens committed). To prevent a participating node from leaving the protocol at the moment or moments when it has a local token surplus, the IATP includes a mechanism that allows each participating node in the protocol to prevent the execution of a set of indirect token transactions until the participating node confirms that the necessary commitment channels have been created.
[0082] To enable this security mechanism, each indirect token transaction corresponding to a commitment channel is protected by a public key Q of a secret value k, such that Q=kG, where G is a base point on the elliptic curve. Prior to creating the commitment channels required by the protocol, the value k is not known to any of the participants. Instead, each user is given a secret share k of key k. i Thus, in operation 306, the participating nodes obtain key shares of the private key k. The key shares are used in a function that generates the private value k. In particular, the participating nodes' key shares k i All of the public keys Q, Q, Q, and Q are needed to generate the value k. The public key Q is used by the participating nodes when creating the commitment channel, so that the commitment channel can only be unlocked when all participants cooperate to reconstruct the secret value k. In IATP, any random secret is stored as f(0) in a t-th order polynomial f(x), and only participant i knows its share f(x i ) can be calculated by using, for example, Lagrange polynomial interpolation, when t+1 out of n participants are working together. 1 ),f(x 2 ),…,f(x n ) corresponding share k 1 ,k 2 ,…,k n can be used to reconstruct any point on f(x).
[0083] In operation 308, the participant node, in collaboration with all other nodes in the protocol, uses the secret share combination to generate a public key Q that corresponds to the private key k. As described above, the public key Q is used in generating indirect token transactions. The computation of Q is accomplished without any participant node revealing its individual key shares, and without the participants first collaborating to discover the private key k.
[0084] In IATP, participants in the protocol must provide the correct key share k, which aligns with the public key used to create the commitment channel. iIf inconsistent shares are distributed among the participating nodes, the participants will not be able to reconstruct the secret k required by the protocol. In at least some embodiments, a Publicly Verifiable Secret Sharing (PVSS) scheme may be used for participant key share verification. In the PVSS scheme, each participant U i is the decryption function D i , which has access to information encrypted with the corresponding public encryption function. The dealer then distributes the shares using the public encryption function and transfers them to K i =E i (k i ), i=1,…,n The encrypted shares can be publicly verified by any interested individual; anyone (not just the participants themselves) can verify that participants received the correct key shares.
[0085] Once the public key Q is obtained, indirect token transactions between the participating nodes of the protocol can be set up. Indirect transfers between different pairs of participating nodes are achieved through the use of commitment channels. In IATP, a “commitment channel” consists of three separate transactions: commitment transaction T c , return transaction T r,0 , and a transfer transaction T t That is, without loss of generality, the transferee node U A and the transferee node U B For each indirect transfer to or from, three blockchain transactions are created: ·Commitment ·Transaction T c is a 2 / 2 multi-signature P2SH transaction, A takes advantage of this by dividing the amount of tokens x by U B(i.e., the output address of the transaction). Return transaction T r,0 Let x be the amount of committed tokens in U A (i.e., the input address of the transaction). ·Transfer transaction T t Let x be the amount of committed tokens in U B (i.e. the output address of the transaction).
[0086] Each commitment channel generated as part of an IATP is “locked” by a secret value. In at least one implementation of an IATP, the commitment channel U A →U B The secret value for is k+k B where k is the private key corresponding to the public key Q, and k B is the transferred node U B As explained below, the secret value sv B =k+k B The encrypted value of Q B If the relocator node U A Calculated by the commitment channel U A →U B can be used during the construction of
[0087] Commitment Channel U A →U B An exemplary process 400 for constructing a .DELTA..times ... 1. Action 402:U B is a random number k B Each commitment channel may use a different random number to make it more difficult for an outsider to associate a set of transactions as part of the same instance of IATP. In particular, tying different transactions visible on the blockchain to a common instance of IATP can be made more complicated since those transactions are not all tagged with the same secret. 2. Action 402:U B K B The value of U A Communicate to. 3. Action 404:U A The relation is Q B =(k+k B )G=kG+k B G=Q+k B G Using Q B where Q is obtained collaboratively (by a secret share bond) and can be thought of as an encryption of the private key k. 4. Action 406:U A is the encrypted value Q B Using the commitment transaction T c The commitment transaction is: (1) U A and U B Signature of both parties or (2) sv B and U B commits an amount x of tokens that can only be consumed by any of the signatures of 5. Action 408:U A is the return transaction T r,0 The return transaction creates a new transaction, U, by transferring the entire committed amount of tokens x (minus any transaction costs that may consume one or more tokens). A The returning transaction includes the parameter nLockTime, which specifies when the returning transaction becomes eligible for submission to the blockchain. 6. Action 410:U B signs the return transaction. 7. Action 412:U A signs the commitment transaction and submits it to the blockchain. 8. Action 414: Transfer transaction T t However, the relocator U A or Transferee U BThe transfer transaction transfers the committed amount of tokens x from the commitment transaction to U. B If the transaction is successfully submitted to the blockchain, the unlock script for the transfer transaction or <scriptsig>is the value sv B must contain:
[0088] Thus, in operation 310, for each transaction in the subset of indirect token transactions for a participating node, the node cooperates with its counterpart in the transaction to construct a commitment channel. Specifically, if the participating node is a transferor in the transaction, the node: (1) B A random value k communicated by (the counterpart in the transaction) B Create a commitment transaction using this, and (2) create a return transaction that returns the committed token to the node.
[0089] After all commitment channels have been created for all required transactions in the IATP instance, the node, in cooperation with all other participating nodes in the protocol, recovers a secret key k using its key shares and a suitable secret sharing scheme (e.g., Shamir's secret sharing scheme) in operation 312. Once the value of k is determined, if the participating node is a transferee of a commitment channel, it calculates the amount of tokens to be transferred by the corresponding transfer transaction. <scriptsig>The secret value in s B =k+k B Then, the IATP instance transfer transaction T t All of the transfer transactions may be submitted to the blockchain. These transfer transactions may be broadcast in an unstructured manner, in a random order or in any order determined by the participating nodes submitting the transactions. The randomness in the order in which transactions are broadcast may help make it more difficult to track and recognize the final and initial stages of the protocol.
[0090] In at least some instances of the IATP, each of the input and output addresses provided by a participating node for indirect transfer transactions involving that node is unique. That is, a node's address, whether an input or output address, is not reused at any point in the IATP protocol. In other words, in some cases, constraints may be imposed on the participating nodes of the IATP, such that node U i n i1 In an indirect transfer transaction, n i2 When acting as an output node in an indirect transfer transaction, U i is at least n i1 +n i2 Each participating node is required to have multiple separate addresses and sufficient funds already available at the address that served as the input before joining the IATP. These multiple "disconnected" addresses can provide increased anonymity for transactions involving participating nodes by facilitating the existence of multiple concurrent commitment channels for participants and making it more difficult for outsiders to trace the flow of tokens to and from participating nodes.
[0091] Reference is now made to Figure 6, which illustrates in block diagram form a simplified example of a participating node 500. The node 500 may be an input node or an output node. The node 500 includes a processor 502, which may include one or more microprocessors, application specific integrated chips (ASICs), microcontrollers, or similar computer processing devices. The node 500 further includes a memory 504, which may include persistent and non-persistent memory for storing values, variables, and possibly processor-executable program instructions, and a network interface 506, which provides network connectivity via a wired or wireless network.
[0092] The node 500 includes a processor-executable blockchain application 508 that includes processor-executable instructions that, when executed, cause the processor 502 to perform one or more of the functions or operations described herein.
[0093] It will be understood that any modules, routines, processes, threads, applications, or other software components implementing the apparatus and processes described herein, as well as the described methods / processes for configuring participating nodes, may be implemented using standard computer programming techniques and languages, and the application is not limited to any particular processor, computer language, computer programming conventions, data structures, and other such implementation details.
[0094] It should be noted that the above-described embodiments illustrate the invention rather than limit it, and that those skilled in the art can design many alternative embodiments without departing from the scope of the invention as defined by the appended claims. Any reference signs placed between parentheses in the claims shall not be construed as limiting the claims. Words such as "comprise" and "have" do not exclude the presence of elements or steps other than those listed in any claim or the specification as a whole. In this specification, "comprise" means "comprises or consists of" and "has" means "has or consists of". The singular reference of an element does not exclude the plural reference of such element and vice versa. The invention can be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer. In a device claim enumerating several means, several of these means may be embodied by one and the same item of hardware. The mere fact that certain measures are recited in mutually different dependent claims does not indicate that a combination of these measures cannot be used to advantage.
[0095] Several aspects will be described. [Aspect 1] A computer-implemented method for participating in a token transfer process for transferring a first amount of tokens from a sender node to a recipient node using a blockchain, the token transfer process including a plurality of participating nodes and performing a set of indirect token transactions between a plurality of pairs of the participating nodes, the sender node and the recipient node being included in the token transfer process as participating nodes, the method being implemented at a participating node, comprising: obtaining a subset of the set of indirect token transactions, the subset including transactions in which the participating node is either an input node or an output node, the set of indirect token transactions being generated based on the first amount of tokens and a predetermined number of transaction rounds in the token transfer process; for each indirect token transaction in the subset, in cooperation with each second participant node included in the indirect token transaction, generating a commitment channel for the indirect token transaction between the participant node and the second participant node; and cooperating with all other participating nodes in executing the indirect token transactions of the subset using the generated commitment channel. method. [Aspect 2] Generating a commitment channel for the indirect token transaction comprises: In cooperation with the second participating node: A first blockchain transaction (T) to commit an indirect amount of tokens to be transferred to the output address of the indirect token transaction. c ) to generate; A second blockchain transaction (T) returns the committed indirect amount of tokens to the input address of the indirect token transaction. r,0 ) to generate; A third blockchain transaction (T) to effect the transfer of the committed indirect amount of tokens to the output address of the indirect token transaction. t ), The method of embodiment 1. [Aspect 3] The first blockchain transaction (T c ) is the second blockchain transaction (T r,0 3. The method of claim 2, wherein the indirect token transaction is signed by an output node of the indirect token transaction before being submitted to the blockchain. Aspect 4 The second blockchain transaction (T r,0 4. The method of claim 2 or 3, wherein the second blockchain transaction subsequently becomes eligible for submission to the blockchain, the second blockchain transaction comprising a transaction parameter (nLockTime) that specifies a time at which the second blockchain transaction subsequently becomes eligible for submission to the blockchain. Aspect 5 Key shares (k) of the first private key (k) i ), wherein the first private key is unknown to all of the participating nodes; and cooperating in deriving a first public key (Q) corresponding to said first private key (k) using a secret shared bond. The method of embodiment 2. Aspect 6 The third blockchain transaction (T t 6. The method of claim 5, wherein the first secret key (k) is based on the first key (sv) and the second secret key (sv) is based on the first secret key (sv). Aspect 7 7. The method of claim 6, wherein collaborating with all other participating nodes in performing the indirect token transactions of the subset includes collaborating with all other participating nodes in deriving the first private key (k) using the key shares. Aspect 8 7. The method of claim 6, wherein the secret value is the sum of the first secret key (k) and a random number provided by an output node of the indirect token transaction. Aspect 9 Using a publicly verifiable secret sharing scheme (PVSS), i 9. The method of any one of embodiments 5-8, further comprising verifying the validity of and compatibility with said first public key (Q). Aspect 10 10. The method of any one of aspects 5 to 9, wherein collaborating in deriving the first public key (Q) includes calculating a term of a first Lagrangian polynomial interpolation that includes the key shares and adding that term with terms of the first Lagrangian polynomial provided by all other participating nodes. Aspect 11 11. The method of any one of aspects 1 to 10, wherein the set of indirect token transactions is based on a predefined number of transactions per transaction round. Aspect 12 12. The method of any one of claims 1 to 11, wherein the participating nodes include a plurality of sender-receiver pairs, and the set of indirect token transactions is generated based on respective amounts of tokens associated with the plurality of sender-receiver pairs. Aspect 13 13. The method of any one of aspects 1 to 12, wherein for each indirect token transaction in the set, an indirect amount of tokens for that indirect token transaction is less than a threshold that depends on a committed amount of tokens made available by the transferor. Aspect 14 1. A computing device for participating in a token transfer process including a plurality of participating nodes, the computing device being one of the participating nodes, the computing device: Processor; Memory; A network interface that provides network connectivity; and a blockchain application including computer executable instructions that, when executed by the processor, cause the processor to perform the method of any one of aspects 1 to 13; Computing device. Aspect 15 14. A non-transitory processor-readable medium storing processor-executable instructions for participating in a token transfer process involving a plurality of participating nodes, the processor-executable instructions, when executed by a processor at one of the participating nodes, cause the processor to perform the method of any one of aspects 1-13.< / scriptsig> < / scriptsig>
Claims
1. A computer-implemented method for participating in a token transfer process for transferring a first amount of tokens from a sender node to a recipient node using a blockchain, the token transfer process including a plurality of participating nodes and performing a set of indirect token transactions between a plurality of pairs of the participating nodes, the sender node and the recipient node being included in the token transfer process as participating nodes, the method being implemented at a participating node, comprising: receiving a message from an initiator node identifying a subset of the set of indirect token transactions, the subset including transactions in which the participating node is either an input node or an output node, the set of indirect token transactions being generated based on the first amount of tokens and a predetermined number of transaction rounds in the token transfer process; for each indirect token transaction in the subset, cooperating with each second participant node involved in the indirect token transaction to generate a commitment channel for the indirect token transaction between the participant node and the second participant node; and cooperating with all other participating nodes in executing the indirect token transactions of the subset using the generated commitment channel; Creating a commitment channel for each indirect token transaction involves: computing a value for the commitment channel derived from a first public key (Q), where each participating node has a key share of a first private key (k) corresponding to the first public key; In cooperation with the second participating node, a first blockchain transaction (T) is created to commit an indirect amount of tokens to be transferred to an output address of the indirect token transaction using the value. c ) and A second blockchain transaction (T) that returns the committed indirect amount of tokens to the input address of the indirect token transaction. r,0 ) and a third blockchain transaction (T) for effecting a transfer of the committed indirect amount of tokens to an output address of the indirect token transaction; t and generating a method.
2. The first blockchain transaction (T c ) is the second blockchain transaction (T r,0 2. The method of claim 1, wherein the indirect token transaction is signed by an output node of the indirect token transaction before being submitted to the blockchain.
3. The second blockchain transaction (T r,0 3. The method of claim 2, wherein nLockTime includes a transaction parameter (nLockTime) that specifies a point in time after which the second blockchain transaction becomes eligible for submission to the blockchain.
4. The method of claim 1 , wherein the set of indirect token transactions is based on a predefined number of transactions per transaction round.
5. 5. The method of claim 1, wherein the participating nodes include a plurality of sender-receiver pairs, and the set of indirect token transactions is generated based on respective amounts of tokens associated with the plurality of sender-receiver pairs.
6. 6. The method of claim 1, wherein for each indirect token transaction in the set, an indirect amount of tokens for that indirect token transaction is less than a threshold that depends on a committed amount of tokens made available by a transferor.
7. A computing device for participating in a token transfer process including a plurality of participating nodes, the computing device being one of the participating nodes, the computing device comprising: Processor; Memory; A network interface providing a network connection; and a blockchain application including computer executable instructions that, when executed by the processor, cause the processor to perform the method of any one of claims 1 to 6; Computing device.
8. 7. A non-transitory processor-readable medium storing processor-executable instructions for participating in a token transfer process involving a plurality of participating nodes, the processor-executable instructions, when executed by a processor at one of the participating nodes, causing the processor to perform the method of any one of claims 1 to 6.
