Abrégé

A computer-implemented method of requesting a read receipt for a message using a blockchain, the read receipt evidencing that the message has been opened, the method being performed by a first party and comprising: sending the message, and/or an encrypted version thereof, to a second party; generating a cryptographic puzzle based on the message; generating a request blockchain transaction, wherein the request blockchain transaction comprises a first output locked by a first locking script, wherein the first locking script is configured to, when executed together with a first unlocking script of a response blockchain transaction, require the first unlocking script to comprise a solution to the cryptographic puzzle; and determining that the message has been opened in response to determining that the first output has been unlocked.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

A computer-implemented method for generating a zero-knowledge proof for proving knowledge of a pre-image value. A series of pre-image blocks is obtained which, when combined, form the pre-image value. A series of nodes are executed, wherein each node of the series is configured to: receive a respective current state and a respective current iteration counter; evaluate an instance of a predefined compression function, based on the respective current state, to compute a respective next state; increment the respective current iteration counter to generate a respective next iteration counter; determine, based on a respective next pre-image block of the series of pre-image blocks, that the predefined compression function instance has been evaluated correctly; and output a proof, wherein the proof attests to the predefined compression function instance being evaluated correctly. The proof generated by a final node of the series of nodes proves knowledge of the pre-image value.

Classes IPC  ?

• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 9/30 - Clé publique, c. à d. l'algorithme de chiffrement étant impossible à inverser par ordinateur et les clés de chiffrement des utilisateurs n'exigeant pas le secret

Abrégé

A computer-implemented method of transferring a token using a blockchain, comprising: generating a transaction comprising an input that references an output of a issuance transaction or an output of a transaction that forms part of a chain of one or more transactions linking to the issuance transaction, an output locked to a public key of the receiving party and an output locked to a public key of the sending party; sending the transaction to a receiving party; receiving a funded transaction from the receiving party; verifying that the output locked to the public key of the sending party locks a predetermined amount of digital asset, and if so, generating a signed transaction by including a signature in the input of the funded transaction, wherein the signature corresponds to the first public key of the sending party; and sending the signed transaction to a blockchain network.

Classes IPC  ?

• G06Q 20/06 - Circuits privés de paiement, p.ex. impliquant de la monnaie électronique utilisée uniquement entre les participants à un programme commun de paiement
• G06Q 20/22 - Schémas ou modèles de paiement
• G06Q 20/38 - Architectures, schémas ou protocoles de paiement - leurs détails
• G06Q 20/40 - Autorisation, p.ex. identification du payeur ou du bénéficiaire, vérification des références du client ou du magasin; Examen et approbation des payeurs, p.ex. contrôle des lignes de crédit ou des listes négatives
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

A computer-implemented method for enforcing constraints on a blockchain transaction, wherein the method is performed by a first party and comprises: generating an enforcement locking script for inclusion in a first output of a first blockchain transaction, wherein the enforcement locking script comprises a commitment sub-script, and a constraint sub-script comprising a verification key, and wherein when executed together with an unlocking script of a second blockchain transaction, the unlocking script comprising a transaction commitment and a constraint proof, the enforcement locking script is configured such that: the commitment sub-script is configured to verify that the transaction commitment corresponds to the second blockchain transaction; and the constraint subscript is configured to use the verification key to verify that the constraint proof provides proof that a committed blockchain transaction satisfies one or more constraints.

Classes IPC  ?

• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

A computer-implemented method for generating a zero-knowledge proof for proving each data block of a plurality of data blocks corresponding to a Merkle tree satisfies a predefined criterion. Leaf nodes are mapped to leaf hash values of the Merkle tree and inner nodes are mapped to inner hash values of the Merkle tree. The leaf nodes are executed, with each leaf node: receiving a respective data block and a corresponding data block proof for proving the data block satisfies the predefined criterion; verifying the respective data block proof; computing and outputting a data block hash. The inner nodes are executed, with each inner node: receiving, from each of two previous nodes, a respective hash value; computing and outputting an output hash value. The output hash value computed by a final inner node in a final layer of the Merkle tree is a Merkle root corresponding to the Merkle tree.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système

Abrégé

A computer-implemented method of performing a token protocol using a blockchain, comprising: obtaining a token melt transaction comprising a first input signed by a first party, wherein the first input references a respective output of a first token transfer transaction, wherein the respective output is locked to a first public key of the first party and comprises a first token amount, and a first output locked to a melting public key of the delegated entity and comprising the first token amount; creating a token mint transaction comprising a respective input signed by the delegated entity using a signature corresponding to a minting public key, and a respective output locking a respective amount of the digital asset sufficient to fund one or more respective token transfer transactions, wherein the respective output is locked to a second public key of the first party and comprises the first token amount.

Classes IPC  ?

• G06F 21/64 - Protection de l’intégrité des données, p.ex. par sommes de contrôle, certificats ou signatures
• G06Q 20/06 - Circuits privés de paiement, p.ex. impliquant de la monnaie électronique utilisée uniquement entre les participants à un programme commun de paiement
• G06Q 20/36 - Architectures, schémas ou protocoles de paiement caractérisés par l'emploi de dispositifs spécifiques utilisant des portefeuilles électroniques ou coffres-forts électroniques
• G06Q 20/38 - Architectures, schémas ou protocoles de paiement - leurs détails
• G07G 1/00 - Caisses enregistreuses
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

A method for enabling a second party to determine a shared cryptographic key, comprising: generating a puzzle blockchain transaction comprising one or more outputs, each output comprising a puzzle locking script, wherein each puzzle locking script comprises a target public key and is configured to, when executed together with a unlocking script comprising a candidate value, convert the candidate value into a candidate public key and require the candidate public key to match the target public key; and sending the puzzle blockchain transaction to one or more nodes of a blockchain network and/or the second party, wherein the first party is configured to generate the shared cryptographic key based on the first private key, the second public key, and each target public key, and wherein the second party is configured to generate the shared cryptographic key based on the second private key, the first public key, and each candidate value.

Classes IPC  ?

• H04L 9/08 - Répartition de clés
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

A computer-implemented method of validating a token transaction as part of a token protocol using a blockchain, comprising: obtaining a candidate token transaction; obtaining, for each respective input of the candidate token transaction that references a respective token transaction, a respective list of transactions tracing back to a respective token mint transaction linking the candidate token transfer transaction to the respective token mint transaction; and validating the candidate token transfer transaction by: verifying that each respective input of the candidate token transaction references a respective token mint transaction or can be traced back, using the respective list of transactions, to a respective token mint transaction; and verifying that a sum of the respective token amounts comprised by the respective outputs of the candidate transaction is equal to a sum of the respective token amounts comprised by the one or more respective outputs referenced by the candidate transaction.

Classes IPC  ?

• G06F 21/64 - Protection de l’intégrité des données, p.ex. par sommes de contrôle, certificats ou signatures
• G06Q 20/06 - Circuits privés de paiement, p.ex. impliquant de la monnaie électronique utilisée uniquement entre les participants à un programme commun de paiement
• G06Q 20/36 - Architectures, schémas ou protocoles de paiement caractérisés par l'emploi de dispositifs spécifiques utilisant des portefeuilles électroniques ou coffres-forts électroniques
• G06Q 20/38 - Architectures, schémas ou protocoles de paiement - leurs détails
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

A computer-implemented method for representing a state machine using a blockchain, comprising: generating a plurality of transactions representing all possible states of the state machine, by: generating an initial transaction representing an initial state and comprising a respective first output; for each respective state to which the initial state can transition, generating a respective transaction representing the respective state and comprising a respective input referencing the respective first output of the initial transaction, and a respective spendable output; repeating a process of generating respective transactions representing respective states until each possible state through which the state machine can transition has been represented by a respective transaction; and sending the plurality of transactions available to a second party, wherein the second party operates a device configured to implement the state machine.

Classes IPC  ?

• G06Q 20/06 - Circuits privés de paiement, p.ex. impliquant de la monnaie électronique utilisée uniquement entre les participants à un programme commun de paiement
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• G06Q 20/38 - Architectures, schémas ou protocoles de paiement - leurs détails

Abrégé

A computer-implemented method for representing a state machine using a blockchain, wherein the state machine comprises a plurality of respective states, wherein each respective state can transition to one or more respective states, and wherein the method is performed by a first party operating a device configured to implement the state machine, wherein the blockchain comprises a respective previous transaction representing a respective previous state, wherein the respective previous transaction comprises a respective first output, and wherein the method comprises: in response to a respective transition from the respective previous state to a respective next state, obtaining a respective next transaction representing the respective next state, wherein the respective next transaction comprises a respective input that references the respective first output of the respective previous transaction, and a respective first output; and sending the respective next transaction to one or more blockchain nodes for publishing on the blockchain.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

