Abstract: The invention comprises a solution for securing an output (UTXO) in a single blockchain (e.g. Bitcoin) transaction (TX) so that it can only be unlocked by an authorised party at an allowed time, and in accordance with external data supplied to the transaction's locking script. The invention may comprise two steps which are implemented within a redeem script provided within the UTXO's locking script: 1) Calculation of a time-related value (which we will call Tsupplied) using the external data provided; and 2) use of the calculated Tsupplied value in a time lock technique to ensure that unlocking occurs at a time pre-determined time. The invention allows external data to be introduced into the time lock control of a transaction on the blockchain. It also includes a technique for combining absolute and relative time locks (e.g. CLTV and CSV as known in the Bitcoin protocol).

Abstract: A solution for controlling access to a resource such as a digital wallet implemented using a blockchain. Use of the invention during set-up of the wallet can enable subsequent operations to be handled in a secure manner over an insecure channel. An example method comprises splitting a verification element into multiple shares; determining a common secret at multiple nodes in a network; and using the common secret to transmit a share of the verification element between nodes. The shares can be split such that no share is sufficient to determine the verification element and can be stored at separate locations. Upon share unavailability, the share can be retrieved a location accessibility. For safe transmission of the share(s), the common secret is generated at two different nodes independently and used to generate an encryption key for encrypting at least one share of the verification element to be transmitted securely.

Abstract: A method (300) and system (1) of determining a common secret for two nodes (3, 7). Each node (3, 7) has a respective asymmetric cryptography pair, each pair including a master private key and a master public key. Respective second private and public keys may be determined based on the master private key, master public key and a deterministic key. A common secret may be determined at each of the nodes based on the second private and public keys. In one example, a node (3, 7) may determine the common secret based on (i) a second private key based on the node's own master private key and the deterministic key; and (ii) a second public key based on the other node's master public key and the deterministic key. The invention may be suited for use with, but not limited to, digital wallets, blockchain (e.g. Bitcoin) technologies and personal device security.

Abstract: A computer-implemented method and system for encrypting an executable of a computer software for installation using a distributed hash table and a peer-to-peer distributed ledger. This may be the Bitcoin blockchain or an alternative implementation. The method may include determining a generator value.

Abstract: The present disclosure is directed to an agitating system having a sub-hopper configured to receive particulate material, an agitator disposed within the sub-hopper and configured to promote movement of the particulate material through the sub-hopper, and a deflector configured to block a portion of the particulate material from exerting a force onto the agitator as the particulate material flows through the sub-hopper. The deflector is positioned such that the agitator extends beyond a first distal edge and a second distal edge of the deflector along a lateral axis.

Abstract: The invention provides mechanisms for enhancing the security and protection of a computer-based system or network. It relates, in part, to the use of a decoy (which may be termed “honeypot” or “honeynet”) for collecting attacker-related data, and/or diverting malicious behaviour away from legitimate resources. In one embodiment, the invention provides a method comprising the steps of receiving, processing and logging network traffic data of a plurality of users, where the network traffic is received from a plurality of participating users; determining an attacker profile from the network traffic data; determining a honeypot or honeynet configuration based on the attacker profile; and upon receipt of a valid information request from a user of the plurality of users, providing the determined attacker profile and configuration to the user.

Abstract: The present disclosure relates to highly secure, high speed encryption methodologies suitable for applications such as media streaming, streamed virtual private network (VPN) services, large file transfers and the like. For example, encryption methodologies as described herein can provide stream ciphers for streaming data from, for example, a media service provider to a plurality of users. Certain configurations provide wire speed single use encryption. The methodologies as described herein are suited for use with blockchain (e.g. Bitcoin) technologies.

Abstract: A method (400) of encrypting data at an electronic device (3) where the electronic device is associated with a key device (5). Each device is associated with an asymmetric cryptography pair, each pair including a first private key and a first public key. Respective second private and public keys may be determined based on the first private key, first public key and a deterministic key. A secret may be determined based on the second private and public keys. The data at the electronic device (3) may be encrypted using the determined secret or an encryption key that is based on the secret. Information indicative of the deterministic key may be sent to the key device (5) where the information may be stored.

Abstract: A method of sharing a secret value is disclosed. The method comprises distributing respective first shares of a first secret value, known to a first participant (Pi), to a plurality of second participants (Pj?i), wherein said first shares are encrypted by means of at least one private-public key pair comprising a private key and a public key being an elliptic curve generator point multiplied by the private key and wherein a first threshold number of first shares is required in order to enable a second participant to determine the first secret value.

Abstract: A method and devices for securely and privately generating a threshold vault address and distributed individual key shares reliant upon individually selected polynomial functions, without revealing the key shares and without ever reconstructing the private key. A digital asset stored at the threshold vault address may be used as an input to a transaction through generating a digital signature corresponding to the threshold vault address. Methods and devices are described for collaboratively generating the digital signature without reconstructing the private key or revealing individual key shares. Methods and devices are described for refreshing the distributed private key shares.

Abstract: The invention provides methods and systems which enable additional functionality to be inserted into blockchain scripts with ease and in an effective and manner. According to one embodiment, the invention provides a blockchain-implemented method comprising the steps of arranging a plurality or selection of scripting language primitives to provide, upon execution, the functionality of a high-level scripting language primitive, wherein the scripting language is associated with a blockchain protocol; inserting the plurality of scripting language primitives at least once into a script; and inserting the script into blockchain transaction (Tx). The high-level scripting language primitive may perform, for example, an arithmetic operation such as multiplication or division. The scripting language primitives may be called op-codes, words or commands, and are native to the scripting language. The scripting language may be Script, and the blockchain protocol may be a version of the Bitcoin protocol.

