Personal device security using cryptocurrency wallets

Information

  • Patent Grant
  • 12294661
  • Patent Number
    12,294,661
  • Date Filed
    Monday, June 6, 2022
    3 years ago
  • Date Issued
    Tuesday, May 6, 2025
    2 months ago
Abstract
A method of encrypting data at an electronic device where the electronic device is associated with a key device. 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 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 where the information may be stored.
Description
TECHNICAL FIELD

The present disclosure relates to a method, a system and a device for encrypting data stored on an electronic device. The present disclosure further relates to a method, a system and a device for decrypting the encrypted data.


BACKGROUND

Cryptography involves techniques for protecting data on a hard disk of an electronic device, for example in the event that the electronic device is lost or stolen. An electronic device may include a laptop computer, a desktop computer, a tablet computer, a mobile communication device and any other form of computing device. The electronic device may be associated with a natural person, a group of people such as employees of a company, a system such as a banking system, etc.


In some cases, the data on a hard disk of the electronic device may be protected by a password, passphrase or a PIN. However, short codes such as 4-8 character PINs can easily be determined by trialling different combinations of characters. Passwords and passphrases may be more secure than PINs. However, the level of security depends on the user memorising a lengthy set of code words or a sentence.


In other cases, a cryptographic key may be used to protect the data on the hard disk of the electronic device. The cryptographic key may be stored on a USB drive which needs to be physically connected to the electronic device to transmit the cryptographic key. However, due to electromagnetic signals that are generated during the transmission of the cryptographic key from the USB drive to the electronic device, the transmitted key may still be obtained by a third party.


Therefore a problem in such cryptographic data protection is the transmission of the secret key to the electronic device.


Any discussion of documents, acts, materials, devices, articles or the like which has been included in the present specification is not to be taken as an admission that any or all of these matters form part of the prior art base or were common general knowledge in the field relevant to the present disclosure as it existed before the priority date of each claim of this application.


Throughout this specification the word “comprise”, or variations such as “comprises” or “comprising”, will be understood to imply the inclusion of a stated element, integer or step, or group of elements, integers or steps, but not the exclusion of any other element, integer or step, or group of elements, integers or steps.


SUMMARY

A computer implemented method of encrypting data at an electronic device (S), the electronic device being associated with a key device (C), wherein the electronic device is further associated with a first asymmetric cryptography pair having a first electronic device private key (V1S) and a first electronic device public key (P1S), and the key device is associated with a second asymmetric cryptography pair having a first key device private key (V1C) and a first key device public key (P1C); the method comprising:

    • determining, at the electronic device, a deterministic key (DK);
    • receiving, at the electronic device, the first key device public key (P1C) from the key device;
    • determining, at the electronic device, a second electronic device private key (V2S) based on at least the first electronic device private key (V1S) and the deterministic key (DK), and
    • determining, at the electronic device, a second key device public key (P2C) based on at least the first key device public key (P1C) and the deterministic key (DK);
    • determining a secret based on at least the second electronic device private key (V2S) and the second key device public key (P2C);
    • encrypting the data at the electronic device using the determined secret or an encryption key that is based on the determined secret; and
    • sending information indicative of the deterministic key (DK) to the key device where the information can be stored.


The method may further comprise storing, at the key device, the information indicative of the deterministic key (DK).


The deterministic key (DK) may be based on a message (M). The method may comprise a step of generating the message (M) at the electronic device. The method may further comprise determining the deterministic key (DK) based on determining a hash of the message (M). The step of storing information indicative of the deterministic key on the key device may comprise storing the message (M) on the key device.


The method may comprise determining a second electronic device public key (P2S) based on at least the first electronic device public key (P1S) and the deterministic key (DK).


The method may also comprise: sending from the electronic device to the key device, a notice indicative of using a common elliptic curve cryptography (ECC) system with a common generator (G).


The first electronic device public key (P1S) and the first key device public key (P1C) may be based on elliptic curve point multiplication of the respective first electronic device private key (V1S) and first key device private key (V1C) and the common generator (G).


The method may comprise generating the first electronic device private key (V1S) and the first electronic device public key (P1S). For example, the first electronic device private key (V1S) may be generated based on a random integer in an allowable range specified in the common ECC system; and the first electronic device public key (P1S) may be generated based on elliptic curve point multiplication of the first electronic device private key (V1C) and the common generator (G) according to the following formula:

P1S=V1S×G


The second electronic device private key (V2S) may be based on a scalar addition of the first electronic device private key (V1S) and the deterministic key (DK) according to the following formula:

V2S=V1S+DK


The second electronic device public key (P2S) may be based on at least the first electronic device public key (P1S) with elliptic curve point addition to the deterministic key (DK). In a specific example, the second electronic device public key (P2S) may be based on the first electronic device public key (P1S) with elliptic curve point addition to the elliptic curve point multiplication of the deterministic key (DK) and the common generator (G) according to the following formula:

P2S=P1S+DK×G.


The second key device public key (P2C) may be based on at least the first key device public key (P1C) with elliptic curve point addition to the deterministic key (DK). In a specific example, the second key device public key (P2C) may be based on the first key device public key (P1C) with elliptic curve point addition to the elliptic curve point multiplication of the deterministic key (DK) and the common generator (G) according to the following formula:

P2C=P1C±DK×G


The method may comprise determining the encryption key based on the determined secret. For example, the encryption key may be based on the secret and identification information of the electronic device. The identification information may comprise a serial number of the electronic device.


The method may comprise connecting the electronic device with the key device to be in communication with each other. For example, the electronic device may be connected to the key device via a wireless protocol, such as Bluetooth or a communications network, for example the internet, or a local communications network. Alternatively, the electronic device may be connected to the key device by virtue of a wire, for example via cable or a suitable port of the electronic device.


The method may further comprise storing, at a data storage associated with the electronic device, the first key device public key (P1C).


A computer implemented method of decrypting data at an electronic device, the data being encrypted in accordance with the method of encrypting data as described above, the method of decrypted the data comprising:

    • receiving, at the electronic device, the information indicative of the deterministic key (DK), from the key device;
    • determining the secret based on the received information indicative of the deterministic key (DK); and
    • decrypting, at the electronic device, the encrypted data using the secret or the encryption key that is based on the secret.


The method may comprise authenticating the key device. For this, the method may comprise generating, at the electronic device, an authentication message (MA) and sending the authentication message (MA) to the key device.


The method may comprise generating, at the key device, a second asymmetric cryptography pair having a second key device private key (V2C) and a second key device public key (P2C). The second key device private key (V2C) may be based on a deterministic authentication key (DKA) and the first key device private key (V1C). The second key device public key (P2C) may be based on the deterministic authentication key (DKA) and the first key device public key (P1C).


The method may comprise determining the deterministic authentication key (DKA). For example, the deterministic authentication key (DKA) may be determined based on the authentication message (MA), such as by determining a hash of the message (MA).


The method may include generating, at the key device, a signed authentication message (SMA) based on the deterministic authentication key (DKA) and the second key device private key (V2C).


The method may further include: receiving, at the electronic device, the signed authentication message (SMA) from the key device; validating the signed message (SMA) with the second key device public key (P2C); and authenticating the key device based on the result of validating the signed authentication message (SMA).


The method of decrypting the data may comprise requesting, at the electronic device, the information indicative of the deterministic key (DK) from the key device. In embodiments in which the information indicative of the deterministic key (DK) comprises the message (M), in response to receiving the request at the key device, the key device may generate a signed message (SM) based on the message (M) and send the signed message (SM) to the electronic device. The signed message (SM) may be generated based on the message (M) and the first or second key device private key.


The method of decrypting the data may further comprise validating, at the electronic device, the signed message (SM) and retrieving the message (M) such that the secret can be determined, at the electronic device, for decrypting the data.


A computer system for encrypting data at an electronic device, the computer system comprising:

    • the electronic device being associated with a first asymmetric cryptography pair having a first electronic device private key (V1S) and a first electronic device public key (P1S),
    • a key device being associated with a second asymmetric cryptography pair having a first key device private key (V1C) and a first key device public key (P1C);
    • wherein the electronic device comprises a processor configured to:
      • determine a deterministic key (DK);
      • receive the first key device public key (P1C) from the key device;
      • determine a second electronic device private key (V2S) based on at least the first electronic device private key (V1S) and the deterministic key (DK), and
      • determine a second key device public key (P2C) based on at least the first key device public key (P1C) and the deterministic key (DK);
      • determine a secret based on at least the second electronic device private key (V2S) and the second key device public key (P2C); and
      • encrypt the data on the electronic device using the determined secret or an encryption key that is based on the determined secret;
    • wherein information indicative of the deterministic key (DK) is stored on the key device.


The deterministic key (DK) may be based on a message (M). The processor may be configured to generate the message (M). The processor may further be configured to determine the deterministic key (DK) based on determining a hash of the message (M).


The processor may be configured to determine a second electronic device public key (P2S) based on at least the first electronic device public key (P1S) and the deterministic key (DK).


In the system, the electronic device may comprise an interface and the key device may comprise a key device interface to establish communication between the electronic device and the key device. For example, the electronic device may be connected to the key device via a wireless protocol, such as Bluetooth or a communications network, for example the internet, or a local communications network. Alternatively, the electronic device may be connected to the key device by virtue of a wire, for example via cable or a suitable port of the electronic device.


The interface of the electronic device may be configured to send a notice indicative of using a common elliptic curve cryptography (ECC) system with a common generator (G) to the key device interface of the associated key device.


The first electronic device public key (P1S) and the first key device public key (P1C) may be based on elliptic curve point multiplication of respective first electronic device private key (V1S) and first key device private key (V1C) and a generator (G).


The processor may be configured to generate the first electronic device private key (V1S) and the first electronic device public key (P1S). For example, the first electronic device private key (V1S) may be generated based on a random integer in an allowable range specified in the common ECC system; and the first electronic device public key (P1S) may be generated based on elliptic curve point multiplication of the first electronic device private key (V1C) and the common generator (G) according to the following formula:

P1S=V1S×G


The second electronic device private key (V2S) may be based on a scalar addition of the first electronic device private key (V1S) and the deterministic key (DK) according to the following formula:

V2S=V1S+DK


The second electronic device public key (P2S) may be based on at least the first electronic device public key (P1S) with elliptic curve point addition to the deterministic key (DK). In a specific example, the second electronic device public key (P2S) may be based on the first electronic device public key (P1S) with elliptic curve point addition to the elliptic curve point multiplication of the deterministic key (DK) and the common generator (G) according to the following formula:

P2S=P1S+DK×G.


The second key device public key (P2C) may be based on at least the first key device public key (P1C) with elliptic curve point addition to the deterministic key (DK). In a specific example, the second key device public key (P2C) may be based on the first key device public key (P1C) with elliptic curve point addition to the elliptic curve point multiplication of the deterministic key (DK) and the common generator (G) according to the following formula:

P2C=P1C±DK×G


The processor may be configured to determine the encryption key based on the determined secret. For example, the encryption key may be based on the determined secret and identification information of the electronic device. The identification information may comprise a serial number of the electronic device.


The electronic device may comprise a data storage in which the first key device public key (P1C) may be stored.


The key device may comprise a key device data storage for storing at least the information indicative of the deterministic key.


The computer system as described above further configured to decrypt data, the processor of the electronic device being configured to:

    • receive the information indicative of the deterministic key (DK), from the key device;
    • determine the secret based on the information indicative of the deterministic key (DK); and
    • decrypt the data using the determined secret or the encryption key that is based on the determined secret.


The processor may be configured to authenticate the key device. For this, the processor may generate an authentication message (MA) and send the authentication message (MA) to the key device.


The key device may comprise a key device processor that may be configured to generate a second asymmetric cryptography pair having a second key device private key (V2C) and a second key device public key (P2C). The second key device private key (V2C) may be based on a deterministic authentication key (DKA) and the first key device private key (V1C). The second key device public key (P2C) may be based on the deterministic authentication key (DKA) and the first key device public key (P1C).


The key device processor may further be configured to determine the deterministic authentication key (DKA). For example, the deterministic authentication key (DKA) may be determined based on the authentication message (MA), such as by determining a hash of the message (MA).


The key device processor may be configured to generate a signed authentication message (SMA) based on the deterministic authentication key (DKA) and the second key device private key (V2C).


The processor of the electronic device may be configured to: receive the signed authentication message (SMA) from the key device; validate the signed message (SMA) with the second key device public key (P2C); and authenticate the key device based on the result of validating the signed authentication message (SMA).


The processor of the electronic device may request the information indicative of the deterministic key (DK) from the key device. In embodiments in which the information indicative of the deterministic key (DK) comprises the message (M), in response to receiving the request at the key device, the key device processor may generate a signed message (SM) based on the message (M) and send the signed message (SM) to the electronic device. The signed message (SM) may be generated based on the message (M) and the first or second key device private key.


The processor of the electronic device may further be configured to validate the signed message and retrieving the message (M) such that the secret can be determined for decrypting the data.


An electronic device for encrypting data, the electronic device being associated with a key device, wherein the electronic device is associated with a first asymmetric cryptography pair having a first electronic device private key (V1S) and a first electronic device public key (P1S), and the key device is associated with a second asymmetric cryptography pair having a first key device private key (V1C) and a first key device public key (P1C); the electronic device comprising a processing device configured to:

    • determine a deterministic key (DK);
    • receive the first key device public key (P1C) from the associated key device;
    • determine a second electronic device private key (V2S) based on at least the first electronic device private key (V1S) and the deterministic key (DK), and
    • determine a second key device public key (P2C) based on at least the first key device public key (P1C) and the deterministic key (DK);
    • determine a secret based on at least the second electronic device private key (V2S) and the second key device public key (P2C); and
    • encrypt the data on the electronic device using the determined secret or an encryption key that is based on the determined secret;
    • wherein information indicative of the deterministic key (DK) is sent to the key device where it can be stored.


A computer program comprising machine-readable instructions to cause a processing device of an electronic device to implement any one of the methods described above.





BRIEF DESCRIPTION OF DRAWINGS

Examples of the present disclosure will be described with reference to the following figures:



FIG. 1 is a schematic diagram of an example system to encrypt data;



FIG. 2 is a flow chart of computer-implemented methods for registering the electronic device and the key device of FIG. 1;



FIG. 3 is a flow chart of a computer-implemented method for encrypting data at the electronic device of FIG. 1 using a secret;



FIG. 4 is a flow chart of a computer-implemented method of authenticating the key device of FIG. 1;



FIG. 5 is a flow chart of a computer implemented method of decrypting the encrypted data at the electronic device following authentication of the key device; and



FIG. 6 illustrates a schematic of an example processing device.





DESCRIPTION OF EMBODIMENTS
Overview

A method, device and system to encrypt data at an electronic device will now be described.



FIG. 1 illustrates a computer system 1 that includes an electronic device 3 that is in communication with a key device 5. The electronic device 3 has an associated first processing device 23 and the key device 5 has an associated second processing device 25. The electronic device 3 may be a personal electronic device, such as a laptop computer, a desk computer, a tablet computer, a mobile communication device, a computer server or any other computing device capable of processing data. In this particular example as illustrated in FIG. 1, the electronic device 3 is represented by a laptop computer.