The invention resides in a computer-implemented communication method. The method comprises a mechanism for distributing blockchain and/or cryptocurrency-related communications such as alerts, notifications and updates across an electronic network to one or more recipients as efficiently and swiftly as possible. Embodiments may use IPv6 multicast to perform such improved communications. A communication can comprise a code, flag or filter which enables the communication to be targeted at particular recipient(s) and allow multicast group members that have no interest or authorised access to the contents of the communication to ignore it. Thus, improvements are provided in respect of processing resources and time. In some examples, the disclosure can be advantageous for the implementation of a blockchain-related alert key or system which can aid in network responses to emergencies or threats, thus improving the security of the blockchain network.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 45/16 - Routage multipoint

Abrégé

A computer implemented data distribution method is disclosed. The method comprises sending a portion of data from a sending resource on a network to one or more groups of receiving resources, each of the one or more groups being associated with a respective multicast address. Preferably, the portion of data comprises blockchain-related data. Also disclosed is 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. Also disclosed is a computer program embodied on computer-readable storage and configured so as, when run on one or more processors, to perform the method.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 45/16 - Routage multipoint

Abrégé

Methods and techniques are provided that employ multicast transmission and anycast transmission to coordinate and distribute tasks and/or processing requests amongst groups of resources on a network. In one embodiment, the groups of resources can include nodes or other resources of a blockchain network that implement all or part of a particular blockchain protocol (e.g., Bitcoin SV protocol), and/or service providers that provide services to a blockchain-related organisation, group or network.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 45/16 - Routage multipoint

Abrégé

The invention resides in computer-implemented method of operating a sending and/or receive resource. The resource is configured for generating, storing, processing, accessing and/or maintaining a record of a packet of data e.g. comprising at least a portion of blockchain data e.g. a blockchain transaction, block, block header etc. From the record an allocated address is determined. The resource sends, at least in part, the record across an electronic network to the allocated address. The allocated address can be a multicast address associated with a group of receiving resources. Determination can include processing the record e.g. parsing and/or hashing the record. Processing can include parsing and/or hashing the record to determine a key, and selecting at least one address from a set of addresses using the key. The resource can receive a record and/or plurality of records, and at least one of: relaying the record and/or block to the allocated address; and consolidating records and/or blocks for relay to corresponding allocated address.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 45/16 - Routage multipoint

Abrégé

The invention resides in a computer-implemented method. The method comprises the transmission of packets of data using nodes and/or routers, which optimise the dissemination and/or balancing of resources through management and/or allocation. In particular, the invention relates to the controlled transmission and/or access to those packets of data. The method can include operating a sending resource, and the packet of data preferably includes blockchain related data. The sending resource can be the originator of the packets of data e.g. the creator or the producer, or the sending resource can be an operator, such as distributor who collates, aggregates or pools packets of data for subsequent transmission e.g. independently of the original transmission. The multicast group and/or the packets of data can be secured, and a recipient e.g.an end-user can obtain an access-key for accessing the multicast group and/or the packet of data. In some embodiments, the access-key can be provided during an exchange over a blockchain, for example by using a payment channel.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 45/16 - Routage multipoint

Abrégé

A computer-implemented method for proving knowledge of a challenge value is provided. A private key is calculated based on the challenge value and a locking signature provided in a first locking script of a challenge blockchain transaction. The private key is associated with the locking signature. The challenge value comprises an ephemeral key corresponding to the locking signature and the private key. A proof signature is generated using the private key. The proof signature is provided in a first unlocking script of a proof blockchain transaction, which is made available to one or more nodes of a blockchain network.

Classes IPC  ?

• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

A computer-implemented method for generating a blockchain transaction is provided. A first locking script of the blockchain transaction is provided. The first locking script comprising a locking signature portion based on a locking signature. The first locking script is configured, when executed with a first unlocking script of a proof transaction, to verify that a public key provided in the first unlocking script is associated with the locking signature. The blockchain transaction is made available to one or more nodes of a blockchain network.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/40 - Protocoles réseaux de sécurité

Abrégé

A computer-implemented method for enabling identification of blockchain transactions, wherein the method is performed by a first party and comprises: obtaining a first set of transactions belonging to a first blockchain block, wherein one or more transactions of the first set of transactions comprise a respective data type; for one or more of the respective data types, generating a respective first dataset, wherein the respective first dataset comprises, for each respective transaction of the first set comprising the respective data type, i) a respective transaction identifier of the respective transaction, and ii) a respective instance of the respective data type; for each respective first dataset, generating a respective filter representing the respective first dataset; and making one or more of the respective filters available to a second party.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• G06F 21/62 - Protection de l’accès à des données via une plate-forme, p.ex. par clés ou règles de contrôle de l’accès

Abrégé

Embodiments provide a blockchain-implemented database overlay and indexing mechanism. In one embodiment, records in the database are associated via the overlay to respective unspent outputs in transaction(s) on the blockchain. Each output comprises a locking script that specifies which keys can be used to spend the output to a further transaction. When a user wishes to access a given record in the database, the further (spending) transaction is generated and sent to the blockchain network. The further transaction comprises an unlocking script that provides the required key(s) to meet the conditions of the locking script, otherwise the blockchain's consensus mechanism will not allow spending of the output and access to the record will be denied. If, however, the requirements are met then the output is spent and the access request is deemed authorized. In this way, the consensus mechanism provides an improved permission control and user authorization solution for a database. When the output is spent by the further transaction, the overlay is updated to associate the record with the spending transaction. A transaction log may also be provided to enable swift and efficient regeneration of the database should it be required.

Classes IPC  ?

• G06F 21/60 - Protection de données
• G06F 16/22 - Indexation; Structures de données à cet effet; Structures de stockage
• G06F 21/62 - Protection de l’accès à des données via une plate-forme, p.ex. par clés ou règles de contrôle de l’accès
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

A computer-implemented method of attesting to knowledge of a first output being included in a first blockchain transaction, wherein the method is performed by a first party and comprises: generating a first attestation signature based on a first message, wherein the first message comprises a first outpoint of the first blockchain transaction and the first output of the first blockchain transaction, wherein the first output is locked to a first public key associated with the first party, and wherein the first attestation signature is generated using a first private key corresponding to the first public key; and causing the first attestation signature to be included in a second output of the first blockchain transaction.

Classes IPC  ?

• G06F 21/62 - Protection de l’accès à des données via une plate-forme, p.ex. par clés ou règles de contrôle de l’accès
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• G06F 16/27 - Réplication, distribution ou synchronisation de données entre bases de données ou dans un système de bases de données distribuées; Architectures de systèmes de bases de données distribuées à cet effet

Abrégé

A computer-implemented method of encrypting data by performing the following steps: a) encrypting the first data item with a first respective encryption key to generate a first encrypted value, b) combining a second data item with the first encrypted value to generate a first combined value, c) encrypting the first combined value with a second respective encryption key to generate a second encrypted value, and d) repeating a process of i) combining a respective next data item with a respective latest encrypted value to generate a respective next combined value, and ii) encrypting the respective next combined value with a respective next encryption key to generate a respective next encrypted value, until a combination of the final data item and a respective latest encrypted value has been encrypted with a respective next encryption key to generate a final encrypted value, the encrypted payload comprising the final encrypted value.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 9/14 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité utilisant plusieurs clés ou algorithmes
• H04L 9/08 - Répartition de clés

Abrégé

A method of proving to a verifier that at least one data section is in an input to a function, which outputs an output value when receiving the input, without revealing at least one further data section of the input. A first transaction is created and transmitted to a blockchain network to commit the first transaction to a blockchain. A second transaction is created and transmitted to the network to commit the second transaction to the blockchain. The second transaction comprises: input data comprising the at least one data section and a second transaction message; further input data comprising the at least one further data section and a first transaction message; and output data comprising the output value and at least one midstate of the function. Confirmation data is received and a proof is sent to the verifier to prove that the least one data section is in the input.

Classes IPC  ?

• G06F 21/62 - Protection de l’accès à des données via une plate-forme, p.ex. par clés ou règles de contrôle de l’accès
• G06F 21/64 - Protection de l’intégrité des données, p.ex. par sommes de contrôle, certificats ou signatures
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

Method of proving to a verifier that at least one data section is input to a function, which outputs an output value when receiving the input, without revealing at least one further data section of the input. A first transaction is created and transmitted to a blockchain network to commit it to a blockchain. The first transaction comprises the output value and at least one midstate of the function. A second transaction is created and transmitted to the network to commit the second transaction to the blockchain. The second transaction comprises: input data comprising the first transaction and a second transaction message; further input data comprising the at least one further data section, the first transaction and a first transaction message; and output data comprising the data section(s). Confirmation data is received and a proof is generated to prove that the data section(s) are in the input.

