Granted Patent B2

US 12,217,224 · App. 18/389,584 · Granted Feb 4, 2025

Inventors: Craig Steven Wright (London, GB); Stephane Savanah (London, GB)

Assignee: NCHAIN LICENSING AG

G06Q20/0658G06Q20/3829H04L9/0637H04L9/0643H04L9/0841H04L9/14H04L9/3066H04L9/3073G06Q2220/00H04L9/50H04L2209/56

Abstract

Claims (15)

1. A method of securely transmitting a output script or information associated with a payroll and a user between a first node and a second node with symmetric-key algorithm, wherein the method comprises:

determining a symmetric-key based on a common secret, wherein the symmetric key is determined using a generator value, wherein the generator value is used to determine the 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, and wherein the second node second private key forms a cryptographic pair with a second node second public key, wherein the second node second public key is based on a second node second master public key and the generator value;

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, over a communications network, the encrypted output script or encrypted information associated with the payroll and the second node from the first node to the second node.

2. The method of claim 1 , wherein the first node second private key forms a cryptographic pair with a first node second public key.

3. The method of claim 2 , wherein the first node second public key is determined based on a first node master public key and the generator value.

4. The method of claim 1 , wherein a first token is associated with a quantity of cryptocurrency.

5. The method of claim 4 , wherein the first token comprises information associated with employment rights and benefits of the first node or second node.

6. The method of claim 4 , wherein the first token is transferred from the first node to the second node.

7. The method of claim 1 , wherein the generator value is determined based on a string associated with a first node.

8. The method of claim 1 , wherein the generator value is determined based on a Unix time and a nonce.

9. A non-transitory computer-readable medium comprising machine-readable instructions that when executed by a processor, cause the processor to perform the method of claim 1 .

10. A device comprising:

one or more processors; and

memory storing computer executable instructions that are executable by the one or more processors to cause the device to perform the method of claim 1 .

Assignments (4)

Priority Claims (4)

Continuity (3)

References Cited (400)