The key device 7 may be a further personal electronic device, such as a mobile communication device, a portable memory device, such as a USB drive or the like. In this particular example as illustrated in FIG. 1, the key device 5 is represented by a mobile communication device.


The electronic device 3 may be in communication with the key device 5 via a wireless protocol, such as Bluetooth or a communications network, for example the internet or a local communications network. Alternatively, the electronic device 3 may be physically connected to the key device 5, for example via a USB port of the electronic device or via a cable connection. In this particular example as illustrated in FIG. 1, the electronic device 3 is in communication with the key device 5 via Bluetooth 7.


The electronic device 3 is associated with a first asymmetric cryptography pair having an electronic device master private key (V1S) and an electronic device master public key (P1S). The key device 5 is associated with a second asymmetric cryptography pair having a key device master private key (V1C) and a key device master public key (P1C). The first and second asymmetric cryptography pairs may be generated during registration. Methods of registration 200, 300 performed by the electronic device 3 and the key device 5 will be described in further detail below with reference to FIG. 2. The public key for each device may be shared between the devices 3, 5 publicly, for example via Bluetooth 7.


To encrypt data at the electronic device 3, a secret is determined based on a technique similar to the technique described in the co-filed application no. GB1603117.1 (Feb. 23, 2016), and GB1619301.3 (filed Nov. 15, 2016), both entitled “Determining a common secret for two Blockchain nodes for the secure exchange of information” filed at the Intellectual Property Office by the applicant, which is herein incorporated by reference in its entirety. The secret is determined on a private cryptography key of the electronic device 3 and a public cryptography key of the key device 5. By determining the secret, data can be encrypted using an encryption key (E) that is based on the determined secret. In some examples, the secret may be used as the encryption key (E). One of the advantages of this technique is that there is no need for transmitting or storing the secret or the encryption key (E) on any of the devices 3, 5.


To encrypt the data using the secret at the electronic device 3, the method 400 is performed without communicating any of the private keys between the devices 3, 5 which will be described in further detail with reference to FIG. 3.


In general, the method of encrypting data performed by the electronic device 3 initially includes connecting the electronic device 3 with a key device 5 to communicate with the key device 5. The communication may be established through a wired connection or a wireless connection, such as Bluetooth 7.


The method further includes determining a deterministic key (DK) which may be based on a message (M) created by the electronic device 3. For example, the processing device 23 of the electronic device 3 may generate a message (M) and then uses a standard algorithm to create a hash of the message forming the deterministic key (DK).


The method further includes determining a second electronic device private key (V2S) based on at least the electronic device master private key (V1S) and the deterministic key (DK), and determining a second key device public key (P2C) based on the key device master public key (P1C) and the deterministic key (DK). A secret is then determined based on the second electronic device private key (V2S) and the second key device public key (P2C). Optionally, the method may include determining a second electronic device public key (P2S) based on at least the electronic device master public key (P1S) and the deterministic key (DK).


In a further method step, data can then be encrypted using an encryption key (E) that is based on the determined secret. As mentioned above, the determined secret itself may be used as encryption key (E), or the encryption key (E) may be determined based on the secret. Following encrypting the data on the electronic device, the secret may be erased and only the deterministic key (DK) or the message (M) may be sent to the key device 5 where it can be securely stored. The deterministic key (DK) or the message (M) stored on the key device 5 can subsequently be used to decrypt the encrypted data.


It will be appreciated that the data to be encrypted/decrypted may comprise one or more individual files, one or more folders comprising files or an entire hard drive of the electronic device. In some examples, the method may comprise prompting a user to select the files and/or folders that are to be encrypted/decrypted. In such case, the key device 5 may store information indicative of a deterministic key for each file and folder and link them accordingly.


Method of Registration 200, 300


An example of methods of registration 200, 300 will be described with reference to FIG. 2, where method 200 is performed by the electronic device 3 and method 300 is performed by the key device 5. This includes establishing the first and second asymmetric cryptography pairs for the respective devices 3, 5.


The asymmetric cryptography pairs include associated private and public keys, such as those used in public-key encryption. In this example, the asymmetric cryptography pairs are generated using Elliptic Curve Cryptography (ECC) and properties of elliptic curve operations.


Standards for ECC may include known standards such as those described by the Standards for Efficient Cryptography Group (www.sceg.org). Elliptic curve cryptography is also described in U.S. Pat. Nos. 5,600,725, 5,761,305, 5,889,865, 5,896,455, 5,933,504, 6,122,736, 6,141,420, 6,618,483, 6,704,870, 6,785,813, 6,078,667, 6,792,530.


In the method 200, 300, this includes the electronic device 3 and the key device 5 settling 210, 310 to a common ECC system and using a common generator (G). In one example, the common ECC system may be based on secp256K1 which is an ECC system used by Bitcoin. The common generator (G) may be selected, randomly generated, or assigned.


In the specific example illustrated in FIG. 1 in which the electronic device 3 is a laptop computer and the key device 5 is a mobile communication device, communications between the respective devices 3, 5 are realised by an application programming interface (API) communicating with a dedicated application installed on the mobile communications device 5. For this, software may be downloaded and installed on the laptop computer which is compatible with the dedicated application installed on the mobile communication device.


In a specific example, the key device 5 may be provided with not only the software application for the key device but also with the software for the electronic device. In this way, when the key device is connected to the electronic device, the software can be installed on the electronic device by executing the installation from the key device.


Turning now to the method 200 performed by the electronic device 3, the method 200 includes settling 210 on the common ECC system and common generator (G). This may include sending information indicative of the common ECC system and common generator from the electronic device 3 to the key device 5, or receiving the information from a third device, such as remote server computer. For example, the electronic device 3 may send, via Bluetooth 7, a notice indicative of using the common ECC system with a common generator (G) to the key device 5. In turn, the key device 5 may settle 310 by sending a notice indicative of an acknowledgment to using the common ECC system and common generator (G).


The method 200 also includes generating 220, at the electronic device 3, a first asymmetric cryptography pair that includes the electronic device master private key (V1S) and the electronic device master public key (P1S). In this particular example, the electronic device master private key (V1S) is determined based, at least in part, on a random integer in an allowable range specified in the common ECC system. The electronic device master public key (P1S) is then determined based on elliptic curve point multiplication of the electronic device master private key (P1S) and the common generator (G) according to the formula:

P1S=V1S×G  (Equation 1)


Thus the first asymmetric cryptography pair includes:

    • V1S: The electronic device master private key that is kept secret by the electronic device.
    • P1S: The electronic device master public key that is made publicly known.


The electronic device 3 may store the first asymmetric cryptography pair in a first data storage 13 associated with the electronic device 3. For security, the electronic device master private key (V1S) may be stored in a secure portion of the first data storage 13 to ensure the key remains private.


In this example, the method 200 includes sending 230 the electronic device public master key (P1S) to the key device 3. However, for encrypting the data on the electronic device 3, this step may not be necessary.


Turning now to the method 300 performed by the key device 5, in this specific example the key device 5 receives 320 the electronic device master public key (P1S) and stores 330 the received electronic device master public key (P1S) within a storage element of the key device 5.


Similar to the method 200, the method 300 at the key device 5 includes generating 340 a second asymmetric cryptography pair that includes the key device master private key (V1C) and the key device master public key (P1C). The key device master private key (V1C) is also a random integer within the allowable range specified in the common ECC system. In turn, the key device master public key (P1C) is determined by the following formula:

P1C=V1C×G  (Equation 2)


Thus the second asymmetric cryptography pair includes:

    • V1C: The key device master private key that is kept secret by the key device.
    • P1C: The key device master public key that is made publicly known.


The key device 5 may store the second asymmetric cryptography pair in a second data store 15 of the key device. The method 300 further includes sending 330 the key device master public key (P1C) to the electronic device 3 where it may be stored in storage 13.


In some alternatives, the respective public master keys may be received and stored at a third data store associate with a third device, such as a trusted third party. This may include a third party that acts as a public directory, such as a certification authority. Thus in some examples, the key device master public key (P1C) may be requested and received by the electronic device 3 only when determining the secret is required.


The registration steps may only need to occur once as an initial setup. Afterwards, the master keys can be reused in a secure matter to determine the secret that is dependent, inter alia, on the deterministic key (DK).


Encryption of Data at the Electronic Device 3


An exemplary method 400 of encrypting data at the electronic device 3 by determining a secret that is based on a private key of the electronic device 3 and a public key of the key device 5 will now be described with reference to FIG. 3. The secret may be used for one cycle only, each cycle being a full round of encryption and decryption of the data.


It will be appreciated that new private and public keys may be determined for both the electronic device and the key device for each cycle of encryption and decryption. The new private and public keys may for example be determined by re-hashing the message (M) as described in further detail in the co-filed application as mentioned above which is herein incorporated by reference in its entirety. In this way, sub-keys may be created, wherein each sub-key is linked to the master key.


Generating a Message (M) 410


In this example, the method 400 includes generating 410 a message (M) at the electronic device 3. The message (M) may be random, pseudo random, or user defined. In one example, the message (M) is based on Unix time and a nonce (and arbitrary value). For example, the message (M) may be provided as:

Message (M)=Unix Time+nonce  (Equation 3)


In some examples, the message (M) is arbitrary. However it is to be appreciated that the message (M) may have selective values (such as Unix Time, etc.) that may be useful in some applications.


The method 400 includes sending 420 the message (M) via Bluetooth 7, to the key device 5 where the message (M) will be stored. Importantly, the message (M) may be sent to the key device 5 over an unsecure network as the message (M) does not include information on the private keys.


It will be appreciated that the message (M) may be communicated to the key device 5 at any time. For example, the message (M) may be sent to the key device 5 after the encryption of the data is completed.


Determining a Deterministic Key 430


The method 400 further includes the step of determining 430 a deterministic key (DK) based on the message (M). In this example, this includes determining a cryptographic hash of the message. An example of a cryptographic hash algorithm includes SHA-256 to create a 256-bit deterministic key (DK). That is:

DK=SHA-256(M)  (Equation 4)


The selection of message may be arbitrary for the purpose of generating the encryption key (E) and will be newly selected for each encryption/decryption cycle. In this example, the message (M) is reduced to 160 bits by hashing in order to keep the message length short.


It is to be appreciated that other hash algorithms may be used. This may include other hash algorithms in the Secure Hash Algorithm (SHA) family. Some particular examples include instances in the SHA-3 subset, including SHA3-224, SHA3-256, SHA3-384, SHA3-512, SHAKE128, SHAKE256. Other hash algorithms may include those in the RACE Integrity Primitives Evaluation Message Digest (RIPEMD) family. A particular example may include RIPEMD-160. Other hash functions may be based on Zémor-Tillich hash function and knapsack-based hash functions.


Determining Second Private and Public Keys 440, 450, 460


The method 400 then includes determining 440, 450, 460 the following second keys based on the deterministic key (DK), i.e. the hash of the message (M).


The second electronic device private key (V2S) is determined 440 based on the electronic device master private key (V1S) and the hash of the message (M). This can be based on a scalar addition of the electronic device master private key (V1S) and the hash of the message (M) according to the following formula:

V2S=V1S+SHA-256(M)  (Equation 5)


The second electronic device public key (P2S) is determined 450 based on the electronic device master public key (P1S) and the hash of the message (M). This can be determined based on the following formula:

P2S=P1S+SHA-256(MG  (Equation 6)


The second key device public key (P2C) is determined 460 based on the key device master public key (P1C) and the hash of the message (M). This can be determined according to the following formula:

P2C=P1C+SHA-256(MG  (Equation 7)


It should be noted that in this specific example in which elliptic curve cryptography is applied, ‘G’ refers to the generator, the operator ‘+’ refers to elliptic curve point addition and the operator ‘x’ refers to elliptic curve point multiplication.


Furthermore, it should be noted that for the encryption of the data, it may not be necessary to determine the second electronic device public key P2S. As will be described in further detail below, for determining the secret, the second electronic device public key P2S may not be necessary.


Determine the Secret 470


The electronic device 3 may then determine 470 the secret based on the determined second electronic device private key (V2S) and the determined second key device public key (P2C). The secret may be determined by the electronic device 3 according to the following formula:

CS=V2C×P2S(Equation 8)

The Secret and Encryption Key


The secret may be used as a symmetric encryption key, or as the basis for determining a symmetric encryption key.


In this particular example, the method 400 includes a further step of determining 480 an encryption key (E) based on the determined secret. The encryption key (E) is further based on the electronic device's serial number to ensure that the encryption key (E) is specific to the electronic device 3. The encryption key (E) is determined according to the following formula:

E=SHA256(SHA256(salt+secret)+serial number)  (Equation 9)

    • Where salt=message (M)


In this particular example, the concept of random salts is used to determine the encryption key (E). It will be appreciated that any suitable techniques to calculate an encryption key (E) based on the determined secret may be used (if any).


The method 400 further includes encrypting 490 the data, at the electronic device 3, using the determined encryption key (E). It will be appreciated that any suitable method for encrypting the data using the encryption key (E) may be used.


Importantly, the electronic device 3 does not need to store the encryption key (E) or the secret as this can be re-calculated based on the message (M) which is stored on a data storage of the key device 5.


Decryption of the Encrypted Data


Following the encryption of the data at the electronic device 3, a method of decrypting the encrypted data at the electronic device 3 will now be described with reference to FIGS. 4 and 5. To decrypt the data, the electronic device 3 re-calculates the secret which was previously determined when the data was encrypted.


Initially, the electronic device 3 is connected to the key device 5 to be in communication with each other. The step of connecting the respective devices 3, 5 may include determining whether the respective software running on the devices is compatible and synchronised.


Authenticating 500 the Key Device 5


Before the encrypted data is decrypted at the electronic device 3, in this particular example, the key device 5 is initially authenticated by the electronic device 3.


A method of authenticating 500 the key device 5 will be described with reference to FIG. 4. The method of authenticating 500 the key device 5 may be part of the decryption cycle of the data at the electronic device 3.


The method 500 includes generating 510 an authentication message (MA) at the electronic device 3 which will be used to authenticate that the key device 5 is the key device 5. It will be appreciated that the generated message (MA) may solely be used for the authentication of the key device 5. However, in some examples, the authentication message (MA) may form the message (M) as described with reference to FIG. 3 used in the encryption process for the next encryption-decryption cycle.


The method 500 includes receiving 520 the authentication message (MA) at the key device 5 via Bluetooth 7 from the electronic device 3.


The key device 5 then determines 530 a deterministic authentication key (DKA) based on the message (MA). For example, the deterministic authentication key (DKA) may be the hash of the authentication message similar to step 430 of method 400 and can be determined according to the following formula:

DKA=SHA-256(MA)  (Equation 10)


The key device 5 then determines a new asymmetric cryptography pair based on the deterministic authentication key (DKA). Specific to this example, the method 500 includes determining 540 a second key device private key V2C according to the following formula:

V2C=V1C+SHA-256(MA)  (Equation 11)


The method 500 also includes determining 550 a second key device public key P2C according to the following formula.

P2C=P1C+SHA-256(MAG  (Equation 12)


The method 300 further includes generating 560 a signed message (SMA) based on the authentication message (MA) and the determined second key device private key (V2C). Generating a signed message includes applying a digital signature algorithm to digitally sign the authentication message (MA). In one example, this includes applying the second key device private key (V2C) to the message in an Elliptic Curve Digital Signature Algorithm (ECDSA) to obtain the signed message (SMA). The authentication message (MA) may be signed according to the following formula:

SMA=Sig−V2C<MA>  (Equation 13)


Examples of ECDSA include those based on ECC systems with secp256k1, secp256r1, secp384r1, se3cp521r1.


The signed authentication message (SMA) is subsequently sent 570 to the electronic device 3 for authentication of the key device 5.


The method 500 includes receiving 580 the signed authentication message (SMA) from the key device 5. The electronic device 3 may then validate 590 the signature on the signed authentication message (SMA) with the second key device public key (P2C) that was determined at step 550.


Verifying the digital signature may be done in accordance with an Elliptic Curve Digital Signature Algorithm (ECDSA). Importantly, the signed authentication message (SMA) that was signed with the second key device private key (V2C) should only be correctly verified with the corresponding second key device public key (P2C), since V2C and P2C form a cryptographic pair. Since these keys are deterministic of the key device master private key (V1C) and the key device master public key (P1C) that were generated at registration of the key device, verifying the signed authentication message (SMA) can be used as a basis of authenticating that an alleged key device 5 sending the signed message (SMA) is the same key device 5 as during registration.


Re-Calculate the Encryption Key (E) to Decrypt the Encrypted Data


Following successful authentication of the key device 5, the electronic device 3 decrypts the encrypted data by re-calculating the secret and thereby the encryption key (E). An exemplary method 600 of decrypting the encrypted data will now be described with reference to FIG. 5.


The method 600 includes requesting 610 the message (M) that was previously used in the encryption cycle and stored on the key device 5 as described in step 420 of method 400.


The method 600 then includes receiving 630 message (M). In this particular example, the message (M) is signed 620 by the key device 5 using the second key device private key (V2C) before the message (M) is sent to the electronic device 3. The message (M) may be signed according to the following formula:

SM=Sig−V2C<M>  (Equation 14)


The method 600 further includes verifying 650 the signed message (SM). This may be done by independently determining the second key device public key (P2C) and then performing applying an Elliptic Curve Digital Signature Algorithm (ECDSA) to SM and P2C. The second key device public key may be determined according to the following formula:

P2C=P1C+SHA-256(MG  (Equation 15)


The method 600 then includes retrieving 660 the message (M) from the signed message (M) so that the electronic device 3 can re-calculate 670 the secret following steps 430 to 470 as described with reference to FIG. 3.


In a further step 680, the encryption key (E) is re-determined based on the secret and the electronic device's serial number as described with reference to step 480 of method 400. Once the encryption key (E) is determined, the data can be decrypted 690.


It will be appreciated that for decrypting the encrypted data, a method of authentication as described with reference to FIG. 4 may not be necessary for some embodiments.


Processing Device


As noted above, the electronic device 3 and the key device 5 may be personal electronic devices, such as a laptop computer, tablet computer, mobile communication device, computer server etc. The electronic device may include a processing device 23, 25, a data store 13, 15 and a user interface 14.



FIG. 6 illustrates an example of a processing device 23, 25. The processing device 23, 25 may be used at the electronic device 3, or the key device 5. The processing device 23, 25 includes a processor 1510, a memory 1520 and an interface device 1540 that communicate with each other via a bus 1530. The memory 1520 stores instructions and data for implementing the method 200, 300, 400, 500 and 600 described above, and the processor 1510 performs the instructions from the memory 1520 to implement the method 200, 300, 400, 500 and 600. The interface device 1540, may include a communications module that facilitates communication with the communications network, such as Bluetooth 7 and, in some examples, with the user interface 14 and peripherals such as data store 13, 15. It should be noted that although the processing device 1501 may be independent network elements, the processing device 1501 may also be part of another network element. Further, some functions performed by the processing device 1501 may be distributed between multiple network elements. For example, the electronic device 3 may have multiple processing devices 23 to perform method 200, 400 and parts of method 500, 600 in a secure local area network associated with the electronic device 3.


Where this disclosure describes that a user, issuer, merchant, provider or other entity performs a particular action (including signing, issuing, determining, calculating, sending, receiving, creating etc.), this wording is used for the sake of clarity of presentation. It should be understood that these actions are performed by the computing devices operated by these entities.


Signing may comprise executing a cryptographic function. The function has an input for a clear text and an input for a key, such as a private key. A processor may execute the function to calculate a number or string that can be used as a signature. The signature is then provided together with the clear text to provide a signed text. The signature changes completely if the message text or the key changes by a single bit. While calculating the signature requires little computational power, recreating a message that has a given signature is practically impossible. This way, the clear text can only be changed and accompanied by a valid signature if the private key is available. Further, other entities can easily verify the signature using the publicly available public key.


In most circumstances, encrypting and decrypting comprises a processor executing a cryptographic function to calculate an output string representing the encrypted message or the clear text message respectively.


Keys, tokens, metadata, transactions, offers, contracts, signatures, scripts, metadata, invitations, and the like refer to binary data represented as numbers, text or strings stored on data memory, such as variables in program code of type “string” or “int” or other types or text files.


An example of the peer-to-peer ledger is the bitcoin Blockchain. Transferring funds or paying fees in bitcoin currency comprises creating a transaction on the bitcoin Blockchain with the funds or fees being output from the transaction. An example of a bitcoin transaction includes an input transaction hash, a transaction amount, one or more destinations, a public key of a payee or payees and a signature created by using the input transaction as the input message and a private key of a payer to calculate the signature. The transaction can be verified by checking that the input transaction hash exists in a copy of the bitcoin Blockchain and that the signature is correct using the public key. To ensure that the same input transaction hash has not been used elsewhere already, the transaction is broadcast to a network of computing nodes (‘miners’). A miner accepts and records the transaction on the Blockchain only if the input transaction hash is not yet connected and the signatures are valid. A miner rejects the transaction if the input transaction hash is already linked to a different transaction.


When two items are associated, this means that there is a logical connection between these items. In a database, for example, identifiers for the two items may be stored in the same records to make the two items associated with each other. In a transaction, identifiers for the two items may be included in the transaction string to make the two items associated with each other.


Authorising another entity may comprise calculating a signature string of a transaction using a private key and providing the signature string to the entity to allow the entity to use the signature to verify the transaction.


A user having an account with another entity may comprise the entity storing information about the user, such as email address, name and potentially public keys. For example, the entity may maintain a database, such as SQL, OrientDB, MongoDB or others. In some examples, the entity may also store one or more of the user's private keys.


It will be appreciated by persons skilled in the art that numerous variations and/or modifications may be made to the above-described embodiments, without departing from the broad general scope of the present disclosure. The present embodiments are, therefore, to be considered in all respects as illustrative and not restrictive.

Claims
  • 1. A computer implemented method of determining a common secret at an electronic device (S), the electronic device being configured to communicate with a key device (C), wherein the electronic device is further associated with a first asymmetric cryptography pair having a first electronic device private key (V1S) and a first electronic device public key (P1S), and the key device is associated with a second asymmetric cryptography pair having a first key device private key (V1C) and a first key device public key (P1C), the method comprising: determining, at the electronic device, a deterministic key (DK);determining, at the electronic device, a second electronic device private key (V2S) based on at least the first electronic device private key (V1S) and the deterministic key (DK);determining, at the electronic device, a second key device public key (P2C) based on at least the first key device public key (P1C) and the deterministic key (DK);determining a secret based on at least the second electronic device private key (V2S) and the second key device public key (P2C);encrypting data at the electronic device using the determined secret or an encryption key that is based on the determined secret;sending information indicative of the deterministic key (DK) to the key device;determining, at the electronic device, an updated second electronic device private key (V2S) based on at least the first electronic device private key (V1S) and the deterministic key (DK);determining, at the electronic device, an updated second key device public key (P2C) based on at least the first key device public key (P1C) and the deterministic key (DK);determining an updated secret based on at least the updated second electronic device private key (V2S) and the updated second key device public key (P2C); andencrypting data at the electronic device using the determined updated secret or an encryption key that is based on the determined updated secret.
  • 2. The method of claim 1, further comprising: storing, at the key device, the information indicative of the deterministic key (DK).
  • 3. The method of claim 1, wherein the deterministic key (DK) is based on a message (M).
  • 4. The method of claim 3, comprising a step of generating the message (M) at the electronic device, and determining the deterministic key (DK) based on determining a hash of the message (M).
  • 5. The method of claim 3, comprising: requesting, at the electronic device, the information indicative of the deterministic key (DK) from the key device;generating, at the key device, a signed message (SM) based on the message (M);sending the signed message (SM) to the electronic device;validating, at the electronic device, the signed message (SM); andretrieving the message (M) such that the secret can be determined, at the electronic device, for decrypting the data.
  • 6. The method of claim 1, comprising a step of determining the encryption key based on the determined secret and identification information of the electronic device.
  • 7. The method of claim 1, comprising a step of storing, at a data storage associated with the electronic device, the first key device public key (P1C).
  • 8. The method of claim 1, further comprising: receiving, at the electronic device, the information indicative of the deterministic key (DK), from the key device;determining the secret based on the received information indicative of the deterministic key (DK); anddecrypting, at the electronic device, the encrypted data using the secret or the encryption key that is based on the secret.
  • 9. The method of claim 8, comprising a step of generating, at the electronic device, an authentication message (MA) and sending the authentication message (MA) to the key device.
  • 10. The method of claim 9, comprising a step of determining a deterministic authentication key (DKA) by determining a hash of the authentication message (MA).
  • 11. The method of claim 10, comprising a step of generating, at the key device, a second asymmetric cryptography pair having a second key device private key (V2C) and a second key device public key (P2C).
  • 12. The method of claim 11, wherein the second key device private key (V2C) is based on the deterministic authentication key (DKA) and the first key device private key (V1C), and the second key device public key (P2C) is based on the deterministic authentication key (DKA) and the first key device public key (P1C).
  • 13. The method of claim 12, comprising: generating, at the key device, a signed authentication message (SMA) based on the deterministic authentication key (DKA) and the second key device private key (V2C);receiving, at the electronic device, the signed authentication message (SMA) from the key device; andvalidating the signed authentication message (SMA) with the second key device public key (P2C); and authenticating the key device based on a result of validating the signed authentication message (SMA).
  • 14. A memory device storing thereon a computer program comprising machine-readable instructions to cause a processing device of an electronic device to implement the method of claim 1.
  • 15. A computer system for encrypting data at an electronic device, the computer system comprising: the electronic device being associated with a first asymmetric cryptography pair having a first electronic device private key (V1S) and a first electronic device public key (P1S),a key device being associated with a second asymmetric cryptography pair having a first key device private key (V1C) and a first key device public key (P1C), wherein the key device is configured to communicate with the electronic device;wherein the electronic device comprises a processor configured to: determine a deterministic key (DK);determine a second electronic device private key (V2S) based on at least the first electronic device private key (V1S) and the deterministic key (DK);determine a second key device public key (P2C) based on at least the first key device public key (P1C) and the deterministic key (DK);determine a secret based on at least the second electronic device private key (V2S) and the second key device public key (P2C);encrypt the data on the electronic device using the determined secret or an encryption key that is based on the determined secret;determine an updated second electronic device private key (V2S) based on at least the first electronic device private key (V1S) and the deterministic key (DK);determine an updated second key device public key (P2C) based on at least the first key device public key (P1C) and the deterministic key (DK);determine an updated secret based on at least the updated second electronic device private key (V2S) and the updated second key device public key (P2C); andencrypt the data on the electronic device using the determined updated secret or an encryption key that is based on the determined updated secret;wherein information indicative of the deterministic key (DK) is stored on the key device.
  • 16. The computer system of claim 15, further configured to decrypt data, the processor of the electronic device being configured to: receive the information indicative of the deterministic key (DK), from the key device;determine the secret based on the information indicative of the deterministic key (DK); anddecrypt the data using the determined secret or the encryption key that is based on the determined secret.
  • 17. An electronic device for encrypting data, the electronic device being configured to communicate with a key device, wherein the electronic device is associated with a first asymmetric cryptography pair having a first electronic device private key (V1S) and a first electronic device public key (P1S), and the key device is associated with a second asymmetric cryptography pair having a first key device private key (V1C) and a first key device public key (P1C), the electronic device comprising a processing device configured to: determine a deterministic key (DK);determine a second electronic device private key (V2S) based on at least the first electronic device private key (V1S) and the deterministic key (DK);determine a second key device public key (P2C) based on at least the first key device public key (P1C) and the deterministic key (DK);determine a secret based on at least the second electronic device private key (V2S) and the second key device public key (P2C);encrypt the data on the electronic device using the determined secret or an encryption key that is based on the determined secret;determine an updated second electronic device private key (V2S) based on at least the first electronic device private key (V1S) and the deterministic key (DK);determine an updated second key device public key (P2C) based on at least the first key device public key (P1C) and the deterministic key (DK);determine an updated secret based on at least the updated second electronic device private key (V2S) and the updated second key device public key (P2c); andencrypt the data on the electronic device using the determined updated secret or an encryption key that is based on the determined updated secret;wherein information indicative of the deterministic key (DK) is sent to the key device.
Priority Claims (3)
Number Date Country Kind
1603117 Feb 2016 GB national
1603122 Feb 2016 GB national
1619301 Nov 2016 GB national
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 16/926,583, filed Jul. 10, 2020, entitled “PERSONAL DEVICE SECURITY USING CRYPTOCURRENCY WALLETS,” which is a continuation of U.S. patent application Ser. No. 16/079,082, filed Aug. 22, 2018, entitled “PERSONAL DEVICE SECURITY USING ELLIPTIC CURVE CRYPTOGRAPHY FOR SECRET SHARING,” which is a 371 National Stage of International Patent Application No. PCT/132017/050815, filed Feb. 14, 2017, entitled “PERSONAL DEVICE SECURITY USING ELLIPTIC CURVE CRYPTOGRAPHY FOR SECRET SHARING,” which claims priority to United Kingdom Patent Application No. 1619301.3, filed Nov. 15, 2016, United Kingdom Patent Application No. 1603122.1, filed Feb. 23, 2016, and United Kingdom Patent Application No. 1603117.1, filed Feb. 23, 2016, the disclosures of which are incorporated herein by reference in their entirety.

US Referenced Citations (387)
Number Name Date Kind
4918589 Floro et al. Apr 1990 A
5034686 Aspelin Jul 1991 A
5535276 Ganesan Jul 1996 A
5600725 Rueppel et al. Feb 1997 A
5761305 Vanstone et al. Jun 1998 A
5801938 Kalantery Sep 1998 A
5867578 Brickell et al. Feb 1999 A
5889865 Vanstone et al. Mar 1999 A
5896455 Vanstone et al. Apr 1999 A
5920630 Wertheimer et al. Jul 1999 A
5933504 Vanstone et al. Aug 1999 A
6061449 Candelore et al. May 2000 A
6078667 Johnson Jun 2000 A
6118874 Okamoto et al. Sep 2000 A
6122736 Vanstone et al. Sep 2000 A
6141420 Vanstone et al. Oct 2000 A
6286098 Wenig et al. Sep 2001 B1
6487660 Vanstone Nov 2002 B1
6490352 Schroeppel Dec 2002 B1
6618483 Vanstone et al. Sep 2003 B1
6662299 Price, III Dec 2003 B1
6704870 Vanstone et al. Mar 2004 B2
6785813 Vanstone et al. Aug 2004 B1
6792530 Qu et al. Sep 2004 B1
6819766 Weidong Nov 2004 B1
6876745 Kurumatani Apr 2005 B1
7003665 Dultz et al. Feb 2006 B1
7006633 Reece Feb 2006 B1
7095851 Scheidt Aug 2006 B1
7181017 Nagel et al. Feb 2007 B1
7912747 Sachedina Mar 2011 B2
7929702 Brown et al. Apr 2011 B2
7970135 Schwenk Jun 2011 B1
8166481 Dadiomov et al. Apr 2012 B2
8401185 Telang Mar 2013 B1
8520855 Kohno et al. Aug 2013 B1
8522011 Spalka et al. Aug 2013 B2
8855318 Patnala et al. Oct 2014 B1
9209980 Bowman et al. Dec 2015 B2
9251531 Sarkissian Feb 2016 B2
9258130 Hwang et al. Feb 2016 B2
9298806 Vessenes et al. Mar 2016 B1
9350549 Lumb May 2016 B2
9436923 Sriram et al. Sep 2016 B1
9641338 Sriram et al. May 2017 B2
9673975 Machani Jun 2017 B1
9961030 Murphy et al. May 2018 B2
10050779 Alness et al. Aug 2018 B2
10068228 Winklevoss et al. Sep 2018 B1
10354325 Skala et al. Jul 2019 B1
10510053 Armstrong Dec 2019 B2
10516527 Machani et al. Dec 2019 B1
10659223 Wright et al. May 2020 B2
10719816 Kurani Jul 2020 B1
11050690 Hong et al. Jun 2021 B2
11080665 Poelstra et al. Aug 2021 B1
11115196 Triandopoulos et al. Sep 2021 B1
11188907 Vijayvergia et al. Nov 2021 B1
11455378 Wright et al. Sep 2022 B2
11663609 Christidis et al. May 2023 B2
20010002486 Kocher May 2001 A1
20010050990 Sudia Dec 2001 A1
20020112171 Ginter et al. Aug 2002 A1
20020198791 Perkowski Dec 2002 A1
20030026432 Woodward Feb 2003 A1
20030046202 Knapp Mar 2003 A1
20030048906 Vora et al. Mar 2003 A1
20030081785 Boneh et al. May 2003 A1
20030188153 Demoff et al. Oct 2003 A1
20040030932 Juels et al. Feb 2004 A1
20040049687 Orsini et al. Mar 2004 A1
20040078775 Chow et al. Apr 2004 A1
20040111484 Young et al. Jun 2004 A1
20040190181 Hikosaka et al. Sep 2004 A1
20040193890 Girault Sep 2004 A1
20040252831 Uehara Dec 2004 A1
20050071283 Randle et al. Mar 2005 A1
20050094806 Jao et al. May 2005 A1
20050138374 Zheng et al. Jun 2005 A1
20060023887 Agrawal et al. Feb 2006 A1
20060034494 Holloran Feb 2006 A1
20060153365 Beeson Jul 2006 A1
20060153366 Beeson Jul 2006 A1
20060153367 Beeson Jul 2006 A1
20060153368 Beeson Jul 2006 A1
20060153370 Beeson Jul 2006 A1
20060156012 Beeson Jul 2006 A1
20060156013 Beeson Jul 2006 A1
20060161485 Meldahl Jul 2006 A1
20060173788 Nath Pandya et al. Aug 2006 A1
20060179319 Krawczyk Aug 2006 A1
20060242038 Giudilli Oct 2006 A1
20060248114 Anderson et al. Nov 2006 A1
20070055880 Lauter et al. Mar 2007 A1
20070165843 Lauter et al. Jul 2007 A1
20070192842 Beaulieu et al. Aug 2007 A1
20070223706 Gantman et al. Sep 2007 A1
20070265978 Kahn et al. Nov 2007 A1
20070269040 Yuval et al. Nov 2007 A1
20070276836 Chatterjee et al. Nov 2007 A1
20070288320 Cooper et al. Dec 2007 A1
20080048022 Vawter Feb 2008 A1
20080082817 Takahashi et al. Apr 2008 A1
20080101596 Cerruti et al. May 2008 A1
20080130895 Jueneman Jun 2008 A1
20080137857 Bellare et al. Jun 2008 A1
20080144836 Sanders et al. Jun 2008 A1
20080165955 Ibrahim Jul 2008 A1
20080195499 Meredith et al. Aug 2008 A1
20080260143 Ibrahim Oct 2008 A1
20080263357 Boyen Oct 2008 A1
20080285759 Shaw Nov 2008 A1
20080288773 Nguyen et al. Nov 2008 A1
20090022311 Vanstone et al. Jan 2009 A1
20090048979 Al-Herz et al. Feb 2009 A1
20090074179 Futa et al. Mar 2009 A1
20090161876 Sherkin Jun 2009 A1
20090282243 Rose et al. Nov 2009 A1
20100005302 Vishnu et al. Jan 2010 A1
20100023771 Struik Jan 2010 A1
20100031369 Grummt Feb 2010 A1
20100037055 Fazio et al. Feb 2010 A1
20100042839 Ho Feb 2010 A1
20100054458 Schneider Mar 2010 A1
20100054480 Schneider Mar 2010 A1
20100131752 Flegel May 2010 A1
20100131755 Zhu et al. May 2010 A1
20100134848 Lynggaard et al. Jun 2010 A1
20100146292 Shi et al. Jun 2010 A1
20100150341 Dodgson et al. Jun 2010 A1
20100172501 Tian et al. Jul 2010 A1
20100199095 Ho Aug 2010 A1
20100217986 Schneider Aug 2010 A1
20100228973 Dancer et al. Sep 2010 A1
20100241848 Smith et al. Sep 2010 A1
20100268778 Kim et al. Oct 2010 A1
20110016510 Matsuda et al. Jan 2011 A1
20110022854 Macchetti et al. Jan 2011 A1
20110058672 Sannino et al. Mar 2011 A1
20110157473 Choi et al. Jun 2011 A1
20110202773 Ghouti et al. Aug 2011 A1
20110208790 Brown et al. Aug 2011 A1
20110208970 Brown et al. Aug 2011 A1
20110246766 Orsini et al. Oct 2011 A1
20110307698 Vanstone Dec 2011 A1
20110311051 Resch Dec 2011 A1
20120011362 Lambert Jan 2012 A1
20120039474 Ho Feb 2012 A1
20120100833 Gao Apr 2012 A1
20120198228 Oberheide et al. Aug 2012 A1
20120214441 Raleigh Aug 2012 A1
20120233674 Gladstone et al. Sep 2012 A1
20120243687 Li et al. Sep 2012 A1
20120284794 Trent et al. Nov 2012 A1
20120290830 Resch et al. Nov 2012 A1
20120297405 Zhang et al. Nov 2012 A1
20120331287 Bowman et al. Dec 2012 A1
20130030941 Meredith et al. Jan 2013 A1
20130034642 Eckstrom Feb 2013 A1
20130051552 Handschuh Feb 2013 A1
20130061049 Irvine Mar 2013 A1
20130069772 Najafi et al. Mar 2013 A1
20130077783 Anshel et al. Mar 2013 A1
20130091294 El-Beltagy et al. Apr 2013 A1
20130103945 Cannon et al. Apr 2013 A1
20130159413 Davis et al. Jun 2013 A1
20130177157 Li et al. Jul 2013 A1
20130191632 Spector et al. Jul 2013 A1
20130198104 Parker Aug 2013 A1
20130287210 Matsuda et al. Oct 2013 A1
20130304642 Campos Nov 2013 A1
20130305057 Greco et al. Nov 2013 A1
20130305333 Katzer et al. Nov 2013 A1
20130318578 Palagummi Nov 2013 A1
20130318588 Metzger Nov 2013 A1
20140012751 Kuhn et al. Jan 2014 A1
20140046792 Ganesan Feb 2014 A1
20140068246 Hartley et al. Mar 2014 A1
20140082358 Nakhjiri et al. Mar 2014 A1
20140108473 Nowoczynski et al. Apr 2014 A1
20140129441 Blanco et al. May 2014 A1
20140129844 Johnson et al. May 2014 A1
20140188719 Poornachandran et al. Jul 2014 A1
20140195425 Campos et al. Jul 2014 A1
20140223580 Neivanov et al. Aug 2014 A1
20140250006 Makhotin et al. Sep 2014 A1
20140270401 Irwin et al. Sep 2014 A1
20140330923 Baptist et al. Nov 2014 A1
20150006386 Tebbe Jan 2015 A1
20150039470 Crites Feb 2015 A1
20150052369 Koning et al. Feb 2015 A1
20150066748 Winslow et al. Mar 2015 A1
20150086020 Harjula et al. Mar 2015 A1
20150089616 Brezinski et al. Mar 2015 A1
20150095648 Nix Apr 2015 A1
20150120567 Van Rooyen et al. Apr 2015 A1
20150120569 Belshe et al. Apr 2015 A1
20150124961 Lambert May 2015 A1
20150154562 Emmerson Jun 2015 A1
20150170112 DeCastro Jun 2015 A1
20150188698 Tsai Jul 2015 A1
20150188700 Ben Saied et al. Jul 2015 A1
20150205929 Brama Jul 2015 A1
20150206106 Yago Jul 2015 A1
20150213433 Khan Jul 2015 A1
20150244690 Mossbarger Aug 2015 A1
20150254463 Ryhorchuk et al. Sep 2015 A1
20150254639 Radu Sep 2015 A1
20150256347 Tseng et al. Sep 2015 A1
20150262139 Shtylman Sep 2015 A1
20150262140 Armstrong Sep 2015 A1
20150269570 Phan et al. Sep 2015 A1
20150278780 Vaidyanathan et al. Oct 2015 A1
20150294425 Benson Oct 2015 A1
20150296570 Altamura et al. Oct 2015 A1
20150302401 Metral Oct 2015 A1
20150304302 Zhang Oct 2015 A1
20150310497 Valin et al. Oct 2015 A1
20150324764 Van Rooyen et al. Nov 2015 A1
20150324789 Dvorak et al. Nov 2015 A1
20150332224 Melika et al. Nov 2015 A1
20150332395 Walker et al. Nov 2015 A1
20150348017 Allmen Dec 2015 A1
20150349958 Lindell Dec 2015 A1
20150350171 Brumley Dec 2015 A1
20150356523 Madden Dec 2015 A1
20150363768 Melika et al. Dec 2015 A1
20150363770 Ronca et al. Dec 2015 A1
20150363773 Ronca et al. Dec 2015 A1
20150363777 Ronca et al. Dec 2015 A1
20150372897 Han et al. Dec 2015 A1
20150379510 Smith Dec 2015 A1
20150381729 Manohar et al. Dec 2015 A1
20160026918 Barbieri et al. Jan 2016 A1
20160027229 Spanos et al. Jan 2016 A1
20160028552 Spanos et al. Jan 2016 A1
20160055511 Chidella et al. Feb 2016 A1
20160055583 Liberty et al. Feb 2016 A1
20160065370 Le Saint et al. Mar 2016 A1
20160071108 Caldera et al. Mar 2016 A1
20160085955 Lerner Mar 2016 A1
20160086175 Finlow-Bates et al. Mar 2016 A1
20160092870 Salama et al. Mar 2016 A1
20160092988 Letourneau Mar 2016 A1
20160098723 Feeney Apr 2016 A1
20160132684 Barbas et al. May 2016 A1
20160134593 Gvili May 2016 A1
20160140335 Proulx et al. May 2016 A1
20160149878 Pogorelik et al. May 2016 A1
20160162897 Feeney Jun 2016 A1
20160164884 Sriram et al. Jun 2016 A1
20160203522 Shiffert et al. Jul 2016 A1
20160203572 McConaghy et al. Jul 2016 A1
20160210617 Leger Jul 2016 A1
20160234026 Wilkins et al. Aug 2016 A1
20160260171 Ford et al. Sep 2016 A1
20160261408 Peddada et al. Sep 2016 A1
20160261565 Lorenz et al. Sep 2016 A1
20160261690 Ford Sep 2016 A1
20160269182 Sriram Sep 2016 A1
20160275294 Irvine Sep 2016 A1
20160275492 Brickell et al. Sep 2016 A1
20160283941 Andrade Sep 2016 A1
20160292672 Fay et al. Oct 2016 A1
20160294562 Oberheide et al. Oct 2016 A1
20160321434 McCoy et al. Nov 2016 A1
20160321654 Lesavich et al. Nov 2016 A1
20160335533 Davis et al. Nov 2016 A1
20160335924 Karashi et al. Nov 2016 A1
20160337119 Hosaka et al. Nov 2016 A1
20160337124 Rozman Nov 2016 A1
20160342977 Lam Nov 2016 A1
20160342984 Thomas et al. Nov 2016 A1
20160342994 Davis Nov 2016 A1
20160344543 Alness et al. Nov 2016 A1
20160350749 Wilkins et al. Dec 2016 A1
20160352518 Ford et al. Dec 2016 A1
20160379208 Deliwala et al. Dec 2016 A1
20160381010 Bhandari et al. Dec 2016 A1
20170005804 Zinder Jan 2017 A1
20170011394 Kumar et al. Jan 2017 A1
20170012948 Peeters et al. Jan 2017 A1
20170017936 Bisikalo et al. Jan 2017 A1
20170024817 Wager et al. Jan 2017 A1
20170026468 Kumar et al. Jan 2017 A1
20170046664 Haldenby et al. Feb 2017 A1
20170046668 Rowley et al. Feb 2017 A1
20170046693 Haldenby et al. Feb 2017 A1
20170046698 Haldenby et al. Feb 2017 A1
20170046792 Haldenby et al. Feb 2017 A1
20170046806 Haldenby et al. Feb 2017 A1
20170061138 Lambert Mar 2017 A1
20170061833 Joye et al. Mar 2017 A1
20170075877 Lepeltier Mar 2017 A1
20170083907 McDonough et al. Mar 2017 A1
20170083910 Kraemer et al. Mar 2017 A1
20170091148 Takahashi Mar 2017 A1
20170091750 Maim Mar 2017 A1
20170091764 Lloyd et al. Mar 2017 A1
20170103385 Wilson, Jr. et al. Apr 2017 A1
20170109540 Heiman et al. Apr 2017 A1
20170116608 Forzley et al. Apr 2017 A1
20170124348 Pourzandi et al. May 2017 A1
20170132620 Miller et al. May 2017 A1
20170132621 Miller et al. May 2017 A1
20170147975 Natarajan et al. May 2017 A1
20170148016 Davis May 2017 A1
20170154331 Voorhees Jun 2017 A1
20170154391 Watkins et al. Jun 2017 A1
20170163733 Grefen et al. Jun 2017 A1
20170169403 Zhang Jun 2017 A1
20170173262 Veltz Jun 2017 A1
20170178237 Wong Jun 2017 A1
20170178263 Kraemer et al. Jun 2017 A1
20170185527 Ueda Jun 2017 A1
20170187535 Middleton et al. Jun 2017 A1
20170200137 Vilmont Jul 2017 A1
20170228547 Smith et al. Aug 2017 A1
20170235970 Conner Aug 2017 A1
20170243193 Manian et al. Aug 2017 A1
20170243214 Johnsrud et al. Aug 2017 A1
20170250801 Chen et al. Aug 2017 A1
20170262862 Aljawhari Sep 2017 A1
20170284974 Hershey et al. Oct 2017 A1
20170287090 Hunn et al. Oct 2017 A1
20170300877 Mann et al. Oct 2017 A1
20170307387 Kohlhepp Oct 2017 A1
20170308580 Naganuma et al. Oct 2017 A1
20170310747 Cohn et al. Oct 2017 A1
20170316390 Smith et al. Nov 2017 A1
20170324663 Menase Nov 2017 A1
20170324715 Frincu et al. Nov 2017 A1
20170364908 Smith et al. Dec 2017 A1
20170366347 Smith Dec 2017 A1
20180001183 Tran et al. Jan 2018 A1
20180007131 Cohn et al. Jan 2018 A1
20180017447 Raj et al. Jan 2018 A1
20180025670 Ikarashi et al. Jan 2018 A1
20180034810 Pe'Er et al. Feb 2018 A1
20180063709 Morrison Mar 2018 A1
20180082043 Witchey et al. Mar 2018 A1
20180094953 Colson et al. Apr 2018 A1
20180109377 Fu Apr 2018 A1
20180115428 Lysenko et al. Apr 2018 A1
20180123780 Ikarashi May 2018 A1
20180131512 Gajek May 2018 A1
20180139056 Imai et al. May 2018 A1
20180146367 Altin et al. May 2018 A1
20180176017 Rodriguez et al. Jun 2018 A1
20180176222 Bhaskar et al. Jun 2018 A1
20180225431 Ikarashi et al. Aug 2018 A1
20180227277 Fischer et al. Aug 2018 A1
20180240107 Andrade Aug 2018 A1
20180247191 Katz et al. Aug 2018 A1
20180264347 Tran et al. Sep 2018 A1
20180341648 Kakavand et al. Nov 2018 A1
20180349572 Chen et al. Dec 2018 A1
20180367298 Wright et al. Dec 2018 A1
20180376318 Wang et al. Dec 2018 A1
20190014094 Le Saint Jan 2019 A1
20190034936 Nolan et al. Jan 2019 A1
20190080321 Mundis et al. Mar 2019 A1
20190080404 Molinari et al. Mar 2019 A1
20190080406 Molinari et al. Mar 2019 A1
20190114182 Chalakudi et al. Apr 2019 A1
20190130368 Li et al. May 2019 A1
20190149337 Savanah et al. May 2019 A1
20190158470 Wright et al. May 2019 A1
20190188793 Molinari et al. Jun 2019 A1
20190199531 Staples et al. Jun 2019 A1
20190220859 Weight et al. Jul 2019 A1
20190229911 Allen Jul 2019 A1
20190238334 Nakamura Aug 2019 A1
20190266146 Rose et al. Aug 2019 A1
20190305863 Fayyad Oct 2019 A1
20190340352 Peeters et al. Nov 2019 A1
20190349733 Nolan et al. Nov 2019 A1
20190378139 Stribady et al. Dec 2019 A1
20190392118 Elden et al. Dec 2019 A1
20190392536 Rice Dec 2019 A1
20200026785 Patangia et al. Jan 2020 A1
20200250176 Padmanabhan Aug 2020 A1
20200285935 Song et al. Sep 2020 A1
20210056070 Kakavand et al. Feb 2021 A1
20210081938 Falk Mar 2021 A1
20210194677 Pourzandi et al. Jun 2021 A1
20210409489 Speasl et al. Dec 2021 A1
Foreign Referenced Citations (93)
Number Date Country
2016100059 Mar 2016 AU
2867765 Apr 2016 CA
1262007 Aug 2000 CN
101447980 Jun 2009 CN
102144371 Aug 2011 CN
102938036 Feb 2013 CN
103440209 Dec 2013 CN
103795529 May 2014 CN
103927656 Jul 2014 CN
104320262 Jan 2015 CN
104331516 Feb 2015 CN
104620535 May 2015 CN
104704504 Jun 2015 CN
105204802 Dec 2015 CN
105306194 Feb 2016 CN
105812126 Jul 2016 CN
106022681 Oct 2016 CN
106022917 Oct 2016 CN
106411503 Feb 2017 CN
107122985 Sep 2017 CN
107194822 Sep 2017 CN
107301501 Oct 2017 CN
102010002241 Mar 2012 DE
1477882 Nov 2004 EP
2237473 Oct 2010 EP
2538606 Dec 2012 EP
2975570 Jan 2016 EP
3010176 Apr 2016 EP
3382616 Oct 2018 EP
3018370 Sep 2015 FR
3018377 Sep 2015 FR
3018378 Sep 2015 FR
3018379 Sep 2015 FR
2551643 Dec 2017 GB
H11239124 Aug 1999 JP
H11289324 Oct 1999 JP
2000502553 Feb 2000 JP
2001195479 Jul 2001 JP
2002026895 Jan 2002 JP
2004192587 Jul 2004 JP
2004246882 Sep 2004 JP
2006293764 Oct 2006 JP
2007036910 Feb 2007 JP
2007067631 Mar 2007 JP
2007242221 Sep 2007 JP
2008136063 Jun 2008 JP
2008146601 Jun 2008 JP
2009105824 May 2009 JP
2009171292 Jul 2009 JP
2009526411 Jul 2009 JP
2010503320 Jan 2010 JP
2010219912 Sep 2010 JP
2011082662 Apr 2011 JP
2011211461 Oct 2011 JP
2012515393 Jul 2012 JP
2014068140 Apr 2014 JP
2014153583 Aug 2014 JP
2015536617 Dec 2015 JP
5858506 Feb 2016 JP
2019512909 May 2019 JP
20110012085 Feb 2011 KR
101544722 Aug 2015 KR
101579232 Jan 2016 KR
2015108134 Oct 2016 RU
2015109271 Oct 2016 RU
201202975 Jan 2012 TW
2005096542 Oct 2005 WO
2005107141 Nov 2005 WO
2007113040 Oct 2007 WO
2012039474 Mar 2012 WO
2012054785 Apr 2012 WO
2013034278 Mar 2013 WO
2013053058 Apr 2013 WO
2015127789 Sep 2015 WO
2015142765 Sep 2015 WO
2015171580 Nov 2015 WO
2015175854 Nov 2015 WO
2015188151 Dec 2015 WO
2015194798 Dec 2015 WO
2016022864 Feb 2016 WO
2016137360 Sep 2016 WO
2016137499 Sep 2016 WO
2016161073 Oct 2016 WO
2017006134 Jan 2017 WO
2017109140 Jun 2017 WO
2017112664 Jun 2017 WO
2017165909 Oct 2017 WO
2017187397 Nov 2017 WO
2017198891 Nov 2017 WO
2017201489 Nov 2017 WO
2017220115 Dec 2017 WO
2018026727 Feb 2018 WO
2018037148 Mar 2018 WO
Non-Patent Literature Citations (285)
Entry
Noizat, “Handbook of Digital Currency Chapter 22: Blockchain Electronic Vote,” Elsevier Inc., David Lee Kuo Chuen (ed.), May 2015, 9 pages.
NXT, “Voting,” nxt.org, website archived on Feb. 18, 2016 [retrieved May 31, 2022], https://web.archive.org/web/20160218021746/https://nxt.org/what-is-nxt/voting/, 3 pages.
Openchain, “Home Page,” openchain.org, Dec. 22, 2015 [retrieved May 8, 2020], https://web.archive.org/web/20151222083734/https://www.openchain.org/, 18 pages.
OpenSSL Wiki, “Elliptic Curve Diffie Hellman,” OpenSSL, https://wiki.openssl.org/index.php/Elliptic_Curve_Diffie_Hellman, Mar. 10, 2014 [retrieved Dec. 10, 2018], 5 pages.
OpenSSL Wiki, “EVP Key Agreement,” OpenSSL, https://wiki.openssl.org/index.php/EVP_Key_Agreement, Apr. 28, 2017 [retrieved Dec. 10, 2018], 2 pages.
Ouaddah et al., “FairAccess: a new Blockchain based access control framework for the Internet of Things,” Security and Communication Networks 9(18):5943-5964, Feb. 2017, https://www.researchgate.net/publication/313847688_FairAccess.
Perry, “Tapeke: Bitcoin Accounting for Non-Accountants, ” http://codinginmysleep.com/tapeke-bitcoin-accounting-for-non-accountants/, Jan. 21, 2015, 1 page.
Poon et al., “The Bitcoin Lightning Network: Scalable Off-Chain Instant Payments,” https://www.bitcoinlightning.com/wp-content/uploads/2018/03/lightning-network-paper.pdf, Jan. 14, 2016 [retrieved Dec. 10, 2018], 59 pages.
Pornin, “Deterministic Usage of the Digital Signature Algorithm (DSA) and Elliptic Curve Digital Signature Algorithm (ECDSA),” Request for Comments: 6979, Independent Submission, Aug. 2013, 79 pages.
Pour, “Bitcoin multisig the hard way: Understanding raw P2SH multisig transactions,” Dec. 20, 2014, https://www.soroushjp.com/2014/12/20/bitcoin-multisig-the-hard-way-understanding-raw-multisignature-bitcoin-transactions/, 19 pages.
Pustogarov, “Deanonymisation techniques for Tor and Bitcoin,” PhD Dissertation, The Faculty of Sciences, Technology and Communication, Docteur de L'Université du Luxembourg en Informatique, Jun. 12, 2015, https://orbilu.uni.lu/bitstream/10993/21798/1/phdthesis-pustogarov.pdf, 135 pages.
Reddit, “Could Microsoft use the blockchain as a license key for it's software?,” r/Bitcoin, Sep. 7, 2015 [retrieved May 8, 2020], https://www.reddit.com/r/Bitcoin/comments/3jz09c/could_microsoft_use_the_blockchain_as_a_license/?st=iw26pndq&sh=b862bf7d, 2 pages.
Reiner et al., “Bitcoin Wallet Identity Verification Specification,” diyhpluswiki, http://diyhpl.us/-bryan/papers2/bitcoin/armory-verisign -bitcoin-wallet-identityspecification.pdf, Feb. 27, 2015 (retrieved Jan. 27, 2016), 24 pages.
Rockwell, “BitCongress—Process For Blockchain Voting & Law,” retrieved from http://generalbitcoin.com/BitCongress_Whitepaper.pdf, Feb. 12, 2016, 8 pages.
Ryepdx et al., “Answer to ‘What is the Global Registrar?’,” Ethereum Stack Exchange, Feb. 26, 2016 [retrieved Jan. 30, 2017], http://ethereum.stackexchange.com/questions/1610/what-is-the-global-registrar, 3 pages.
Sams, “Ethereum: Turing-complete, programmable money,” Cryptonomics, Feb. 1, 2014, https://cryptonomics.org/2014/02/01/ethereum-turing-complete-programmable-money, 4 pages.
Sanchez, “Marketplaces,” GitHub, Jun. 10, 2015 [retrieved May 12, 2020], https://github.com/drwasho/openbazaar-documentation/blob/master/04%20Marketplaces.md, 37 pages.
Sanchez, “Protocol,” Github, https://github.com/drwasho/openbazaar-documentation/blob/master/03%20Protocol.md, Jun. 15, 2015, 53 pages.
Sanchez, “Ricardian Contracts in OpenBazaar,” Github, https://gist.github.com/drwasho/a5380544c170bdbbbad8, Jan. 2016, 12 pages.
Sardesai, “Coinffeine: A P2P Alternative to Centralised Bitcoin Exchanges,” Cryptocoins News, Mar. 2, 2014 [retrieved Feb. 14, 2017], https://www.cryptocoinsnews.com/coinffeine-p2p-alternative-centralised-bitcoin-exchanges/, 5 pages.
Satoshi et al., “Connection Limits,” Bitcoin Forum, Aug. 9, 2010, https:/bitcointalk.org/index.php?topic=741.0;prev_next=prev, 2 pages.
Scott, “Counterparty to Create First Peer-to-Peer Digital Asset Exchange Platform,” Cointelegraph, https://cointelegraph.com/news/counterparty_to_create_first_peer_to_peer_digital_asset_exchange_platform, Apr. 10, 2014 [retrieved Dec. 12, 2018], 2 pages.
Sevareid et al., “Use Case Asset Depository,” Github.com, Jan. 11, 2016 version (last edited May 5, 2016) [retrieved Jan. 30, 2017], https://github.com/hyperledger/hyperledger/wiki/Use-Case-Asset-Depository, 4 pages.
Shafagh et al., “Towards Blockchain-based Auditable Storage and Sharing of IoT Data,” May 22, 2017, 2 pages.
Shafagh et al., “Towards Blockchain-based Auditable Storage and Sharing of IoT Data,” Nov. 14, 2017, 6 pages.
Sharma et al., “A Software Defined Fog Node Based Distributed Blockchain Cloud Architecture for IoT,” IEEE Access, Sep. 29, 2017, 10 pages.
Sheridan, “Digitizing Vehicles: The First Blockchain-Backed Car Passport,” BigchainDB Blog, https://blog.bigchaindb.com/digitizing-vehicles-the-first-blockchain-backed-car-passport-b55ead6dbc71, Mar. 24, 2017, 5 pages.
Snow et al., “Factom: Business Processes Secured by Immutable Audit Trails on the Blockchain Version 1.2,” factom.com, Apr. 25, 2018, 38 pages.
Sogeti Labs, “IoT Security Using Blockchain,” retrieved from https://labs.sogeti.com/iot-security-using-blockchain/, May 31, 2017, 13 pages.
Stampery, “Features: Blockchain-based data certification at your fingertips,” Stampery.com, https://stampery.com/features/, archived Mar. 5, 2016 [retrieved Nov. 3, 2016], 4 pages.
Stöcker, “Implementing First Industry 4.0 Use Cases with SAG Tangle Machine Tagging for Digital Twins,” retrieved from https://cstoecker.medium.com/implementing-first-industry-4-0-use-cases-with-iota-dag-tangle-machine-tagging-for-digital-twins-baf1943c499d, Jun. 24, 2017, 9 pages.
Sullivan et al., “Peer-to-peer Affine Commitment using Bitcoin,” Carnegie Mellon University, Jun. 17, 2015, 54 pages.
Swan, “Blockchain: Blueprint for a New Economy,” O'Reilly, Feb. 2015, 149 pages.
Swanson, “Great Chain of Numbers: Chapter 3: Next Generation Platforms,” Great Wall of Numbers, Mar. 4, 2014 [retrieved Jan. 30, 2017], http://www.ofnumbers.com/2014/03/04/chapter-3-next-generation-platforms/, 25 pages.
Taiwanese Office Action mailed Apr. 12, 2021, Patent Application No. 109142412, 5 pages.
Taiwanese Office Action mailed Jul. 28, 2020, Patent Application No. 106105709, 9 pages.
Taiwanese Office Action mailed Oct. 7, 2020, Patent Application No. 106105713, 4 pages.
Tasca et al., “Digital Currencies: Principles, Trends, Opportunities, and Risks,” ECUREX Research Working Paper, Sep. 7, 2015 (Oct. 2015 version), 110 pages.
Third-Party Submission Under 37 CFR 1.290 mailed Jun. 12, 2019, U.S. Appl. No. 16/078,605, filed Aug. 21, 2018, 31 pages.
Third-Party Submission Under 37 CFR 1.290 mailed Jun. 12, 2019, U.S. Appl. No. 16/079,089, filed Aug. 22, 2018, 19 pages.
Timeisnow77724 et al., “Help understanding counterparty, thanks in advance!,” Reddit r/counterparty_xcp, https://www.reddit.com/r/counterparty_xcp/comments/2qntze/help_understanding_counterparty_thanks_in_advance/, Dec. 28, 2014 [retrieved Dec. 11, 2018], 4 pages.
Toomim, “P2pool as prior art for nChain's Turing Complete Transactions patent—or, how to patent all blockchain apps without anybody noticing,” Medium, Sep. 3, 2018, https://medium.com/@j_73307/p2pool-as-prior-art-for-nchains-turing-complete-transactions-patent-or-how-to-patent-all-40f3d429eaa4, 13 pages.
Trouton et al., “3D Opportunity for Blockchain,” Deloitte University Press, 2016, 20 pages.
Tuesta et al., “Smart contracts: the ultimate automation of trust?,” BBVA Research Financial Inclusion Unit, Oct. 2015, 5 pages.
UK Commercial Search Report mailed Apr. 25, 2016, Patent Application No. 11603117.1, filed Feb. 23, 2016, 11 pages.
UK Commercial Search Report mailed Feb. 15, 2018, Patent Application No. GB1718182.7, 12 pages.
UK Commercial Search Report mailed Feb. 16, 2018, Patent Application No. GB1719212.1, 15 pages.
UK Commercial Search Report mailed Feb. 17, 2017, Patent Application No. 1604493.5, 8 pages.
UK Commercial Search Report mailed Feb. 28, 2017, Patent Application No. GB1719654.4, 6 pages.
UK Commercial Search Report mailed Jan. 13, 2017, Patent Application No. 1604498.4, 8 pages.
Bitfury Group, “Public Versus Private Blockchains”, Part 2: Permissionless Blackchains, in collaboration with Jeff Garzik, Version 1.0, Oct. 20, 2015, 20 pages.
Gauthierdickey, et al. “Secure Peer-to-Peer Trading in Small and Large Scale Multiplayer Games”, Multimedia Systems, Apr. 29, 2014, 13 pages.
Feng et al., “A Next Generation Cryptocurrency Platform Ethereum and Its Evaluation”, Oct. 14, 2015, 12 pages.
Ramaswami, U., et al., “Genotype and Phenotype in Hypochondroplasia”, 1998, Mosby, Inc., 5 pages.
UK Commercial Search Report mailed Jan. 18, 2017, Patent Application No. GB510135, filed Mar. 16, 2016, 5 pages.
Abeikverdi et al., “Generating interactive, secure multiple ECC key pairs deterministically,” StackExchange, http://crypto.stackexchange.com/questions/25191/generating-interactivesecure-multiple-ecc-key-pairs-deterministically, Apr. 23, 2015 [retrieved Dec. 26, 2016], 2 pages.
Akcora et al., “Blockchain: A Graph Primer,” arXiv preprint arXiv:1708.08749, Aug. 10, 2017, https://pdfs.semanticscholar.org/1098/64228a62da90454f4d41dfced7c274939f7f.pdf, 16 pages.
Akutsu et al., “Taking on the challenge of creating epoch-making services that impress users. For services that can share the excitement of competitions around the world,” NTT Technical Journal 27(5):10-14, May 1, 2015.
Allison, “Symbiont's Adam Krellenstein: There's really only two smart contract systems—Ethereum's and ours,” International Business Times, https://www.ibtimes.co.uk/symbionts-adam-krellenstein-theres-really-only-two-smart-contract-systems-ethereums-ours-1530490, Nov. 25, 2015 [retrieved Dec. 12, 2018], 4 pages.
Alonso et al., “Digital Economy Outlook,” BBVA Research, Oct. 2015, https://www.bbvaresearch.com/wpcontent/uploads/2015/10/Digital_Economy_Outlook_Oct15_Cap1.pdf, 16 pages.
Andersen, “Blockchain Technology: A game-changer in accounting?,” Deloitte & Touche GmbH Wirtschaftsprüfungsgesellschaft, Mar. 2016, 5 pages.
Andresen et al., “Relay OP_RETURN data TxOut as standard transaction type. #2738,” Github, Jun. 4, 2013, https://github.com/bitcoin/bitcoin/pull/2738, 12 pages.
Angrish et al., “A Flexible Data Schema and System Architecture for the Virtualization of Manufacturing Machines (VMM),” 2017, 3 pages.
Anonymous, “Bitcoin Core 0.11 (ch 2): Data Storage—Bitcoin Wiki,” retrieved from https://en.bitcoin.it/w/index/php?title=Bitcoin_core-0.11_(ch_2):_Data_Storage, Jan. 16, 2016, 10 pages.
Anonymous, “Bitcoin Developer Guide,” Bitcoin Project, https://web.archive.org/web/20160515171209/https://bitcoin.org/en/developer-guide, May 15, 2016 [retrieved Mar. 13, 2019], 55 pages.
Anonymous, “Bitcoin Stats,” retrieved from http://bitcoinstats.com/irc/bitcoin-dev/logs/2015/03/27, Mar. 27, 2015, 11 pages.
Anonymous, “Bitsquare—The decentralised bitcoin exchange,” Bitsquare.io, Jan. 3, 2016 , 14 pages.
Anonymous, “Homepage,” website operational as of 2017 [retrieved Nov. 30, 2020], https://www.coinffeine.com/, 2 pages.
Anonymous, “What is Blockchain Technology? A Step-by-Step Guide for Beginners,” retrieved from https://web.archive.org/web/20171016062654/https://blockgeeks.com/guides/what-is-blockchain-technology/, Oct. 16, 2017, 12 pages.
Antonopoulos et al., “Bitcoin Book,” GitHub, retrieved from https://github.com/bitcoinbook/bitcoinbook, Jun. 8, 2017, 4 pages.
Antonopoulos, “Mastering Bitcoin—Unlocking Digital Cryptocurrencies,” O'Reilly Media, Inc., Dec. 20, 2014, 282 pages.
Australian Office Action for Application No. 2017223158, mailed Jun. 22, 2021, 7 pages.
Biryukov et al., “Deanonymisation of clients in Bitcoin P2P network,” Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, Nov. 3, 2014, 15 pages.
Bitcoin Forum, “Counterparty—Pioneering Peer-to-Peer Finance”, https://bitcointalk.org/index.php?topic=395761.0, Feb. 1, 2014, 7 pages.
bitcoininvestor.com, “All-Star Panel: Ed Moy, Joseph VaughnPerling, Trace Mayer, Nick Szabo, Dr. Craig Wright,” YouTube, https://youtu.be/LdvQTwjVmrE, Bitcoin Investor Conference, Oct. 29, 2015 [retrieved Dec. 12, 2018], 1 page.
Bitfreak! et al, “Understanding Stealth Addresses/Payments,” Bitcoin Forum, Jun. 10, 2015 (retrieved Jun. 16, 2020), https://bitcointalk.org/index.php?topic=1086498.0, 8 pages.
Bitfury Group, “Smart Contracts on Bitcoin Blockchain,” BitFury Group Limited, Aug. 13, 2015 (updated Sep. 4, 2015), http://bitfury.com/content/5-white-papers-research/contracts-1.1.1.pdf, 20 pages.
Blechschmidt, “Digital Twin on Blockchain,” Cognizant Business Consulting, Jun. 2017, 15 pages.
Block_Chan, “Tweet dated Nov. 7, 2018,” Twitter, Nov. 7, 2018, https://twitter.com/block_chan/status/1060336404163584000, 1 page.
Blockgeeks, “What is Blockchain Technology? A Step-by-Step Guide For Beginners,” retrieved from https://web.archive.org/web/20171016062654/https://blockgeeks.com/guides/what-is-blockchain-technology/, Oct. 16, 2017, 2 pages.
Bluematt, http://bitcoinstats.com/irc/bitcoin-dev/logs/2015/03/16.
Bradbury, “Developers Battle Over Bitcoin Block Chain,” Coindesk, http://www.coindesk.com/developers-battle-bitcoin-block-chain/, Mar. 25, 2014, 3 pages.
Brown et al., “Standards for Efficient Cryptography 1: Elliptic Curve Cryptography Version 2.0,” Certicom Research, May 21, 2009, 144 pages.
Brown et al., “Standards for Efficient Cryptography 2: Recommended Elliptic Curve Domain Parameters Version 2.0,” Certicom Research, Jan. 27, 2010, 37 pages.
Brown, “On Distributed Satabases and Distributed Ledgers”, Thoughts on the Future of Finance, Nov. 8, 2016, https://gendal.me/page/3/, 44 pages.
Burgess et al., “The Promise of Bitcoin and the Blockchain,” Consumers' Research, Jul. 13, 2015, 97 pages.
Buterin et al., “Ethereum Development Tutorial,” GitHub, Jul. 1, 2014 [retrieved Jul. 20, 2021], https://github.com/ethereum/wiki/wiki/ethereum-development-tutorial/0c1f501ea03a787910049b03723f1bfd7a14c9c6, 13 pages.
Buterin, “Bitcoin Multisig Wallet: The Future Of Bitcoin,” Bitcoin Magazine, Mar. 13, 2014 [retrieved May 12, 2020], https://bitcoinmagazine.com/articles/multisig-future-bitcoin-1394686504, 7 pages.
Buterin, “Introducing Ethereum Script 2.0”, Ethereum Foundation Blog, Feb. 3, 2014, 9 pages.
Buterin, “Secret Sharing DAOs: The Other Crypto 2.0,” Ethereum Blog, Dec. 26, 2014 [retrieved Nov. 21, 2019], https://ethereum.github.io/blog/2014/12/26/secret-sharing-daos-crypto-2-0/, 10 pages.
Campagna et al., “Standards for Efficient Cryptography 4: Elliptic Curve Qu-Vanstone Implicit Certificate Scheme (ECQV) Version 1.0,” Certicom Research, Jan. 24, 2013, 32 pages.
Charlon et al., “Open-Assests-Protocol,” Github.com, Nov. 17, 2015 [retrieved Jan. 30, 2017], https://github.com/OpenAssets/open-assets-protocol/blob/master/specification.mediawiki, 5 pages.
Christidis et al., “Blockchains and Smart Contracts for the Internet of Things,” IEEE Access 4(1):2292-2303, May 10, 2016.
Coinprism, “80 bytes OP_Return explained,” Coinprism Blog, http://blog.coinprism.com/2015/02/11/80-bytes-op-return/, Feb. 11, 2015 [retrieved Dec. 21, 2018], 8 pages.
Corallo, “[Bitcoin-development] Relative Checklocktimeverify (was CLTV proposal),” Linux Foundation, https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2015-May/007858.html, May 4, 2015 [retrieved Dec. 12, 2018], 3 pages.
Counterparty, “Home Page,” Counterparty, copyright 2018 [retrieved Jan. 13, 2020], counterparty.io, 3 pages.
Countyparty, “The Counterparty Protocol,” retrieved from https://github.com/jsimnz/Counterparty/blob/master/README.md, Jan. 8, 2014, 6 pages.
CPCHAIN, “Decentralized Infrastructure for Next Generation Internet of Things,” Jan. 10, 2018, 34 pages.
crpit.com, FYJC Mumbai 11th Online Admission 2021—Part—1, 2 Admission Form (mumbai.11thadmission.Org.in), https://crpit.com, Jul. 6, 2021 8 pages.
Danda et al., “hd-wallet-addrs,” GitHub, https://github.com/dan-da/hd-wallet-addrs, Dec. 30, 2015 [retrieved Mar. 11, 2016], 7 pages.
Danda et al., “Is there any service/api for deriving HD wallet addresses from a master public key?,” StackExchange, http://bitcoin.stackexchange.com/questions/38887/is-there-any-service-api-for-deriving-hdwallet-addresses-from-a-master-public-k, Jul. 30, 2015, 2 pages.
Danda, “Help / FAQ,” MyBitPrices, https://mybitprices.info/hd-wallet-addrs.html, Jan. 1, 2016 [retrieved Mar. 11, 2016], 4 pages.
Das, “As Exchanges Pause Withdrawals, Chinese Bitcoin Investors Switch to P2P Trading,” CCN, Feb. 13, 2017 [retrieved May 12, 2020], https://www.ccn.com/chinese-bitcoin-investors-switch-p2p-trading-exchanges-pause-withdrawals/, 4 pages.
Dash et al., “bips/bip-0047.mediawiki,” Github, Feb. 24, 2016 (retrieved Jun. 16, 2020), https://github.com/bitcoin/bips/blob/15c0b250cb5b77eba3ea709b082d7da6a310d991/bip-0047.mediawiki, 16 pages.
Datta, “Emergence of Digital Twins—Is This the March of Reason?,” Journal of Innovation Management, 2017, 20 pages.
Lazarovich, Amir, “Invisible Ink: Blockchain for Data Privacy”, May 8, 2015, 85 pages.
Zindros, Dionysis, “A Pseudonymous Trust System for a Decentralized Anonymous Marketplace”, web-of-trust.md, https://gist.github.com/dionyziz/e3b296861175e0ebea4b, Jul. 2, 2014, 30 pages.
Subramanian, et al., “The State of Cryptocurrencies, Their Issues and Policy Interactions”, International Information Management Association, vol. 24, No. 24, No. 3, 2015, pp. 25-40.
Greenspan, Dr. Gideon, “MultiChain Private Blcokchain”, White Paper, Jun. 2015, 17 pages.
Swanson, Tim, “Watermarked Tokens and Pseudonymity on Public Blockchains”, Nov. 4, 2015, 78 pages.
Manabu Takata et al., “Nikkei BP Mook, FinTech Revolution, Financial Common Sense Dissolved by Technology”, Nikkei Business Publications, Inc., Jan. 27, 2016, ISBN: 978-4-8222-7188-6, pp. 44-47.
Atsushi Takeda et al., “System Architecture for Decentralized Authentication in P2P Network”, IPSJ SIG technical Reports, Information Processing Society of Japan, Jun. 12, 2008, vol. 2008 No. 54, [ISSN] 0919-6072, pp. 63-68.
International Search Report and Written Opinion mailed Mar. 29, 2019, Patent Application No. PCT/IB2018/058258, 20 pages.
International Search Report and Written Opinion mailed Mar. 30, 2017, Patent Application No. PCT/IB2017/050819, 13 pages.
International Search Report and Written Opinion mailed Mar. 30, 2017, Patent Application No. PCT/IB2017/050825, 9 pages.
International Search Report and Written Opinion mailed May 29, 2017, International Patent Application No. PCT/IB2017/050815, filed Feb. 14, 2017, 10 pages.
International Search Report and Written Opinion mailed May 31, 2017, Patent Application No. PCT/IB2017/050856, filed Feb. 16, 2017, 11 pages.
International Search Report and Written Opinion mailed May 31, 2017, Patent Application No. PCT/IB2017/050867, 11 pages.
International Search Report and Written Opinion mailed May 31, 2017, Patent Application No. PCT/IB2017/050979, filed Feb. 21, 2017, 11 pages.
International Search Report and Written Opinion mailed May 31, 2017, Patent Application No. PCT/IB2017/050980, 12 pages.
IPLD, “IPLD” retrieved from https://web.archive.org/web/20170921113308/http://ipld.io/, Sep. 21, 2017, 10 pages.
Jaffey, “MQTT and CoAP, IoT Protocols,” Eclipse News Letter, retrieved from https://web.archive.org/web/20170731183138/http://www.eclipse.org/community/eclipse_newsletter/2014/february/article2.php, Jul. 31, 2017, 5 pages.
Japanese Notice of Reason(s) for Rejection mailed Mar. 30, 2021, Patent Application No. 2018-539890, 8 pages.
Japanese Notice of Reason(s) for Rejection mailed Mar. 30, 2021, Patent Application No. 2018-539893, 6 pages.
Japanese Office Action mailed Feb. 16, 2021, Patent Application No. 2018-539331, 7 pages.
Japanese Office Action mailed Jan. 22, 2019, Patent Application No. 2018-516682, filed Feb. 16, 2017, 14 pages.
Japanese Office Action mailed Oct. 6, 2020, Patent Application No. 2018-539865, 14 pages.
Japanese Office Action mailed Oct. 8, 2019, Patent Application No. 2018-539895, 9 pages.
Jesionek et al., “BIP0032: Hierarchical Deterministic Wallets,” GitHub, https://github.com/bitcoin/bips/blob/master/bip-0032.mediawiki, Jan. 2014, 9 pages.
JIM, “Journal of Innovation Management—The International Journal on Multidisciplinary Approaches on Innovation,” retrieved from https://repositorio-aberto.up.pt/handle/10216/107952, Oct. 30, 2017, 161 pages.
Il2012 et al., “MinAddress : Now remember your addresses easily,” BitCoinTalk, Sep. 16, 2014 (retrieved Jun. 16, 2020), https://bitcointalk.org/index.php?topic=774741.150;wap2, 3 pages.
Keane, “Trust Your Odometer? Blockchain Test Aims to Turn Tide on Car Tampering,” retireved from https://www.coindesk.com/markets/2017/07/21/trust-your-odometer-blockchain-test-aims-to-turn-tide-on-car-tampering/, Jul. 21, 2017, 6 pages.
Ken K., “Tutorial 1: Your first contract,” Ethereum.org, Dec. 2014, https://web.archive.org/save/_embed/https://forum.ethereum.org/discussion/1634/tutorial-1-your-first-contract/p1, 22 pages.
Kens et al., “Cryptocontracts Will Turn Contract Law Into a Programming Language ,” Hacker News, Feb. 23, 2014, https://news.ycombinator.com/item?id=7287155, 12 pages.
Killerstorm et al., “Transcript for #bitcoin-dev Sep. 3, 2012,” BitcoinStats, http://www.bitcoinstats.com/irc/bitcoin-dev/logs/2012/09/03, Sep. 3, 2012 [retrieved Dec. 21, 2018], 14 pages.
Koblitz et al., “Cryptocash, Cryptocurrencies, and Cryptocontracts,” Designs, Codes and Cryptography 78 (1):87-102, publication available online Oct. 1, 2015, print publication Jan. 2016.
Kosba et al., “Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts,” IEEE Symposium on Security and Privacy, May 22, 2016, 31 pages.
Kravchenko, “Distributed multi-ledger model for financial industry,” Github.com, Oct. 21, 2015 [retrieved Jan. 30, 2017], https://github.com/WebOfTrustInfo/rebooting-the-web-of-trust/blob/master/topics-andadvance-readings/DistributedMulti-ledgerModelForFinancialIndustry.md, 2 pages.
Krawczyk, “HMQV: A High-Performance Secure Diffie-Hellman Protocol,” Annual International Cryptology Conference 2005, Aug. 14, 2005, first disclosed online Jul. 5, 2005, 66 pages.
Krellenstein, “The Counterparty Protocol,” GitHub, https://github.com/jsimnz/Counterparty/blob/master/README.md, Jan. 8, 2014 [Dec. 12, 2018], 4 pages.
Lebeau, “An Ethereum Journey to Decentralize All Things,” retrieved from https://medium.com/@SingularDTV/an-ethereum-journey-to-decentralize-all-things- 8d62b02e232b#.r6n9w8kqh, Jul. 11, 2016, 10 pages.
LG, “MQTT, Node-RED & Blockchain,” baumann.at, Oct. 17, 2017, 3 pages.
Lin et al., “Blockchain: The Evolutionary Next Step for ICT E-Agriculture,” Environments, 2017, 13 pages.
Luu et al., “Demystifying Incentives in the Consensus Computer,” ISBN, Oct. 2015, 14 pages.
Ly at al., “If An IoT Device's is Unable to Store its Data to the Ledger Due to the Size Limitation, What Will Happen?,” Quora, https://www.quora.com/If-an-IoT-device%E2%80%99s-is-unable-to-store-its-data-to-the-ledger-due-to-the-size-limitation-what-will-happen, 2017, 6 pages.
Mainelli, “Blockchain: why smart contracts need shrewder people,” Banking Technology, Apr. 4, 2016 [retrieved Jan. 30, 2017], http://www.bankingtech.com/461572/blockchain-why-smart-contracts-need-shrewderpeople/, 3 pages.
Makers, “#1 Meetup: IOTA and its Practical Application in the Automotive Industry,” https://www.youtube.com/watch?v=SVTOHdrsJ-U, Sep. 25, 2017, 24 pages.
Maxwell et al., “Blocksonly mode BW savings, the limits of efficient block xfer, and better relay,” Bitcoin Forum, Feb. 26, 2016, https://bitcointalk.org/index.php?topic=1377345.msg, 13 pages.
Maxwell et al., “Deterministic wallets,” Bitcoin Forum, https://bitcointalk.org/index.php?topic=19137.0; all, Jun. 18, 2011 [retrieved Dec. 10, 2018], 104 pages.
McCorry et al., “Authenticated Key Exchange over Bitcoin,” International Conference on Research in Security Standardisation 2015, Dec. 15, 2015, 18 pages.
Menezes et al., “Handbook of Applied Cryptography: pp. 33, 38,” CRC Press, Oct. 16, 1996, 3 pages.
Mezzomix et al., “Angebot: BTC (2-aus-3) Multisig Escrow (Treuhandabwicklung),” Bitcoin Forum, Feb. 9, 2014, https://bitcointalk.org/index.php?topic=456563.0, 7 pages.
Michalko et al., “Decent Whitepaper,” retrieved from http://forklog.net/decent-finalizes-its-decentralized-content-distribution-platform/, Nov. 2015, 20 pages.
Michalko, “Decent Finalizes its Decentralized Content Distribution Platform,” retrieved from http://forklog.net/decent-finalizes-its-decentralized-content-distribution-platform/, Dec. 14, 2016, 2 pages.
Mike et al., “Contract,” Bitcoin Wiki, Oct. 22, 2015 version (first disclosed May 22, 2011) [retrieved May 12, 2020], https://en.bitcoin.it/w/index.php?title=Contract&oldid=59172, 11 pages.
Miller et al., “bips/bip-dandelion.mediawiki,” GitHub, Jun. 10, 2017, https://github.com/gfanti/bips/blob/master/bip-dandelion.mediawiki, 8 pages.
Minsky et al., “Computation: Finite and Infinite Machines Chapter 14: Very Simple Bases for Computability,” Prentice Hall, Inc, 1967, 29 pages.
Mrbandrews, “Bitcoin Core 0.11 (ch 2): Data Storage,” Bitcoin Wiki, Jan. 13, 2016 (last revision Jan. 21, 2016) [retrieved May 8, 2020], https://en.bitcoin.it/w/index.php?title=Bitcoin_Core_0.11_(ch_2):_Data_storage&oldid=60024, 10 pages.
Mülli, “A Decentralized Bitcoin Exchange with Bitsquare—Attack Scenarios and Countermeasures,” University of Zurich Department of Informatics Communication Systems Group Master Thesis, Jul. 30, 2015, 61 pages.
Nakamoto, “Bitcoin: A Peer-to-Peer Electronic Cash System,” Bitcoin, Oct. 31, 2008, https://bitcoin.org/bitcoin.pdf, 9 pages.
Neudecker et al., “Timing Analysis for Inferring the Topology of the Bitcoin Peer-to-Peer Network,” 2016 International IEEE Conferences on Ubiquitous Intelligence & Computing, Advanced and Trusted Computing, Scalable Computing and Communications, Cloud and Big Data Computing, Internet of People, and Smart World Congress (UIC/ATC/ScalCom/CBDCom/IoP/SmartWorld), Jul. 18, 2016, https://www.dsn.kastel.kit.edu/publications/files/323/bitcoin_timing_analysis_dsn.pdf, 10 pages.
Noizat et al., “Blockchain Electronic Vote,” retrieved from https://www.weusecoins.com/assets/pdf/library/blockchain-electronic-vote.pdf, Apr. 29, 2015, 9 pages.
Wikipedia, “Counterparty (platform),” Wikipedia, the Free Encyclopedia, last edited Dec. 6, 2019 [retrieved Jan. 13, 2020], https://en.wikipedia.org/wiki/Counterparty_(platform), 2 pages.
Wikipedia, “Shamir's Secret Sharing,” Wikipedia the Free Encyclopedia, Jan. 20, 2017 version [retrieved on Jan. 9, 2019], https://en.wikipedia.org/w/index.php?title=Shamir's_Secret_Sharing&oldid=761082071, 6 pages.
Wikipedia, “Shamir's Secret Sharing,” Wikipedia the Free Encyclopedia, Mar. 6, 2016 version [retrieved on Jun. 24, 2019], https://en.wikipedia.org/w/index.php?title=Shamir's_Secret_Sharing&oldid=708636892, 6 pages.
Willet et al., “Omni Protocol Specification (formerly Mastercoin),” Github, Nov. 5, 2013 [retrieved May 12, 2020], https://github.com/OmniLayer/spec/blob/9978cc3984ae0b6e51216c4ae74042fc4097b993/README.md, 69 pages.
Willoms et al., “Using blockchain to save and verify software licensing,” Bitcoin Forum, https://bitcointalk.org/index.php?topic=671435.0, Jun. 30, 2014 [retrieved Dec. 13, 2018], 3 pages.
Wood, “Ethereum: A Secure Decentralised Generalised Transaction Ledger: Final Draft—Under Review,” Etereum Project Yellow Paper, http://tech.lab.carl.pro/kb/ethereum/yellowpaper, Apr. 2014, 32 pages.
Wright, “Registry and Automated Management Method for Blockchain Enforced Smart Contracts,” U.S. Appl. No. 15/138,717, filed Apr. 26, 2016.
Wuille, “Hierarchical Deterministic Wallets,” Github, https://github.com/bitcoin/bips/blob/ab90b5289f0356282397fa9b8aa47d2238a7b380/bip-0032.mediawiki, Feb. 12, 2016 (retrieved Mar. 23, 2017), 9 pages.
Yaokai et al., “Experimental evaluation of the next-generation cryptocurrency platform Ethereum,” CSS2015 Computer Security Symposium 2015 Proceedings 2015(3):1151-1158, Oct. 14, 2015.
Zhang et al., “AntShare Trading Platform,” Github.com, Jun. 3, 2016 (last edited Aug. 21, 2016) [retrieved Jan. 30, 2017], https://github.com/AntShares/AntShares/wiki/Whitepaper-1.1, 9 pages.
Zyskind et al., “Decentralizing Privacy: Using a Blockchain to Protect Personal Data,” 2015 IEEE CS Security and Privacy Workshops, May 21, 2015, 5 pages.
Zyskind et al., “Enigma: Decentralized Computation Platform with Guaranteed Privacy,” arXiv preprint arXiv:1506, Jun. 10, 2015, 14 pages.
UK Commercial Search Report mailed Jun. 14, 2016, Patent Application No. 1607249.8, 4 pages.
UK Commercial Search Report mailed Jun. 27, 2016, Patent Application No. GB1603123.9, filed Feb. 23, 2016, 11 pages.
UK Commercial Search Report mailed Jun. 27, 2016, Patent Application No. GB1603125.4, filed Feb. 23, 2016, 11 pages.
UK Commercial Search Report mailed Jun. 28, 2016, Patent Application No. GB1603122.1, filed Feb. 23, 2016, 12 pages.
UK Commercial Search Report mailed Jun. 6, 2016, Patent Application No. 1604497.6, filed Mar. 16, 2016, 6 pages.
UK Commercial Search Report mailed Jun. 9, 2016, Patent Application No. GB1603114.8 , 4 pages.
UK Commercial Search Report mailed Jun. 9, 2016, Patent Application No. GB1603117.1, filed Feb. 23, 2016, 12 pages.
UK Commercial Search Report mailed May 16, 2016, Patent Application No. GB1603125.4, 8 pages.
UK Commercial Search Report mailed May 20, 2016, Patent Application No. 1605026.2, 4 pages.
UK Commercial Search Report mailed May 24, 2016, Patent Application No. GB1605571.7, filed Apr. 1, 2016, 3 pages.
UK Commercial Search Report mailed May 9, 2016, Patent Application No. GB1603112.2, 6 pages.
UK Commercial Search Report mailed May 9, 2016, Patent Application No. GB1603114.8, filed Feb. 23, 2016, 2 pages.
UK Commercial Search Report mailed Nov. 14, 2016, Patent Application No. GB1607063.3, 8 pages.
UK Commercial Search Report mailed Nov. 30, 2016, Patent Application No. 1607058.3, filed Apr. 22, 2016, 7 pages.
UK Commercial Search Report mailed Oct. 10, 2016, Patent Application No. GB1607484.1, filed Apr. 29, 2016, 5 pages.
UK Commercial Search Report mailed Sep. 30, 2016, Patent Application No. 1606630.0, filed Apr. 15, 2016, 7 pages.
UK Expanded Commercial Search Report mailed Jun. 15, 2016, Patent Application No. 1605026.2, 5 pages.
UK IPO Search Report mailed Dec. 12, 2016, Patent Application No. GB1606630.0, filed Apr. 15, 2016, 4 pages.
UK IPO Search Report mailed Dec. 15, 2016, Patent Application No. GB1607063.3, 6 pages.
UK IPO Search Report mailed Dec. 21, 2016, Patent Application No. GB1607058.3, 3 pages.
UK IPO Search Report mailed Dec. 21, 2016, Patent Application No. GB1607058.3, filed Apr. 22, 2016, 3 pages.
UK IPO Search Report mailed Dec. 23, 2016, Patent Application No. GB1604495.0, 5 pages.
UK IPO Search Report mailed Dec. 28, 2016, Patent Application No. GB1604497.6, filed Mar. 16, 2016, 4 pages.
UK IPO Search Report mailed Dec. 5, 2016, Patent Application No. 1607249.8, 4 pages.
UK IPO Search Report mailed Dec. 6, 2016, Patent Application No. 1604493.5, 6 pages.
UK IPO Search Report mailed Dec. 6, 2016, Patent Application No. 1607482.5, 5 pages.
UK IPO Search Report mailed Jan. 25, 2017, Patent Application No. 1605026.2, 3 pages.
UK IPO Search Report mailed Jan. 3, 2017, Patent Application No. 1604498.4, 4 pages.
UK IPO Search Report mailed Jul. 26, 2016, Patent Application No. GB1603114.8, filed Feb. 23, 2016, 5 pages.
UK IPO Search Report mailed Jul. 4, 2016, Patent Application No. GB1603125.4, filed Feb. 23, 2016, 6 pages.
UK IPO Search Report mailed Jul. 5, 2016, Patent Application No. GB1603123.9, filed Feb. 23, 2016, 5 pages.
UK IPO Search Report mailed May 1, 2018, Patent Application No. GB1718182.7, 5 pages.
UK IPO Search Report mailed May 1, 2018, Patent Application No. GB1719212.1, 5 pages.
UK IPO Search Report mailed May 1, 2018, Patent Application No. GB1804744.9, 5 pages.
UK IPO Search Report mailed May 9, 2018, Patent Application No. GB1719654.4, 4 pages.
UK IPO Search Report mailed Oct. 17, 2016, Patent Application No. GB1603117.1, filed Feb. 23, 2016, 5 pages.
UK IPO Search Report mailed Oct. 21, 2016, Patent Application No. GB1603112.2, 4 pages.
UK IPO Search Report mailed Oct. 26, 2016, Patent Application No. GB1603122.1, filed Feb. 23, 2016, 4 pages.
UK IPO Search Report mailed Sep. 9, 2016, Patent Application No. GB1605571.7, filed Apr. 1, 2016, 5 pages.
Van Der Ploeg, “Releasing the Potential of Blockchain—Why Unchain.io?,” Sep. 7, 2017, 2 pages.
Van Renesse, “A Blockchain Based on Gossip?—a Position Paper,” Cornell University, 2016, https://www.zurich.ibm.com/dccl/papers/renesse_dccl.pdf, 4 pages.
Vayngrib, “DHT hardening,” GitHub, https://github.com/tradle/about/wiki/DHT-hardening, Feb. 2, 2015 (last updated May 21, 2015) [retrieved Dec. 13, 2018], 5 pages.
Vayngrib, “Future, operating business on chain,” Github.com, May 4, 2015 [retrieved Jan. 30, 2017], https://github.com/tradle/about/wiki/Future,-operating-business-on-chain, 9 pages.
Vietnamese Office Action mailed Sep. 27, 2018, Patent Application No. 1-2018-03358, filed Feb. 16, 2017, 2 pages.
Walport et al., “Distributed Ledger Technology: beyond block chain—A report by the UK Government Chief Scientific Adviser,” United Kingdom Government Office for Science, Dec. 2015, 88 pages.
Wang et al., “Towards Better Understanding of Bitcoin Unreachable Peers,” arXiv preprint arXiv:1709.06837, Sep. 20, 2017, https://arxiv.org/pdf/1709.06837.pdf, 7 pages.
Watanabe et al., “Blockchain contract: A complete consensus using blockchain,” IEEE 4th Global Conference on Consumer Electronics, Oct. 27, 2015, 3 pages.
Weller et al., “CounterpartyXCP/Documentation: Protocol Specification,” Github.com, Jan. 25, 2015 (last edited Jun. 17, 2019) [retrieved Jan. 13, 2020], https://github.com/CounterpartyXCP/Documentation/blob/master/Developers/protocol_specification.md, 10 pages.
White, “How Computers Work,” Que Publishing 7th Edition, Oct. 15, 2003, 44 pages.
Whitequark, “#bitcoin-wizards on Jul. 30, 2015—irc logs at whitequark.org,” whitequark.org, https://irclog.whitequark.org/bitcoin-wizards/2015-07-30, Jul. 30, 2015 [retrieved Dec. 12, 2018], 8 pages.
Decker, “[BIP] Normalized transaction IDs,” Bitcoin-Dev, https://bitcoin-development.narkive.com/DjOYjEig/bip-normalized-transaction-ids, Oct. 19, 2015 [retrieved Dec. 12, 2018], 16 pages.
Dixon, “True peer-to-peer currency exchange?,” DGC Magazine, Jul. 2, 2013 [retrieved May 12, 2020], http://dgcmagazine.com/true-peer-to-peer-currency exchange/, 6 pages.
Dorier, “Colored Coins and Ricardian Contracts,” Coinprism Blog, Dec. 10, 2014 [retrieved Jan. 30, 2017], http://blog.coinprism.com/2014/12/10/colored-coins-and-ricardian-contracts/, 9 pages.
Drcode, “New Kid on the Blockchain,” Hacker News, https://news.ycombinator.com/item?id=11372455, Mar. 28, 2016 [Dec. 12, 2018], 32 pages.
Durback, “Standard BIP Draft: Turing Pseudo-Completeness,” Bitcoin-Dev, Dec. 10, 2015, https://bitcoin-development.narkive.com/uRciVtAQ/standard-bip-draft-turing-pseudo-completeness, 11 pages.
Eragmus et al., “Time to lobby Bitcoin's core devs: “SF Bitcoin Devs Seminar—Scalability to billions of transactions per day, satoshi-level Micropayments, near-zero risk of custodial theft, & Instant transactions” . . . but only w/ a malleability-fixing soft fork,” Reddit r/bitcoin, https://www.reddit.com/r/Bitcoin/comments/2z2191/time_to_lobby_bitcoins_core_devs_sf_bitcoin_devs/, Mar. 14, 2015 [Dec. 12, 2018], 21 pages.
Ethereum, “EIP-20: Token Standard,” retrieved from https://eips.ethereum.org/EIPS/eip-20, Nov. 19, 2015, 5 pages.
European Communication pursuant to Article 94(3) EPC mailed Jan. 2, 2020, Patent Application No. 18166910.2-1218, filed Feb. 16, 2017, 4 pages.
European Communication pursuant to Article 94(3) EPC mailed Jul. 1, 2019, Application No. 17707121.4-1218, filed Feb. 14, 2017, 6 pages.
Extended European Search Report mailed Jul. 18, 2018, Patent Application No. 18166910.2-1218, filed Feb. 16, 2017, 8 pages.
Familiar et al., “Transcript for #bitcoin-dev 2015/03/27,” BitcoinStats, http://bitcoinstats.com/irc/bitcoin-dev/logs/2015/03/27, Mar. 27, 2015 [archived version Jun. 27, 2016], 11 pages.
Fanti et al., “Dandelion: Privacy-Preserving Transaction Propagation,” Jun. 6, 2017, 4 pages.
Fimkrypto, “FIMK 0.6.4 Released,” Github.com, Feb. 11, 2016 [retrieved Jan. 30, 2017], https://github.com/fimkrypto/fimk/releases, 17 pages.
Flood et al., “Contract as Automaton: The Computational Representation of Financial Agreements,” Office of Financial Research Working Paper No. 15-04, Mar. 26, 2015, 25 pages.
Fotiou et al., “Decentralized Name-based Security for Content Distribution using Blockchains,” retrieved from, Mobile Multimedia Laboratory, Department of Informatics, Apr. 14, 2016, 6 pages.
Franco, “Understanding Bitcoin: Cryptography, Engineering and Economics,” Wiley, ISBN: 978-1-119-01916-9, Oct. 2014, 144 pages.
Friedenbach et al., “Freimarkets: extending bitcoin protocol with user-specified bearer instruments, peer-to-peer exchange, off-chain accounting, auctions, derivatives and transitive transactions,” Version v0.01, http://freico.in/docs/freimarkets-v0.0.1.pdf, Aug. 24, 2013 [retrieved Dec. 12, 2018], 25 pages.
Friedenbach, “[Bitcoin-development] New Output Script Type,” Linux Foundation, Sep. 14, 2013, https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2013-September/003256.html, 2 pages.
Fuchita, “Special Topic: Innovation and Finance, Blockchain and Financial Transaction Innovation,” Nomura Capital Market Quarterly 19-2(74): 11-35, Nov. 1, 2015.
Fujimura et al., “Bright: A Concept for a Decentralized Rights Management System Based on Blockchain,” 2015 IEEE 5th International Conference on Consumer Electronics-Berlin (ICCE-Berlin), Sep. 6, 2015, 2 pages.
Gautham, “Bitwage Makes Bitcoin Payroll Easier with New Features,” NewsBTC, Mar. 9, 2016 (retrieved Jun. 16, 2020), https://www.newsbtc.com/2016/03/09/bitwage-makes-bitcoin-payroll-easier-new-features/, 4 pages.
Gennaro et al., “Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security,” International Conference on Applied Cryptography and Network Security, Jun. 9, 2016, 42 pages.
Gitbook, “Ethereum Frontier Guide,” Gitbook (Legacy), Feb. 4, 2016, 293 pages.
Github, “Bitcoin/Bips,” retrieved from http://web.archive.org/web/20150307191218/https://github.com/bitcoin/bips/blob/master/bip-0016.mediawiki, Apr. 5, 2014, 4 pages.
github.com, “Dual Key Stealth Address”, About Shadow, https://github.com/shadowproject/Shadow-Docs/blob/88501b5ba019780ef9a62d26678932c54a434e08/source/index.md, Mar. 10, 2016, 27 pages.
Goldfeder et al., “Securing Bitcoin Wallets via a New DSA/ECDSA threshold signature scheme,” manuscript, https://www.cs.princeton.edu/˜stevenag/threshold_sigs.pdf, 2015 [retrieved Jun. 21, 2018], 26 pages.
Goldfeder et al., “Securing Bitcoin wallets via threshold signatures” Princeton's Center for Information Technology Policy, Mar. 28, 2014, 11 pages.
Goldfeder et al., “Threshold signatures and Bitcoin wallet security: A menu of options,” Freedom to Tinker, May 23, 2014 [retrieved Nov. 16, 2020], https://freedom-to-tinker.com/2014/05/23/threshold-signatures-and-bitcoin-wallet-security-a-menu-of-options/, 3 pages.
Gutierrez, “Boeing Improves Operations with Blockchain and the Internet of Things,” retrieved from https://www.altoros.com/blog/boeing-improves-operations-with-blockchain-and-the-internet-of-things/, May 24, 2017, 12 pages.
Gutoski et al., “Hierarchical deterministic Bitcoin wallets that tolerate key leakage (Short paper),” Financial Cryptography and Data Security: 19th International Conference, FC 2015, Revised Selected Papers, Jan. 26, 2015, 9 pages.
Hacker News, “Cryptocontracts Will Turn Contract Law into a Programming Language,” retrieved from https://news.ycombinator.com/item?id=7287155, Feb. 23, 2014, 12 pages.
Hao, “On Robust Key Agreement Based on Public Key Authentication,” International Conference on Financial Cryptography and Data Security, Jan. 25, 2010, 12 pages.
Harayama et al., “Key escrow method of personal decryptographic key by using elliptic curve calculation,” Institute of Electronics, Information and Communication Engineers (IEICE) Technical Report 109(85):91-96, Jun. 11, 2009.
Hearn, “Distributed markets,” Bitcoin Wiki, https://en.bitcoin.it/wiki/Distributed_markets, Jul. 11, 2015 [retrieved Sep. 20, 2016], 5 pages.
Heber et al., “Towards a Digital Twin: How the Blockchain Can Foster E/E-traceability in Consideration of Model-Based Systems Engineering,” International Conference on Engineering Design, Aug. 21-25, 2017, 10 pages.
Herbert et al., “A Novel Method for Decentralised Peer-to-Peer Software License Validation Using Cryptocurrency Blockchain Technology,” Proceedings of the 38th Australasian Computer Science Conference, Jan. 27, 2015, 9 pages.
International Search Report and Written Opinion for Application No. PCT/IB2018/058256, mailed Jan. 31, 2019, filed Oct. 23, 2018, 15 pages.
International Search Report and Written Opinion mailed Apr. 10, 2017, Patent Application No. PCT/IB2017/050861, 11 pages.
International Search Report and Written Opinion mailed Apr. 12, 2017, Patent Application No. PCT/IB2017/050818, 10 pages.
International Search Report and Written Opinion mailed Apr. 12, 2017, Patent Application No. PCT/IB2017/050829, 9 pages.
International Search Report and Written Opinion mailed Apr. 12, 2017, Patent Application No. PCT/IB2017/050866, 10 pages.
International Search Report and Written Opinion mailed Apr. 21, 2017, Patent Application No. PCT/IB2017/050820, 12 pages.
International Search Report and Written Opinion mailed Apr. 26, 2017, International Patent Application No. PCT/IB2017/050865, filed Feb. 16, 2017, 9 pages.
International Search Report and Written Opinion mailed Apr. 3, 2017, Patent Application No. PCT/IB2017/050824, filed Feb. 14, 2017, 13 pages.
International Search Report and Written Opinion mailed Apr. 3, 2017, Patent Application No. PCT/IB2017/050827, 10 pages.
International Search Report and Written Opinion mailed Apr. 3, 2017, Patent Application No. PCT/IB2017/050827, 13 pages.
International Search Report and Written Opinion mailed Feb. 1, 2019, Patent Application No. PCT/IB2018/058258, 14 pages.
International Search Report and Written Opinion mailed Feb. 18, 2019, Patent Application No. PCT/IB2018/059092, 12 pages.
International Search Report and Written Opinion mailed Mar. 29, 2017, Patent Application No. PCT/IB2017/050821, 10 pages.
International Search Report and Written Opinion mailed Mar. 29, 2017, Patent Application No. PCT/IB2017/050821, 13 pages.
Goldfeder et al., “Escrow Protocols for Cryptocurrencies: How to Buy Physical Goods Using Bitcoin,” retrieved from http://stevengoldfeder.com/papers/escrow.pdf, Jul. 26, 2018, 27 pages.
International Search Report and Written Opinion mailed Aug. 3, 2018, Patent Application No. PCT/IB2018/053289, 10 pages.
UK Commercial Search Report mailed Jun. 12, 2017, Patent Application No. GB510912, 6 pages.
UK IPO Search Report mailed Oct. 9, 2017, Patent Application No. GB1707788.4, 6 pages.
Drwasho, “Openbazaar Documentation”, Github, Jun. 2015, 53 pages.
Bluematt, “Contract, Bitcoin Wiki”, Oct. 22, 2015, 12 pages.
UK IPO Search Report mailed Dec. 21, 2016, Patent Application No. GB1607484.1, 4 pages.
Gutoski et al., “Hierarchical Deterministic Bitcoin Wallets That Tolerate Key Leakage”, Lecture Notes in Computer Science book series (LNSC, vol. 8975), Jan. 1, 2015, 9 pages.
Mirzadeh et al., “CPFP: An Efficient Key Management Scheme for Large Scale Personal Networks”, IEEE, 2008, 6 pages.
Menezes et al., “Handbook of Applied Cryptography,” CRC Press, Oct. 16, 1996, 811 pages.
Deloitte, “Blockchain Technology A Game-changer in Accounting”, Mar. 2016, 5 pages.
Related Publications (1)
Number Date Country
20230107243 A1 Apr 2023 US
Continuations (2)
Number Date Country
Parent 16926583 Jul 2020 US
Child 17833433 US
Parent 16079082 US
Child 16926583 US