Classes IPC  ?

• G06F 21/62 - Protection de l’accès à des données via une plate-forme, p.ex. par clés ou règles de contrôle de l’accès
• G06F 21/64 - Protection de l’intégrité des données, p.ex. par sommes de contrôle, certificats ou signatures
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

mrmππrmπrr) is not known by, or made available to, the designated verifier.

Classes IPC  ?

• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

xπii dxππii ππxx).

Classes IPC  ?

• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système

Abrégé

Systems and computer-implemented methods for freezing or unfreezing digital assets on a blockchain. A freeze administration service may send a signed freeze request to mining nodes, which maintain two blacklists of digital asset identifiers: a pending blacklist and a consensus blacklist. The digital asset identifiers may be transaction outpoints in some cases. If accepted by the mining node, the transaction outpoints in the freeze request are added to the pending blacklist, which causes rejection of any transactions using those outpoints, but does not cause rejection of any new blocks that include transactions using those outpoints. If a consensus threshold of acceptances is reached based on hash power, the request becomes an order and the outpoints are added to the consensus blacklist, which causes rejection of any transaction or block containing a transaction using those outpoints.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système

Abrégé

Systems and computer-implemented methods for generating, propagating and handling alert messages on a blockchain network. The alert messages may be generated and sent by an alert administration service to instruct mining nodes to take certain actions, including freezing a transaction outpoint, banning a peer node, invalidating a block, or implementing a confiscation transaction to move assets from a transaction outpoint to another address. An alert handler within the node software at the mining nodes manages the parsing and processing of alerts. Alerts may be sent in P2P message that includes a serialized alert transaction that itself includes the alert message in an output field. A processed alert message results in the alert transaction being included in the mempool and, eventually, the blockchain.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système

Abrégé

A computer-implemented method of using a blockchain to incentivise data transfer between nodes of a P2P network, comprising: obtaining a plurality of request transactions, each request transaction comprising a first output locked to the public key of a P2P node and locks an amount of a digital asset, each request transaction comprising a hash of a data request, the data request associated with a data item, and wherein each request transaction is associated with a timestamp; computing a regression model based on at least the amount and the timestamp of each request transaction; using the regression model to determine a target amount; generating a target request transaction comprising an output locked to the public key of a P2P node and locking the target amount, wherein the target request transaction comprises a target hash of a target data request, the target data request being associated with the target data item.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 67/104 - Réseaux de pairs [P2P]
• G06Q 20/22 - Schémas ou modèles de paiement
• H04L 45/00 - Routage ou recherche de routes de paquets dans les réseaux de commutation de données

Abrégé

A computer implemented method of using a blockchain to coordinate data transfer on a P2P network, comprising: obtaining a second hash value generated by hashing at least a data request with a first hash function then hashing with a second hash function, wherein the data request is associated with the target data item; generating a primary request transaction comprising the first hash value, at least one input referencing a UTXO, and one or more outputs, each output being locked to a respective public key associated with a respective intermediate P2P node connected to the requesting P2P node; sending a primary request message to at least one respective intermediate P2P nodes, the primary request message comprising a first signature over the primary request transaction for unlocking the UTXO, a reference to the UTXO, and the second hash value; obtaining the target data item from the target P2P node.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 67/104 - Réseaux de pairs [P2P]
• H04L 45/00 - Routage ou recherche de routes de paquets dans les réseaux de commutation de données
• G06Q 20/22 - Schémas ou modèles de paiement

Abrégé

A computer implemented method comprising: determining, by a first party, a secret value, wherein the secret value can be determined by a second party; generating, by the first party, a Merkle tree based on the secret value and two or more parts of a first public key of the second party; and generating, by the first party, at least one public key of the second party based on the first public key of the second party and a respective one or more values derived from the Merkle tree.

Classes IPC  ?

• H04L 9/08 - Répartition de clés
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 9/40 - Protocoles réseaux de sécurité

Abrégé

A computer-implemented method of journaling messages sent to and/or from a first party, wherein the method comprises: determining a first message to be journaled, wherein the first message is sent to or from the first party; generating a first journaled message, wherein the first journaled message comprises a copy of the first message; storing the first journaled message and/or an encrypted version of the first journaled message at a storage location; causing a first blockchain transaction to be sent to a blockchain network to be recorded on a blockchain, wherein the first blockchain transaction comprises a first hash generated by hashing at least the first journaled message.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

A computer-implemented method of optimizing a size of a blockchain transaction by minimising a number of inputs and/or outputs of the transaction, wherein the method comprises: executing a fee decision algorithm, said executing comprises: determining a leftover amount, and if the leftover amount if less than a total of the associated input fee and the associated output fee, causing the transaction to be sent to a blockchain network without the additional output, if the leftover amount is greater than the associated output fee, causing the transaction to be sent to the blockchain network with the additional output; and if the leftover amount is greater than the total of the associated input fee and the associated output fee and less than the associated output fee and a predetermined minimum value, causing the transaction to be sent to the blockchain network with the additional output and an additional input.

Classes IPC  ?

• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

A computer-implemented method for generating a blockchain transaction is provided. A first locking script of a challenge blockchain transaction comprising a target statement and a verification script for verifying a challenge solution π provided in a first unlocking script of a proof blockchain transaction is generated. The challenge solution π is a non-interactive zero-knowledge proof proving knowledge of a secret witness w. The first locking script, when executed with the first unlocking script, is configured to: compute, based on the challenge solution π and one of the target statement and a candidate statement provided in the first unlocking script, a candidate commitment value A*; compute, using the candidate commitment value A* and one of the target and candidate statements, a candidate hash value; verify, based on the candidate hash value, the challenge solution π; and verify that the challenge solution π is provided in the proof blockchain transaction.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système

Abrégé

A computer-implemented method of transmitting blockchain transactions to nodes of a blockchain network, wherein a compact transaction is a blockchain transaction comprising i) a CS at least partly written in a high-level (HL) scripting language, wherein the CS is configured to perform an operation equivalent to an expanded script (ES) written in the LL scripting language, and wherein the method comprises: obtaining a set of compact transactions; transmitting one or more of the set of compact transactions to at least one other CS-enabled node; converting one or more of the set of compact transactions to one or more respective expanded transactions, wherein said converting comprises, for a given compact transaction, replacing the CS of that compact transaction with an equivalent ES; and transmitting the one or more expanded transactions to at least one CS-disabled node.

Classes IPC  ?

• G06F 21/12 - Protection des logiciels exécutables
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 9/40 - Protocoles réseaux de sécurité
• G06Q 20/06 - Circuits privés de paiement, p.ex. impliquant de la monnaie électronique utilisée uniquement entre les participants à un programme commun de paiement
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système

Abrégé

A computer-implemented method of optimizing a size of a blockchain transaction by minimising a number of inputs and/or outputs of the transaction, wherein the method comprises: determining a respective number of each respective UTXO having a respective value to be used as a respective input to the transaction and a respective number of each output of the transaction having a respective value, by minimising, for each different respective value of the respective UTXOs and for each different respective value of each output, a sum of a) a number of each respective UTXO having a respective value multiplied by the associated input fee, and b) a sum of bi) a number of each respective output having a respective value multiplied by the associated output fee, and bii) a leftover fee, wherein said minimising is subject to constraints.

Classes IPC  ?

• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

A computer-implemented method of determining an optimal set of input values for use as funding a set of respective blockchain transactions, wherein the method comprises: for a plurality of different respective sets of input values, determining the respective set of input values that minimises a function when evaluated based on the set of respective blockchain transactions, wherein the function is based on i) the total amount of fees of the respective transaction, ii) a maximum of the respective associated data fees, iii) is a total value of all input values used for respective inputs to the set of transactions, iv) a total number of spendable outputs across the set of transactions, v) an initial number of instances of each input value available to the optimizer, and vi) a total number of transactions in the set of transactions.

Classes IPC  ?

• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

A computer-implemented method of transmitting compact transactions, wherein a compact transaction is a blockchain transaction comprising a compact script at least partly written in an intermediate-level scripting language, comprising: generating a first compact transaction comprising a first CS, wherein the first CS comprises a first library identifier of a first high- level reference library, the first HL reference library comprising a first set of HL functions written in a HL scripting language, each HL function being configured to perform an operation equivalent to an operation performed by a respective set of one or more LL functions, a respective function identifier of one or more of the first set of HL functions, and at least one IL function configured to call the one or more HL functions during script execution; and transmitting the first compact transaction to at least one CS-enabled node, wherein each CS-enabled node is configured to validate compact transactions.

Classes IPC  ?

• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• G06F 9/455 - Dispositions pour exécuter des programmes spécifiques Émulation; Interprétation; Simulation de logiciel, p.ex. virtualisation ou émulation des moteurs d’exécution d’applications ou de systèmes d’exploitation
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