Abstract: The invention provides a computer-implemented method (and corresponding system) for generating a blockchain transaction (Tx). This may be a transaction for the Bitcoin blockchain or another blockchain protocol. The method comprises the step of using a software resource to receive, generate or otherwise derive at least one data item; and then insert, at least once, at least one portion of code into a script associated the transaction. Upon execution of the script, the portion of code provides the functionality of a control flow mechanism, the behaviour of the control flow mechanism being controlled or influenced by the at least one data item. In one embodiment, the code is copied/inserted into the script more than once. The control flow mechanism can be a loop, such as a while or for loop, or a selection control mechanism such as a switch statement. Thus, the invention allows the generation of a more complex blockchain script and controls how the script will execute when implemented on the blockchain.

Abstract: A solution for controlling access to a resource such as a digital wallet implemented using a blockchain. Use of the invention during set up of the wallet can enable subsequent operations to be handled in a secure manner over an insecure channel. An example method comprises splitting a verification element into multiple shares; determining a common secret at multiple nodes in a network; and using the common secret to transmit a share of the verification element between nodes. The shares can be split such that no share is sufficient to determine the verification element and can be stored at separate locations. Upon share unavailability, the share can be retrieved a location accessibility. For safe transmission of the share(s), the common secret is generated at two different nodes independently and used to generate an encryption key for encrypting at least one share of the verification element to be transmitted securely.

Abstract: A ventilation closure system includes a damper, a shape memory alloy actuator, and a heating device. The shape memory alloy actuator is coupled to the damper. The shape memory alloy actuator has a first state in which the damper is positioned to permit airflow in the duct and has a second state in which the damper is positioned to obstruct the airflow in the duct. The shape memory alloy actuator is configured to change from the first state to the second state responsive to the shape memory alloy actuator attaining a first temperature responsive to heat released by an exothermic reaction in a compartment associated with the duct. The heating device is configured to heat the shape memory alloy actuator to maintain the damper in a position that obstructs the airflow in the duct.

Abstract: A method (300) and system (1) of determining a common secret for two nodes (3, 7). Each node (3, 7) has a respective asymmetric cryptography pair, each pair including a master private key and a master public key. Respective second private and public keys may be determined based on the master private key, master public key and a deterministic key. A common secret may be determined at each of the nodes based on the second private and public keys. In one example, a node (3, 7) may determine the common secret based on (i) a second private key based on the node's own master private key and the deterministic key; and (ii) a second public key based on the other node's master public key and the deterministic key. The invention may be suited for use with, but not limited to, digital wallets, blockchain (e.g. Bitcoin) technologies and personal device security.

Abstract: A computer-implemented method (900) and system (1) for verifying the integrity of a computer software for installation using a distributed hash table (13) and a peer-to-peer distributed ledger (14). This may be the Bitcoin blockchain or an alternative implementation. The method includes determining (910) a metadata associated with a transaction record stored on the peer-to-peer distributed ledger (14). An indication of an entry stored on the distributed hash table (13) may be determined (920) from the metadata. The method further includes determining (930) a third hash value based on the computer software and determining (940) a fourth hash value from the entry on the distributed hash table (13). The method further includes comparing (950) the third hash value and the fourth hash value and verifying (960) the integrity of the computer software based on the comparing of the third hash value and the fourth hash value.

Abstract: Implementations disclose methods and systems for facilitating an automated user login into a first application hosted by a first-screen device. A method includes detecting, by a second-screen device, a message transmitted by the first-screen device over a network; determining, based on the message, that the first application hosted by the first-screen device is requesting user authentication for the automated user login; presenting, via a second application hosted by the second-screen device, a prompt for user input indicating user acceptance of the automated user login; receiving the user input indicating the user acceptance of the automated user login; and responsive to the user input, transmitting an authentication code from the message to the server device to perform the user authentication for the automated user login into the first application.

Abstract: A process for recovering phosphorus from phosphoritic materials in a top submerged lance furnace or a fuming furnace is disclosed. The process employs a mixture of combustion agents to produce reducing conditions in the slag bath and post-combustion oxidising conditions in the headspace of the furnace. The process involves smelting a mixture of a phosphoritic material and a carbonaceous material in the furnace to produce a molten slag in the slag bath and phosphorus vapour in the headspace, wherein the post-combustion oxidising conditions in the headspace favours retention of ferrous oxides in the molten slag to minimise deportment of phosphorus to a ferro-phosphorus alloy; The phosphorus vapour in the headspace is subsequently oxidised to produce phosphorus pentoxide, which is subsequently passed from the headspace to a reactor to recover a phosphoric acid solution.

Abstract: The disclosure relates to a blockchain-implemented system and method of controlling the transmission and/or distribution of digital content. In an illustrative embodiment, the blockchain is the Bitcoin blockchain. The first user (5) is associated with a deposit quantity of cryptocurrency at a common address (23), wherein to spend from the common address requires signatures of both a first private key of the first user (5) and a second private key of the second user (7). The system (1) comprises a first node (15) and a second node (17).

Abstract: A computer-implemented method (900) and system (1) for verifying the integrity of a computer software for installation using a distributed hash table (13) and a peer-to-peer distributed ledger (14). This may be the Bitcoin blockchain or an alternative implementation. The method includes determining (910) a metadata associated with a transaction record stored on the peer-to-peer distributed ledger (14). An indication of an entry stored on the distributed hash table (13) may be determined (920) from the metadata. The method further includes determining (930) a third hash value based on the computer software and determining (940) a fourth hash value from the entry on the distributed hash table (13). The method further includes comparing (950) the third hash value and the fourth hash value and verifying (960) the integrity of the computer software based on the comparing of the third hash value and the fourth hash value.