According to a first aspect disclosed herein there is provide a device comprising: a PUF module, and one or more outer layer components providing at least part of an unsecured channel for inputting a challenge to the PUF module and receiving back a response. Internal logic of the PUF module comprises a logging mechanism arranged to automatically log a record of the challenge and/or response in a log medium, e.g. a blockchain. According to a second aspect, there is provided a method comprising: sending a first message to be recorded on a blockchain, submitting a query to check that the first message has been recorded on the blockchain without manipulation, on condition thereof, sending a second messaging transaction to be recorded on the blockchain. The first and second aspects may be used together or independently.
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 21/10 - Protection de programmes ou contenus distribués, p.ex. vente ou concession de licence de matériel soumis à droit de reproduction
G06F 21/64 - Protection de l’intégrité des données, p.ex. par sommes de contrôle, certificats ou signatures
G06F 21/87 - Boîtiers fiables ou inviolables par encapsulation, p.ex. de circuits intégrés
G07C 5/08 - Enregistrement ou indication de données de marche autres que le temps de circulation, de fonctionnement, d'arrêt ou d'attente, avec ou sans enregistrement des temps de circulation, de fonctionnement, d'arrêt ou d'attente
H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
2.
COMPUTER-IMPLEMENTED SYSTEMS AND METHODS FOR AN ACCUMULATOR-BASED PROTOCOL FOR THE DISTRIBUTION OF TASKS ACROSS A COMPUTER NETWORK
Techniques described herein can be utilized to implement a protocol for performing an unbiased selection of a particular worker node among a plurality of worker nodes to execute a computational task. Nodes of a distributed network may register to join a group membership by generating quantities derived at least in part from a hierarchical data structure, such as an accumulation tree, whose parameters are defined by a manager node. The manager node may utilise the quantities provided by the plurality of worker nodes to perform an unbiased selection of a worker node from among the plurality of worker nodes to perform a computational task. At least in one embodiment of the present invention, the manager node cannot determine, based on quantities supplied by the worker nodes, whether a particular worker node was selected to perform the computational task.
According to a first aspect of the disclosure, there is provided a request-response protocol for requesting access to data from a destination transaction. According to a second aspect of the disclosure, there is provided a method of accessing data from one or more destination transactions stored on a blockchain, wherein the method comprises selecting one or more hyperlinks linking to the destination transaction(s).
G06F 16/955 - Recherche dans le Web utilisant des identifiants d’information, p.ex. des localisateurs uniformisés de ressources [uniform resource locators - URL]
H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
A computer-implemented method of creating different versions of a tree structure overlaid on a blockchain, wherein the method is performed by a tree creator and comprises: creating one or more target child nodes of a target parent node, each target child node comprising a respective data payload; and forming a respective edge between each target child node and the target parent node by associating each of the target child nodes with a respective link identifier, wherein the respective link identifier is based on at least one off-chain parameter.
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
5.
METHODS AND DEVICES FOR INCREASING ENTROPY OF A BLOCKCHAIN USING BLINDED OUTCOME DIVERSIFICATION
An implementation of the present application provides a computer-implemented method to increase the security of a blockchain-implemented transaction, the transaction including participation from a plurality of participating nodes, each participating node participating as a message originator, selector, and propagator. The method, implemented at a participating node, includes: receiving ciphertext from a prior node and determining whether the participating node is a selector node for said ciphertext received from the prior node. When the participating node is the selector node for said ciphertext, the method includes selecting a subset of said ciphertext, decrypting the selected subset of said ciphertext to provide opted ciphertext and transmitting said opted ciphertext to the next node. When the participating node is other than the selector node for said ciphertext, the method includes decrypting said ciphertext received from the prior node and transmitting the decrypted ciphertext to the next node.
H04L 9/16 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité utilisant plusieurs clés ou algorithmes qui sont changés pendant l'opération
6.
METHOD AND SYSTEM FOR EFFICIENT TRANSFER OF CRYPTOCURRENCY ASSOCIATED WITH A PAYROLL ON A BLOCKCHAIN THAT LEADS TO AN AUTOMATED PAYROLL METHOD AND SYSTEM BASED ON SMART CONTRACTS
Techniques are presented for securely transmitting a output script or information associated with a payroll and a user between a first node and a second node. The method comprises: determining a symmetric-key based on a common secret, based on a first node second private key and a second node second private key, wherein the second node has the same common secret based on a first node second public key and a second node second private key; encrypting at least part of the output script or information associated with the payroll and the second node with the symmetric-key, to an encrypted output script or encrypted information associated with the payroll and the second node; and sending the encrypted output script or encrypted information associated from the first node to the second node.
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/38 - Architectures, schémas ou protocoles de paiement - leurs détails
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/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/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
A computer-implemented method of generating a share of a digital signature of a message, wherein a threshold number of different signature shares from respective participants of a group of participants are required to generate the digital signature, wherein each participant has a respective private key share, the method being performed by a first one of the participants and comprising: generating a first message-independent component and a first message-dependent component, wherein the message-independent component is generated based on a first private key share and wherein the message-dependent component is generated based on the message; causing the first message-independent component to be made available to a coordinator; and causing a first signature share to be made available to the coordinator for generating the signature based on at least the threshold number of signature shares, wherein the first signature share comprises at least the message-dependent component.
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
Techniques are provided for emulating or otherwise executing the functionality of a logic gate via a computer-based distributed ledger or blockchain. The method comprises the steps of automatically generating a blockchain transaction comprising a locking script for an output, wherein a corresponding redeem script: i) specifies a plurality of public keys, each associated with a corresponding private key; and wherein each public key is uniquely associated with a potential state of at least one data source; and ii) comprises logic arranged to provide a result based on which of the plurality of associated private key is used to sign an unlocking script, wherein a minimum number of said private keys must be used to sign the unlocking script of a further blockchain transaction in order to spend the output.
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
G06F 21/30 - Authentification, c. à d. détermination de l’identité ou de l’habilitation des responsables de la sécurité
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/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
H04W 4/70 - Services pour la communication de machine à machine ou la communication de type machine
Techniques are presented to instantiate an event chain with a first block, wherein the first block is timestamped with an instantiation time; monitor for an event associated with a monitoring request; signal to other nodes in a plurality of nodes based on the monitoring by providing a commitment to a plurality of nodes in the plurality of nodes, wherein based on occurrence of the event providing either a dummy signal or an indicator comprising an encryption private key share held by the node, wherein the commitment is provided to the other nodes in the plurality of nodes; monitor for commitments from the other nodes in the plurality of nodes, wherein each commitment comprises a dummy signal or an encryption key share; process the commitments received from the other nodes to obtain an encryption private key share; and identify the encryption private key based on the analysis of the commitments.
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
10.
METHOD AND SYSTEM FOR SYNCHRONISING USER EVENT STREAMS WITH DUST-BASED RENDEZVOUS TRANSACTIONS
A method is provided by which payments for assets are recorded using blockchain transactions, and verified based on immutable logs associated with the transactions.
G06Q 20/10 - Architectures de paiement spécialement adaptées aux systèmes de banque à domicile
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é
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.
A computer-implemented method of generating blockchain transactions, wherein the method is performed by a first party and comprises: generating a first blockchain transaction, wherein the first blockchain transaction comprises a first compact script (CS), wherein the first CS is at least partly written in a high-level (HL) scripting language and comprises one or more HL functions, wherein when executed, each HL function is configured to perform an operation equivalent to a respective operation performed by one or more low-level (LL) functions of a LL scripting language, wherein the first CS is configured to perform an operation equivalent to a first expanded script (ES) written in the LL scripting language and comprising a plurality of LL functions, and wherein the first CS is smaller in storage size than the first ES; and making the first blockchain transaction available to one or more nodes of a blockchain network and/or a second party.
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.
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
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.
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/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é
15.
METHODS AND SYSTEMS FOR STREAMING BLOCK TEMPLATES WITH CROSS-REFERENCES
Methods and devices for compressing transaction identifiers by a first mining node in a blockchain network. The method may include building a first candidate block containing a first ordered list of transaction identifiers; receiving, from a second mining node, data defining a second ordered list of transaction identifiers in a second candidate block being mined by the second mining node; determining that at least one of the transaction identifiers in the first ordered list is also in the second ordered list; generating an append message containing data defining the first ordered list of transaction identifiers, wherein the data specifies said at least one transaction identifier in the first ordered list of transaction identifiers by including an index position of said at least one transaction identifier in the second ordered list of transaction identifiers; and transmitting the append message to the second mining node.
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
A computer program for generating an input and an output for a voting transaction for a blockchain for casting a vote, the computer program causes one or more processors to be configured to: receive voting instructions from a vote coordinator comprising one or more public keys and a set of voting options; render a user interface displaying the voting options; receive a user selection of one of the voting options; and generate an input-output pair for inclusion in a voting transaction; wherein a non-signature portion of the input comprises an outpoint identifying an unspent transaction output, and a signature portion of the input comprises a signature single flag and an associated signature signing at least the non-signature portion of the input-output pair and the output of the input-output pair but not any other output of the voting transaction, and the output of the input-output pair comprises one of public keys.
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
There is provided mechanisms for managing data in a blockchain network. In one embodiment, there is provided a computer implemented method performed at a headers client and comprising the following steps. Receiving a plurality of block headers from at least one external source, external to the headers client, the block headers each referring to a block in a blockchain. Storing the received plurality of block headers in a storage module. Analysing the plurality of block headers by validating the proof-of work for the plurality of received headers. Determining a best chain of block headers from the analysed plurality of block headers and storing the best chain at the storage module. The best chain can be a chain of blocks from genesis, which is a first block in the blockchain, to a current best block, which is a latest block in the blockchain. The best block may have the highest cumulative proof-of-work.
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.
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é
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.
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
A computer-implemented method of generating a shared cryptographic key based on at least one shared secret, wherein each participant belonging to a first group has a respective share of a first secret, the first secret having a first threshold and a corresponding first public key, wherein a second coordinator has a second public key corresponding to a second secret, wherein the second coordinator is configured to generate the same shared cryptographic key.
A method is provided by which payments for assets are recorded using blockchain transactions, and verified based on immutable logs associated with the transactions.
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/38 - Architectures, schémas ou protocoles de paiement - leurs détails
22.
PLATFORM FOR A PLURALITY OF SERVICES ASSOCIATED WITH A BLOCKCHAIN
In a first aspect, the present disclosure proposes methods, devices and systems for implementing a platform providing a plurality of services that are associated with a blockchain, using a platform processor associated with an application programming interface (API) that is capable of receiving a client request in a Hypertext Transfer Protocol (HTTP) transmission protocol format for a service. Further to suitable verification of the identity of the client and/or the request, a destination address or endpoint for the requested blockchain service is determined, and at least one blockchain transaction is generated based on the destination address to obtain an output script. A result based on the output script is then sent to the given client in the HTTP transmission protocol format. In some aspects, the blockchain transaction is associated with an event stream that is implemented as a Finite State Machine on the blockchain.
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
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.
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
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.
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é
25.
SYSTEMS AND METHODS FOR COMMUNICATION, STORAGE AND PROCESSING OF DATA PROVIDED BY AN ENTITY OVER A BLOCKCHAIN NETWORK
A computer-implemented method for submitting feedback for an entity to a blockchain is disclosed. The method, which is implemented at one of a plurality of participating nodes, includes: obtaining a first key, the first key being one of a fixed set of keys distributed to participating nodes that are eligible to submit feedback for the entity; generating first feedback (rj) of the entity for submission to the blockchain; encrypting the first feedback (rj) using at least the first key; and submitting the encrypted first feedback to a mixing service, the mixing service being configured to generate a mixed transaction based on the encrypted first feedback and at least one other encrypted feedback submission from one or more eligible participating nodes.
H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
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
26.
SYSTEM AND METHOD FOR HIERARCHICAL TOKEN DISTRIBUTION ON BLOCKCHAIN NETWORK
A computer-implemented method to generate a unidirectional commitment channel to send one or more tokens from a sender node to a recipient node using a blockchain is disclosed. The method is implemented by a processing resource that performs steps comprising: generating a first commitment transaction representing a commitment component in which a specified set of tokens is sent or committed for transfer from the first node to the second node; generating a return transaction which returns all tokens from the second node to the first node; signing the return transaction and, based on the signing of the return transaction, signing the commitment transaction; creating one or more further return transactions to reflect the transfer of tokens being made off the blockchain.
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
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.
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é
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.
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
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.
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.
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.
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.
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.
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.
The invention relates to a method of enabling zero-knowledge proof or verification of a statement (S) for enabling exchange of data between a prover and a verifier, wherein the prover has access to first data on a first blockchain, and the verifier has access to second data on a second blockchain. In the method, a prover sends to a verifier a set of data including a statement, which for a given function circuit output and an elliptic curve point, the function circuit input is equal to the corresponding elliptic curve point multiplier. The statement can be that the prover knows a private key for an address on a blockchain network.
G06F 16/2458 - Types spéciaux de requêtes, p.ex. requêtes statistiques, requêtes floues ou requêtes distribuées
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/12 - Architectures de paiement spécialement adaptées aux systèmes de commerce électronique
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
G06Q 30/018 - Certification d’entreprises ou de produits
G06Q 30/0207 - Remises ou incitations, p.ex. coupons ou rabais
G06Q 40/04 - Transactions; Opérations boursières, p.ex. actions, marchandises, produits dérivés ou change de devises
H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
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/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
36.
COMPUTER-IMPLEMENTED SYSTEMS AND METHODS FOR COMBINING BLOCKCHAIN TECHNOLOGY WITH DIGITAL TWINS
A computer implemented method and system is described which uses blockchain technology as a storage system for data acquired from a digital twin. The blockchain can be used to generate an immutable transaction history of data produced by the digital twin. In the case of an error, failure, incident, or accident, parties of interest can then access and analyse an immutable set of data. The blockchain network can also execute a digital smart contract based on the data received from a digital twin. The invention may be used in conjunction with the Bitcoin blockchain or another blockchain protocol.
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 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
G06F 21/64 - Protection de l’intégrité des données, p.ex. par sommes de contrôle, certificats ou signatures
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
A system is provided for performing transaction mixing between a plurality of users on a blockchain. The system is configured to carry out the steps of: selecting an initiator node to calculate a deterministic hash function using a chosen random number; distribute the deterministic hash function to a plurality of users on the blockchain; choose an amount of time each user is given to construct a payment channel, retrieve the random number, and submit an execution transaction to a blockchain network; choose a second time for when a payment to a user is submitted to the blockchain network; and establish a one-way payment channel between every pair of users in an ordered set of the plurality of users to establish a transaction chain linking all users.
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/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/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/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
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.
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é
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.
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
This invention relates to distributed systems, and more particularly to methods and systems for event-locked operations in transactions using a blockchain network. The method includes: detecting, by a first node that is a member of a congress comprising a plurality of nodes, malicious activity by a malicious node that is also a member of the congress; providing, by the first node, a partial signature on a confiscation transaction to transfer portion of digital asset(s) deposited by the malicious node to an unspendable address, wherein the digital asset(s) deposited by the malicious node; determining, by a threshold number of members of the congress, that the digital assets of the malicious node should be confiscated, and then confiscating the at least portion of digital asset(s) of the malicious node by generating a valid signature for the confiscation transaction and suspending the malicious node from further participation in the congress.
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
41.
COMPUTER IMPLEMENTED METHOD AND SYSTEM FOR TRANSFERRING CONTROL OF A DIGITAL ASSET
A computer-implemented method of transferring control of a digital asset on a blockchain network. The method described in one of the embodiments provides an advantage of enabling easy increase of the number of participants in the signature scheme. The method comprises the steps of distributing a version of cryptographic key, encrypted by means of cryptography system, to a plurality of second participants, wherein a homomorphic property enables derivation of a second public key from a first public key and said version of said cryptographic key. The shares communicated to each a first and/or second participant may be inaccessible to each other said first and/or second participants.
G06Q 20/12 - Architectures de paiement spécialement adaptées aux systèmes de commerce électronique
G06Q 20/38 - Architectures, schémas ou protocoles de paiement - leurs détails
G06Q 40/04 - Transactions; Opérations boursières, p.ex. actions, marchandises, produits dérivés ou change de devises
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
A method, system and program enabling a third party to determine whether a first party and a second party agree on membership of a set of blockchain transactions transacting between the first and second party.
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
G06F 21/64 - Protection de l’intégrité des données, p.ex. par sommes de contrôle, certificats ou signatures
43.
EFFICIENT IDENTIFICATION OF BLOCKCHAIN TRANSACTIONS
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.
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.
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.
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
A computer-implemented method of validating a blockchain transaction is disclosed. The method comprises requesting at least one UTXO referenced by at least one respective input of the transaction from a member node of at least one shard comprising at least one UTXO, obtaining validity data of at least one UTXO from at least one node, and performing a validation check on at least one input using the validity data.
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 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
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/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
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.
Techniques are presented to enable recovery of one or more digital assets held on a blockchain after a private key is lost. The computer implemented method comprises setting access for the one or more digital assets held on the blockchain under the public key Pk and accessible using the corresponding private key Sk of the user such that the one or more digital assets are also accessible using a private key x shared by a congress on the blockchain network, each member of the congress having a private key share xi to be used in a threshold signature scheme used to generate a valid signature. As a result of the private key Sk being lost, the congress accesses the one or more digital assets on behalf of the user in response to the user proving their identity to the congress by providing a recovery password.
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/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/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
49.
COMPUTER-IMPLEMENTED SYSTEM AND METHOD FOR UPDATING A NETWORK'S KNOWLEDGE OF THE NETWORK'S TOPOLOGY
The computer implemented invention provides a method, corresponding systems and arrangement within a network for detecting changes in the topology, ordering those changes by occurrence and constructing a new topology reflecting the changes. The invention addresses problems with keeping the knowledge of the network topology at each network node current, particularly when the network topology is dynamic, i.e., when links fail and recover at arbitrary times. The topology updating is event driven, as it is activated when some change in the network, particularly with nodes and links occurs. Events cause topology changes to be reported to other nodes in the network. Timestamping of messages allows the messages to be correctly applied as the most recent update or discarded. An algorithm is provided that allows each merchant node to maintain a correct view of the network topology despite link and node failures.
A computer-implemented method of alerting users to on-chain events, wherein a primary user is associated with a primary user public key, and wherein the method is performed by an alerting entity and comprises: identifying one or more event transactions, wherein each event transaction comprising respective event data; generating a primary alert transaction, wherein the primary alert transaction comprises a first output locked to the primary user public key, and a second output comprising alert data, and wherein the alert data comprises a respective identifier of each identified event transaction; and transmitting the primary alert transaction to the blockchain network.
H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
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/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
51.
BLOCKCHAIN IMPLEMENTED COUNTING SYSTEM AND METHOD FOR USE IN SECURE VOTING AND DISTRIBUTION
Techniques are presented for the implementation of automated processes, such as device/system control, process control, distributed computing and storage, and event detecting, monitoring and/or counting mechanism. The event may be, for example, a vote, decision or selection which is made by a given entity. A counting solution is presented in which a computing resource, running simultaneously and in parallel to the blockchain, manages a loop-based operation. The computing resource continuously monitors the state of the blockchain as well as any other off-blockchain input data or source. The execution of the loop is influenced by the state of the blockchain. Each iteration of the loop that is executed by the computing resource is recorded in a transaction that is written to the blockchain.
G06F 21/52 - Contrôle des usagers, programmes ou dispositifs de préservation de l’intégrité des plates-formes, p.ex. des processeurs, des micrologiciels ou des systèmes d’exploitation au stade de l’exécution du programme, p.ex. intégrité de la pile, débordement de tampon ou prévention d'effacement involontaire de données
H04L 9/00 - Dispositions pour les communications secrètes ou protégées; 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
G06F 21/64 - Protection de l’intégrité des données, p.ex. par sommes de contrôle, certificats ou signatures
G06N 7/00 - Agencements informatiques fondés sur des modèles mathématiques spécifiques
G06Q 20/38 - Architectures, schémas ou protocoles de paiement - leurs détails
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
Candidate block data is pre-propagated using append messages such that each miner builds append only lists representing the candidate blocks being worked on by those other miners. The append only lists can end up out-of-sync with earlier versions of a candidate block being worked on by mining units at a miner. A block finalize message may be received providing a block solution for a final candidate block and including synchronization data. The synchronization data details one or more transactions appended to the append only list associated with the winning miner are not included in the final candidate block for which the block solution was found, enabling the receiving miner to remove those one or more transactions from the append only list associated with the winning miner to produce a final append only list and construct and validate a solved block from the final append only list.
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é
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.
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.
The invention relates to distributed ledger technologies such as consensus-based blockchains. Computer-implemented methods for locking and unlocking transaction inputs and outputs are described. The invention is implemented using a blockchain network. A group of entities form a group in with membership may be proven using an accumulation tree. A variety of methods are described for generating the accumulation tree, including methods that use a central authority and methods that use a decentralized protocol in place of the central authority. In various implementations, parties are able to unlock transaction outputs that are based on group membership without revealing their identity generally.
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
56.
MALLEABILITY OF TRANSACTIONS FOR INCLUSION IN A BLOCKCHAIN
A method of recording a target transaction in a blockchain, comprising: obtaining an updated version of the target transaction, being updated relative to a pre-existing first version; and instead of the first version, sending the updated version to be propagated through a network of nodes to be recorded in the blockchain. The target transaction comprises an input comprising an unlocking script and a pointer to an output of a first transaction, the output of the first transaction comprising a locking script specifying a plurality of alternative conditions for unlocking that output. The unlocking script of the first version of the target transaction is configured to unlock the first output of the first transaction based on a first of said alternative conditions, and the unlocking script of the updated version is configured to unlock it based on a second one of said alternative conditions.
H04L 67/1095 - Réplication ou mise en miroir des données, p.ex. l’ordonnancement ou le transport pour la synchronisation des données entre les nœuds du réseau
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
A method for enabling a verifying party to verify an identity of a target party or device. The method comprises, in a set-up phase: storing, in a data store, a respective piece of response data for each of a set of one or more responses resulting from a setting-up party inputting a respective set of one or more challenges into a PUF module comprising a physically unclonable function, PUF, to generate the one or more responses based on the PUF; and storing an indication of the set of challenges in the data store. The indication does not comprise a value of each of the challenges in the set, but rather a master challenge from which the set of challenges is derivable by applying a derivation function to the master challenge.
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é
58.
COMPUTER-IMPLEMENTED SYSTEM AND METHOD FOR PROPAGATION AND COMMUNICATION OF DATA IN A NETWORK SUCH AS A BLOCKCHAIN NETWORK
A method of propagating data packets in a network of nodes is disclosed. The method, implemented at one of the nodes, includes: generating at least one data packet of a first type; collecting a set of data packets of the first type during a first time period, the set including the at least one generated data packet and one data packet of the first type received from one or more first nodes in the network; and for each data packet in the set: randomly select two or more neighbouring nodes connected to said one of the nodes; transmit, to each of the two or more selected neighbouring nodes: the data packet, wherein the two or more selected neighbouring nodes are configured to relay the data packet to one or more second nodes in the network using a mode of data propagation arbitrarily selected for that neighbouring node.
H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
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
59.
IMPLEMENTING LOGIC GATE FUNCTIONALITY USING A BLOCKCHAIN
The invention presents a solution in which blockchain transactions are created to implement the functionality of a logic gate. The invention may be implemented on the Bitcoin platform or an alternative blockchain platform. The transaction includes a locking script which comprises instructions to process Boolean inputs and implement the functionality of a logic gate, such as the XOR gate. When the script is executed, the inputs will be evaluated, using computing agents, to provide an output of TRUE or FALSE, and the output will be subsequently provided to an unlocking script associated with a second transaction attempting to spend the output associated with the locking script. The second transaction is transmitted to the blockchain network for validation and, if determined to be valid (evaluated to a TRUE output), it will be written to the blockchain. Thus, the locking script of the first transaction provides the functionality.
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/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
G06F 9/30 - Dispositions pour exécuter des instructions machines, p.ex. décodage d'instructions
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 9/22 - Aménagements de microcommande ou de microprogramme
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é
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
62.
COMPUTER-IMPLEMENTED METHODS AND SYSTEMS FOR VALIDATING TOKENS FOR BLOCKCHAIN-BASED CRYPTOCURRENCIES
A first token associated with a first set of metadata and a first quantity of an asset is minted. A condition for triggering a process to duplicate the first token is determined to have been fulfilled. A second token that duplicates the first token is minted by at least causing a token minting transaction to be recorded to a peer-to-peer distributed ledger, wherein the token minting transaction associates a second set of metadata with the second token with the second set of metadata matching the first set of metadata, allocates the first quantity of the asset to the second token, and indicates that the first quantity of the asset has been transferred to the second token and that the first token is no longer valid. Aa identifier for the second token is provided, where the identifier is usable to determine that the second token is valid.
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
G06F 21/30 - Authentification, c. à d. détermination de l’identité ou de l’habilitation des responsables de la 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
G06F 21/64 - Protection de l’intégrité des données, p.ex. par sommes de contrôle, certificats ou signatures
G06Q 40/00 - Finance; Assurance; Stratégies fiscales; Traitement des impôts sur les sociétés ou sur le revenu
G06Q 20/38 - Architectures, schémas ou protocoles de paiement - leurs détails
Distributing first shares of a first secret value, known to a first participant, to second participants. The first shares encrypted using a private key and a public key that is elliptic curve generator point multiplied by the private key. A first threshold number of first shares being required to enable a second participant to determine the first secret value. A second share of a second secret value is received from each of the second participants. The second shares encrypted using a private key and a public key that is an elliptic curve generator point multiplied by the private key. A second threshold number of second shares being required to enable a participant other than the second participant to determine the second secret value. A third share of a third secret value formed from the second shares. A third threshold number of third shares being required to enable the third secret value to be determined.
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/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
A computer-implemented access method is provided. The method comprises the steps of: (i) submitting, to a blockchain (such as the Bitcoin blockchain), an access blockchain transaction addressed to a derived public key derived at least in part from a secret value and a public key; (ii) generating a verification public key based at least in part on the secret value and the public key; (iii) comparing the derived public key and the verification public key; and (iv) based on the comparison of step (iii): (a) allocating the at least one of the derived and verification public key as a further public key for verifying a further derived public key; and (b) granting access to a resource associated with at least one of the secret value and the derived public key.
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/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/14 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité utilisant plusieurs clés ou algorithmes
65.
SECURE PROVISION OF UNDETERMINED DATA FROM AN UNDETERMINED SOURCE INTO THE LOCKING SCRIPT OF A BLOCKCHAIN TRANSACTION
The invention relates to distributed ledger technologies such as consensus-based blockchains. Computer-implemented methods for locking blockchain transactions are described. The invention is implemented using a blockchain network. A first locking script is configured in a blockchain network. The first locking script is executed together with a first unlocking script, based on data obtained by executing the first unlocking script and a set of constraints. Verification that a first set of field values of the unlocking blockchain transaction is obtained by executing the first unlocking script and the set of constraints against the unlocking blockchain transaction. Validating the unlocking blockchain transaction according to the set of constraints. Finally, making the locking blockchain transaction available to one or more nodes of the blockchain network.
G06Q 20/38 - Architectures, schémas ou protocoles de paiement - leurs détails
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
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/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/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/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
66.
DUPLICATING SMART CONTRACTS WITH TERMINATION CONDITION
The invention relates to distributed ledger technologies such as consensus-based blockchains. Computer-implemented methods for locking and unlocking blockchain transactions are described. The invention is implemented using a blockchain network. A first unlocking script of the unlocking blockchain transaction is configured to unlock a first locking script, wherein the first locking script is configured, when executed together with the first unlocking script, to determine, based on the first locking script and a constraint for verifying the unlocking blockchain transaction. Verifying the unlocking blockchain transaction is based on a set of constraints and corresponding field of the unlocking blockchain transaction, wherein data is based on the set of constraints. Providing data at the corresponding field of the unlocking blockchain transaction. Finally, making the unlocking blockchain transaction available to one or more nodes of a blockchain network.
G06Q 20/38 - Architectures, schémas ou protocoles de paiement - leurs détails
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
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/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/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/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
A computer-implemented method of generating keys of a hierarchical key structure, wherein the method is performed by a key generator and comprises: obtaining a child key derivation path, wherein the child key derivation path comprises a sequence of elements, wherein the sequence of elements comprises one or more sets of one or more elements, each set of elements being generated based on a respective data item of a data path, and wherein each element in the sequence corresponds to a respective position of key in a respective level of the key structure; and generating one or more child keys based on the child key derivation path, wherein each respective child key is generated based on a respective element in the sequence at the respective position and of the respective level corresponding to that respective element.
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é
A computer-implemented method of executing blockchain transactions, wherein a first blockchain transaction comprises a first output, wherein the first output comprises a first locking script comprising a version opcode, wherein a second transaction comprises a first input that references the first output of the first transaction and comprises a first unlocking script, and wherein the method is performed by a blockchain node and comprises: executing the first locking script together with the first unlocking script, wherein said execution comprises, upon executing the version opcode, obtaining a node protocol version number of the blockchain node, and outputting the node protocol version number, wherein the node protocol version number is associated with a particular functionality that the blockchain node is configured to execute.
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é
69.
SECURE PROVISION OF UNDETERMINED DATA FROM AN UNDETERMINED SOURCE INTO THE LOCKING SCRIPT OF A BLOCKCHAIN TRANSACTION
The invention relates to distributed ledger technologies such as consensus-based blockchains. Computer-implemented methods for a self-replicating smart contract with termination condition are described. The invention is implemented using a blockchain network. A first transaction including a first script is validated by a node in the blockchain network including a third script, and a second set of field values of a second transaction, wherein the second set of field values includes a copy of the second script causing to obtain the second transaction. The second transaction includes a second script, validated by a node upon determining that a termination condition is unfulfilled, at least obtaining the third script from the first set of field values, and determining that the copy of the second script matches the third script. The first transaction is validated as a result of execution of the first script and the second script.
G06Q 20/38 - Architectures, schémas ou protocoles de paiement - leurs détails
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
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/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/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/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
70.
METHODS AND SYSTEMS FOR COMPRESSING TRANSACTION IDENTIFIERS
Methods and systems for compressing transaction identifiers by a mining node in a blockchain network. The method may include receiving transaction data regarding a blockchain transaction having a transaction identifier; appending the transaction identifier to a global transaction identifier list at a position associated with an index; generating a fixed-length prefix value from the transaction identifier using a function, wherein the function has an equiprobable distribution of results across a range of fixed-length prefix values; identifying a memory location associated with the fixed-length prefix value and storing the index in a data structure at the memory location; truncating the transaction identifier to a shortened transaction identifier; and outputting the fixed-length prefix value concatenated with the shorted transaction identifier as a compressed transaction identifier.
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
COMPUTER-IMPLEMENTED SYSTEMS AND METHODS TO ENABLE COMPLEX FUNCTIONALITY ON A BLOCKCHAIN WHILE PRESERVING SECURITY-BASED RESTRICTIONS ON SCRIPT SIZE AND OPCODE LIMITS
Techniques are presented to decompose the functionality of a blockchain transaction script into several chunks or functional parts, and to use the output of a chunk as the input of the next chunk. Advantageously, this allows the blockchain to be used for ever complex tasks and computations while minimizing script size, and also provides a novel architecture for the distributed execution of computational processes. A presented method obtains data from at least one data storage resource, the data comprising a first unlocking script corresponding to a first blockchain transaction and a second unlocking script corresponding to a second blockchain transaction, and controls a task or computation based on the data obtained as a result of the first and second blockchain transactions.
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
G06F 9/46 - Dispositions pour la multiprogrammation
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/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
G06Q 20/38 - Architectures, schémas ou protocoles de paiement - leurs détails
G06F 9/448 - Paradigmes d’exécution, p.ex. implémentation de paradigmes de programmation
72.
BLOCKCHAIN-IMPLEMENTED SECURITY SYSTEMS AND METHODS FOR BLINDED OUTCOME SELECTION
First secrets are generated by a first party. The first secrets are encrypted by the first party utilizing elliptic curve cryptography to obtain data points representing encrypted versions of the first secrets. A message, which includes the data points, is sent by the first party to a second party. A first transaction created by the second party is verified by the first party ensuring that cryptographic locks generated by the second party are based on allowed linear combinations of encrypted versions of the first secrets and encrypted versions of second secrets generated by the second party. One secret from the first secrets is randomly selected by the first party. Another message, which includes the one secret, is sent by the first party to the second party such that the second party can generate a cryptographic key that unlocks a cryptographic lock of the cryptographic locks generated by the second party.
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/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
73.
CRYPTOGRAPHIC METHOD AND SYSTEM FOR SECURE EXTRACTION OF DATA FROM A BLOCKCHAIN
Techniques are presented for cryptographic secure processing, transmission and exchange of data. A computer implemented method is presented comprising associating one or more elements of a structure with a cryptographic sub-key derived from another cryptographic key, wherein the structure is formed by elements within a hierarchical entity, and the hierarchical entity has a plurality of elements organized or associated in a hierarchical relationship; extracting or copying, from a blockchain transaction, data comprising or relating to the cryptographic sub-key associated with the one or more elements; and transmitting the extracted data to a non-blockchain based computer system associated with the hierarchical entity.
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
G06Q 20/38 - Architectures, schémas ou protocoles de paiement - leurs détails
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
A computer-implemented method of sharing blockchain transactions, wherein the method is performed by a first party and comprises: receiving, from a second party over a QUIC connection, a payment destination, wherein the payment destination comprises a public key and/or a public-key-based address; and sending a transaction to the second party over the QUIC connection, wherein the transaction comprises an output locked to the payment destination.
G06Q 20/38 - Architectures, schémas ou protocoles de paiement - leurs détails
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
A computer-implemented method of providing proof that a data item of a blockchain transaction exists on a blockchain, wherein the method comprises: obtaining, from a requesting party, target data item of a target blockchain transaction; obtaining the target blockchain transaction; obtaining a target Merkle proof for the target blockchain transaction, wherein a corresponding target Merkle root is contained within a block of the blockchain, and wherein obtaining the target Merkle proof comprises calculating an index of a target transaction identifier of the target blockchain transaction within a leaf layer of a corresponding target Merkle tree; and outputting at least the target Merkle proof for use by the requesting party as proof that the target data item exists as part of the target blockchain transaction on the blockchain.
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
G06F 16/22 - Indexation; Structures de données à cet effet; Structures de stockage
A computer-implemented method of deriving keys of a hierarchical key structure, wherein the method is performed by a first party and comprises: generating a target index of a target child key, wherein the target index is generated based on a first result of inputting at least a target message to a first hash function; and deriving the target child key of a level in a hierarchy of a key structure based on a) a parent key of a preceding level in the hierarchy, and b) a second result of inputting at least i) the parent key, and ii) the target index, to a second hash function.
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
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.
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
78.
METHODS AND SYSTEMS FOR DISTRIBUTING AND VALIDATING ALERTS IN A DISTRIBUTED COMPUTING SYSTEM
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.
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
79.
COORDINATING PEER-TO-PEER DATA TRANSFER USING BLOCKCHAIN
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.
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.
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.
A computer-implemented method of providing proof that a blockchain transaction exists on a blockchain, wherein the method is performed by a Merkle proof entity configured to store a set of transaction identifiers of respective blockchain transactions but not to publish new blockchain blocks to the blockchain network, and wherein the method comprises: obtaining a target transaction identifier of a target blockchain transaction, wherein the target transaction identifier forms part of the stored set of transaction identifiers; obtaining a target Merkle proof for the target blockchain transaction, wherein a corresponding target Merkle root is contained within a blockheader of the blockchain; and outputting the target Merkle proof for use by the requesting party as proof that the target blockchain transaction exists on the blockchain.
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
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.
Techniques are provided for causing an injection of a serialized previous transaction into a locking script. A first script, of a first transaction to be validated, causes a node to at least obtain a first set of field values corresponding to the first transaction and obtain a second set of field values corresponding to a particular transaction. A second script, included in a second transaction, causes the node to at least obtain the first set of field values and the second set of field values of the particular transaction supplied as a result of execution of the first script, extract a transaction identifier from the first set of field values, and determine, based at least in part on the second set of field values, that the particular transaction corresponds to the transaction identifier. The first transaction is validated by executing the first script and the second script.
G06Q 20/38 - Architectures, schémas ou protocoles de paiement - leurs détails
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
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/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/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/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
85.
CHALLENGE-RESPONSE PROTOCOL BASED ON PHYSICALLY UNCLONABLE FUNCTIONS
A computer-implemented method comprising one or more instances of a challenge-response mapping operation. The challenge-response mapping operation comprises: from a submitting party, receiving challenge data comprising a secondary challenge, from among a set of multiple possible secondary challenges; inputting a primary challenge into a physically unclonable function, PUF, to generate a corresponding primary response; inputting the received secondary challenge and the generated primary response into a deterministic transform function in order to generate a secondary response, being a response to the secondary challenge, the transform function being a function of the secondary challenge and the primary response; and outputting response data comprising the secondary response or data derived therefrom.
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é
The invention provides a method and corresponding system for controlling a transfer of an asset via a blockchain. It can also be used to control and record the ownership of an asset represented on the blockchain without the need for a separate registry of ownership. The ownership and transfers thereof can be handled and recorded without the need for knowledge of the parties involved or their identities. According to one embodiment, the method comprises steps of finding an anchor transaction to begin traversal of a transaction history, traversing the transaction history to determine a current unspent transaction output (UTXO) set, and creating a distributed transaction associated with an asset for the determined UTXO. Next, the distribution transaction is broadcasted and re-directed, by an asset owner, to a select private key of the owner. After the re-directing the distribution transaction, the asset is published on the blockchain.
G06Q 20/38 - Architectures, schémas ou protocoles de paiement - leurs détails
G06Q 20/10 - Architectures de paiement spécialement adaptées aux systèmes de banque à domicile
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
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/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/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 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
H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
87.
SYSTEM AND METHOD FOR TRANSFERRING RESOURCES USING A BLOCKCHAIN
A computer-implemented includes sending a public key associated with a particular node in a cyclically-ordered set of nodes participating in a blockchain network to an initiator node; receiving, by the particular node from a node immediately previous to the particular node in the cyclically-ordered set, a first value based on public keys associated with each node from the particular node through to the initiator node; determining a locking value based on the first value and the public key associated with the particular node; and preparing using the locking value, a transaction arranged to transmit control of a resource from a source address associated with the particular node to a receiving address of a node immediately subsequent to the particular node. The control of the resource is to be transmitted responsive to satisfaction of an execution condition including supply of an unlocking value corresponding to the locking value.
G06Q 20/38 - Architectures, schémas ou protocoles de paiement - leurs détails
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
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é
88.
SYSTEM AND METHOD FOR SECURELY SHARING CRYPTOGRAPHIC MATERIAL
Systems and methods described herein relate to techniques in which multiple parties each generate and exchange quantities that are based on a shared secret (e.g., powers of the shared secret) without exposing the shared secret. According to a protocol, two or more parties may exchange sets of elliptic curve points generated over polynomials that can be used, by each of the two or more parties, to determine a power of a shared secret. The protocol may be utilised as part of determining parameters for a smart contract that is broadcast to a blockchain network (e.g., Bitcoin). Based on the protocol, an additional party (e.g., a third party different from the two or more parties) may perform a computational task such as execution of the smart contract.
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
G06F 17/17 - Opérations mathématiques complexes Évaluation de fonctions par des procédés d'approximation, p.ex. par interpolation ou extrapolation, par lissage ou par le procédé des moindres carré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/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/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/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
89.
PHYSICALLY UNCLONABLE FUNCTIONS STORING RESPONSE VALUES ON A BLOCKCHAIN
A method for enabling a verifying party to verify an identity of a target party or device. The method comprises, in a set-up phase: inputting of each of a set of one or more challenges into a PUF module comprising a physically unclonable function, PUF, to generate a respective one of a set of responses from each challenge; and causing to be stored, on a blockchain, a respective piece of response data for each of the set of one or more responses generated by the PUF module. The piece of response data for each response comprises the respective response or data derived therefrom. The pieces of response data are stored in one or more storage transactions recorded on the blockchain, thereby making at least one of the pieces of response data available to the verifying party for verifying the identity of the target in a subsequent verification phase.
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é
A technique for locking a blockchain transaction based on undetermined data, using a blockchain network. A locking node may include a locking script in a blockchain transaction to lock a digital asset. The locking script includes a public key for a determined data source and instructions to cause a validating node executing the locking script to verify the source of data provided in an unlocking script by: a) generating a modified public key based on the public key for the determined data source and based on data defined in the unlocking script; and b) evaluating a cryptographic signature in the unlocking script based on the modified public key. The blockchain transaction containing the locking script is sent by the locking node to the blockchain network. The lock may be removed using a cryptographic signature generated from a private key modified based on the data.
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 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
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
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/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
91.
PHYSICALLY UNCLONABLE FUNCTIONS STORING RESPONSE VALUES ON A DATA STORE
A method for enabling a verifying party to verify an identity of a target comprising a target party or device. The method comprises, in a set-up phase, by a party other than the verifying party: inputting a set of one or more challenges into a PUF module comprising a physically unclonable function, PUF, in order to generate a respective set of one or more responses based on the PUF; and storing a respective response data record for each of the set of responses in a data store external to any equipment of the target party or verifying party, the data store either being part of third party computer equipment or being a public peer-to-peer publication medium. The response data records are thus made available to the verifying party to verify the identity of the target in a subsequent verification phase.
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é
The invention provides a blockchain-implemented control method and corresponding system(s). The invention may control access to an internet-enabled resource such as an IoT device that is provided with computing capabilities enabling it to communicate with other computer-based resources and interact with a distributed ledger such as a blockchain. In one embodiment, the invention provides a method for controlling the use of an internet-enabled resource comprising providing a first blockchain transaction comprising at least one output which is redeemable only by provision of at least: i) a secret value selected by a user; and ii) a signature associated with a resource provider; sending use-related information to the resource; generating a second blockchain transaction requesting at least the secret value; and modifying the second blockchain transaction to include the secret value.
G06Q 20/14 - Architectures de paiement spécialement adaptées aux systèmes de facturation
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
A computer-implemented method of authorising a payment by a target party to a verifying party. The method comprises, by the verifying party: performing a payment verification to verify a source of funds of the target party; and performing an identity verification to verify an identity of the target party. The identity verification comprises accessing response data stored in a data store in association with the identity of the target party, the data store being implemented in third party computer equipment of a trusted third party or on a peer-to-peer publication medium, wherein the response data comprises either a) a stored instance of a response to a challenge, or b) an attestation comprising a transformation of the response. The payment is authenticated on condition that the outputs of both the payment verification and identity verifications is true.
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
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/20 - Systèmes de réseaux présents sur les points de vente
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.
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é
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.
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
96.
MESSAGING PROTOCOL FOR COMPACT SCRIPT TRANSACTIONS
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.
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
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.
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é
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.
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é
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.
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é
100.
METHODS & SYSTEMS FOR SYNCHRONISING AND CONTROLLING STATE WITHIN COMPUTER-IMPLEMENTED ENVIRONMENTS
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.