111222) to determine the proximity of the first actor in relation to the zone (Z). The domain can be a network, and can be used to define an environment or domain, such as a warehouse.

Classes IPC  ?

• H04L 67/52 - Services réseau spécialement adaptés à l'emplacement du terminal utilisateur
• G06F 16/176 - Support d’accès partagé aux fichiers; Support de partage de fichiers
• G06F 16/178 - Techniques de synchronisation des fichiers dans les systèmes de fichiers
• G06Q 10/08 - Logistique, p.ex. entreposage, chargement ou distribution; Gestion d’inventaires ou de stocks

Abrégé

A computer-implemented method for enabling non-native blockchain signatures to be verified in-script, wherein the method is performed by a first party and comprises: obtaining a second blockchain transaction, wherein the second blockchain transaction references a first blockchain transaction; generating a first signature based on at least the second blockchain transaction, wherein a first private key used to generate the first signature is set equal to one; generating a second signature based on the first signature, wherein the first signature is a native blockchain signature and the second signature is a non-native blockchain signature; including the first signature and the second signature in an unlocking script of the second blockchain transaction for verification when the unlocking script is executed together with a locking script of the first blockchain transaction; and causing the second blockchain transaction to be submitted to a blockchain network.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système

Abrégé

A method of providing proof that a statement is true keeping a secret input to the statement a secret, comprising: generating a proof using a public input, the secret input, and a proving key linked to an augmented verification circuit which comprises (i) a verification circuit arranged to receive the inputs, supply the secret input to a function circuit representing the statement to generate a function circuit output, and determine whether the public input corresponds to the function circuit output; and (ii) a multiplicative gate arranged to receive the secret input and a dummy value. The proof comprises a commitment to inputs of multiplicative gates of the augmented verification circuit, the commitment generated using a first vector comprising n components from a finite group of data elements. The secret input is a discrete logarithm of a public element of said finite group. The proof is transmitted to a verifying device.

Classes IPC  ?

• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système

Abrégé

A method of proving that a secret committed in a commitment is a discrete logarithm of a public element of a finite group of data elements, comprising: obtaining a first vector used to generate the commitment, the first vector comprising n components, wherein one of the n components of the first vector is at a position which corresponds to the secret; generating a second vector comprising n components, wherein a component of the second vector, at a predetermined position corresponding to the position in the first vector, is set to zero; generating a further commitment to the second vector; transmitting the further commitment to a verifying device; receiving a random challenge from the verifying device; generating a response using the first vector, the second vector and the random challenge; and transmitting the response to the verifying device to prove that the secret is the discrete logarithm of the public element.

Classes IPC  ?

• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système

Abrégé

A computer-implemented method, the method performed by a controller configured to communicate with a blockchain and with a network comprising one or more devices, the method comprising: maintaining identification information comprising an index number assigned to each of the one or more devices; receiving one or more input-output pairs of a blockchain transaction, wherein each input-output pair is associated with an assigned index number and wherein each input-output pair comprises data from a device of the one or more devices; generating a blockchain transaction based on the one or more input-output pairs; sending the blockchain transaction to the blockchain.

Classes IPC  ?

• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

A computer-implemented method for performing a multi-party computation (MPC) protocol, comprising: obtaining a circuit representation of a computable function to be evaluated based on one or more first inputs to generate one or more outputs, wherein each first input is to be either specified or randomly generated; converting the circuit representation of the function to a multi-party representation; making the multi-party representation available to each party; executing each SSG by distributing the respective share of the respective secret to each respective party; obtaining a respective share of each output from at least a threshold number of parties, the threshold number corresponding to a circuit threshold associated with the multi-party circuit; and generating each output of the function, wherein each output is generated based on at least the threshold number of the respective output shares of that output.

Classes IPC  ?

• H04L 9/08 - Répartition de clés

Abrégé

A computer-implemented method of shuffling an ordered set of data items, comprising: generating an ordered set of shuffle keys, each shuffle key being an elliptic curve point, and said generating comprising, for each data item: either deriving the shuffle key based on a respective private key, or generating the shuffle key and deriving the respective private key based on the shuffle key, deriving, based on the respective private key, a public key, and mapping the public key to the respective data item; encrypting each shuffle key with a first scalar to obtain a respective first encrypted shuffle key; placing each first encrypted shuffle keys in an ordered set, wherein the order of the first encrypted shuffle keys is shuffled compared with the order of the shuffle keys in the ordered set of shuffle keys; and sharing the ordered set of first encrypted shuffle keys with at least a second party.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 9/30 - Clé publique, c. à d. l'algorithme de chiffrement étant impossible à inverser par ordinateur et les clés de chiffrement des utilisateurs n'exigeant pas le secret
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système

Abrégé

A computer-implemented method of shuffling an ordered set of data items, comprising: generating an ordered set of first party shuffle keys; for each data item, deriving a first party public key, and mapping the first party public key to the data item; obtaining, from each party, a party public key mapped to each data item, wherein a combined public key is generated based on each party public key mapped to that data item, and an ordered set of party encrypted shuffle keys; for each data item, generating a sequence of elements; encrypting each sequence with a first scalar to generate a first encrypted sequence; generating a first ordered set of first encrypted sequences, wherein the order of the first encrypted sequences of elements differs compared to the initial ordered set of sequences of elements; sending the first ordered set of first encrypted sequences of elements to the second party.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/30 - Clé publique, c. à d. l'algorithme de chiffrement étant impossible à inverser par ordinateur et les clés de chiffrement des utilisateurs n'exigeant pas le secret

Abrégé

There is provided a computer implemented method. The method provides a generation of a proof of existence data structures. The method comprising: (i) receiving a request comprising a data reveal path, the data reveal path referencing a node of interest within an input hierarchical data structure (ii) obtaining the input hierarchical data structure comprising an input root node and a plurality of input nodes, wherein each of the input nodes within the input hierarchical data structure have an associated value, and (iii) generating an output hierarchical data structure based on the data reveal path and the input hierarchical data structure, wherein the output hierarchical data structure comprises a plurality of output nodes. There is also provided a method for verification of the proof of existence.

Classes IPC  ?

• G06Q 10/087 - Gestion d’inventaires ou de stocks, p.ex. exécution des commandes, approvisionnement ou régularisation par rapport aux commandes
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• G06Q 20/02 - Architectures, schémas ou protocoles de paiement impliquant un tiers neutre, p.ex. une autorité de certification, un notaire ou un tiers de confiance

Abrégé

A computer implemented method for adding a current transaction associated with a set of transactions in a blockchain system. The method comprising the steps of generating a first state data, wherein the first state data is based on a first transaction reference to a first transaction and/or a second transaction reference to a second transaction, generating the current transaction comprising the first state data, and submitting the current transaction to the blockchain.

Classes IPC  ?

• G06Q 10/087 - Gestion d’inventaires ou de stocks, p.ex. exécution des commandes, approvisionnement ou régularisation par rapport aux commandes
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• G06Q 20/02 - Architectures, schémas ou protocoles de paiement impliquant un tiers neutre, p.ex. une autorité de certification, un notaire ou un tiers de confiance

Abrégé

The invention resides in a computer-implemented method comprising: using a part (A) of a block from a blockchain to provide a modified version (p) of a portion of data (P); and using the modified version (p) of the portion of data (P) as an input to an encryption process (E) to provide an encrypted version (C) of the modified version (p) of the portion of data (P). The part (A) can be, for example, a transaction ID (TxID) and/or a hash of at least a portion of the transaction or the block. The part (A) of the block is used to provide the modified version of the portion of data (p) as an input to at least one operation e.g. a mod operation or an XOR operation. The encryption process can be, can use or comprise a block cipher e.g. Hill Cipher.

Classes IPC  ?

• H04L 9/06 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité l'appareil de chiffrement utilisant des registres à décalage ou des mémoires pour le codage par blocs, p.ex. système DES
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

The invention resides in a computer-implemented method comprising: using a part (A) of a block from a blockchain to provide an encrypted version (C) of a portion of data (P) or a portion of data (P) decrypted from an encrypted version (C) of the portion of data (P). The part (A) of the block and the portion of data (P) and/or the encrypted version (C) of the portion of data (P), are used as inputs to an encryption process (E) or a decryption process (D), respectively. The part (A) of the block can include a transaction ID (TxID). The part (A) of the block can be used to provide the modified version of the portion of data (p) by using the part (A) of the block and/or the portion of data (P) as inputs to at least one operation e.g. a mod operation, or an XOR operation. The invention is particularly suited to a block cipher, such as a Hill Cipher.

Classes IPC  ?

• H04L 9/06 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité l'appareil de chiffrement utilisant des registres à décalage ou des mémoires pour le codage par blocs, p.ex. système DES
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

