System and method for distributing data recording by using block chain
The method and system enhance blockchain transaction privacy and security by using stealth addressing and record dispersion to separate inputs from outputs, preventing traceability and maintaining anonymity in data record distribution.
Patent Information
- Application Number
- JP2024138364
- Authority / Receiving Office
- JP · JP
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2017-04-11
- Filing Date
- 2024-08-20
- Publication Date
- 2024-11-19
- Estimated Expiration
- Not applicable · inactive patent
AI Technical Summary
The public nature of blockchain transactions compromises privacy and security by allowing the traceability of data records, which can reveal sensitive information about participating nodes and compromise their anonymity.
Implementing a method and system that uses stealth addressing, record dispersion, and deconstruction of data records based on predetermined characteristics to separate inputs from outputs, ensuring secure movement of data records through blockchain transactions.
Enhances privacy and security by preventing the linking of input and output nodes, thwarting tracking activities and maintaining the anonymity of data record distribution.
Smart Images

Figure 2024161531000001_ABST
Abstract
Description
[Technical field]
[0001] The present invention relates generally to blockchain transactions, and more specifically to methods and devices for creating and executing data recording distributed transactions. [Background technology]
[0002] Herein, 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 un-permissioned 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. Although Bitcoin may be referred to herein for convenience and explanation, it should be noted that the present invention is not limited to use with the Bitcoin blockchain, and alternative blockchain implementations and protocols are within the scope of the present invention.
[0003] Blockchain is a consensus-based electronic ledger, implemented as a computer-based decentralized distributed system made up of blocks 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 so that blocks are chained together to form a permanent and immutable record of all transactions that have been written to the blockchain since its inception. Transactions contain small programs, known as scripts, embedded in their inputs and outputs. Scripts specify how and by whom the output of a transaction can be accessed. In the Bitcoin platform, these scripts are written using a scripting language based on Stack.
[0004] In order for a transaction to be written to the blockchain, it must be “validated”. Network nodes (miners) perform the task of making sure each transaction is valid, and invalid transactions are rejected from the network. A software client installed on the node performs this validation task on unspent transactions (UTXOs) by executing its locking script. If the execution of the locking script evaluates to TRUE, then the transaction is valid and the transaction is written to the blockchain. Thus, for a transaction to be written to the blockchain, it must be i) verified by the first node that receives the transaction, and if the transaction is verified, the node relays it to other nodes in the network, ii) added to a new block constructed by miners, and iii) mined, i.e., appended to the public ledger of past transactions.
[0005] One of the recognized advantages of blockchain technology such as Bitcoin is its anonymity and security: the Bitcoin ledger does not contain any personal information about those participating in transactions, it only contains public address information. However, using external data and analytics, it is possible to successfully associate specific transactions and addresses with individuals.
[0006] One drawback of some digital currencies such as Bitcoin, despite their public reputation for privacy, is that the flow of Bitcoins in the blockchain is completely public and analyzable to trace the movement of value through the chain. This can give rise to situations where privacy is compromised. For example, if a person has a wallet that contains a large unspent transaction output UTXO, such as a biweekly paycheck, and that unspent transaction is used as an input to pay someone else a small amount, that other person and anyone viewing the transaction will have information about the assets and possibly salary of the person making the payment, based in part on the change returned in the transaction. Other situations can arise where large inputs and / or large change transactions can compromise a user's privacy.
[0007] It is therefore desirable to provide improved methods and devices that provide increased security and more robust encryption through improved untraceability and untlinkability of inputs to outputs, while still forming an efficient and effective cryptocurrency payment mechanism.
[0008] Although blockchain technology is most widely known for its use in implementing cryptocurrencies, digital entrepreneurs are beginning to explore the use of both the cryptographic security system on which Bitcoin is based, and the data that can be stored on the blockchain, to implement new systems. It would be highly advantageous if blockchains were used for automating tasks and processes that are not limited to the field of cryptoassets. Such solutions could leverage the benefits of blockchains (e.g., permanent tamper-resistant recording of events, distributed processing, etc.) while broadening their use. Thus, this application may refer to a "data record" that is recorded on a blockchain. A data record may include, for example, a document, a measurement of processing power or time, a cryptocurrency amount, a security or other token indicating ownership of an asset, or other such thing that may be controlled by an entity with cryptographic material that allows that entity to use or move that data record.
[0009] The potential traceability of records in a blockchain reveals implementation flaws that could cause harm to certain applications. Examples of applications include submitting exams or papers for grading, submitting anonymous crime reports, submitting anonymous survey or census reports, or other such applications that require participating nodes to securely and confidentially move data records to one or more other nodes under conditions where the data is not altered after submission. Similar to cryptocurrencies, the movement of other types of data records may be traceable based on the characteristics of the records themselves, which may allow for tracing of submissions back to a particular node, compromising the privacy or security of the node's users, or undermining the anonymity integrity of the distribution or submission process. Furthermore, if nodes in the network are able to identify one node as the origin of a forwarded document to other nodes, it increases the ability of observer nodes to compromise the security of the network through attacks such as spoofing and other computer security attacks.
[0010] The public nature of blockchain presents a technical challenge in structuring the distributed process of data records, whether cryptocurrencies or other types of data records, to more effectively ensure the security and integrity of the distributed process while minimizing the opportunity to trace the movement of data records between specific, specific nodes.
[0011] Such an improved solution has now been devised. Summary of the Invention
[0012] Thus, according to the present invention there is provided a method and device as defined in the accompanying claims.
[0013] Advantageously, the present application provides improved methods, devices and systems for blockchain-based data record distribution that improve transaction privacy and security. Using a unique combination of stealth addressing, record distribution and deconstruction of records into predefined data record characteristics, the entire data record is transferred while decoupling inputs from outputs to prevent disclosure of information about either input or output nodes and to thwart tracking activities.
[0014] 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 encryption method / system. It may provide secure transfer of digital assets or data records, such as cryptocurrency fractions or amounts. Additionally or alternatively, it may provide a control mechanism to control the transfer of digital assets, such as cryptocurrency fractions or amounts.
[0015] Additionally or alternatively, the present application may describe a computer-implemented method of moving all data records between input and output nodes using a blockchain. The method may be performed at an input node and may include obtaining public key material associated with an output node, determining one or more inputs selected from the available data records and a plurality of outputs based on the available data records and all data records controlled by the input node, the cumulative sum of the one or more inputs being equal to or greater than the all data records, each output being associated with a respective data record characteristic selected from a set of predefined data record characteristics, and the sum of the plurality of outputs being equal to the all data records, for each of the plurality of outputs, randomly selecting a number, generating an output address based on the public key material and the random number, inserting the output address into a record distribution transaction to be assigned a data record having the data record characteristic of each of the outputs, generating a nonce public key from the random number, sharing the nonce public key with the output node, and signing the one or more inputs.
[0016] Additionally or alternatively, the present application may describe a computer-implemented method of moving an entire data record between an input node and an output node using a blockchain. The method may be performed at an output node and may include providing public key material associated with the output node to the input node, obtaining a nonce public key from the input node, searching the blockchain for data record distributed transactions having a plurality of input addresses and a plurality of output addresses, each output address being assigned a data record having a respective data record characteristic in a set of predefined data record characteristics, determining a public-private key pair based on the nonce public key and the public key material, matching a public key from the public-private key pair with one of the output addresses in the data record distributed transaction and adding the data record assigned to the output address to an interim data record compilation based on the matching, determining whether the interim data record compilation is less than the entire data record, and if so, continuing the searching, determining, and matching until the interim data record compilation matches the entire data record.
[0017] Additionally or alternatively, the present application may describe a computer-implemented method of transferring total value between input and output nodes using a blockchain. The method may be performed at an input node and may include obtaining public key material associated with an output node, and determining one or more inputs selected from unspent output transactions based on available unspent output transactions and a total value owned by the input node, and a plurality of outputs, the cumulative value of the one or more inputs being equal to or greater than the total value, each output being for each denomination selected from a set of predefined denominations, and the sum of the plurality of outputs being equal to the total value. The method may further include randomly selecting a number for each of the plurality of outputs, generating an output address based on the public key material and the random number, inserting the output address into a coin mixing transaction to assign the denomination of each of the outputs, generating a nonce public key from the random number, and sharing the nonce public key with the output node. The input node signs the one or more inputs.
[0018] In some implementations, determining the one or more inputs and the plurality of outputs is based in part on available coin mixing transactions, each of which involves mixing a particular denomination, and determining the one or more inputs and the plurality of outputs is based in part on matching values of each of the one or more inputs and the plurality of outputs to each one of the particular denominations.
[0019] In some implementations, for the multiple outputs, inserting the output addresses includes inserting all output addresses as outputs into a single coin mixing transaction structured to mix multiple different denominations. In some other implementations, for the multiple outputs, inserting the output addresses includes inserting at least one output address into a first coin mixing transaction and at least one other output address into a second coin mixing transaction, where the first coin mixing transaction is intended to mix a different denomination than the denomination being mixed in the second coin mixing transaction.
[0020] In some implementations, the set of predetermined denominations includes a maximum coin value and 1 / 10 of the maximum coin value. n where n is a positive integer. In other implementations, other series may be used.
[0021] In some implementations, the public key material comprises two public keys BPub x and BPub y and the output address of output i is BPub i =H(r i BPub x )G+BPub y where G is the elliptic curve base point, H() is the hash function, and r i is the random number selected for output i. The nonce public key R i is R i =r i It can be produced as G.
[0022] In some implementations, sharing the nonce public key includes inserting the nonce public key into a non-transaction data field in the coin mixing transaction, inserting the nonce public key into a non-transaction data field in a separate transaction that is different from the coin mixing transaction, or sending the nonce public key to the output node using non-blockchain communication.
[0023] Additionally or alternatively, the present application may describe a method implemented at an output node, the method including providing public key material associated with the output node to an input node, obtaining a nonce public key from the input node, and searching a blockchain for coin mixing transactions, the coin mixing transactions having a plurality of input addresses and a plurality of output addresses, each output address being assigned a value that matches a denomination within a set of predefined denominations. The method further includes determining a public-private key pair based on the nonce public key and the public key material, matching a public key from the public-private key pair to one of the output addresses in the coin mixing transaction, and adding the value assigned to that output address to a spending amount based on the matching, and determining whether the spending amount is less than a total value, and if so, continuing the searching, determining, and matching until the payment amount matches the total value.
[0024] In some implementations, the public key material comprises two public keys BPub x and BPub y The two public keys have corresponding private keys BPriv x and BPriv y Determining the i-th public-private key pair includes the steps of: BPrivi =H(BPriv x R i )+BPriv y BPriv i is the private key of the public-private key pair, H() is a hash function, and R i is the nonce public key, and the public key of the i-th public-private key pair is BPub i =BPriv i G, where G is the elliptic curve base point.
[0025] In some implementations, searching the blockchain includes identifying a coin mixing transaction that includes a non-transaction code, and deriving the nonce public key includes extracting the nonce public key from a non-transaction data field of the coin mixing transaction. In some other implementations, extracting the nonce public key includes searching the blockchain for a transaction that includes a non-transaction code, and, if identified, extracting the nonce public key from a non-transaction data field within the transaction.
[0026] Still other implementations of the methods described herein include a computing device having a memory, a processor, and executable instructions that, when executed, cause the processor to perform one or more operations of the methods described herein.
[0027] Any feature described with respect to one aspect or embodiment of the invention may also be used with respect to one or more other aspects / embodiments. These and other aspects of the invention will be apparent from and will be elucidated with reference to the embodiments described herein. 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]
[0028] [Figure 1] 1 represents an example blockchain network of nodes. [Diagram 2] 1 illustrates a schematic representation of one embodiment of a data record distribution process. [Diagram 3] 1 illustrates, in flowchart form, an example process for data record distribution in a blockchain transaction. [Figure 4] 1 illustrates, in flow chart form, an example process for participating as an input node in a data record distribution operation in accordance with an embodiment of the present application. [Diagram 5] 1 illustrates, in flow chart form, an example process for participating as an input node in a data record distribution operation in accordance with an embodiment of the present application. [Figure 6] 1 shows a simplified block diagram of a participating node. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0029] In this application, the term "and / or" is intended to cover all possible combinations and subcombinations of the listed elements, including any one of the listed elements only, any subcombination, or all of the elements, without necessarily excluding additional elements.
[0030] As used herein, the phrase "at least one of ... or ..." is intended to cover any one or more of the listed elements, including any one of the listed elements only, any subcombination, or all of the elements, without necessarily excluding additional elements, and without necessarily requiring all of the elements.
[0031] At times hereinafter, reference may be made to a data record. A data record includes a data field that includes a value. An overall data record may in some cases be formed from the sum of the values of multiple data records. In some cases, the value may represent a digital asset such as cryptocurrency or an amount thereof, but may also represent other assets such as computational resources, time, etc. Reference to a data record characteristic may refer to an attribute of the data record. In some instances, this may include a value represented within the data record, and a predefined set of data record characteristics may include a set of predefined values. The value may in some cases be an integer or decimal value. In some instances, the value represents a cryptocurrency amount and may be referred to as a denomination.
[0032] Reference is first made to FIG. 1, which illustrates in block diagram form an example of a blockchain network 100 associated with a blockchain. A blockchain network is a peer-to-peer, non-membership network in which anyone can join without an invitation or consent from other members. Distributed electronic devices running instances of the blockchain protocol on 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.
[0033] The electronic devices that run the blockchain protocol and form the nodes 102 of the blockchain network 100 may be of various types, including, for example, computers such as desktop computers, laptop computers, tablet computers, servers, mobile devices such as smartphones, wearable computers such as smart watches, or other electronic devices.
[0034] The nodes 102 of the blockchain network 100 are coupled to one another using suitable communication technologies, which may include wired and wireless communication technologies. In many cases, the blockchain network 100 is implemented at least in part over the Internet, and some of the individual nodes 102 may be located in geographically dispersed locations.
[0035] 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 to ensure that the global ledger remains valid. The details of implementing and operating a blockchain network, such as one that uses the Bitcoin protocol, are well understood by those skilled in the art.
[0036] Each transaction typically has one or more inputs and one or more outputs. Script embedded in the inputs and outputs specifies how and by whom the transaction's outputs can be accessed. A transaction's output contains an address to which a value is moved as a result of the transaction. That value is then associated with that output address as an Unspent Transaction Output (UTXO). Subsequent transactions may then reference that address as an input in order to use or reassign ownership of that value.
[0037] While transactions are pseudo-anonymous in that no personal information is included in the transaction on the blockchain ledger, it is possible to track the movement of data records within the chain of transactions and, in some cases, link data records to individual or specific nodes using external data. As a means of increasing security, data record distribution transactions, such as coin mixing transactions, may be used to pool inputs from various sources and then split and assign the pooled data records to outputs. If all inputs and outputs are data records with the same characteristics, it is difficult to link a specific input with a specific output. However, in such a transaction, at least one participating node is aware of the link between the input address and the output address specified by the other participating nodes. In a coin mixing transaction, such as the CoinJoin operation in the Bitcoin protocol, a single transaction with multiple inputs and multiple outputs is used to mix values.
[0038] Several other techniques, such as stealth addresses, are used, with varying degrees of effectiveness, to avoid revealing the link between inputs and outputs. Stealth addresses attempt to decouple the output address to which a data record is sent from a particular output node in order to disrupt traceability.
[0039] According to the present application, methods and devices are described that enhance the privacy and security of shares and facilitate the movement of all data records from input nodes to output nodes in a manner that prevents links of shares to specific inputs and / or outputs and the tracing of shares or revealing relevant information about input nodes. Doing this within the structure of a blockchain protocol while ensuring security presents significant technical implementation challenges. The following description provides at least one embodiment of a solution to such technical implementation challenges.
[0040] In the description herein, the terms "input node", "output node", "participating node", "input address", and "output address" may be used. A reference to a node's "address" does not refer to the network address of a physical node. Instead, an "address" is the address specified in a blockchain transaction that has an unused value that a physical node can claim ownership of by having the key corresponding to a signature on the transaction. In this sense, an "output address" is not the address of a participating node, but rather the blockchain transaction output address owned by or associated with the participating output node. Similarly, an "input address" is the address of an unused transaction output (UTXO) owned by or associated with the participating input node.
[0041] [Elliptic Curve Digital Signature] Some blockchain technologies such as Bitcoin use the Elliptic Curve Digital Signature Algorithm (ECDSA) as a mathematical method for digital signatures. ECDSA is an encrypted digital signature used to ensure that values associated with UTXOs can only be used by their legitimate owners. The parameters required for an ECDSA signature are E - Elliptic curve function G - Base point on the elliptic curve with order n: n×G = O n - Large prime number q - Group order and include.
[0042] A key pair is generated from a random number x, where 0 < x < n. The number x becomes the private key, and the public key P is generated as P = x×G.
[0043] Considering the message m, the random number k, and the private key x, the signature is generated by the pair (r, s). The random number k is selected such that 0 < k < q. Then, r = k × G is calculated, and s = k -1 (m + xr) mod n is calculated. At this time, k -1 is the inverse of k mod n, and k -1 k ≡ 1 mod n. This gives the signature (r, s).
[0044] Considering the signature (r, s), the message m, and the public key P, the signature can be verified. To verify the signature, v = s -1 m × G + s -1 r × y is calculated. In this formula, s -1 is the inverse of s mod q such that s -1 s ≡ 1 mod n. The signature is valid when v = r. Remembering that G has order n, the mod n part of s -1 disappears when the EC point is multiplied by G.
[0045] [Pooled Decomposed Data Record] Reference is now made to FIG. 2, which diagrammatically illustrates one embodiment of a data record distribution process 200. In this example, the data records relate to cryptocurrencies, and all data records are payments of total value. The input node 202 is denoted as “Wallet A”. The input node 202 is a lightweight node designed to give and receive payments, and is not a full node that holds a copy of the blockchain. In some cases, the input node 202 may be a full node, or even a mining node, but in the present example, the input node 202 is a lightweight node, which may often be referred to as a “wallet”. In the Bitcoin protocol, such nodes are sometimes referred to as simplified payment verification (SPV). The output node 204 is denoted as “Wallet B”. Like the input node 202, in this example, the output node 204 is a lightweight node. Nodes 202 and 204 may be referred to as participants or participating nodes.
[0046] The input node 202 "owns" (controls) a number of UTXOs of various values, denoted by reference numeral 206. The input node 202 owns them in the sense that the input node 202 has a private key corresponding to each UTXO 206, which allows the input node 202 to sign a script that "uses" each UTXO 206 as an input to a blockchain transaction. Each UTXO 206 is an unspent output of a previous transaction that has been sent or returned to the input node 202. A UTXO 206 may be for changing amounts of value of an applicable cryptocurrency.
[0047] The output node 204 is (BPub x ,BPriv x ) and (BPub y ,BPriv y ), where BPub=BPrivG. The output node 204 receives the public key BPubx and BPub y with the input node 202 and possibly other nodes.
[0048] In this situation, the owner of input node 202 seeks to transfer a total value to the owner of output node 204. The total value may, in some implementations, reflect payment for goods or services.
[0049] In accordance with aspects of the present application, the input node 202 selects one or more of the UTXOs 206 to be inputs to a transaction that results in a payment. The cumulative value of the one or more UTXOs 206 is equal to or greater than the total value of the payment to be made to the output node 204. The selection of the UTXOs 206 may be based in part on using UTXOs 206 of multiple smaller denominations to make up the total value, rather than using one large UTXO 206 that would result in change, or at least a significant amount of change being returned to the input node 202.
[0050] In some implementations, the input node 202 may determine the optimal or advantageous UTXOs 206 using a greedy algorithm that produces a sum of inputs that is equal to or greater than the total value of the payments while minimizing the number of UTXOs 206. Additional factors in the analysis may include minimizing change accrued, i.e., ensuring that the cumulative value of the selected UTXOs 206 exceeds the total value by the minimum amount possible given the available UTXOs 206. In some implementations, the UTXOs 206 may be prioritized based on their value; that is, UTXOs 206 whose value corresponds to one of a predefined set of denominations may be preferred, as described further below.
[0051] In some implementations, the selection of the optimal set of UTXOs 206 can be based on the total value (or the total value plus fees, since the input node 202 may need to ensure that the submitted input contains enough to cover the transaction's fees) and rules that avoid using large UTXOs 206 to make small payments. That is, the input node 202 may prioritize using UTXOs 206 that are smaller than full payments. The input node 202 may perform the UTXO selection process using dynamic programming, greedy methods, or other suitable computer programming techniques to find a locally optimal, or at least suitable, selection of UTXOs 206.
[0052] In accordance with another aspect of the present application, the movement of value should be accomplished by one or more coin mixing transactions, such as a coin join transaction in the Bitcoin protocol, i.e., the selected UTXO 206 is an input to one or more coin mixing transactions.
[0053] The input node 202 further determines a number of outputs that make up the total payment. The cumulative value of the outputs corresponds to the total value of the payments made to the output node 204. Each output is determined to be for a respective denomination selected from a series of predefined denominations. In one example, the denomination may be a predefined series of rational numbers of the applicable cryptocurrency. In one example, the denomination may be 1 / 10 of the cryptocurrency. n The denomination may be given by a multiple of the base unit, where n=0, 1, 2, 3, etc. Using Bitcoin as an example, the denominations are: 1BTC,0.1BTC,0.01BTC,0.001BTC,...,1Satoshi Other example denominations may be, for example: 1BTC, 0.5BTC, 0.2BTC, 0.1BTC, 0.05BTC, 0.02BTC, 0.001BTC, etc. They do not necessarily have to be related by the base 10, for example.
[0054] In some implementations, all but one of the inputs have corresponding outputs of the same value (because if the cumulative value of the inputs exceeds the total payout, one of the inputs may result in an excess amount attributable to change and / or fee payments in the transaction being paid back to the input). Inputs that match in value to corresponding outputs may be included in the same coin mixing transaction, where the transaction is designed to mix multiple inputs and outputs that all have the same value.
[0055] Once the input node 202 has determined one or more UTXOs 206 as inputs, and has determined multiple outputs and their respective values, the input node 202 participates in one or more coin mixing transactions by inserting the UTXOs 206 as inputs and respective output addresses corresponding to each of the outputs.
[0056] In a further aspect of the present application, the input node 202 does not use the public address of the output node as the output address and does not pool the output at a common address for the output node 204. Instead, the input node 202 generates a new secret output address for each output. Each new secret output address is generated using the public key B pub provided by the output node. x and BPub y and the random number r i The random number r is generated based on imay be referred to as a nonce. In this regard, the two public keys from the output node 204 together act as "stealth addresses" in the sense that they will act as seeds for generating a secret address, but the link between the output node 204 and the new secret address is known only to the input node 202. This conceals the identity of the payee in the transaction, since the actual output address is not known to be associated with the output node 204, while if a payment is made to an output node 204 that published a public key address, it will be identifiably associated with the output node 204.
[0057] In this example, the input node 202 specifically: BPub i =H(r i BPub x )G+BPub y Based on this, a new secret output address BPub i where G is the elliptic curve base point and H() is a hash function. The input node 202 also generates R i =r i Based on G, a random number r i From the nonce public key R i Calculate.
[0058] The input node 202 generates a new secret output address BPub for each output. i It also generates a per-output nonce public key R i with the output node 204. The output node 204 then shares its nonce public key R i and the private key BPriv x and BPriv y and to find the private key corresponding to one of the output addresses in the transaction, using the formula: BPriv i =H(BPriv x R i )+BPrivy The generated private key is the public key BPub. i If the output node 204 has the correct private key to unlock the transaction output destined for that output address, then the output node 204 may be used to obtain the correct private key to unlock the transaction output destined for that output address.
[0059] Nonce Public Key R i The mechanism for sharing the nonce public key R may take a variety of forms, depending on the implementation. i is inserted into a non-transaction field of the coin mixing transaction in which the output address is used. The output node 204 searches the blockchain to find coin mixing transactions that have data in a non-transaction field. For example, in the Bitcoin protocol, the OP_RETURN code is a Script opcode used to mark invalid transaction outputs. Any data placed after the OP_RETURN code is ignored when processing Bitcoin payments, so it can effectively act as a message or data carrying field within the transaction. Thus, in one implementation based on the Bitcoin protocol, coin mixing transactions include the public nonce R i In general terms, codes that indicate that non-transactional data or information is not included in the transaction may be referred to herein as "non-transactional codes."
[0060] Note that some protocols, such as Bitcoin, may limit the ability to use such non-transaction data fields in transactions. As an example, Bitcoin may only allow one OP_RETURN code per transaction. This is because one R iIn some cases, only one R may be specified in a single non-transactional data field. i Although it may be possible to concatenate multiple keys, in some embodiments limitations on key size and field length may make this impractical. Thus, the nonce public key R for multiple outputs in a coin mixing transaction i may be shared using other mechanisms.
[0061] In one exemplary embodiment, the input node 202 is i The output node 204 then generates further transactions 212, each having a non-transaction data field containing one of the nonce public keys. The number of further transactions may match the number of outputs. The output node 204 then searches or monitors the blockchain for the presence of transactions containing non-transaction data, such as OP_RETURN codes. If the output node 204 finds such a transaction, it retrieves the non-transaction data based on it being a possible nonce public key and uses that data along with the public key material to generate possible output addresses. The output node 204 then evaluates whether the generated possible output addresses appear on the blockchain as outputs of the coin mixing transaction.
[0062] In another exemplary implementation, the input node 202 transmits the nonce public key R using a separate, preferably encrypted, communication channel. i The output node 204 then forwards the corresponding public key B Pub to the output node 204 outside the blockchain itself. i , and searches the blockchain for coin mixing transactions that move value to those addresses.
[0063] The output node 204 receives the nonce public key R i, but rather, when the output node 204 searches the blockchain to find transactions that contain non-transaction data and attempt to identify corresponding outputs in the coin mixing transaction, the output node 204 may continue its search until it finds a set of outputs that cumulatively add to the total value that should have been moved by the input node 202.
[0064] 2 shows an example where an input node 202 should move 0.49 coins. The coins may be bitcoins, altcoins, or other cryptocurrencies. In this example, a coin mixing transaction 210 is available for input node 202 to participate in, in which multiple denominations are being mixed (at a fixed, pre-defined denomination). That is, the transaction includes multiple 1 coin inputs and outputs, multiple 0.1 coin inputs and outputs, multiple 0.01 coin inputs and outputs, and multiple 0.001 coin inputs and outputs, etc. In other examples, more denominations may be included, including non-base 10 denominations.
[0065] In this example, the input node 202 uses five available UTXOs 206, each in an amount of 0.1 coins, to assemble 0.49 coins. If the input node 202 did not happen to have enough UTXOs 206 in 0.1 coin increments, it would select a UTXO of another denomination to construct the payment. In this example, if the input node 202 was inputting 0.5 coins to construct the 0.49 coin payment, the input node 202 would be entitled to 0.01 coin change, but as can be seen in this example, transactions may carry a fee. Change in the amount of 9 x 0.001 coins is returned to the input node 202, which implies a transaction fee of 0.001 coins.
[0066] The five inputs each come from a different UTXO 206 owned by the input node 202. The output includes 4×0.1 coins and 9×0.01 coins. In this example, the input node 202 receives BPub1, BPub2, . . . , BPub 13 It generates 13 output addresses, denoted as
[0067] 13 public number keys i (i=1,2,...,13) are shared with the output node 204. As mentioned above, in some protocols it may be possible to insert a key into each of the non-transaction data fields in the coin mixing transaction. A non-transaction data field is any type of data field that does not adversely affect the transaction. The data fields may be designated fields for comments, text, or other data unrelated to the transaction. In some cases, the data fields may be marked or identified with a specific code or signal to indicate that the field contains non-transaction data. As mentioned above, in the Bitcoin protocol, the OP_RETURN code may be used for this purpose. However, the Bitcoin protocol does not allow for the insertion of all 13 nonce public keys R i Restrict the use of non-transaction outputs so that they cannot be inserted into coin mixing transactions.
[0068] Nonce Public Key R i If the nonce public keys R cannot be shared in a non-transaction field in the coin mixing transaction itself, the input node 202 shares them in another way. In one example, the input node 202 sends them to the output node 204 through a separate encrypted channel or communication. In another example, the input node 202 sends each nonce public key R i They are shared across the blockchain by placing the
[0069] The output node 204 scans the blockchain looking for transactions that may include payments from the input node 202. The search may be based on identifying transactions that contain a particular signal or code (which may in some cases be a nonce public key) that indicates the presence of non-transactional data. In one implementation, the signal that is detected is a non-transactional code, such as the OP_RETURN code (or its functional equivalent) in the Bitcoin protocol. This code indicates that the data following the code is non-transactional.
[0070] In this example, there are at least 13 null outputs that contain non-transaction data, either in the coin mixing transaction 210 itself or in the set of 13 further transactions 212. For each field, the output node 204 then generates the data (whether it is the nonce public key R i ) and take that BPriv x and BPriv y and the formula: BPriv i =H(BPriv x R i )+BPriv y Based on this, BPriv i and the corresponding BPub i The retrieved data is used to calculate the nonce public key R used by the input node 202 to generate the secret output address. i , the output node 204 outputs a BPub corresponding to one of the output addresses in the transaction 210. i This means that the calculated BPub i The output node 204 may simply compare the corresponding private key, BPriv, to the output address of the transaction 210 to verify that it has correctly identified one of the payments to itself. i Since they have the UTXO, they own it.
[0071] As can be seen, the example of Figure 2 involves a transaction 210 mixing a sufficient amount of multiple base-10 denominations such that an input node 202 can find a combination of UTXOs 206 that cumulatively constitute a payment and participate in the transaction 210. In some circumstances, such a coin-mixing transaction may not be available for participation or may fail to complete.
[0072] Also, as will be apparent, while the example of FIG. 2 is specific to the distribution of cryptocurrencies and payments in the discussion that follows, the processes and systems described are applicable to the distribution of data records (one example of which is crypto asset value) based on data record characteristics that match predetermined data record characteristics (one example of which is conforming the value to a predetermined denomination).
[0073] FIG. 3 illustrates another example payment process 300 in which multiple coin mixing transactions 302, 304 are used.
[0074] In this example, the input node 202 is constrained in selecting an available UTXO 206 based on the available coin mixing transactions 302, 304. In this example, it is assumed that one coin mixing transaction 302 is for mixing a 0.1 coin denomination and the other coin mixing transaction 304 is for mixing a 0.01 coin denomination. Participating in each of the transactions 302, 304 is subject to a transaction fee, in this example 0.00001 coins. The fee is entered into the transaction by the input node 202 with a separate UTXO 206 of that amount, rather than relying on overpayments and change.
[0075] The input node 202 cannot use the 5×0.1 coins as seen in the previous example because the coin mixing transaction 302 is not necessarily designed to return 0.01 change and the output payment to the output node 204 would result in an overpayment of 0.01 coins. Thus, the input node 202 may construct a payment using the 4×0.1 coins mixed in transaction 302 and the 9×0.01 coins mixed in transaction 304. The output would be the same, 4×0.1 coins from transaction 302 and 9×0.01 coins from transaction 304. If multiple non-transaction data fields are allowed in the particular implementation / protocol being used, then the nonce public keys R1, R2, R3, R4 would be placed in a non-transaction data field in transaction 302 and the remaining nonce public keys R5 through R6 would be placed in a non-transaction data field in transaction 302 and the remaining nonce public keys R6 through R7 would be placed in a non-transaction data field in transaction 302 and the remaining nonce public keys R7 through R8 would be placed in a non-transaction data field in transaction 302 and the remaining nonce public keys R8 through R9 would be placed in a non-transaction data field in transaction 302 and the remaining nonce public keys R9 through R10 would be placed in a non-transaction data field in transaction 302 and the remaining nonce public keys R10 through R104 ... 13 is placed in a non-transaction data field in the transaction 304. Alternatively, the nonce public key R i is shared with the output node 204 through a separate communication channel or in a non-transaction data field with the nonce public key R i are shared through separate, individual blockchain transactions, each of which contains one of the
[0076] As will be appreciated by those skilled in the art, still other example processes may use other denominations and coin mixing transactions to achieve payment.
[0077] As will be apparent, in order to participate in the above processes 200 and 300, the input node 202 has sufficient UTXO 206 available in the correct denomination. There may be situations where the UTXO 206 owned by the input node 202 is not in the correct denomination to participate in coin mixing at the given denomination. In one implementation, the input node 202 may be configured to signal to the payer that it wishes to receive payment in the given denomination, so that the input node 202 has a UTXO available for a payment that it intends to make thereafter. In some cases, the input node 202 may be configured to actively collapse or decompose its UTXO 206 into multiple UTXO 206 having the given denomination. Such functionality may be built into the wallet software and may actively generate transactions to decompose the UTXO 206 into the given denomination, provided that such transactions can be implemented with negligible or zero transaction fees. In some cases, the wallet software may be configured to enable or disable this feature. When enabled, the wallet software may generate and execute these transactions in the background. In some implementations, the software may display proposed fragmentation transactions for user approval before executing the transaction, especially if any fees are due for the fragmentation transactions.
[0078] 4, which illustrates in flow chart form an example method 400 for making a blockchain-based payment from an input node to an output node in accordance with an embodiment of the present application. The method 400 includes obtaining public key material from the output node at operation 402. In this example, the public key material is BPriv x and BPriv y Note that in some other implementations, the public key material of the output node may take other forms.
[0079] The input node then selects a UTXO from its pool of available UTXOs to comprise a payment to the output node at operation 404. The selected UTXO may be based on a denomination of the available coin mixing transactions. The selected UTXO may be further based on minimizing the number of UTXOs involved. The selected UTXO may also be further based on minimizing the change returned to the input node. Other factors may also be used in the selection process to identify the UTXOs that will comprise the payment. While in many cases a payment may be composed of multiple UTXOs, in some cases a single UTXO may be selected. The cumulative value of the UTXOs is equal to or greater than the total payment amount.
[0080] The input node also determines the number and denomination of outputs that will constitute the payment to the output node, at operation 404. The output denomination may be selected from predefined denominations and may be selected based on the denominations of the available coin mixing transactions.
[0081] Having determined the number of outputs at operation 406, the input node then generates a random number r i and for each output, its associated random number r i and the public key material from the output node, i Generate the output address.
[0082] The input node then inserts the inputs and outputs into one or more coin mixing transactions at operation 408.
[0083] At operation 410, the input node receives the nonce public key R i Each node shares its nonce public key R i is the output address BPub i The random number r used to generate i In some implementations, the nonce public key R iis inserted into one or more non-transaction data fields of the coin mixing transaction. In some implementations, the nonce public key R i is a separate, additional transaction (nonce public key R i In yet another implementation, the input node receives the nonce public key R i with the output node via a separate communication channel outside the blockchain protocol.
[0084] The input node then signs each of the inputs that it inserted into one or more transactions, at operation 412.
[0085] 5 illustrates in flow chart form an example method 500 for receiving payments at an output node using blockchain technology. The output node initially publishes or makes available its public key material at operation 502. In this example method 500, the public key material is made available in the form of two public keys B Pub . x and BPub y It may provide this material to an input node that intends to make a payment to the output node. In this example, the output node is assumed to know the upcoming payment and the amount of the payment. However, there may be cases where the output node has made its public key material widely available and may receive payments from any number of possible sources in amounts not known in advance. In such cases, the output node intermittently scans the blockchain for non-transactional data, as described below, and tests any such data it finds.
[0086] At operation 504, the output node begins searching the blockchain for transactions that may be related to the payment from the input node. In particular, the output node looks for transactions that include a non-transaction signal or code that indicates the presence of non-transaction data. In some embodiments, the output node may limit its search to coin mixing transactions that include non-transaction data. As will be apparent, this example assumes that the non-transaction data is included in the coin mixing transaction itself. As noted above, in some implementations, this may not be possible, and the nonce public key material may be shared with the output node in other ways, for example, through a further transaction that includes a non-transaction data field, or through a separate non-blockchain communication channel. For example, the output node may look for transactions that include one P2PKH output and one Null Data output, where the nonce public keys are included in each separate transaction.
[0087] Upon identifying a candidate transaction that includes non-transaction data at operation 506, the output node retrieves the non-transaction data and tests whether the data can be used to generate one of the output addresses in the transaction. As described above, if the non-transaction data is associated with a nonce public key R i If so, then using the public key material, the output node derives the public-private key pair BPriv i and BPub i It is possible to generate a public key BPub. iwill correspond to one of the output addresses. At operation 508, the output node evaluates whether the generated key corresponds to an output address in the transaction. If not, the output node discards the non-transaction data and returns to searching the blockchain, or tests for further non-transaction data in the current candidate transaction, if such data exists.
[0088] BPriv i and BPub i If the output node determines at operation 508 that it has successfully identified one of the payments by determining i The output node may then proceed to add the payments allocated to it to the total amount paid by the input nodes. At operation 512, the output node may evaluate whether the cumulative value of the payments from the input nodes achieves a full payment. If not, it continues searching.
[0089] As will be apparent, some of the operations described in the above example embodiments may be performed simultaneously or in different orders in some implementations without substantially affecting the process. The present application includes these variations and modifications.
[0090] Coin mixing transactions may, in some implementations, be executed from a central server, but they may also be fully distributed, with all input nodes acting as blind-signing servers. In the context of Bitcoin, JoinMarket is an example of a decentralized implementation of coin mixing that encourages participation and increases liquidity.
[0091] Reference is now made to Figure 6, which illustrates in block diagram form a simplified example of a participating node 600. The node 600 includes a processor 602. The processor 602 may include one or more microprocessors, application specific integrated circuits (ASICs), microcontrollers, or similar computer processing devices. The node 600 further includes a memory 604. The memory 604 may include permanent and non-transitory memory that stores values, variables, and in some cases, program instructions executable by the processor. The node 600 further includes a network interface 606 that provides network connectivity over wired or wireless networks.
[0092] The node 600 includes a processor-executable blockchain application 608 that includes processor-executable instructions that, when executed, cause the processor 602 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 described methods / processes to configure the devices and processes, and nodes, described herein may be implemented using standard computer programming techniques and languages, and the application is not limited to any particular processor, computer language, computer programming specifications, data structures, or other such implementation details.
[0094] It should be noted that the above embodiments illustrate rather than limit the invention, 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. In the claims, any reference signs in parentheses shall not be construed as limiting the scope of the claims. The words "comprising" and "comprises" and the like 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, "comprising" means "includes or consists of" and "comprising" means "including or consisting of". A single reference of an element does not exclude a plurality of references of such elements and vice versa. The invention may 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 claims does not indicate that a combination of these measures cannot be used to advantage.
Claims
1. 1. A computer-implemented method for moving entire data records between an input node and an output node using a blockchain, the method being performed at the output node, comprising: providing public key material associated with said output node to said input node; Obtaining a nonce public key from the input node; searching the blockchain for a data record distributed transaction, the data record distributed transaction having a plurality of input addresses and a plurality of output addresses, each output address being assigned a data record having a respective data record characteristic in a set of predefined data record characteristics; determining a public-private key pair based on the nonce public key and the public key material; matching a public key from the public-private key pair with one of the output addresses in the data record distribution transaction and, based on the matching, adding the data record assigned to that output address to an interim data record compilation; determining whether the interim data record compilation is less than the entire data record, and if so, continuing said searching, determining, and matching until the interim data record compilation matches the entire data record; The method comprising:
2. The public key material consists of two public keys, BPub x and B.P.U.B. y The two public keys have corresponding private keys BPriv x and B.P.R.I.V. y having The method of claim 1.
3. Determining the i-th public-private key pair comprises: B.Priv i = H(BPriv x R i ) + B Priv y determining whether B.Priv i is the private key of the public-private key pair, H() is a hash function, and R i is the nonce public key, The public key of the i-th public-private key pair is B Pub i = B.P.R.I.V. i G, where G is the elliptic curve base point. The method of claim 2.
4. The nonce public key R i is R i = r i Generated as G, The method according to claim 3.
5. Searching the blockchain includes identifying data record distributed transactions that include non-transaction codes; deriving the nonce public key comprises retrieving the nonce public key from a non-transaction data field of the data record distributed transaction.
5. The method according to any one of claims 1 to 4.
6. deriving the nonce public key comprises searching the blockchain for a transaction including a non-transaction code, and if identified, retrieving the nonce public key from a non-transaction data field within the transaction.
5. The method according to any one of claims 1 to 4.
7. the data record characteristic is a value specified in the data record; The set of predetermined data recording characteristics includes a maximum value and 1 / 10 of the maximum value. n a succession of values based on a series defined by a factor n, where n is a positive integer.
7. The method according to any one of claims 1 to 6.
8. Searching the blockchain includes identifying coin mixing transactions that include non-transaction codes; deriving the nonce public key comprises retrieving the nonce public key from a non-transaction data field of the coin mixing transaction.
8. The method according to any one of claims 1 to 7.
9. A computing device that uses a blockchain to move entire data records between input nodes and output nodes, comprising: the computing device being one of the output nodes; The computing device comprises: A processor; Memory, a network interface for providing network connectivity; a blockchain application comprising computer executable instructions which, when executed by the processor, cause the processor to perform the method of any one of claims 1 to 8; A computing device comprising:
10. 1. A non-transitory processor-readable medium storing processor-executable instructions for moving entire data records between input nodes and output nodes using a blockchain, comprising: The processor executable instructions, when executed by a processor of the output node, cause the processor to perform a method according to any one of claims 1 to 8. A non-transitory processor-readable medium.
Citation Information
Patent Citations
Virtual currency system
US20150269539A1
Crypto Key Recovery and Social Aggregating, Fractionally Efficient Transfer Guidance, Conditional Triggered Transaction, Datastructures, Apparatuses, Methods and Systems
US20170048209A1
Computationally efficient transfer processing, auditing, and search apparatuses, methods and systems
WO2017011601A1
