WO2023156099A1 - Adresses de chaîne de blocs liées à l'identité - Google Patents

Adresses de chaîne de blocs liées à l'identité Download PDF

Info

Publication number
WO2023156099A1
WO2023156099A1 PCT/EP2023/050825 EP2023050825W WO2023156099A1 WO 2023156099 A1 WO2023156099 A1 WO 2023156099A1 EP 2023050825 W EP2023050825 W EP 2023050825W WO 2023156099 A1 WO2023156099 A1 WO 2023156099A1
Authority
WO
WIPO (PCT)
Prior art keywords
parameter
target
script
transaction
blockchain
Prior art date
Application number
PCT/EP2023/050825
Other languages
English (en)
Inventor
Alec BURNS
Craig Steven WRIGHT
Original Assignee
Nchain Licensing Ag
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nchain Licensing Ag filed Critical Nchain Licensing Ag
Publication of WO2023156099A1 publication Critical patent/WO2023156099A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
    • H04L9/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures

Definitions

  • the present disclosure relates to a method for generating a common blockchain address for multiple public keys.
  • a blockchain refers to a form of distributed data structure, wherein a duplicate copy of the blockchain is maintained at each of a plurality of nodes in a distributed peer-to-peer (P2P) network (referred to below as a "blockchain network”) and widely publicised.
  • the blockchain comprises a chain of blocks of data, wherein each block comprises one or more transactions.
  • Each transaction other than so-called “coinbase transactions”, points back to a preceding transaction in a sequence which may span one or more blocks going back to one or more coinbase transactions.
  • Coinbase transactions are discussed further below.
  • New blocks are created by a process often referred to as “mining”, which involves each of a plurality of the nodes competing to perform "proof-of-work", i.e. solving a cryptographic puzzle based on a representation of a defined set of ordered and validated pending transactions waiting to be included in a new block of the blockchain.
  • mining a process often referred to as "mining”
  • proof-of-work i.e. solving a cryptographic puzzle based on a representation of a defined set of ordered and validated pending transactions waiting to be included in a new block of the blockchain.
  • the blockchain may be pruned at some nodes, and the publication of blocks can be achieved through the publication of mere block headers.
  • the transactions in the blockchain may be used for one or more of the following purposes: to convey a digital asset (i.e. a number of digital tokens), to order a set of entries in a virtualised ledger or registry, to receive and process timestamp entries, and/or to time- order index pointers.
  • a blockchain can also be exploited in order to layer additional functionality on top of the blockchain.
  • blockchain protocols may allow for storage of additional user data or indexes to data in a transaction.
  • Nodes of the blockchain network (which are often referred to as “miners") perform a distributed transaction registration and verification process, which will be described in more detail later.
  • a node validates transactions and inserts them into a block template for which they attempt to identify a valid proof-of-work solution. Once a valid solution is found, a new block is propagated to other nodes of the network, thus enabling each node to record the new block on the blockchain.
  • a user e.g. a blockchain client application
  • Nodes which receive the transaction may race to find a proof-of-work solution incorporating the validated transaction into a new block.
  • Each node is configured to enforce the same node protocol, which will include one or more conditions for a transaction to be valid. Invalid transactions will not be propagated nor incorporated into blocks. Assuming the transaction is validated and thereby accepted onto the blockchain, then the transaction (including any user data) will thus remain registered and indexed at each of the nodes in the blockchain network as an immutable public record.
  • the node who successfully solved the proof-of-work puzzle to create the latest block is typically rewarded with a new transaction called the "coinbase transaction" which distributes an amount of the digital asset, i.e. a number of tokens.
  • the detection and rejection of invalid transactions is enforced by the actions of competing nodes who act as agents of the network and are incentivised to report and block malfeasance.
  • the widespread publication of information allows users to continuously audit the performance of nodes.
  • the publication of the mere block headers allows participants to ensure the ongoing integrity of the blockchain.
  • the data structure of a given transaction comprises one or more inputs and one or more outputs.
  • Any spendable output comprises an element specifying an amount of the digital asset that is derivable from the proceeding sequence of transactions.
  • the spendable output is sometimes referred to as a UTXO ("unspent transaction output").
  • the output may further comprise a locking script specifying a condition for the future redemption of the output.
  • a locking script is a predicate defining the conditions necessary to validate and transfer digital tokens or assets.
  • Each input of a transaction (other than a coinbase transaction) comprises a pointer (i.e.
  • a reference to such an output in a preceding transaction, and may further comprise an unlocking script for unlocking the locking script of the pointed-to output.
  • the first transaction comprises at least one output specifying an amount of the digital asset, and comprising a locking script defining one or more conditions of unlocking the output.
  • the second, target transaction comprises at least one input, comprising a pointer to the output of the first transaction, and an unlocking script for unlocking the output of the first transaction.
  • one of the criteria for validity applied at each node will be that the unlocking script meets all of the one or more conditions defined in the locking script of the first transaction. Another will be that the output of the first transaction has not already been redeemed by another, earlier valid transaction. Any node that finds the target transaction invalid according to any of these conditions will not propagate it (as a valid transaction, but possibly to register an invalid transaction) nor include it in a new block to be recorded in the blockchain.
  • An alternative type of transaction model is an account-based model.
  • each transaction does not define the amount to be transferred by referring back to the UTXO of a preceding transaction in a sequence of past transactions, but rather by reference to an absolute account balance.
  • the current state of all accounts is stored by the nodes separate to the blockchain and is updated constantly.
  • a hash function is a function that takes an input of arbitrary length and gives an output of fixed length.
  • hash functions There are two general uses of hash functions. One use is to convert key-value pairs to index-value pairs for table lookup, in which case keys are hashed to indices. Multiplicative hashing is commonly used in programming for this purpose.
  • the other major use is in cryptography, in which case the hash functions are generally referred to as cryptographic hash functions. In this case, security requirements result in more complicated hash functions.
  • SHA256 is a cryptographic hash function used in blockchain technology.
  • Cryptographic hash functions such as SHA256, are frequently used in locking scripts of blockchain transactions.
  • a well-known locking script is the pay-to-public-key- hash (P2PKH) locking script which uses the OP_HASH160 opcode discussed below.
  • P2PKH pay-to-public-key- hash
  • OP_RIPEMD160 is an opcode configured to hash an input using the RIPEMD-160 hash function.
  • OP_SHA1 is an opcode configured to hash an input using the SHA-1 hash function.
  • OP_SHA256 is an opcode configured to hash an input using the SHA-256 hash function.
  • OP_HASH160 is an opcode configured to first hash an input using the SHA-256 hash function and then with the RIPEMD-160 hash function.
  • OP_HASH256 is an opcode configured to hash an input twice using the SHA-256 hash function. See, for example, https://wiki.bitcoinsv.io/index.php/Opcodes_used_in_Bitcoin_Script.
  • Other blockchains are similarly limited. There are many scenarios where it would be beneficial to use a hash function that is not limited to those that are implemented by the existing set of opcodes. However it is not desirable to introduce new opcodes as this would undermine the stability of the blockchain and reduce its trustworthiness. It would therefore be desirable to expand the range of hash functions that can be implemented, in script, using the existing set of opcodes (or functions more generally).
  • some of the available opcodes (e.g. OP_HASH256) involve applying several cryptographic hash functions to an input and are thus computationally expensive. It would therefore be desirable to be able to implement a hash function that is less computationally expensive than those that involve multiple cryptographic hash operations.
  • Cryptographic hashing is the most commonly used method to mask a public key address in a locking script, referred to as pay-to-public-key-hash (P2PKH). This is useful as it provides a degree of privacy to the public key until the unspent transaction output (UTXO) is unlocked, at which point the public key is revealed in the spending transaction. As it is computationally infeasible to calculate the pre-image of SHA-256 from the hash value, there is little risk of deriving the public key value from the on-chain hash value.
  • a party may use a standard one-of-two multi-signature transaction.
  • multi-signature transactions expose all potential claimant public keys on-chain, in the locking script. If these public key addresses were hashed on chain to conceal them, it would still be necessary to contain each hashed address value on chain also.
  • Cryptographic hashing in this way can still allow for parties to associate hashed addresses together, thus requiring a party to generate a new public key to maximise privacy even if they don't claim the funds by revealing the associated public key.
  • a computer-implemented method of linking multiple public keys to generate a common blockchain address wherein each party is associated with a respective public key
  • the method comprises: generating the common blockchain address, wherein the common blockchain address is generated by hashing any one of the respective public keys with a universal hash function, wherein hashing the respective public key with the universal hash function comprises: generating a first intermediate result based on a multiplication of the respective public key by a first parameter, generating a second intermediate result based on an addition of a second parameter to the first intermediate result, generating a third intermediate result based on a modulo of the second intermediate result by a third parameter; and generating the common blockchain address based on a modulo of the third intermediate result by a fourth parameter, wherein a respective value of at the first parameter is derived based on each of the multiple public keys and the fourth parameter.
  • Universal hashing refers to an algorithm that selects a hash function from a set of hash functions, then calculates the output based on the selected hash function, for any given input.
  • the main goals for universal hashing are to reduce the likelihood of collisions and to avoid worst case inputs (for some hash functions, there exists a set of worst-case inputs for which it would take much longer than average to compute their hash values).
  • the hash function (referred to as a universal hash function) involves multiplying an input by a first parameter (a), adding a second parameter (b), taking mod p (third parameter), and then taking mod n (fourth parameter). In some examples, other (minor) operations may be performed.
  • Each party has a respective public key.
  • the common blockchain address can be generated by inputting any one of the public keys to the hash function. In other words, the same address is produced by hashing any one of the public keys. The same blockchain address is generated regardless of which public key is input to the hash function. In order to do so, a particular value of the first parameter must be derived, where the value of the first parameter is based on each of the multiple public keys and the fourth parameter (n). In this way, a common blockchain address is generated that is based on and therefore links a plurality of public keys.
  • the common blockchain address may be used to lock a transaction output.
  • the output includes, as part of a locking script, a hash function (HF) script configured to implement the hash function.
  • HF hash function
  • This HF script is thus configured to implement a new hash function compared to those currently available as part of the blockchain's primitive scripting language.
  • the HF script is less computationally expensive compared to the existing hash functions offered on some blockchains (e.g. OP_HASH160).
  • the HF script is used as part of a P2PKH script instead of the OP_HASH160 opcode, and therefore achieves the same result (locking an output to a public key hash) with less computation.
  • the HF script may be even more efficient if implemented as a single opcode.
  • the common blockchain address is linked to multiple public keys, when used to lock a UTXO, any party that owns one of the multiple public keys can unlock the UTXO.
  • the common blockchain address may be used as a multi-signature address. Unlike conventional multi-signature addresses, only the claiming party must reveal their public key to claim the UTXO. This preserves privacy and security of the non-claiming parties' public keys. In some cases, there is also a storage saving compared to conventional multi-signature addresses. In conventional multi-signature addresses the size of the locking script increases with each public key (each public key must be included in the locking script). In contrast, the common blockchain address remains a constant size as the number of public keys increases.
  • a plurality of different blockchain addresses may be generated from the same public keys using the universal hash function. This is achieved by varying the values of the third and/or fourth parameters, which in turn varies the first parameter.
  • Each address may be used to lock a different output of a transaction, and/or to lock different outputs of different transactions.
  • Each different output may include an instance of the HF script, with each instance including (and therefore being locked to) a different one of the addresses.
  • Figure 1 is a schematic block diagram of a system for implementing a blockchain
  • Figure 2 schematically illustrates some examples of transactions which may be recorded in a blockchain
  • Figure 3A is a schematic block diagram of a client application
  • Figure 3B is a schematic mock-up of an example user interface that may be presented by the client application of Figure 3A,
  • Figure 4 is a schematic block diagram of some node software for processing transactions
  • Figure 5A schematically illustrates an example system for generating a common blockchain address
  • Figure 5B is a schematic block diagram of an example system for submitting blockchain transactions to a blockchain
  • Figure 6 is a schematic block diagram of another example system for submitting blockchain transactions to a blockchain
  • Figure 7 schematically illustrates a hierarchical deterministic set of keys
  • Figure 8 is an example script for converting to a binary representation
  • Figure 9 is an example script for performing a point scalar multiplication
  • Figure 10 is an example script for performing an inverse modulo calculation
  • Figure 11 is an example script for performing a point addition of two different points
  • Figure 12 is an example script for performing a point addition of two same points
  • Figure 13 is an example script for performing a point addition of two points
  • Figure 14 is an example script for converting data into a compressed key format
  • Figure 15 schematically illustrates a hybrid hashing index scheme.
  • FIG. 1 shows an example system 100 for implementing a blockchain 150.
  • the system 100 may comprise a packet-switched network 101, typically a wide-area internetwork such as the Internet.
  • the packet-switched network 101 comprises a plurality of blockchain nodes 104 that may be arranged to form a peer-to-peer (P2P) network 106 within the packet- switched network 101.
  • P2P peer-to-peer
  • the blockchain nodes 104 may be arranged as a near-complete graph. Each blockchain node 104 is therefore highly connected to other blockchain nodes 104.
  • Each blockchain node 104 comprises computer equipment of a peer, with different ones of the nodes 104 belonging to different peers.
  • Each blockchain node 104 comprises processing apparatus comprising one or more processors, e.g. one or more central processing units (CPUs), accelerator processors, application specific processors and/or field programmable gate arrays (FPGAs), and other equipment such as application specific integrated circuits (ASICs).
  • Each node also comprises memory, i.e. computer-readable storage in the form of a non-transitory computer-readable medium or media.
  • the memory may comprise one or more memory units employing one or more memory media, e.g. a magnetic medium such as a hard disk; an electronic medium such as a solid-state drive (SSD), flash memory or EEPROM; and/or an optical medium such as an optical disk drive.
  • the blockchain 150 comprises a chain of blocks of data 151, wherein a respective copy of the blockchain 150 is maintained at each of a plurality of blockchain nodes 104 in the distributed or blockchain network 106.
  • maintaining a copy of the blockchain 150 does not necessarily mean storing the blockchain 150 in full. Instead, the blockchain 150 may be pruned of data so long as each blockchain node 150 stores the block header (discussed below) of each block 151.
  • Each block 151 in the chain comprises one or more transactions 152, wherein a transaction in this context refers to a kind of data structure. The nature of the data structure will depend on the type of transaction protocol used as part of a transaction model or scheme. A given blockchain will use one particular transaction protocol throughout.
  • each transaction 152 comprises at least one input and at least one output.
  • Each output specifies an amount representing a quantity of a digital asset as property, an example of which is a user 103 to whom the output is cryptographically locked (requiring a signature or other solution of that user in order to be unlocked and thereby redeemed or spent).
  • Each input points back to the output of a preceding transaction 152, thereby linking the transactions.
  • Each block 151 also comprises a block pointer 155 pointing back to the previously created block 151 in the chain so as to define a sequential order to the blocks 151.
  • Each of the blockchain nodes 104 is configured to forward transactions 152 to other blockchain nodes 104, and thereby cause transactions 152 to be propagated throughout the network 106.
  • Each blockchain node 104 is configured to create blocks 151 and to store a respective copy of the same blockchain 150 in their respective memory.
  • Each blockchain node 104 also maintains an ordered set (or "pool") 154 of transactions 152 waiting to be incorporated into blocks 151.
  • the ordered pool 154 is often referred to as a "mempool”. This term herein is not intended to limit to any particular blockchain, protocol or model. It refers to the ordered set of transactions which a node 104 has accepted as valid and for which the node 104 is obliged not to accept any other transactions attempting to spend the same output.
  • the (or each) input comprises a pointer referencing the output of a preceding transaction 152i in the sequence of transactions, specifying that this output is to be redeemed or "spent" in the present transaction 152j.
  • the preceding transaction could be any transaction in the ordered set 154 or any block 151.
  • the preceding transaction 152i need not necessarily exist at the time the present transaction 152j is created or even sent to the network 106, though the preceding transaction 152i will need to exist and be validated in order for the present transaction to be valid.
  • preceding refers to a predecessor in a logical sequence linked by pointers, not necessarily the time of creation or sending in a temporal sequence, and hence it does not necessarily exclude that the transactions 152i, 152j be created or sent out-of-order (see discussion below on orphan transactions).
  • the preceding transaction 152i could equally be called the antecedent or predecessor transaction.
  • the input of the present transaction 152j also comprises the input authorisation, for example the signature of the user 103a to whom the output of the preceding transaction 152i is locked.
  • the output of the present transaction 152j can be cryptographically locked to a new user or entity 103b.
  • the present transaction 152j can thus transfer the amount defined in the input of the preceding transaction 152i to the new user or entity 103b as defined in the output of the present transaction 152j .
  • a transaction 152 may have multiple outputs to split the input amount between multiple users or entities (one of whom could be the original user or entity 103a in order to give change).
  • a transaction can also have multiple inputs to gather together the amounts from multiple outputs of one or more preceding transactions, and redistribute to one or more outputs of the current transaction.
  • an output-based transaction protocol such as bitcoin
  • a party 103 such as an individual user or an organization
  • wishes to enact a new transaction 152j (either manually or by an automated process employed by the party)
  • the enacting party sends the new transaction from its computer terminal 102 to a recipient.
  • the enacting party or the recipient will eventually send this transaction to one or more of the blockchain nodes 104 of the network 106 (which nowadays are typically servers or data centres, but could in principle be other user terminals).
  • the party 103 enacting the new transaction 152j could send the transaction directly to one or more of the blockchain nodes 104 and, in some examples, not to the recipient.
  • a blockchain node 104 that receives a transaction checks whether the transaction is valid according to a blockchain node protocol which is applied at each of the blockchain nodes 104.
  • the blockchain node protocol typically requires the blockchain node 104 to check that a cryptographic signature in the new transaction 152j matches the expected signature, which depends on the previous transaction 152i in an ordered sequence of transactions 152.
  • this may comprise checking that the cryptographic signature or other authorisation of the party 103 included in the input of the new transaction 152j matches a condition defined in the output of the preceding transaction 152i which the new transaction assigns, wherein this condition typically comprises at least checking that the cryptographic signature or other authorisation in the input of the new transaction 152j unlocks the output of the previous transaction 152i to which the input of the new transaction is linked to.
  • the condition may be at least partially defined by a script included in the output of the preceding transaction 152i. Alternatively it could simply be fixed by the blockchain node protocol alone, or it could be due to a combination of these.
  • the blockchain node 104 forwards it to one or more other blockchain nodes 104 in the blockchain network 106. These other blockchain nodes 104 apply the same test according to the same blockchain node protocol, and so forward the new transaction 152j on to one or more further nodes 104, and so forth. In this way the new transaction is propagated throughout the network of blockchain nodes 104.
  • the definition of whether a given output is assigned (e.g. spent) is whether it has yet been validly redeemed by the input of another, onward transaction 152j according to the blockchain node protocol.
  • Another condition for a transaction to be valid is that the output of the preceding transaction 152i which it attempts to redeem has not already been redeemed by another transaction. Again if not valid, the transaction 152j will not be propagated (unless flagged as invalid and propagated for alerting) or recorded in the blockchain 150. This guards against double-spending whereby the transactor tries to assign the output of the same transaction more than once.
  • An account-based model on the other hand guards against double-spending by maintaining an account balance.
  • blockchain nodes 104 also race to be the first to create blocks of transactions in a process commonly referred to as mining, which is supported by "proof-of-work". At a blockchain node 104, new transactions are added to an ordered pool
  • the blockchain nodes then race to assemble a new valid block 151 of transactions 152 from the ordered set of transactions 154 by attempting to solve a cryptographic puzzle.
  • this comprises searching for a "nonce" value such that when the nonce is concatenated with a representation of the ordered pool of pending transactions 154 and hashed, then the output of the hash meets a predetermined condition.
  • the predetermined condition may be that the output of the hash has a certain predefined number of leading zeros. Note that this is just one particular type of proof-of- work puzzle, and other types are not excluded.
  • a property of a hash function is that it has an unpredictable output with respect to its input. Therefore this search can only be performed by brute force, thus consuming a substantive amount of processing resource at each blockchain node 104 that is trying to solve the puzzle.
  • the first blockchain node 104 to solve the puzzle announces this to the network 106, providing the solution as proof which can then be easily checked by the other blockchain nodes 104 in the network (once given the solution to a hash it is straightforward to check that it causes the output of the hash to meet the condition).
  • the first blockchain node 104 propagates a block to a threshold consensus of other nodes that accept the block and thus enforce the protocol rules.
  • the ordered set of transactions 154 then becomes recorded as a new block 151 in the blockchain 150 by each of the blockchain nodes 104.
  • the block pointer 155 also assigns a sequential order to the blocks 151. Since the transactions 152 are recorded in the ordered blocks at each blockchain node 104 in a network 106, this therefore provides an immutable public ledger of the transactions.
  • a protocol also exists for resolving any "fork” that may arise, which is where two blockchain nodesl04 solve their puzzle within a very short time of one another such that a conflicting view of the blockchain gets propagated between nodes 104. In short, whichever prong of the fork grows the longest becomes the definitive blockchain 150. Note this should not affect the users or agents of the network as the same transactions will appear in both forks.
  • a node that successfully constructs a new block 104 is granted the ability to newly assign an additional, accepted amount of the digital asset in a new special kind of transaction which distributes an additional defined quantity of the digital asset (as opposed to an inter-agent, or inter-user transaction which transfers an amount of the digital asset from one agent or user to another).
  • This special type of transaction is usually referred to as a "coinbase transaction", but may also be termed an "initiation transaction” or "generation transaction”. It typically forms the first transaction of the new block 151n.
  • the proof-of-work signals the intent of the node that constructs the new block to follow the protocol rules allowing this special transaction to be redeemed later.
  • the blockchain protocol rules may require a maturity period, for example 100 blocks, before this special transaction may be redeemed.
  • a regular (non-generation) transaction 152 will also specify an additional transaction fee in one of its outputs, to further reward the blockchain node 104 that created the block 151n in which that transaction was published. This fee is normally referred to as the "transaction fee", and is discussed blow.
  • each blockchain node 104 stores software configured to run on the processing apparatus of the blockchain node 104 in order to perform its respective role or roles and handle transactions 152 in accordance with the blockchain node protocol. It will be understood that any action attributed herein to a blockchain node 104 may be performed by the software run on the processing apparatus of the respective computer equipment.
  • the node software may be implemented in one or more applications at the application layer, or a lower layer such as the operating system layer or a protocol layer, or any combination of these.
  • Some or all of the parties 103 may be connected as part of a different network, e.g. a network overlaid on top of the blockchain network 106.
  • Users of the blockchain network (often referred to as “clients") may be said to be part of a system that includes the blockchain network 106; however, these users are not blockchain nodes 104 as they do not perform the roles required of the blockchain nodes. Instead, each party 103 may interact with the blockchain network 106 and thereby utilize the blockchain 150 by connecting to (i.e. communicating with) a blockchain node 106.
  • Two parties 103 and their respective equipment 102 are shown for illustrative purposes: a first party 103a and his/her respective computer equipment 102a, and a second party 103b and his/her respective computer equipment 102b. It will be understood that many more such parties 103 and their respective computer equipment 102 may be present and participating in the system 100, but for convenience they are not illustrated.
  • Each party 103 may be an individual or an organization. Purely by way of illustration the first party 103a is referred to herein as Alice and the second party 103b is referred to as Bob, but it will be appreciated that this is not limiting and any reference herein to Alice or Bob may be replaced with "first party" and "second "party” respectively.
  • the computer equipment 102 of each party 103 comprises respective processing apparatus comprising one or more processors, e.g. one or more CPUs, GPUs, other accelerator processors, application specific processors, and/or FPGAs.
  • the computer equipment 102 of each party 103 further comprises memory, i.e. computer-readable storage in the form of a non-transitory computer-readable medium or media.
  • This memory may comprise one or more memory units employing one or more memory media, e.g. a magnetic medium such as hard disk; an electronic medium such as an SSD, flash memory or EEPROM; and/or an optical medium such as an optical disc drive.
  • the memory on the computer equipment 102 of each party 103 stores software comprising a respective instance of at least one client application 105 arranged to run on the processing apparatus.
  • any action attributed herein to a given party 103 may be performed using the software run on the processing apparatus of the respective computer equipment 102.
  • the computer equipment 102 of each party 103 comprises at least one user terminal, e.g. a desktop or laptop computer, a tablet, a smartphone, or a wearable device such as a smartwatch.
  • the computer equipment 102 of a given party 103 may also comprise one or more other networked resources, such as cloud computing resources accessed via the user terminal.
  • the client application 105 may be initially provided to the computer equipment 102 of any given party 103 on suitable computer-readable storage medium or media, e.g. downloaded from a server, or provided on a removable storage device such as a removable SSD, flash memory key, removable EEPROM, removable magnetic disk drive, magnetic floppy disk or tape, optical disk such as a CD or DVD ROM, or a removable optical drive, etc.
  • the client application 105 comprises at least a "wallet" function. This has two main functionalities. One of these is to enable the respective party 103 to create, authorise (for example sign) and send transactions 152 to one or more bitcoin nodes 104 to then be propagated throughout the network of blockchain nodes 104 and thereby included in the blockchain 150.
  • this second functionality comprises collating the amounts defined in the outputs of the various 152 transactions scattered throughout the blockchain 150 that belong to the party in question.
  • client functionality may be described as being integrated into a given client application 105, this is not necessarily limiting and instead any client functionality described herein may instead be implemented in a suite of two or more distinct applications, e.g. interfacing via an API, or one being a plug-in to the other. More generally the client functionality could be implemented at the application layer or a lower layer such as the operating system, or any combination of these. The following will be described in terms of a client application 105 but it will be appreciated that this is not limiting.
  • the instance of the client application or software 105 on each computer equipment 102 is operatively coupled to at least one of the blockchain nodes 104 of the network 106. This enables the wallet function of the client 105 to send transactions 152 to the network 106.
  • the client 105 is also able to contact blockchain nodes 104 in order to query the blockchain 150 for any transactions of which the respective party 103 is the recipient (or indeed inspect other parties' transactions in the blockchain 150, since in embodiments the blockchain 150 is a public facility which provides trust in transactions in part through its public visibility).
  • the wallet function on each computer equipment 102 is configured to formulate and send transactions 152 according to a transaction protocol.
  • each blockchain node 104 runs software configured to validate transactions 152 according to the blockchain node protocol, and to forward transactions 152 in order to propagate them throughout the blockchain network 106.
  • the transaction protocol and the node protocol correspond to one another, and a given transaction protocol goes with a given node protocol, together implementing a given transaction model.
  • the same transaction protocol is used for all transactions 152 in the blockchain 150.
  • the same node protocol is used by all the nodes 104 in the network 106.
  • a given party 103 say Alice, wishes to send a new transaction 152j to be included in the blockchain 150, then she formulates the new transaction in accordance with the relevant transaction protocol (using the wallet function in her client application 105). She then sends the transaction 152 from the client application 105 to one or more blockchain nodes 104 to which she is connected. E.g. this could be the blockchain node 104 that is best connected to Alice's computer 102.
  • any given blockchain node 104 receives a new transaction 152j, it handles it in accordance with the blockchain node protocol and its respective role. This comprises first checking whether the newly received transaction 152j meets a certain condition for being "valid", examples of which will be discussed in more detail shortly. In some transaction protocols, the condition for validation may be configurable on a per-transaction basis by scripts included in the transactions 152.
  • condition could simply be a built-in feature of the node protocol, or be defined by a combination of the script and the node protocol.
  • any blockchain node 104 that receives the transaction 152j will add the new validated transaction 152 to the ordered set of transactions 154 maintained at that blockchain node 104. Further, any blockchain node 104 that receives the transaction 152j will propagate the validated transaction 152 onward to one or more other blockchain nodes 104 in the network 106. Since each blockchain node 104 applies the same protocol, then assuming the transaction 152j is valid, this means it will soon be propagated throughout the whole network 106.
  • Different blockchain nodes 104 may receive different instances of a given transaction first and therefore have conflicting views of which instance is 'valid' before one instance is published in a new block 151, at which point all blockchain nodes 104 agree that the published instance is the only valid instance. If a blockchain node 104 accepts one instance as valid, and then discovers that a second instance has been recorded in the blockchain 150 then that blockchain node 104 must accept this and will discard (i.e. treat as invalid) the instance which it had initially accepted (i.e. the one that has not been published in a block 151).
  • An alternative type of transaction protocol operated by some blockchain networks may be referred to as an "account-based" protocol, as part of an account-based transaction model.
  • each transaction does not define the amount to be transferred by referring back to the UTXO of a preceding transaction in a sequence of past transactions, but rather by reference to an absolute account balance.
  • the current state of all accounts is stored, by the nodes of that network, separate to the blockchain and is updated constantly.
  • transactions are ordered using a running transaction tally of the account (also called the "position"). This value is signed by the sender as part of their cryptographic signature and is hashed as part of the transaction reference calculation.
  • an optional data field may also be signed the transaction. This data field may point back to a previous transaction, for example if the previous transaction ID is included in the data field.
  • FIG. 2 illustrates an example transaction protocol.
  • This is an example of a UTXO-based protocol.
  • a transaction 152 (abbreviated "Tx") is the fundamental data structure of the blockchain 150 (each block 151 comprising one or more transactions 152). The following will be described by reference to an output-based or "UTXO" based protocol. However, this is not limiting to all possible embodiments. Note that while the example UTXO-based protocol is described with reference to bitcoin, it may equally be implemented on other example blockchain networks.
  • each transaction (“Tx") 152 comprises a data structure comprising one or more inputs 202, and one or more outputs 203.
  • Each output 203 may comprise an unspent transaction output (UTXO), which can be used as the source for the input 202 of another new transaction (if the UTXO has not already been redeemed).
  • the UTXO includes a value specifying an amount of a digital asset. This represents a set number of tokens on the distributed ledger.
  • the UTXO may also contain the transaction ID of the transaction from which it came, amongst other information.
  • the transaction data structure may also comprise a header 201, which may comprise an indicator of the size of the input field(s) 202 and output field(s) 203.
  • the header 201 may also include an ID of the transaction. In embodiments the transaction ID is the hash of the transaction data (excluding the transaction ID itself) and stored in the header 201 of the raw transaction 152 submitted to the nodes 104.
  • Tx 1 The preceding transaction 152i is labelled “ Tx 0 " in Figure 2.
  • Tx 0 and Tx 1 are just arbitrary labels. They do not necessarily mean that Tx 0 is the first transaction in the blockchain 151, nor that Tx 1 is the immediate next transaction in the pool 154. Tx 1 could point back to any preceding (i.e. antecedent) transaction that still has an unspent output 203 locked to Alice.
  • the preceding transaction Txo may already have been validated and included in a block 151 of the blockchain 150 at the time when Alice creates her new transaction Txi, or at least by the time she sends it to the network 106. It may already have been included in one of the blocks 151 at that time, or it may be still waiting in the ordered set 154 in which case it will soon be included in a new block 151. Alternatively Txo and Txi could be created and sent to the network 106 together, or Txo could even be sent after Txi if the node protocol allows for buffering "orphan" transactions.
  • One of the one or more outputs 203 of the preceding transaction Tx 0 comprises a particular UTXO, labelled here UTXO 0 .
  • Each UTXO comprises a value specifying an amount of the digital asset represented by the UTXO, and a locking script which defines a condition which must be met by an unlocking script in the input 202 of a subsequent transaction in order for the subsequent transaction to be validated, and therefore for the UTXO to be successfully redeemed.
  • the locking script locks the amount to a particular party (the beneficiary of the transaction in which it is included).
  • the locking script defines an unlocking condition, typically comprising a condition that the unlocking script in the input of the subsequent transaction comprises the cryptographic signature of the party to whom the preceding transaction is locked.
  • the locking script (aka scriptPubKey) is a piece of code written in the domain specific language recognized by the node protocol. A particular example of such a language is called "Script" (capital S) which is used by the blockchain network.
  • the locking script specifies what information is required to spend a transaction output 203, for example the requirement of Alice's signature. Unlocking scripts appear in the outputs of transactions.
  • the unlocking script (aka scriptSig) is a piece of code written the domain specific language that provides the information required to satisfy the locking script criteria. For example, it may contain Bob's signature. Unlocking scripts appear in the input 202 of transactions.
  • UTXO 0 in the output 203 of Tx 0 comprises a locking script [Checksig P A which requires a signature Sig P A of Alice in order for UTXO 0 to be redeemed (strictly, in order for a subsequent transaction attempting to redeem UTXO 0 to be valid).
  • [Checksig P A ] contains a representation (i.e. a hash) of the public key P A from a public- private key pair of Alice.
  • the input 202 of Tx 1 comprises a pointer pointing back to Tx 1 (e.g. by means of its transaction ID, TxID 0 , which in embodiments is the hash of the whole transaction Tx 0 ).
  • the input 202 of Tx 1 comprises an index identifying UTXO 0 within Tx 0 , to identify it amongst any other possible outputs of Tx 0 .
  • the input 202 of Tx 1 further comprises an unlocking script ⁇ Sig P A > which comprises a cryptographic signature of Alice, created by Alice applying her private key from the key pair to a predefined portion of data (sometimes called the "message" in cryptography).
  • the data (or "message") that needs to be signed by Alice to provide a valid signature may be defined by the locking script, or by the node protocol, or by a combination of these.
  • the node applies the node protocol. This comprises running the locking script and unlocking script together to check whether the unlocking script meets the condition defined in the locking script (where this condition may comprise one or more criteria). In embodiments this involves concatenating the two scripts:
  • the scripts may be run one after the other, with a common stack, rather than concatenating the scripts. Either way, when run together, the scripts use the public key P A of Alice, as included in the locking script in the output of Tx 0 , to authenticate that the unlocking script in the input of Txi contains the signature of Alice signing the expected portion of data.
  • the expected portion of data itself also needs to be included in order to perform this authentication.
  • the signed data comprises the whole of Tx 1 (so a separate element does not need to be included specifying the signed portion of data in the clear, as it is already inherently present).
  • Tx 1 If the unlocking script in Tx 1 meets the one or more conditions specified in the locking script of Tx 0 (so in the example shown, if Alice's signature is provided in Tx 1 and authenticated), then the blockchain node 104 deems Tx 1 valid. This means that the blockchain node 104 will add Tx 1 to the ordered pool of pending transactions 154. The blockchain node 104 will also forward the transaction Tx 1 to one or more other blockchain nodes 104 in the network 106, so that it will be propagated throughout the network 106. Once Tx 1 has been validated and included in the blockchain 150, this defines UTXO 0 from Tx 0 as spent. Note that Tx 1 can only be valid if it spends an unspent transaction output 203.
  • Tx 1 will be invalid even if all the other conditions are met.
  • the blockchain node 104 also needs to check whether the referenced UTXO in the preceding transaction Tx 0 is already spent (i.e. whether it has already formed a valid input to another valid transaction). This is one reason why it is important for the blockchain 150 to impose a defined order on the transactions 152.
  • a given blockchain node 104 may maintain a separate database marking which UTXOs 203 in which transactions 152 have been spent, but ultimately what defines whether a UTXO has been spent is whether it has already formed a valid input to another valid transaction in the blockchain 150.
  • UTXO-based transaction models a given UTXO needs to be spent as a whole. It cannot "leave behind" a fraction of the amount defined in the UTXO as spent while another fraction is spent. However the amount from the UTXO can be split between multiple outputs of the next transaction. E.g. the amount defined in UTXO 0 in Tx 0 can be split between multiple UTXOs in Tx 1 . Hence if Alice does not want to give Bob all of the amount defined in UTXO 0 , she can use the remainder to give herself change in a second output of Tx 1 , or pay another party.
  • the transaction fee does not require its own separate output 203 (i.e. does not need a separate UTXO). Instead any difference between the total amount pointed to by the input(s) 202 and the total amount of specified in the output(s) 203 of a given transaction 152 is automatically given to the blockchain node 104 publishing the transaction.
  • a pointer to UTXO 0 is the only input to Tx 1 , and Tx 1 has only one output UTXO 1 . If the amount of the digital asset specified in UTXO 0 is greater than the amount specified in UTXO 1 , then the difference may be assigned by the node 104 that wins the proof-of-work race to create the block containing UTXO 1 . Alternatively or additionally however, it is not necessarily excluded that a transaction fee could be specified explicitly in its own one of the UTXOs 203 of the transaction 152.
  • Alice and Bob's digital assets consist of the UTXOs locked to them in any transactions 152 anywhere in the blockchain 150.
  • the assets of a given party 103 are scattered throughout the UTXOs of various transactions 152 throughout the blockchain 150.
  • script code is often represented schematically (i.e. not using the exact language).
  • operation codes opcodes
  • "OP_" refers to a particular opcode of the Script language.
  • OP_RETURN is an opcode of the Script language that when preceded by OP_FALSE at the beginning of a locking script creates an unspendable output of a transaction that can store data within the transaction, and thereby record the data immutably in the blockchain 150.
  • the data could comprise a document which it is desired to store in the blockchain.
  • an input of a transaction contains a digital signature corresponding to a public key P A .
  • this is based on the ECDSA using the elliptic curve secp256kl.
  • a digital signature signs a particular piece of data.
  • the signature will sign part of the transaction input, and some or all of the transaction outputs. The particular parts of the outputs it signs depends on the SIGHASH flag.
  • the SIGHASH flag is usually a 4-byte code included at the end of a signature to select which outputs are signed (and thus fixed at the time of signing).
  • the locking script is sometimes called "scriptPubKey” referring to the fact that it typically comprises the public key of the party to whom the respective transaction is locked.
  • the unlocking script is sometimes called “scriptSig” referring to the fact that it typically supplies the corresponding signature.
  • the scripting language could be used to define any one or more conditions. Hence the more general terms “locking script” and “unlocking script” may be preferred.
  • the client application on each of Alice and Bob's computer equipment 102a, 120b, respectively, may comprise additional communication functionality.
  • This additional functionality enables Alice 103a to establish a separate side channel 107 with Bob 103b (at the instigation of either party or a third party).
  • the side channel 107 enables exchange of data separately from the blockchain network.
  • Such communication is sometimes referred to as "off-chain" communication.
  • this may be used to exchange a transaction 152 between Alice and Bob without the transaction (yet) being registered onto the blockchain network 106 or making its way onto the chain 150, until one of the parties chooses to broadcast it to the network 106.
  • Sharing a transaction in this way is sometimes referred to as sharing a "transaction template".
  • a transaction template may lack one or more inputs and/or outputs that are required in order to form a complete transaction.
  • the side channel 107 may be used to exchange any other transaction related data, such as keys, negotiated amounts or terms, data content, etc.
  • the side channel 107 may be established via the same packet-switched network 101 as the blockchain network 106.
  • the side channel 301 may be established via a different network such as a mobile cellular network, or a local area network such as a local wireless network, or even a direct wired or wireless link between Alice and Bob's devices 102a, 102b.
  • the side channel 107 as referred to anywhere herein may comprise any one or more links via one or more networking technologies or communication media for exchanging data "off-chain", i.e. separately from the blockchain network 106. Where more than one link is used, then the bundle or collection of off-chain links as a whole may be referred to as the side channel 107. Note therefore that if it is said that Alice and Bob exchange certain pieces of information or data, or such like, over the side channel 107, then this does not necessarily imply all these pieces of data have to be send over exactly the same link or even the same type of network.
  • CLIENT SOFTWARE Figure 3A illustrates an example implementation of the client application 105 for implementing embodiments of the presently disclosed scheme.
  • the client application 105 comprises a transaction engine 401 and a user interface (U I ) layer 402.
  • the transaction engine 401 is configured to implement the underlying transaction-related functionality of the client 105, such as to formulate transactions 152, receive and/or send transactions and/or other data over the side channel 301, and/or send transactions to one or more nodes 104 to be propagated through the blockchain network 106, in accordance with the schemes discussed above and as discussed in further detail shortly.
  • the Ul layer 402 is configured to render a user interface via a user input/output (I/O) means of the respective user's computer equipment 102, including outputting information to the respective user 103 via a user output means of the equipment 102, and receiving inputs back from the respective user 103 via a user input means of the equipment 102.
  • the user output means could comprise one or more display screens (touch or non- touch screen) for providing a visual output, one or more speakers for providing an audio output, and/or one or more haptic output devices for providing a tactile output, etc.
  • the user input means could comprise for example the input array of one or more touch screens (the same or different as that/those used for the output means); one or more cursor-based devices such as mouse, trackpad or trackball; one or more microphones and speech or voice recognition algorithms for receiving a speech or vocal input; one or more gesture-based input devices for receiving the input in the form of manual or bodily gestures; or one or more mechanical buttons, switches or joysticks, etc.
  • the various functionality herein may be described as being integrated into the same client application 105, this is not necessarily limiting and instead they could be implemented in a suite of two or more distinct applications, e.g. one being a plug-in to the other or interfacing via an API (application programming interface).
  • the functionality of the transaction engine 401 may be implemented in a separate application than the Ul layer 402, or the functionality of a given module such as the transaction engine 401 could be split between more than one application.
  • some or all of the described functionality could be implemented at, say, the operating system layer.
  • Figure 3B gives a mock-up of an example of the user interface ( U I ) 500 which may be rendered by the Ul layer 402 of the client application 105a on Alice's equipment 102a. It will be appreciated that a similar Ul may be rendered by the client 105b on Bob's equipment 102b, or that of any other party.
  • FIG. 3B shows the Ul 500 from Alice's perspective.
  • the Ul 500 may comprise one or more Ul elements 501, 502, 502 rendered as distinct Ul elements via the user output means.
  • the Ul elements may comprise one or more user-selectable elements 501 which may be, such as different on-screen buttons, or different options in a menu, or such like.
  • the user input means is arranged to enable the user 103 (in this case Alice 103a) to select or otherwise operate one of the options, such as by clicking or touching the Ul element on-screen, or speaking a name of the desired option (N.B. the term "manual" as used herein is meant only to contrast against automatic, and does not necessarily limit to the use of the hand or hands).
  • the Ul elements may comprise one or more data entry fields 502, through which the user can enter data.
  • These data entry fields are rendered via the user output means, e.g. on-screen, and the data can be entered into the fields through the user input means, e.g. a keyboard or touchscreen.
  • the data could be received orally for example based on speech recognition.
  • the Ul elements may comprise one or more information elements 503 output to output information to the user. E.g. this/these could be rendered on screen or audibly.
  • Figure 4 illustrates an example of the node software 450 that is run on each blockchain node 104 of the network 106, in the example of a UTXO- or output-based model. Note that another entity may run node software 450 without being classed as a node 104 on the network 106, i.e. without performing the actions required of a node 104.
  • the node software 450 may contain, but is not limited to, a protocol engine 451, a script engine 452, a stack 453, an application-level decision engine 454, and a set of one or more blockchain-related functional modules 455.
  • Each node 104 may run node software that contains, but is not limited to, all three of: a consensus module 455C (for example, proof-of-work), a propagation module 455P and a storage module 455S (for example, a database).
  • the protocol engine 401 is typically configured to recognize the different fields of a transaction 152 and process them in accordance with the node protocol.
  • a transaction 152j Tx j
  • the protocol engine 451 identifies the unlocking script in Tx j and passes it to the script engine 452.
  • the protocol engine 451 also identifies and retrieves Tx i based on the pointer in the input of Tx j .
  • Tx i may be published on the blockchain 150, in which case the protocol engine may retrieve Tx i from a copy of a block 151 of the blockchain 150 stored at the node 104.
  • Tx i may yet to have been published on the blockchain 150.
  • the protocol engine 451 may retrieve Tx i from the ordered set 154 of unpublished transactions maintained by the nodel04. Either way, the script engine 451 identifies the locking script in the referenced output of Tx i and passes this to the script engine 452.
  • the script engine 452 thus has the locking script of Tx i and the unlocking script from the corresponding input of Tx j .
  • transactions labelled Tx 0 and Tx 1 are illustrated in Figure 2, but the same could apply for any pair of transactions.
  • the script engine 452 runs the two scripts together as discussed previously, which will include placing data onto and retrieving data from the stack 453 in accordance with the stack-based scripting language being used (e.g. Script).
  • the script engine 452 determines whether or not the unlocking script meets the one or more criteria defined in the locking script - i.e. does it "unlock” the output in which the locking script is included? The script engine 452 returns a result of this determination to the protocol engine 451. If the script engine 452 determines that the unlocking script does meet the one or more criteria specified in the corresponding locking script, then it returns the result "true”. Otherwise it returns the result "false”.
  • the result "true” from the script engine 452 is one of the conditions for validity of the transaction.
  • protocol-level conditions evaluated by the protocol engine 451 that must be met as well; such as that the total amount of digital asset specified in the output(s) of TXj does not exceed the total amount pointed to by its inputs, and that the pointed-to output of Tx i has not already been spent by another valid transaction.
  • the protocol engine 451 evaluates the result from the script engine 452 together with the one or more protocol-level conditions, and only if they are all true does it validate the transaction Tx j .
  • the protocol engine 451 outputs an indication of whether the transaction is valid to the application-level decision engine 454.
  • the decision engine 454 may select to control both of the consensus module 455C and the propagation module 455P to perform their respective blockchain-related function in respect of Tx j .
  • This comprises the consensus module 455C adding Tx j to the node's respective ordered set of transactions 154 for incorporating in a block 151, and the propagation module 455P forwarding Tx j to another blockchain node 104 in the network 106.
  • the application-level decision engine 454 may apply one or more additional conditions before triggering either or both of these functions.
  • the decision engine may only select to publish the transaction on condition that the transaction is both valid and leaves enough of a transaction fee.
  • true and “false” herein do not necessarily limit to returning a result represented in the form of only a single binary digit (bit), though that is certainly one possible implementation. More generally, “true” can refer to any state indicative of a successful or affirmative outcome, and “false” can refer to any state indicative of an unsuccessful or non-affirmative outcome. For instance in an account-based model, a result of "true” could be indicated by a combination of an implicit, protocol-level validation of a signature and an additional affirmative output of a smart contract (the overall result being deemed to signal true if both individual outcomes are true).
  • H be a set of hash functions.
  • H be a set of hash functions from A to B.
  • H is universal if for all x, y in A.
  • ⁇ 5 H (x,y) counts the number of hash functions in the set that would induce a collision on x st y, while
  • a hash function H is cryptographically secure if it is
  • FIG. 5A illustrates an example system 500a for generating a common blockchain address based on multiple public keys. Since each public key is associated with a party (e.g. a user) having an identity, the common blockchain address may also be referred to as an "identity- linked address".
  • the system comprises an address generator (Alice 103a) and one or more secondary parties, each having a respective public key.
  • the system 500a may comprise any number of secondary parties.
  • the system 500a comprises three secondary parties: Bob 103b having public key PKB, Charlie 103c having public key PKc, and Debbie having public key PKD.
  • the address generator and secondary parties may take any form and need not necessarily be users.
  • “Alice 103a” is merely used as convenient labels for the address generator, and the address generator need not necessarily be configured to perform all of the actions described as being associated with Alice 103a with reference to Figures 1 to 4, though that is not excluded.
  • the address generator, Alice 103a obtains a plurality of public keys, one from each secondary party.
  • Alice 103a may obtain PKB, PKC, and PKD.
  • Alice 103a is configured to generate the common blockchain address by hashing any one of the public keys with a universal hash function (UHF).
  • UHF universal hash function
  • the blockchain address is common in the sense that the same blockchain address is generated regardless of which public key is hashed with the UHF.
  • the public key that is hashed will be referred to as the target public key.
  • Hashing the target public key involves at least four mathematical operations.
  • the first operation involves computing a first intermediate result by multiplying the target public key by a first parameter.
  • the first operation may consist of said multiplication.
  • the first operation may involve one or more additional sub-operations (e.g. addition, subtractions, etc.).
  • the second operation involves computing a second intermediate result by adding a second parameter to the first intermediate result.
  • the second operation may consist of said addition.
  • the third operation involves computing a third intermediate result based on performing a first modulo operation on the second intermediate result using a third parameter. In other words, the third intermediate result is based on the remainder after dividing the second intermediate result by the third parameter.
  • the third operation may consist of said first modulo operation.
  • the fourth operation involves computing the common blockchain address based on performing a second modulo operation on the third intermediate result using a fourth parameter. In other words, the fourth intermediate result is based on the remainder after dividing the third intermediate result by the fourth parameter.
  • the fourth operation may consist of said second modulo operation.
  • the values of the parameters are set or derived such that each public key hashes to the same blockchain address.
  • the first parameter is a function of at least the public keys and the fourth parameter.
  • the first parameter may also be a function of the third parameter and/or one or more further parameters.
  • Alice 103a determines a set of values of the parameters for the hash function which results in each public key hashing to the same result: the common blockchain address.
  • the common blockchain address may be used to lock a transaction output. That is, the common blockchain address may be included in a locking script and require a public key to be provided, in an unlocking script of a spending transaction, that hashes to the common blockchain address. This is described further below.
  • Alice 103a may generate multiple common blockchain addresses for the same set of public keys.
  • the first parameter is a function of the public keys and the fourth parameter. Since the public keys remain the same, the fourth parameter may be varied to give different blockchain addresses. Additionally or alternatively, the values of the second and/or third parameters may also be varied.
  • the first parameter may be a function of the two public keys, the fourth parameter and the third parameter.
  • the first parameter may be a function of the two public keys, the fourth parameter and a fifth parameter.
  • the fifth parameter is a whole integer and is chosen such that the hashes of the three public keys collide. This fifth parameter is used off-chain by Alice 103a to find values that link the public keys for Bob 103b, Charlie 103c, and Debbie 103d under a single UHF which comprises the first, second, third and fourth parameters. In other words, the fifth parameter is used to derive the values of the first to fourth parameters that link the three public keys.
  • the common blockchain address may be used to lock a transaction output.
  • Figure 5B illustrates an example system 500b for locking an output of a transaction using the common blockchain address.
  • the system 500b includes Alice 103a (the address generator) and Bob 103b.
  • the system 500b may include other secondary parties, e.g. Charlie 103c and Debbie 103d.
  • the system 500b also comprises one or more nodes 104 of a blockchain network 106.
  • Alice 103a is configured to generate a first blockchain transaction Txl and to submit the first blockchain transaction Txl to the blockchain network 106.
  • the first blockchain transaction comprises one or more inputs and one or more outputs.
  • At least one of the outputs comprises a locking script (a "first locking script") comprising a hash function (HF) script.
  • first here is used merely as a label and does not necessarily imply any form of ordering.
  • the HF script is a portion of script configured to, when executed alongside an unlocking script of a second transaction Tx2, generate (i.e. compute, calculate, etc.) a hash (a "hash result") of an input (a "target input”) included in the unlocking script.
  • the target input may be any type of data item, e.g. a number, a string, etc. In embodiments, the target input is a public key.
  • the first locking script may consist of the HF script, or it may comprise the HF script and one or more data items and/or additional portions of script. For example, the HF script may form part of a larger script.
  • the second transaction Tx2 is shown as being transmitted to the blockchain network 106 by Bob 103b. It is also not excluded that the second transaction Tx2 may be submitted to the blockchain network 106 by Alice 103a, or Charlie 103c, or Debbie 103d.
  • the HF script is configured to perform at least four mathematical operations. Each operation may be performed by a single function (e.g. opcode) of the blockchain scripting language (e.g. Bitcoin Script). Alternatively, some or all of the operations may be performed by more than one function.
  • the first operation involves computing a first intermediate result by multiplying the target data item by a first parameter. The first operation may consist of said multiplication. Alternatively, the first operation may involve one or more additional sub- operations (e.g. addition, subtractions, etc.).
  • the second operation involves computing a second intermediate result by adding a second parameter to the first intermediate result. The second operation may consist of said addition.
  • the third operation involves computing a third intermediate result based on performing a first modulo operation on the second intermediate result using a third parameter.
  • the third intermediate result is based on the remainder after dividing the second intermediate result by the third parameter.
  • the third operation may consist of said first modulo operation.
  • the fourth operation involves computing the hash result based on performing a second modulo operation on the third intermediate result using a fourth parameter.
  • the fourth intermediate result is based on the remainder after dividing the third intermediate result by the fourth parameter.
  • the fourth operation may consist of said second modulo operation.
  • the hash function implemented by the HF script may be referred to as a "universal hash function" because it satisfies the definition of a universal hash (Definition 4).
  • the HF script may take the following form:
  • a is the first parameter
  • b is the second parameter
  • p is the third parameter
  • n is the fourth parameter.
  • the skilled person will be familiar with the opcodes.
  • the HF script may be configured to output one, some or all of the first intermediate result, second intermediate result, third intermediate result, and fourth intermediate result.
  • the result(s) may be output to memory.
  • the memory may be a memory stack in the case that the scripting language is a stack-based scripting language. In some examples, only the hash result is output, e.g. to memory.
  • the first parameter a may be any non-zero number, and is chosen as described above. That is, the first parameter is chosen such that each public key hashes to the same common blockchain address.
  • the second parameter b may be any number, and may be chosen randomly.
  • the third parameter p may be any positive number, e.g. a prime number, such as a prime number associated with a particular elliptic curve. For example, p may be the prime number that defines the Secp256kl elliptic curve which is used by some blockchains. Further details of some example values of the parameters are provided further below.
  • the first locking script includes the common blockchain address.
  • the correct parameters of the universal hash function which link the public keys to one common address are computed off-line by some party (e.g. address generated Alice 103a). For instance, the common blockchain address result may be calculated on Alice's computing equipment 102a.
  • the first locking script is configured to require the hash result generated by the HF script (i.e. during script execution) to match the common blockchain address. That is, a condition of the unlocking script of the second transaction Tx2 unlocking the first locking script of the first blockchain transaction is that the unlocking script comprises a public key, and that the public key hashes to the common blockchain address. This may be implemented using a hash puzzle. Implementing a hash puzzle, per se, will be familiar to the skilled person. That is, the locking script first generates a "candidate address" by hashing the public key with the UHF, and then verifies that the candidate address is equal to the common blockchain address. The verification may be performed using a hash puzzle.
  • the first locking script may also require the unlocking script of Tx2 to comprise a signature generating using a private key corresponding to the public key.
  • the first locking script may require the unlocking script to comprise Bob's public key PKB (which hashes to the common blockchain address), and Bob's signature generated using Bob's private key skB.
  • PKB public key
  • Bob's signature generated using Bob's private key skB.
  • ECDSA digital signature
  • This form of locking script is often referred to as a pay-to-public-key-hash (P2PKH) script.
  • P2PKH pay-to-public-key-hash
  • the first blockchain transaction does not necessarily need to involve a payment to Bob 103b, and can in general be used for any purpose, such as sending messages to Bob 103b, storing data on the blockchain 150, etc.
  • the first locking script may take the following form:
  • OPJDUP [UHF a,b,p,n ] ⁇ UHF a,b,p,n (PK B )> OPJEQUALVERIFY OP_CHECKSIG
  • [UHF a,b,p,n ] is shorthand for the HF script
  • ⁇ UHF a,b,p,n PK B )> is the common blockchain address generated by applying the universal hash function (UHF) to Bob's public key PK B .
  • the first locking script therefore requires the unlocking script to take the following form:
  • P2PKH scripts have taken the following form:
  • HASH160 takes a given public key PK and outputs its hash value. The hash value is then compared with the expected hash value given in the script, ⁇ HASH160 ( PK) >.
  • HASH160 is a composite function (i.e. algorithm), which can be described as:
  • Step 2 3. adding prefix to the output of Step 2 to indicate network type (mainnet, testnet, regtest);
  • Step 7 is reversible. That is, given the output of Step 7, one can apply base58- decoding to work out the output of step 6. However, it is not computationally feasible to reverse all the way to obtain the input public key due to the one-way-ness of the cryptographic functions used.
  • HASH160 in the locking script is to ensure that only the expected public key will be used in the unlocking script. As it is shown above, HASH160 requires four hashes (one SHA256, one RIPEMD160 and one double SHA256). The universal hash function implemented by the HF script achieves the same result with less computation. The HF script is also much more efficient than HASH160 in a P2PKH because it only involves one multiplication, one addition and two modular operations.
  • the locking script may be configured to require the unlocking script to include more than one of the multiple public keys. For instance, the locking script may force the unlocking script to include all of the multiple public keys.
  • the locking script is configured to hash each of the public keys provided in the unlocking script with the UHF, and require each hash of the public key to match the common blockchain address. That is, each public key is separately hashed, and the resulting hash compared with the common blockchain address.
  • the locking script may define the number of public keys that are to be provided in the unlocking script.
  • the locking script may be configured to require the unlocking script to comprises a separate signature for each public key.
  • Alice 103a may generate different common blockchain addresses for the same set of public keys, and lock different transaction outputs using the different common blockchain addresses.
  • the different outputs may be part of the same transaction or different transactions.
  • the second parameter b may be chosen randomly from
  • a public key may be represented in a compressed form as ( x i , +) or (x i , — ). Note that knowing Secp256kl, one can work out what the y-coordinate can be and use the sign to identify the unique y value. We assume that x i G [0, p — 1], and we use — x i as the input to the universal hash function for ( x i , — ).
  • the last inequality is the range needed for counting the number of solutions of x' .
  • the sign of x indicates which value the y-coordinate takes.
  • the first step is to convert modular arithmetic to integer arithmetic. There exists an integer k A such that
  • the result can be generalised by leaving the upper bound of the probability in the form where p and n are the moduli in the universal hash function and
  • Figure 6 illustrates an example system 600 for generating public keys in-script.
  • the first locking script of the first transaction Tx1 may comprise a public key derivation (PKD) script
  • the PKD script may comprise the HF script.
  • the PKD script is configured to, when executed, generate a child public key PK chad based on a parent public key PK parent included in the unlocking script of the second transaction Tx2. That is, the unlocking script of the second transaction may include a parent public key PK parent , e.g. a public key owned by Alice 103a or Bob 103b, and the PKD script is configured to compute a child public key PK child of the parent public key PK parent .
  • PK parent e.g. a public key owned by Alice 103a or Bob 103b
  • the target data item comprises a chain code c parent of a parent public key, the parent public key PK parent , and an index of the child public key.
  • the first locking script may be configured to output the child public key PK child , e.g. to memory, such as a stack.
  • Figure 7 illustrates an example of a hierarchical deterministic (HD) set of keys, also known as a HD wallet.
  • the master key is generated based on a seed.
  • the child keys in each set of child keys are each generated based on the master key.
  • the grandchild keys in each respective set of grandchild keys are each generated based on a respective set of the child keys.
  • the master key is the parent key.
  • the labels "parent” and “child” may be used to refer to a public key in an n th level and public key an (n + l) t/l level, th wherein the public key in the (n + 1) level is generated based on the public key in the n th level.
  • the PKD script may be configured to generate a child public key using the following equation:
  • UHF a,b,p,n is implemented by the HF script
  • P pa rent I I index is the target data item
  • P par ent I I index is the hash result.
  • the PKD script is configured to perform point multiplication (•) of the hash result and the generator point G.
  • the PKD script is also configured to perform point addition (+) of the parent public key with the result of that multiplication.
  • the PKD script may take the following pseudo form: OP_DUP ⁇ 0x20 > OP_SPLIT OP_SWAP OP_ROT [UHF a,b,p,2 512] ⁇ 0x20 > OP_LEFT [Hex to binary] [Point scalar multiplication] [Point addition] where the input is the parent chain code, index and the parent public key, and the result will be the child public key, as described above.
  • the HF script fragment may be simply implemented as
  • the PKD script may be used as an alternative child keys of a HD wallet.
  • Bitcoin improvement proposal (BIP) 32 HD wallets has been widely used in the blockchain ecosystem. It offers a mechanism to derive a large number of ECDSA key pairs from a single secret seed.
  • the key derivation algorithm uses HMAC-SHA512 to generate two strings of 256 bits from a parent chain code, a parent public key and an index, HMAC-SHA512 L c parent , P parent
  • the left 256-bit string is used in child key pair derivation, while the right 256-bit string is used as the chain code for further key pair derivations.
  • HMAC-SHA512 is chosen for BIP32 other than that it offers the required bit-length of the outputs.
  • a benefit of deriving keys explicitly on chain is that a party can prove the link between two public keys that they own, and therefore there is an immutable record of that proof. This is especially useful in the context of public key infrastructure (PKI), where a single public key
  • a party can prove that a public key used to sign a transaction is linked to a certified public key. By virtue of this proof of a link being on chain, related public keys can be certified by extension.
  • Another benefit of calculating a child public key on chain is that this child public key can be used to sign transactions but never explicitly be stored on chain. As a result, if an adversary is searching for transactions containing a given child public key, they would not find the transactions that use this method, thus increasing privacy.
  • the HF script fragment [UHF a,b,p,2 512] is then executed. After execution of this function, the state of the stack is the following:
  • the resulting number is then changed from hexadecimal to binary. Note that if the hash result is already in binary, this conversion is not necessary.
  • a function i.e. the binary conversion script
  • n 1.
  • the left hand columns represent the stack and the right hand columns represent the altstack.
  • the flow of the stack is from left to right and then top to bottom.
  • the function converts the hexadecimal ⁇ 0x07 > to its binary representation ⁇ 0x00010101 > where each byte represents one bit.
  • the Ox prefix denotes that the bytes following it are a hexadecimal number, and so ⁇ 0x00010101 > isn't actually equivalent to 0x07 in binary, but the way that the next opcodes read this representation will treat it as such. If it is read exactly as it is written, ⁇ 0x00010101 > is equivalent to the decimal 65793.
  • the state of the stack after execution of the function [Hex to binary] is the following:
  • the function [Hex to binary] results in a string where each byte now represents one bit. For this particular example PKD script, the string must be split into an array using the following opcodes:
  • the following illustrates an example of how to perform the point scalar multiplication in Script.
  • the [Point scalar multiplication] function (i.e. the PSM script).
  • This function adds the point 2 l ⁇ G to the current state of q • G when the corresponding bit of q is equal to 1.
  • This function uses [Point addition] (i.e. the point addition script), which is described below.
  • the [Point scalar multiplication] function begins by pushing ⁇ 0x00 > ⁇ 0x00 > to the stack, the purpose of which is to act as an initial point, which in this case is the identity element. Since the [Point addition] takes two points as input, without pushing ⁇ 0x00 > ⁇ 0x00 > to the stack initially, the first execution of this will only have one input and will result in an error.
  • ⁇ 0x00 > ⁇ 0x00 > acts as the identity element, since [Point addition] is defined in a way that if one point is ⁇ 0x00 > ⁇ 0x00 >, then the function simply outputs the other point. Note that the reason it is safe to choose this notation as the identity is because the point (0,0) is not a point on the secp256kl elliptic curve.
  • the state of the stack at this point is now the following: where the top two items are the x- and y- coordinates of the result of the calculation of q ⁇ G.
  • the [Point addition] function is the final function used in the child key derivation. It takes the result of [Point scalar multiplication] and the P parent key, which has been stored at the bottom of the stack since it was duplicated in the first few opcodes of the function [P child derivation], and returns P child to the stack.
  • n is 256, which is the binary length of p.
  • Figure 11 illustrates an example script for performing a point addition.
  • the example script performs a point addition of two different points.
  • the input is ⁇ y 2 > ⁇ x 2 > ⁇ y 1 > ⁇ x 1 >, where each coordinate is a 32-byte hexadecimal.
  • the code in Figure 12 calculates the function
  • Figure 12 illustrates another example script for performing a point addition.
  • the example script performs a point addition of the same point.
  • the input is ⁇ y x > ⁇ x 1 > ⁇ y 1 > ⁇ x 1 >, where each coordinate is a 32-byte hexadecimal.
  • the code in Figure 12 calculates the function [Same Point addition], returning ⁇ y 2 > ⁇ x 2 > to the stack.
  • the following illustrates the state of the stack at the end of every line in the code of Figure 12. The state of the stack begins with the input, and then each row of the example code is executed in turn.
  • Figure 13 illustrates another example script for performing a point addition.
  • the example script performs a check of whether the two points to be added are the same point or different points, and the acts accordingly. Note that the bold text in Figure 13 explain what that line of code is doing, and the numbers (i) correspond to the definition of point addition given above.
  • the input is assumed to be in the form ⁇ y 2 > ⁇ x 2 > ⁇ y > ⁇ x >, where each coordinate is a 32-byte hexadecimal.
  • the first line is a check for the second point being ⁇ 0x00 > ⁇ 0x00 >, which in the chosen notation is the point at infinity, since it is known that this point is not on the secp256kl curve. If the second point is the point at infinity, then the first point ⁇ y 1 > ⁇ x 1 > is returned to the stack, which corresponds to definition (4) of point addition. Note that in the example code, the point at infinity only ever appears as the second point.
  • Figure 14 illustrates an example script for converting the data on the stack into a compressed key format.
  • the example function takes the x and y coordinate of a key as inputs, and returns the compressed public key format.
  • the opcodes in Figure 14 defines the function [Compressed Key format]. The first 3 opcodes check if the y coordinate of the child key is even or odd. Then the next opcodes append the x - coordinate with the correct prefix depending on this result. This results in the compressed child key, giving the final state of the stack to be the following: Alternatively, if in fact the result is desired to be in uncompressed format, the following function may be used:
  • the HF script may be used to generate keys in key-value pairs, which can be used for a look-up table.
  • One efficient way to construct a look-up table is to use universal hash functions to create keys in key- value pairs.
  • the in-script universal hashing approach described above effectively puts a copy of the keys in the key-value pairs on chain. This allows a seamless integration to a local look- up table as they share the same keys (hash values). For applications with smaller volume of public keys, they can reduce the number of bytes of the universal hash outputs by trimming the hash values while keeping the full value on chain.
  • Alice 103a may store the common blockchain address, or a shortened version of the common blockchain address (e.g. the first four leading bytes), in a look-up table together with (i.e. mapped to a corresponding public key and/or a transaction identifier of the first transaction.
  • the (shortened) common blockchain address is the key of a key-value pair, where the value is the expected public key and/or transaction identifier.
  • the look-up table may comprise several key-value pairs of this type, for different hash results, public keys and transaction identifiers. Alice 103a may use the (shortened) common blockchain address as a look-up to find the corresponding public key and/or transaction identifier.
  • the UHF is dependent on four parameters, a, b, n and q.
  • the examples above describe how a single address can be generated from a public key by applying the UHF to the public key with a fixed set of parameters.
  • multiple addresses may be derived from the same public key. That is, the value of the parameters a, b, n and q may be changed in order to generate different addresses.
  • only a single parameter is changed.
  • more than the value of more than one parameter is changed. For instance, the values of all of the parameters may be changed.
  • An address may be generated for every possible value of the parameter a. Similarly, an address may be generated for every possible value of the parameter b. In some examples, an address may be generated for every possible combination of a and b. In these examples, the values of the parameters n and q may be fixed. Alternatively, the values of the parameters n and q may be varied.
  • the parameters may take any suitable value, including any value discussed above.
  • the different addresses may be used to lock different transaction outputs. For example, one or more outputs of the same transaction may be locked using a different one of the addresses derived from the same public key. Additionally or alternatively, one or more outputs of one or more different transaction may be locked using a different one of the addresses derived from the same public key.
  • the locking script that locks the outputs takes the same form as described above.
  • the locking script may take the following form:
  • the values of a, b, n and q are defined in the locking script and correspond to the values used to generate the corresponding address. That is, the values of the parameters that are used to generate an address are the same values that appear in the locking script that comprises that same address.
  • the corresponding unlocking script takes the following form:
  • the form of the unlocking script stays the same for each address. That is, although the address changes depending on the parameters used to derive the address, the locking script is still unlocked using the public key from which the address is derived, and a signature corresponding to the public key (i.e. generated using a private key corresponding to the public key).
  • Alice 103a may generate a plurality of addresses using Bob's same public key (or the public key of a different secondary party). Each address is generated by hashing the public key using the universal hash function, wherein the value of at least one parameter of the UHF is changed for each different address.
  • the first transaction that is generated by Alice 103a and submitted to the network 106 may include multiple outputs, each of which comprises an instance of a locking script which locks the output to one of the addresses. That is, the locking script includes the address and requires an unlocking script to include a public key which will be hashed by the HF script to give the address. Additionally or alternatively, Alice 103a may generate one or more additional transactions.
  • Each transaction includes at least one output locked to one of the addresses derived from Bob's public key.
  • the addresses may be generated by hashing the result of the universal hash function with a cryptographic hash function. That is, Alice 103a may derive a plurality of addresses using the universal hash function (again, changing the value of one or more parameters of the UHF to generate each different address), and then hash each of those addresses using the cryptographic hash function.
  • the addresses output by the UHF will now be referred to as "intermediate addresses", or "intermediate hash results”. So, Alice 103a generates a plurality of different intermediate addresses and hashes each intermediate address to generate a corresponding final address. In these examples it is the final address that is used as the blockchain address, i.e. the address that appears in the output of the blockchain transaction.
  • each locking script is configured to generate the intermediate address and then hash the intermediate address to generate the final common blockchain address.
  • the final address is compared with an expected final address that is included in the locking script.
  • the parameters of the UHF may be included in the unlocking script rather than the locking script. An example is given below.
  • the cryptographic hash function may be any suitable hash function.
  • the cryptographic hash function may be RIPEMD160, SHA256, SHA512, etc.
  • the cryptographic hash function may be a combination of more than one hash function.
  • the cryptographic hash function may be HASH160 which comprises hashing first with SHA256 and then with RIPEMD160.
  • Alice 103a may store the plurality of different addresses (intermediate and/or final) in a look-up table for ease of reference.
  • the addresses may be associated with an index or with the public key from which the addresses are derived.
  • Cryptographic hash functions are one-way functions that produce an unpredictable and fixed length output from an arbitrary sized input. They are used frequently in Bitcoin transaction scripts to hide the pre-image input. One of the most common examples of this is to mask the public key in a P2PKH transaction. As highlighted, P2PKH transactions are larger than P2PK transactions and are therefore more costly to transact overall. P2PKH typically involves the following locking script:
  • HASH160 is the algorithm used on chain to perform this and is composed of 8 steps:
  • HASH160 The output of HASH160 is unpredictable and deterministic, e.g. the same input will always produce the same output.
  • Public keys are typically not linked to an individual's identity and therefore masking is not necessary to maintain the privacy of an individual.
  • attackers it is possible for attackers to link commonalities between multiple transactions. For example, if an attacker Bob knew real world information about Alice it might be possible for Bob to link a public key to Alice. This would not compromise the security of Alice's funds in any way but could allow Bob to track Alice's transactions related to this public key and therefore reduce her privacy.
  • the HASH160 algorithm provides a mask for a public key in a P2PKH transaction script locked in the above manner, it is computationally infeasible for a party to derive the public key from the hashed value available on chain. However, as the algorithm is deterministic, the same public key will always produce the same hashed value. This would therefore allow an attacker to simply match the same on-chain P2PKH hashed values together if used more than once.
  • the receiving party must still provide their pre-image public key on- chain. Once accepted, the network can associate this public key with the P2PKH hash value and could connect any other on-chain P2PKH transaction associated with that public key. It is therefore strongly recommended that to increase privacy a party should always vary their public key for new transactions. This brings into question what functionality masking in this way provides, especially considering the additional cost incurred in utilising P2PKH over P2PK. If the public key should be altered for every transaction, it would be infeasible to link accounts to public keys, thus mitigating the need to mask them. Further, the security of ECDSA is currently considered computationally infeasible to break, so the additional layer of security provided by hashing seems unnecessary.
  • universal hashing refers to a form of hashing that typically takes the form:
  • Hash UHF (x) ((ax + h) mod p ) mod n
  • UHF Universal Hash Functions
  • This second condition defines that UHF evenly distribute outputs, so that the probability of two distinct inputs hashing to the same value is less than or equal to 1 over the output size n.
  • UHF utilises only one multiplication, one addition and two modular operations. It is therefore extremely efficient to perform this style of hashing many times to create an index of outputs. It is much more efficient than HASH160 which, as shown above, utilises more steps with each of these more complicated.
  • UHFs allow a degree of choice for the parameters used from the party computing them. This flexibility can be used to provide functionality currently not available in HASH160.
  • Public key hashing in P2PKH transactions ensures that the public keys are not disclosed to other users prior to that public key's owner spending funds. This creates an additional layer of security between the user's private key and the public network, providing a degree of increased privacy.
  • deriving a private key from the public key is currently considered computationally infeasible, this may be considered unnecessary.
  • HASH160 is deterministic, an attacker can easily connect the same hashed values of public keys together and link them to a public key once funds are unlocked by the user. As a result, users are recommended to alter their public key for each transaction to increase privacy.
  • masking using HASH160 in a P2PKH transaction vs a P2PK transaction seems limited to reducing the size of a locking script by 13 bytes but increasing the unlocking script by 33 bytes.
  • UHF's allow a level of control over parameters that generates much more functionality than the cryptographic hash functions currently used in script.
  • the present disclosure describes how this functionality may be used to produce multiple hashed addresses from a single public key, link multiple public keys to a common hashed address and be used in conjunction with a cryptographic hash to provide multiple secure addresses from a single address.
  • UHF's are extremely efficient due to the simple arithmetic they utilise.
  • Multi-signature concealment - The locking and unlocking scripts have the same format as that outlined for a single intended recipient. This would mean that only the funding party, and potentially the receiving parties would know that the transaction could be unlocked by multiple parties.
  • More than two public keys may be linked to the same UHF address.
  • P B , P c and P D belonging respectively to Bob 103b, Charlie 103c and Debbie 103d
  • a UHF may be derived from j, q and a that ensures keys P B , P c and P D collide to the same address, for a solution where j, n and a are whole numbers.
  • a benefit of this system is that the size of the locking and unlocking scripts is constant, whereas, the size of multi-signature transactions increases as the number of parties increases.
  • the pre-image resistance provided by HASH160 would make it computationally infeasible to derive A i from the publicly visible address hash , which in turn makes it infeasible to compute potential public keys, P i , that solve for .
  • this hybrid hashing would provide all the functionality described above.
  • Parties may create a hash index table that efficiently outputs multiple addresses from a single public key, by varying UHF parameters. These distinct address values, when passed through HASH160, would also have very distinct values . However, now it would be infeasible to compute the pre-image value A t from , and therefore infeasible to compute the public key(s) that solve for this address.
  • the hash index table may take the following form:
  • the locking and unlocking script may take the following forms:
  • Alice 103a wants to verify that some publicly available information she has is correct. Rather than manually gathering the information herself, she wants to outsource this. She broadcasts the task, and two parties, Bob 103b and Charlie 103c are interested. Alice 103a states that if they can verify the publicly available information by matching the hashed output she has for her version, they will receive funds. We shall call the publicly available information that Alice 103a would like to verify: Records AUce .
  • a B [aP B + b mod p] mod n
  • a c [aP c + b mod p] mod n
  • the locking and unlocking scripts would look as follows:
  • bitcoin network 106 For instance, some embodiments above have been described in terms of a bitcoin network 106, bitcoin blockchain 150 and bitcoin nodes 104.
  • the bitcoin blockchain is one particular example of a blockchain 150 and the above description may apply generally to any blockchain. That is, the present invention is in by no way limited to the bitcoin blockchain. More generally, any reference above to bitcoin network 106, bitcoin blockchain 150 and bitcoin nodes 104 may be replaced with reference to a blockchain network 106, blockchain 150 and blockchain node 104 respectively.
  • the blockchain, blockchain network and/or blockchain nodes may share some or all of the described properties of the bitcoin blockchain 150, bitcoin network 106 and bitcoin nodes 104 as described above.
  • the blockchain network 106 is the bitcoin network and bitcoin nodes 104 perform at least all of the described functions of creating, publishing, propagating and storing blocks 151 of the blockchain 150. It is not excluded that there may be other network entities (or network elements) that only perform one or some but not all of these functions. That is, a network entity may perform the function of propagating and/or storing blocks without creating and publishing blocks (recall that these entities are not considered nodes of the preferred Bitcoin network 106).
  • the blockchain network 106 may not be the bitcoin network.
  • a node may perform at least one or some but not all of the functions of creating, publishing, propagating and storing blocks 151 of the blockchain 150.
  • a "node" may be used to refer to a network entity that is configured to create and publish blocks 151 but not store and/or propagate those blocks 151 to other nodes.
  • any reference to the term “bitcoin node” 104 above may be replaced with the term “network entity” or “network element”, wherein such an entity/element is configured to perform some or all of the roles of creating, publishing, propagating and storing blocks.
  • the functions of such a network entity/element may be implemented in hardware in the same way described above with reference to a blockchain node 104.
  • a computer-implemented method of linking multiple public keys to generate a common blockchain address wherein each party is associated with a respective public key
  • the method comprises: generating the common blockchain address, wherein the common blockchain address is generated by hashing any one of the respective public keys with a universal hash function, wherein hashing the respective public key with the universal hash function comprises: generating a first intermediate result based on a multiplication of the respective public key by a first parameter, generating a second intermediate result based on an addition of a second parameter to the first intermediate result, generating a third intermediate result based on a modulo of the second intermediate result by a third parameter; and generating the common blockchain address based on a modulo of the third intermediate result by a fourth parameter, wherein a respective value of at the first parameter is derived based on each of the multiple public keys and the fourth parameter.
  • Statement 2 The method of statement 1, comprising, generating a plurality of respective common blockchain addresses, wherein each respective common blockchain address is generated based on a different respective value of the fourth parameter.
  • Statement 3 The method of statement 1 or statement 2, wherein the multiple public keys consists of two public keys, and wherein the respective value of the first parameter is derived based on each of the multiple public keys, the fourth parameter, and the third parameter.
  • Statement 4 The method of statement 1 or statement 2, wherein the multiple public keys consists of three public keys, and wherein the respective value of the first parameter is derived based on each of the multiple public keys, the fourth parameter, and a fifth parameter, where the fifth parameter is an integer.
  • Statement 8 The method of any preceding statement, comprising: generating a first blockchain transaction; and submitting the first blockchain transaction to one or more nodes of a blockchain network, wherein the first blockchain transaction comprises a respective locking script, wherein the respective locking script comprises the respective common blockchain address and is configured to, when executed together with a respective unlocking script of a second blockchain transaction comprising a respective target public key, generate a respective target hash of the respective target public key and require the respective target hash to match the respective common blockchain address, wherein the respective locking script comprises a HF script configured to generate the respective target hash by performing at least the steps of: generating a target first intermediate result based on a multiplication of the target public key by the first parameter, generating a target second intermediate result based on an addition of the second parameter to the target first intermediate result, generating a target third intermediate result based on a modulo of the target second intermediate result by the third parameter; and generating the target hash based on a modulo of the target third intermediate result by the fourth parameter.
  • Statement 10 The method of statement 8 or statement 9, wherein the respective unlocking script comprises a different target public key, and wherein the respective locking script is further configured to generate a respective target hash of the different target public key and require the respective target hash to match the respective common blockchain address, wherein the respective locking script comprises a HF script configured to generate the respective target hash by performing at least the steps of: generating a target first intermediate result based on a multiplication of the target public key by the first parameter, generating a target second intermediate result based on an addition of the second parameter to the target first intermediate result, generating a target third intermediate result based on a modulo of the target second intermediate result by the third parameter; and generating the target hash based on a modulo of the target third intermediate result by the fourth parameter, and wherein the respective locking script is further configured to require the respective unlocking script to comprise a respective signature generated using the different target public key.
  • the respective locking script comprises a HF script configured to generate the respective target hash by performing at least the steps of: generating
  • Statement 11 The method of statement 2 and any one of statements 8 to 10, wherein the first blockchain transaction comprises a plurality of respective outputs, each respective output comprising a respective locking script comprising a respective common blockchain address and being configured to, when executed together with a respective unlocking script of a different respective blockchain transaction comprising a respective target public key, generate a respective target hash the respective target public key, wherein the respective locking script comprises a respective HF script configured to generate the target respective hash result by performing at least the steps of: generating a respective target first intermediate result based on a multiplication of the target data item by a respective first parameter, generating a respective target second intermediate result based on an addition of the second parameter to the respective target first intermediate result, generating a respective target third intermediate result based on a modulo of the respective target second intermediate result by the third parameter; and generating the respective target hash based on a modulo of the respective target third intermediate result by the respective fourth parameter.
  • the respective locking script comprises a respective HF script configured to generate the target respective hash
  • Statement 12 any one of statements 8 to 11, comprising: generating one or more further blockchain transactions, wherein each further transaction comprises one or more respective outputs, each respective output comprising a respective locking script comprising a respective common blockchain address and being configured to, when executed together with a respective unlocking script of a different respective blockchain transaction comprising a respective target public key, generate a respective target hash of the respective target public key, wherein the respective locking script comprises a respective HF script configured to generate the respective target hash by performing at least the steps of: generating a respective target first intermediate result based on a multiplication of the target data item by a respective first parameter, generating a respective target second intermediate result based on an addition of the second parameter to the respective target first intermediate result, generating a respective target third intermediate result based on a modulo of the respective target second intermediate result by the third parameter; and generating the respective target hash based on a modulo of the respective target third intermediate result by the respective fourth parameter.
  • each further transaction comprises one or more respective outputs, each respective output comprising
  • Statement 13 The method of any preceding statement, wherein generating the respective common blockchain address further comprises: generating a respective intermediate hash result by hashing the respective public key with the universal hash function; and hashing the respective intermediate hash result with a cryptographic hash function.
  • Statement 14 The method of statement 13 when dependent on any of statements 8 to 12, wherein the modulo of the respective target third intermediate result by the respective fourth parameter generated by the respective HF script is a respective target intermediate hash result, and wherein the respective HF script is configured to generate the respective target hash by hashing the respective target intermediate hash result with the cryptographic hash function.
  • Statement 15 The method of statement 13 or statement 14, wherein the cryptographic hash function is one of: RIPEMD160, SHA256, or a combination of RIPEMD160 and SHA256.
  • Statement 17 The method of statement 16, wherein p is a prime number defining the sec9256kl elliptic curve.
  • Statement 18 The method of statement 16 or statement 17, wherein L is one of: 32, 64, 128, 160, 256, or 512.
  • Computer equipment comprising: memory comprising one or more memory units; and processing apparatus comprising one or more processing units, wherein the memory stores code arranged to run on the processing apparatus, the code being configured so as when on the processing apparatus to perform the method of any preceding statement.
  • Statement 20 A computer program embodied on computer-readable storage and configured so as, when run on one or more processors, to perform the method of any of statements 1 to 18.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Power Engineering (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Storage Device Security (AREA)

Abstract

L'invention concerne un procédé mis en œuvre par ordinateur de liaison de multiples clés publiques destiné à générer une adresse de chaîne de blocs commune, chaque partie étant associée à une clé publique respective, et le procédé comprenant les étapes suivantes : génération de l'adresse de chaîne de blocs commune par hachage de l'une quelconque des clés publiques respectives avec une fonction de hachage universelle, ledit hachage comprenant les étapes suivantes : génération d'un premier résultat intermédiaire sur la base d'une multiplication de la clé publique respective par un premier paramètre, génération d'un second résultat intermédiaire sur la base d'un ajout d'un second paramètre au premier résultat intermédiaire, génération d'un troisième résultat intermédiaire sur la base d'un modulo du second résultat intermédiaire par un troisième paramètre ; et génération de l'adresse de chaîne de blocs commune sur la base d'un modulo du troisième résultat intermédiaire par un quatrième paramètre, une valeur respective du premier paramètre étant dérivée sur la base de chaque clé publique des multiples clés publiques et du quatrième paramètre.
PCT/EP2023/050825 2022-02-15 2023-01-16 Adresses de chaîne de blocs liées à l'identité WO2023156099A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
GB2201953.3 2022-02-15
GB2201953.3A GB2615595A (en) 2022-02-15 2022-02-15 Identity-linked blockchain addresses

Publications (1)

Publication Number Publication Date
WO2023156099A1 true WO2023156099A1 (fr) 2023-08-24

Family

ID=80821010

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2023/050825 WO2023156099A1 (fr) 2022-02-15 2023-01-16 Adresses de chaîne de blocs liées à l'identité

Country Status (2)

Country Link
GB (1) GB2615595A (fr)
WO (1) WO2023156099A1 (fr)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021176283A1 (fr) * 2020-03-04 2021-09-10 nChain Holdings Limited Procédé de génération d'une clé publique
WO2021176284A1 (fr) * 2020-03-04 2021-09-10 nChain Holdings Limited Procédé de génération d'un code d'authentification de message basé sur un hachage

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021176283A1 (fr) * 2020-03-04 2021-09-10 nChain Holdings Limited Procédé de génération d'une clé publique
WO2021176284A1 (fr) * 2020-03-04 2021-09-10 nChain Holdings Limited Procédé de génération d'un code d'authentification de message basé sur un hachage

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
ANONYMOUS: "Universal hashing", 1 September 2009 (2009-09-01), XP055962960, Retrieved from the Internet <URL:http://dbis.informatik.uni-freiburg.de/content/courses/SS09/Kursvorlesung/Theory%20I/Slides/06-Hashing_Chaining.pdf> [retrieved on 20220920] *

Also Published As

Publication number Publication date
GB2615595A (en) 2023-08-16
GB202201953D0 (en) 2022-03-30

Similar Documents

Publication Publication Date Title
US20230291585A1 (en) Method of generating a public key
US20230134619A1 (en) Method of generating a hash-based message authentication code
WO2022238065A1 (fr) Schéma d&#39;adresse de chaîne de blocs multi-parties
US20240214179A1 (en) Blockchain-implemented hash function
WO2023156099A1 (fr) Adresses de chaîne de blocs liées à l&#39;identité
EP4320804A1 (fr) Fonction de hachage mise en oeuvre par chaîne de blocs
GB2615596A (en) Blockchain-implemented hash function
GB2605776A (en) Blockchain-implemented hash function
WO2023041270A1 (fr) Génération de transactions à chaînes de blocs
WO2022238066A1 (fr) Schéma d&#39;adresse de chaîne de blocs multi-partie
WO2022238067A1 (fr) Schéma d&#39;adresse de chaîne de blocs multi-partie
KR20240034793A (ko) 블록체인 트랜잭션들에 대한 조건들의 시행
WO2023036548A1 (fr) Validation de signature
KR20240037243A (ko) 블록체인 트랜잭션들에 대한 조건들의 시행
WO2023174629A1 (fr) Chiffrement de chiffre de hill amélioré basé sur une chaîne de blocs
WO2023174633A1 (fr) Procédés et systèmes mis en œuvre par ordinateur pour une sécurité, un chiffrement et une communication améliorés de données
WO2024041862A1 (fr) Transaction de chaîne de blocs
WO2023144039A1 (fr) Arithmétique de courbe elliptique dans un script
WO2023117274A1 (fr) Échange atomique à base de signature
WO2024041866A1 (fr) Transaction de chaîne de blocs
WO2023144068A1 (fr) Arithmétique de courbe elliptique dans un script
GB2606194A (en) Methods and devices for pruning stored merkle tree data
GB2606196A (en) Subtree-based storage and retrieval of merkle tree data
EP4371271A1 (fr) Blocs de chaîne de blocs et preuve d&#39;existence

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23700535

Country of ref document: EP

Kind code of ref document: A1