A computer-implemented method comprising: obtaining information describing a property; dividing the information into at least two data items describing the property at at least two different levels of precision; obtaining a set of data items for generating a Merkle tree, the set of data items including the at least two data items; generating two or more leaf nodes of a Merkle tree by hashing each data item in the set of data items, wherein the Merkle tree comprises a plurality of leaf nodes including the two or more leaf nodes; and storing at least one of: the Merkle tree; instructions for generating the Merkle tree from the set of data items.

Classes IPC  ?

• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

A computer-implemented method of attesting to a sequence of data exchanges between a group, wherein the group comprises a receiving party and one or more sending parties, and wherein the method is performed by the receiving party and comprises: receiving a sequence of two or more respective sets of data items, each respective set being sent by a respective sending party; and for each respective set of data items in the sequence: generating a respective attestation transaction, wherein the respective attestation transaction comprises a respective output locked to a respective Merkle root of a respective Merkle tree, wherein the respective Merkle tree is based on the respective set of data items and each previous respective set of data items in the sequence; and sending the respective attestation transaction to at least the respective sending party that sent the respective set.

Classes IPC  ?

• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

A method comprising: determining a set of unconsumed outputs of blockchain transactions, and forming a hash tree to attest to the set; wherein a leaf node can each either A) designate a corresponding subset of one or more of the unconsumed outputs or B) comprise a placeholder value. The method further comprises determining an update to the set and recomputing the hash tree to reflect the update. When an output is removed, the leaf node designating the removed output may be replaced with a new leaf node which either: A) designates an updated subset of one or more unconsumed outputs not including the removed output, or B) comprises a placeholder value. When a new output is added, a new leaf node may be inserted in the tree in place of a replaceable leaf node that either: A) designates an output being removed, or B) comprises a placeholder value.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système

Abrégé

A method of challenging a challengee to publicly commit to a set of data items based on a hash tree wherein leaves of the hash tree designate the data items. The method comprises causing a challenge transaction to be recorded on a blockchain. This transaction comprises code which, when run on a node of a blockchain network in response to an attempt to validate a candidate transaction, receives and verifies a signature of a challengee from the candidate transaction; and also determines whether the candidate transaction provides a solution to a hash puzzle, the required solution comprising the root of the hash tree. On condition of passing these tests the candidate transaction is validated for recordal on the blockchain, thereby redeeming a reward for the challengee.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système

Abrégé

A computer-implemented method and system is provided which enables interaction between a device and an asset transfer platform. The interaction can only occur if a permit data structure allows it to happen.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système

Abrégé

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, and wherein the method comprises: generating the common blockchain address by hashing any one of the respective public keys with a universal hash function, wherein said hashing 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.

Classes IPC  ?

• H04L 9/06 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité l'appareil de chiffrement utilisant des registres à décalage ou des mémoires pour le codage par blocs, p.ex. système DES
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

A computer-implemented method for generating a puzzle blockchain transaction. A first locking script of the puzzle blockchain transaction is provided, the first locking script corresponding to a first unspent transaction output and comprising a hash value derived from a target solution of a time-lock puzzle, and a set of puzzle parameters of the time-lock puzzle. The target solution is computed using a set of secret puzzle parameters. The time-lock puzzle is solvable using the set of puzzle parameter in a time equal to or greater than a minimum solving time. The set of puzzle parameters does not comprise the secret puzzle parameters. The locking script is configured to, when executed with a first unlocking script of a solution blockchain transaction, verify a candidate solution, computed using the set of puzzle parameters, provided in the first unlocking script of the solution blockchain transaction based on the hash value.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

A computer implemented method for time-locking a blockchain transaction. The method comprises computing a solution to a time-lock puzzle using a set of secret puzzle parameters. The time-lock puzzle is solvable using a set of puzzle parameter in a time equal to or greater than a minimum solving time. The set of puzzle parameters does not comprise the secret puzzle parameters. The method further comprises generating a transaction encryption key K, encrypting the blockchain transaction using the encryption key K, and encrypting the transaction encryption key K using the solution to the time-lock puzzle.

Classes IPC  ?

• H04L 9/08 - Répartition de clés
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 9/40 - Protocoles réseaux de sécurité
• G06Q 20/06 - Circuits privés de paiement, p.ex. impliquant de la monnaie électronique utilisée uniquement entre les participants à un programme commun de paiement

Abrégé

A computer-implemented method and system is provided which enables interaction between a device and an asset transfer platform. The interaction can only occur if a permit data structure allows it to happen.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

A computer-implemented method and system is provided which enables interaction between a device and an asset transfer platform. The interaction can only occur if a permit data structure allows it to happen.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système

Abrégé

This application provides methods and systems for verifying safe, consistent and secure storage of data especially, but not limited to, situations where storage of the data is delegated to a third party. A data controller, Alice, takes at least one sample of her data D, performs an operation on it to produce a variation. She then calculates the root value of the Merkle tree that represents the data comprising the varied data sample. She sends her data to a storage provider, Bob, while retaining her sample(s) and the resulting Merkle root value(s). Alice does not tell Bob which sample(s) she has chosen, or the operations she has used in the variations, or any inputs to the operations. Alice can delete her original copy of the data. At a later date, Alice can verify that Bob still has her complete data and in its original state by requiring him to perform the same operation on the same data sample, calculate the root value of the resulting Merkle tree and send it to her. If Bob's root value matches Alice's root value, then Bob must have an original and complete copy of Alice's data otherwise he would not be able to calculate the correct Merkle root value. Embodiments can be arranged to fully automate the process, including implementing on a blockchain.

Classes IPC  ?

• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

The present disclosure proposes methods, devices, systems, and computer programs for revoking at least a permission. In more detail, the method of the first aspect comprises: receiving a request comprising a first permit identifier, wherein the first permit identifier identifies a first permit, and obtaining a first permit data based on the first permit identifier wherein the first permit data comprises data indicative of at least one permission and wherein the at least one permission provides an indication of one or more actions a holder of the first permit can take and/or what the holder of the first permit is allowed to do. Wherein the request is a request to revoke at least a subset of permissions of the first permit data and the method further comprises the step of revoking a subset of permissions.

Classes IPC  ?

• G06F 21/62 - Protection de l’accès à des données via une plate-forme, p.ex. par clés ou règles de contrôle de l’accès
• G06F 21/64 - Protection de l’intégrité des données, p.ex. par sommes de contrôle, certificats ou signatures

Abrégé

The present disclosure proposes methods, devices, systems, and computer programs for creating a permit. In more details, the method comprising the steps of receiving a request comprising a first permit identifier, wherein the first permit identifier identifies a first permit, and obtaining a first permit data based on the first permit identifier wherein the first permit data comprises data indicative of at least one permission and wherein the at least one permission provides an indication of one or more actions a holder of the first permit can take and/or what the holder of the first permit is allowed to do, wherein the request is a request to create a further permit and the request comprises data indicative of a further permit.

Classes IPC  ?

• G06F 21/62 - Protection de l’accès à des données via une plate-forme, p.ex. par clés ou règles de contrôle de l’accès
• G06F 21/64 - Protection de l’intégrité des données, p.ex. par sommes de contrôle, certificats ou signatures

Abrégé

The present disclosure proposes methods, devices and systems for validating a permit. The method of the first aspect comprises the steps of receiving a request comprising a first permit identifier, wherein the first permit identifier identifies a first permit, and obtaining a first permit data based on the first permit identifier wherein the first permit data comprises data indicative of at least one permission and wherein the at least one permission provides an indication of one or more actions a holder of the first permit can take and/or what the holder of the first permit is allowed to do, wherein the request is a request to validate an expression associated with at least one permission of the first permit and the request comprises data indicative of the expression.

Classes IPC  ?

• G06F 21/62 - Protection de l’accès à des données via une plate-forme, p.ex. par clés ou règles de contrôle de l’accès
• G06F 21/64 - Protection de l’intégrité des données, p.ex. par sommes de contrôle, certificats ou signatures

Abrégé

The present disclosure proposes methods, devices, systems, and computer programs for adding further permissions to a first permit. In more detail, the method of the first aspect comprises: receiving a request comprising a first permit identifier, wherein the first permit identifier identifies the first permit, and obtaining a first permit data based on the first permit identifier wherein the first permit data comprises data indicative of at least one permission and wherein the at least one permission provides an indication of one or more actions a holder of the first permit can take and/or what the holder of the first permit is allowed to do, wherein the request is to add a set of further permissions to the first permit and the request comprises the set of further permissions.

Classes IPC  ?

• G06F 21/64 - Protection de l’intégrité des données, p.ex. par sommes de contrôle, certificats ou signatures
• G06F 21/62 - Protection de l’accès à des données via une plate-forme, p.ex. par clés ou règles de contrôle de l’accès

Abrégé

A computer-implemented method of generating shares of child private keys, and wherein the method is performed by a first participant of the group and comprises: receiving, from a coordinator, a first share of a master private key, wherein the master private key is generated based on a first portion of a hash of a seed value; receiving, from a coordinator, a master chain code for the master private key, wherein the master chain code is generated based on a second portion of the hash of the seed value; receiving, from a coordinator, a master public key corresponding to the master private key; generating one or more first shares of one or more respective child private keys, wherein each first share of the respective child private key is generated based on the first share of the master private key, and a first portion of a hash of i) the master chain code, ii) the master public key and iii) a respective key index.

Classes IPC  ?

• H04L 9/08 - Répartition de clés
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système

Abrégé

A computer-implemented method for enabling elliptic curve arithmetic to be performed using blockchain transactions. A first script of a first blockchain transaction is generated, comprising a modular inversion script configured to obtain a target integer and a modulus value, and output a modular inverse of the target integer. The modular inverse is generated by generating a sequence of squaring values; for each set bit of a reduced modulus value expressed in binary, including the corresponding squaring value of the sequence of squaring values in a result; multiplying together the squaring values of the result to generate a resultant value; and computing a modulus of the resultant value with respect to the modulus value, wherein the modulus of the resultant value is output as the modular inverse, and outputting the first script for inclusion in the first blockchain transaction.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• G06F 7/72 - Méthodes ou dispositions pour effectuer des calculs en utilisant une représentation numérique non codée, c. à d. une représentation de nombres sans base; Dispositifs de calcul utilisant une combinaison de représentations de nombres codées et non codées utilisant l'arithmétique des résidus
• H04L 9/30 - Clé publique, c. à d. l'algorithme de chiffrement étant impossible à inverser par ordinateur et les clés de chiffrement des utilisateurs n'exigeant pas le secret

Abrégé

A computer-implemented method for enabling elliptic curve arithmetic to be performed using blockchain transactions. A first script comprising a modular inversion script is generated. The modular inversion script is configured to obtain a target integer x, a modulus value p, and a pair of indices for a component of an addition chain identifying a pair of pervious components which, when summed, equal the component of the addition chain. A modular inverse is generated by computing the exponentiation of x to the reduced modulus (p-2) using the addition chain. For each component of the addition chain for 3 ≤ i ≤ l, each multiplier value is calculated by selecting the multiplier values associated with the pair of indices and multiplying the selected multiplier values to generate the respective multiplier value for the component. For i = l, a remainder of the multiplier value with respect to the modulus value is computed.

Classes IPC  ?

• H04L 9/30 - Clé publique, c. à d. l'algorithme de chiffrement étant impossible à inverser par ordinateur et les clés de chiffrement des utilisateurs n'exigeant pas le secret
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

A computer-implemented method for enabling elliptic curve arithmetic to be performed using blockchain transactions, wherein the method is performed by a script generator. A first script of a first blockchain transaction is generated, wherein the first script comprises a modular inversion script configured to obtain a target integer and a modulus value and output a modular inverse of the target integer. The target integer and the modulus value are co-prime. The modular inverse is generated by iteratively computing a first sequence of the extended Euclidean algorithm with the target integer and modulus value as inputs, and using the first sequence to compute a Bezout co-efficient of the target integer, wherein the Bezout co-efficient of the target integer is output as the modular inverse. The first script is outputted for inclusion in the first blockchain transaction.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 9/30 - Clé publique, c. à d. l'algorithme de chiffrement étant impossible à inverser par ordinateur et les clés de chiffrement des utilisateurs n'exigeant pas le secret

Abrégé

A computer implemented method of providing proof of an ordered sequence of events, the method performed on a computing device and comprising: receiving a transaction; creating a further transaction to be sent to a further computing device; obtaining proof data associated with the further transaction that provides proof to the further computing device that the further transaction is linked to an initial transaction in a transaction chain comprising the transaction, wherein the initial transaction relates to an initial event in the ordered sequence of events, and the proof data comprises: (i) a proof; (ii) an identifier of the transaction; and (iii) a unique identifier of the initial transaction; and sending the further transaction and the proof data to the further computing device.

Classes IPC  ?

• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

ii i being derived from (i + 1) data values. One or more first proof transaction templates are generated, each corresponding to a different one of the sequence of verification values, each first proof transaction template comprising a template first unlocking script and an outpoint identifying the first locking script, the template first unlocking script comprising the public key corresponding to the corresponding verification value, wherein the first unlocking script is derived from the template first unlocking script and the corresponding verification value.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

Systems and computer-implemented methods of generating recipient-facilitated blockchain transactions. A recipient device transmits a recipient outpoint to a sender device. The sender device returns a partially-complete transaction containing the recipient outpoint as a recipient input to the partially-complete transaction and containing at least one sender input. The recipient device then adds a recipient output script as an output to the partially-complete transaction, adds an unlocking script for the recipient outpoint using a digital signature across all input and outputs to produce a complete transaction, and transmits the complete transaction to a blockchain node of a blockchain network for propagation and inclusion in a block.

Classes IPC  ?

• G06Q 20/02 - Architectures, schémas ou protocoles de paiement impliquant un tiers neutre, p.ex. une autorité de certification, un notaire ou un tiers de confiance
• G06Q 20/06 - Circuits privés de paiement, p.ex. impliquant de la monnaie électronique utilisée uniquement entre les participants à un programme commun de paiement
• G06Q 20/22 - Schémas ou modèles de paiement
• G06Q 20/36 - Architectures, schémas ou protocoles de paiement caractérisés par l'emploi de dispositifs spécifiques utilisant des portefeuilles électroniques ou coffres-forts électroniques
• G06Q 20/38 - Architectures, schémas ou protocoles de paiement - leurs détails
• G06Q 20/40 - Autorisation, p.ex. identification du payeur ou du bénéficiaire, vérification des références du client ou du magasin; Examen et approbation des payeurs, p.ex. contrôle des lignes de crédit ou des listes négatives

Abrégé

A method performed in a system comprising a first party and a second party, the method comprising: generating, by the first party, a template of a first transaction having an input based on an output from a prior transaction associated with the second party; generating, by the first party, a message based on the template of the first transaction; generating, by the first party, a secret based on the message; generating, by the first party, a value based on the secret, wherein the secret cannot be derived from the value; generating, by the first party, a first puzzle transaction, wherein a first locking script of the first puzzle transaction comprises a knowledge proof configured to require an unlocking script to comprise the secret; publishing, by the first party, the first puzzle transaction to a first blockchain; obtaining, by the second party, the value based on the secret; signing, by the second party, the value based on the secret to create a signature; sending the signature from the second party to the first party; including, by the first party, the signature in the unlocking script of the first transaction and then sending the first transaction to a second blockchain; determining, by the second party and from the first transaction on the second blockchain, the message and the secret; and creating, by the second party, a second transaction which unlocks a first output of the first puzzle transaction based on the secret, and submitting the second transaction to the first blockchain.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

In one embodiment of the present disclosure there is provided a computer implemented method of verifying the authenticity of a child public key that is associated with an entity. The method is performed on a computing device and comprises: obtaining the child public key; receiving a zero knowledge proof from a proving computing device; verifying that the zero knowledge proof is valid using the proof, the child public key, and a verification key, to determine that a key derivation protocol has been used to derive the child public key from a parent key; and determining the authenticity of the child public key based on said verifying.

Classes IPC  ?

• H04L 9/08 - Répartition de clés
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

A computer-implemented method of executing a script formed from a locking script of a first blockchain transaction and an unlocking script of a second blockchain transaction, wherein the script comprises a first script portion, a version function, and a second script portion, and wherein the method comprises: a native script engine executing the first script portion; upon encountering the version function, the native script engine terminating execution of the script and determining whether the first script portion is valid according to a blockchain protocol; in response to determining that the first script portion is valid, the native script engine supplying a sub-script comprising at least the version function and the second script portion to a versioned script engine; and the versioned script engine executing the sub-script, wherein the execution of the sub-script by the versioned script engine does not affect the validity of the first and/or second blockchain transactions.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• G06F 9/00 - Dispositions pour la commande par programme, p.ex. unités de commande

Abrégé

A computer-implemented method performed by a blockchain node and comprising: maintaining a data structure representing orphan transactions, wherein an orphan transaction is a blockchain transaction having at least one parent transaction that is an unavailable transaction and/or at least one parent transaction that is a different orphan transaction, wherein an unavailable transaction is a transaction that is not available to a validation pipeline of blockchain node, and wherein: the data structure comprises a directed graph of nodes and edges, wherein each node of the graph represents either a respective orphan transaction or a respective unavailable transaction, wherein each edge connecting a respective parent node to a respective child node represents the spending of an output of the respective transaction represented by the respective parent node by an input of the respective transaction represented by the respective child node.

Classes IPC  ?

• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 9/40 - Protocoles réseaux de sécurité

Abrégé

A computer-implemented method of generating a share of a threshold signature, wherein a group of participants comprises a set of target participants and a set of dummy participants, wherein the number of target participants is less than the number of participants required to generate a valid signature, wherein each target participant and each dummy participants has i) a respective share of a first private key, ii) a respective share of an ephemeral private key, iii) a respective share of a first blinding key, iv) a respective share of a second blinding key, and wherein each target participant has v) an ephemeral public key corresponding to the ephemeral private key.

Classes IPC  ?

• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/08 - Répartition de clés

Abrégé

The present disclosure provides methods and systems for distributed and/or parallel processing of data records, and in particular validation of blockchain transactions in a blockchain block. In a preferred embodiment, a distributed validation node is disclosed in which one or more transactions are allocated to a validating resource in a plurality of validating resources. The one or more transactions relates to a portion of a Merkle tree for the block, so that each validation resource is able to operate independently on verification of a subset of the block's transactions, each subset being based on a segment of the Merkle tree. The disclosure includes advantageous techniques for at least: allocation of tree segments to different validation resources, load balancing, download of the transactions to be validated, distributed UTXO pools, indexing schemes and prevention of double spend events.

Classes IPC  ?

• G06F 21/64 - Protection de l’intégrité des données, p.ex. par sommes de contrôle, certificats ou signatures
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

A computer-implemented method of representing a first set of data items, wherein the method is performed by a first tree generator and comprises: allocating the first set of data items into a plurality of respective subsets; for each respective subset of data items, generating a respective hash tree based on the respective subset of data items, wherein the respective hash tree comprises a respective root node; and generating a respective first hash set representing the first set of data items, wherein the first hash set comprises each of the respective root nodes.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système

Abrégé

The present disclosure provides methods and systems for distributed and/or parallel processing of data records, and in particular validation of blockchain transactions in a blockchain block. In a preferred embodiment, a distributed validation node is disclosed in which one or more transactions are allocated to a validating resource in a plurality of validating resources. The one or more transactions relates to a portion of a Merkle tree for the block, so that each validation resource is able to operate independently on verification of a subset of the block's transactions, each subset being based on a segment of the Merkle tree. The disclosure includes advantageous techniques for at least: allocation of tree segments to different validation resources, load balancing, download of the transactions to be validated, distributed UTXO pools, indexing schemes and prevention of double spend events.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• G06F 21/64 - Protection de l’intégrité des données, p.ex. par sommes de contrôle, certificats ou signatures

Abrégé

The present disclosure provides methods and systems for distributed and/or parallel processing of data records, and in particular validation of blockchain transactions in a blockchain block. In a preferred embodiment, a distributed validation node is disclosed in which one or more transactions are allocated to a validating resource in a plurality of validating resources. The one or more transactions relates to a portion of a Merkle tree for the block, so that each validation resource is able to operate independently on verification of a subset of the block's transactions, each subset being based on a segment of the Merkle tree. The disclosure includes advantageous techniques for at least: allocation of tree segments to different validation resources, load balancing, download of the transactions to be validated, distributed UTXO pools, indexing schemes and prevention of double spend events.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• G06F 21/64 - Protection de l’intégrité des données, p.ex. par sommes de contrôle, certificats ou signatures

Abrégé

The present disclosure provides methods and systems for generating, storing, processing, accessing and/or maintaining a record of at least a portion of a transaction (Tx). The record comprises transaction data for determining the at least a portion of a transaction (Tx) is included in the Merkle path of a blockchain block (B). The record functions to hold information e.g. data items. Records can be stored in allocated resources e.g. a database, which can be part of a node connected to the blockchain network. Records can comprise, at least, transaction data and can also comprise a status flag/state, verification information, validation data, details of where an unspent transaction outputcan be found, reference to at least one previous record e.g. the location, signatures and authorization data. The record enables data related to a transaction to be stored, and to be stored in a catalogued manner.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• G06F 21/64 - Protection de l’intégrité des données, p.ex. par sommes de contrôle, certificats ou signatures

Abrégé

The present disclosure provides methods and systems for using a portion of data derived from a blockchain to identify and/or allocate a processing and/or storage resource. The data from which the portion of data is derived comprises an unspent transaction output (UTXO) and/or a transaction (Tx) containing a unspent transaction output. By using a portion of data to allocate the resource a relationship between the data, its associated information and the resource in which it is stored is maintained. The database can hold at least one of: a flag of the validity of the unspent transaction output (UTXO) and/or a transaction (Tx) containing an unspent transaction output; and information enabling the validity of an unspent transaction output and/or a transaction (Tx) containing an unspent transaction output to be determined, e.g. SPV information. Processing the data includes determining a key, wherein the key determines the allocated resource. The key can be hashed and the resulting hash determines the allocated resource. At least one of the data, the key, and the resulting hash comprises at least one of: an alphanumeric number; and a binary number, and said number is used to determine the allocated resource. A portion of the number is parsed to determine the allocated resource.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• G06F 21/64 - Protection de l’intégrité des données, p.ex. par sommes de contrôle, certificats ou signatures

Abrégé

A computer-implemented method of generating a shared key, comprising: each target participant: evaluating a respective function at the target index of that target participant to generate a respective first result, evaluating a respective function at the target index of each other target participant to generate a respective second result, sending the respective second result to the respective other target participants but not any of the dummy participants, obtaining a respective second result from each other target participant, generating a respective share of the shared key based on the respective first result and each of the obtained respective second results, evaluating the respective function at the respective dummy index of each respective dummy participant to generate a respective third result, sending the respective third result to the respective dummy participant; and each dummy participant generating a respective share of the shared key based on each of the obtained third results.

Classes IPC  ?

• H04L 9/08 - Répartition de clés
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

The present disclosure provides methods and systems for distributed and/or parallel processing of data records, and in particular validation of blockchain transactions in a blockchain block. In a preferred embodiment, a distributed validation node is disclosed in which one or more transactions are allocated to a validating resource in a plurality of validating resources. The one or more transactions relates to a portion of a Merkle tree for the block, so that each validation resource is able to operate independently on verification of a subset of the block's transactions, each subset being based on a segment of the Merkle tree. The disclosure includes advantageous techniques for at least: allocation of tree segments to different validation resources, load balancing, download of the transactions to be validated, distributed UTXO pools, indexing schemes and prevention of double spend events.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• G06F 21/64 - Protection de l’intégrité des données, p.ex. par sommes de contrôle, certificats ou signatures

Abrégé

0000 may provide or comprise control data that the PoW provider can use to determine whether or not performance of the PoW calculation is to be performed or completed.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• G06F 21/64 - Protection de l’intégrité des données, p.ex. par sommes de contrôle, certificats ou signatures

Abrégé

Embodiments of the disclosure provide systems and associated methods for improving the performance of blockchain-implemented or related operations, and for providing novel architectures for blockchain networks. In particular, the system is suited for distributing blockchain-related operations across multiple processing resources. These include operations such as block and/or transaction validation, mining tasks such as Proof-of-Work calculations, identification and searching of blockchain-related data, and efficient load balancing across the multiple resources used for performance of such operations. In some embodiments, tasks relating to a given type of blockchain operation e.g. validation or mining are outsourced or delegated to one or more dedicated resources. In a preferred embodiment, the individual blockchain functionalities are separated out and performed by different resources which can be located anywhere in the world and/or controlled by non-related, trustless entities.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• G06F 21/64 - Protection de l’intégrité des données, p.ex. par sommes de contrôle, certificats ou signatures

Abrégé

A computer-implemented method of redacting data of a blockchain transaction, wherein the method comprises: obtaining a first blockchain transaction, the first blockchain transaction comprising one or more respective scripts comprising respective target data to be redacted; for at least one of the one or more respective scripts, constructing a respective Merkle tree based on the respective script, wherein the respective target data is divided across one or more of the respective leaves of the respective Merkle tree, and generating a redacted version of the first blockchain transaction by replacing the at least one respective script with a respective Merkle root of the respective Merkle tree.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/40 - Protocoles réseaux de sécurité

Abrégé

A computer-implemented method of implementing a token protocol using a blockchain, wherein the method is performed by a first party and comprises: obtaining a first blockchain transaction, the first blockchain transaction comprising a first output comprising a first locking script, the first locking script comprising token data; constructing a Merkle tree based on the first locking script, wherein the token data is divided across one or more leaves of the Merkle tree; generating a first signature based on a first message comprising a Merkle root of the Merkle tree; and making the first signature available for inclusion in a second output of the first blockchain transaction.

Classes IPC  ?

• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 9/40 - Protocoles réseaux de sécurité

Abrégé

A method of enforcing a locking script to be propagated throughout a chain of blockchain transactions. The method comprises generating a primary transaction comprising a primary locking script configured to, when executed by an unlocking script of an auxiliary transaction, verify that the unlocking script comprises a message generated based on the auxiliary transaction, and verify, based on the message, that an output of the auxiliary transaction comprises an auxiliary locking script. The auxiliary locking script is configured to verify that an unlocking script of a second primary transaction comprises a message generated based on the second primary transaction, verify that the unlocking script of the second primary transaction comprises a data item comprising one or more locking scripts of the primary transaction, and verify, based on the message and the data item, that an output of the second primary transaction comprises the primary locking script.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

Methods and computing devices for privately and confidentially recording linked event records in a manner that ensures immutability and auditability. An event is recorded through the creation of an event string or record and the hashing of that event string or record together with an event hash relating to the previous most-recently recorded event record relating to the same entity or account. The new event hash is recorded on a blockchain to ensure immutability of the underlying preimage containing the event data. Links between event records are only discernable through examining confidentially stored preimages, and preimages can be authenticated through confirming the corresponding event hash is recorded on-chain.

Classes IPC  ?

• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

The present disclosure proposes methods, devices and systems for processing a transaction between a customer (100) and a merchant (130). The method may be performed at a merchant device. The method may comprise receiving customer information from a customer device associated with the customer; establishing a secure communication channel (125) between the customer and the merchant based on the customer information; generating a partial invoice transaction based on the customer information; sending the partial invoice transaction to the customer device via the secure communication channel; receiving via the secure communication channel, a transaction which is a completed version of the partial invoice transaction and which has been authorised at the customer device; validating the transaction; broadcasting the validated transaction to a blockchain node (150) to be submitted to a blockchain (155); receiving at least one notification that the transaction has been validated by the blockchain node and included on the blockchain.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/40 - Protocoles réseaux de sécurité

Abrégé

A computer-implemented method of generating a blockchain transaction, wherein each party of a plurality of second parties has a respective secret number k from which a respective r-portion is derivable, wherein a Merkle tree is defined, at least one leaf node of the Merkle tree being based on at least one of the respective r-portions, wherein the method is performed by a first party and comprises: generating a first blockchain transaction, wherein the first blockchain transaction comprises a first locking script comprising a target Merkle tree portion corresponding to the Merkle tree, the first locking script configured, when executed together with a first unlocking script of a second blockchain transaction, to: extract an r-portion from the first unlocking script, generate a hash value derived from the extracted r-portion, calculate a candidate Merkle tree portion based on the generated hash and a Merkle proof portion of the first unlocking script, verify that the calculated candidate Merkle tree portion matches the target Merkle tree portion, verify a signature portion of the first unlocking script based on a public key of the first unlocking script, and making the first blockchain transaction available to one or more nodes of a blockchain network.

Classes IPC  ?

• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 9/40 - Protocoles réseaux de sécurité

Abrégé

A computer-implemented method of generating a share of a shared private key, wherein each participant of a group of participants has a respective share of a master private key, and wherein the method is performed by a first participant of the group and comprises: generating a first share of a first shared secret, wherein each other participant of the group generates a respective share of the first shared secret; and generating a first share of a first shared private key based on a first share of the master private key and the first share of the first shared secret.

Classes IPC  ?

• H04L 9/08 - Répartition de clés
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

A computer-implemented method of generating a share of a shared private key, wherein each participant of a group of participants has a respective share of a master private key, and wherein the method is performed by a first participant of the group and comprises: generating a first share of a first shared private key based on a first share of the master private key and a first hash value, wherein the first hash value is generated by hashing a nonce value one or more times.

Classes IPC  ?

• H04L 9/08 - Répartition de clés
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

A computer-implemented method of generating a blockchain transaction. A first blockchain transaction is generated, wherein the first blockchain transaction comprises a first locking script comprising a first signature verification function and a second signature verification function, the first locking script configured, when executed together with a first unlocking script of a second blockchain transaction, to verify, using the first signature verification function, a signature of the first unlocking script based on a first message corresponding to the second blockchain transaction, wherein at least a portion of the first message is provided in the first unlocking script; and verify, using the second signature verification function, the signature of the first unlocking script based on a second message corresponding to the second blockchain transaction, wherein the second message is constructed by the second signature verification function. The first blockchain transaction is made available to one or more nodes of a blockchain network.

Classes IPC  ?

• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/30 - Clé publique, c. à d. l'algorithme de chiffrement étant impossible à inverser par ordinateur et les clés de chiffrement des utilisateurs n'exigeant pas le secret
• G06F 21/00 - Dispositions de sécurité pour protéger les calculateurs, leurs composants, les programmes ou les données contre une activité non autorisée

Abrégé

A computer-implemented method for tracking, on a blockchain, at least two clients interacting with an asset, wherein the blockchain comprises a set of transactions associated with the asset, and a set of transactions associated with each client. The asset tracking comprising receiving an asset interaction event request comprising data based on at least two clients associated with an asset interaction event and data indicative of the asset, generating an event transaction based on a reference to the set of transactions associated with the asset and references to the sets of transactions associated with the at least two clients, and submitting the event transaction to the blockchain.

Classes IPC  ?

• G06Q 20/06 - Circuits privés de paiement, p.ex. impliquant de la monnaie électronique utilisée uniquement entre les participants à un programme commun de paiement
• G06Q 20/02 - Architectures, schémas ou protocoles de paiement impliquant un tiers neutre, p.ex. une autorité de certification, un notaire ou un tiers de confiance
• G06Q 20/38 - Architectures, schémas ou protocoles de paiement - leurs détails
• G06Q 20/12 - Architectures de paiement spécialement adaptées aux systèmes de commerce électronique
• G06Q 20/14 - Architectures de paiement spécialement adaptées aux systèmes de facturation

Abrégé

A computer implemented method of using a blockchain to coordinate data transfer over a P2P network. A second hash value is obtained, the second hash value generated by hashing a data request associated with a data item with first and second hash functions. The second hash value and the requesting node's public key are sent to the P2P nodes connected to the requesting node, wherein a chain is formed between the requesting and target nodes. The target node splits the data into packets, uses the requesting node's public key to encrypt each of the packets together with the first hash value to generate first encrypted messages, and generates final encrypted messages by encrypting the first encrypted messages with the public keys of nodes in the chain. The encrypted messages are obtained and decrypted to construct the data item, and submitting attestation transactions to the blockchain.

Classes IPC  ?

• G06F 21/64 - Protection de l’intégrité des données, p.ex. par sommes de contrôle, certificats ou signatures
• G06F 21/60 - Protection de données
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système

Abrégé

A computer implemented method of using a blockchain to coordinate data transfer over a P2P network. The method comprises obtaining a second hash value, wherein the second hash value is generated by hashing at least a data request with a first hash function to generate a first hash value and then hashing at least the first hash value with a second hash function to obtain the second hash value. The data request is associated with the target data item. A primary request transaction is submitted to a blockchain network, wherein the primary request transaction comprises the second hash value and one or more first outputs, each first output being locked to a respective public key associated with a respective P2P node connected to the requesting P2P node. The target data item is obtained from the target P2P node.

Classes IPC  ?

• G06F 21/64 - Protection de l’intégrité des données, p.ex. par sommes de contrôle, certificats ou signatures
• G06F 21/60 - Protection de données
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système

Abrégé

A computer-implemented method of generating a digital signature for signing a message, wherein the method is performed by a coordinating party and comprises: obtaining at least the threshold number of respective signature shares; obtaining, for each of the respective signature shares, a respective commitment of the respective signature share, each respective commitment having been generated by the respective participant that generated the respective signature share; generating a Merkle tree, wherein at least the threshold number of respective leaf nodes of the Merkle tree comprise a respective hash of a respective signature commitment combined with a respective participant index, wherein the respective participant index is associated with the respective participant that generated the respective signature commitment; generating the signature based on at least the threshold number of respective signature shares; and making a Merkle root of the Merkle tree available to at least the respective participants that generated a signature share.

Classes IPC  ?

• H04L 9/08 - Répartition de clés
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
• H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité

Abrégé

A computer-implemented method of generating a respective signature share of a digital signature for signing a message, wherein the method is performed by a first participant of the group and comprises: obtaining at least the threshold number of respective participant indexes, wherein the obtained respective participant indexes comprises a first participant index associated with the first participant; generating a private key index, wherein the private key index is generated based on a hash of a combination of the obtained respective participant indexes; generating a second common private key of the first hierarchical key structure; and generating a first signature share of the digital signature.

Classes IPC  ?

• H04L 9/08 - Répartition de clés
• H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système