Abstract: A digital asset delivery network that consists of a cryptographic scheme and a decentralized network that runs on a blockchain. The decentralized network consists of a computer program that interact with the network by issuing electronic messages, computer programs that validate those messages as entries into blockchain and agree on blocks to publish next, and computer programs that run cryptographic multi-party computation protocols. The multi-party computation protocol generates public keys necessary to create cryptocurrency or crypto asset wallets, and also generates the digital signatures necessary to create a transaction for submission to the crypto asset's underlying decentralized network and blockchain.

Abstract: A distributed ledger system for cryptocurrency transactions uses two types of Directed Acyclic Graph (DAG) technologies into a dual chain architecture. Every transaction creates a unique identifier in the first graph is utilized to refer to a more expansive set of data housed within the second graph.

Abstract: The present invention generally relates to the field of data encryption processes for crypto-currency or other digital asset transactions between a principal and beneficiary utilizing a custodian. Cryptographic protocols protect the asset from the custodian. It can also protect the asset from the principal. It can also protect the asset against the beneficiary until such time as the beneficiary can prove certain logical conditions that give it exclusive control over the digital asset.

Abstract: The present invention generally relates to the field of data encryption processes for crypto-currency or other digital asset transactions between a principal and beneficiary utilizing a custodian. Cryptographic protocols protect the asset from the custodian. It can also protect the asset from the principal. It can also protect the asset against the beneficiary until such time as the beneficiary can prove certain logical conditions that give it exclusive control over the digital asset.

Abstract: A method in a first entity for authenticating itself to a second entity by proving to the second entity that it is in possession of a full secret without sending the full secret to the second entity, the method comprising: receiving in the first entity an input from a user, the full secret having been divided into at least a first factor and a second factor and the input relating to the second factor of the full secret; reconstructing in the first entity the full secret from at least the first factor and the input; and carrying out a calculation in the first entity using the reconstructed full secret and sending the results of the calculation to the second entity, wherein the results provide an input to a pairing calculation in the second entity.

Abstract: There is disclosed a method of authenticating a client computing device to a server, the client computing device and the server both parties to a common authentication approach, the client computing device including an encrypted identifier containing a secret, in which the client computing device cannot decrypt the encrypted identifier, in which the client computing device encrypts the encrypted identifier using the common authentication approach and sends the encrypted encrypted identifier to the server, and in which the server decrypts the encrypted encrypted identifier, using the common authentication approach and a server secret, so as to determine the secret. Related systems, servers, client computing devices, pairs of computer program products comprising a server program product and a client computing device program product, the server program product, or the client computing program product, are disclosed.

Abstract: There is disclosed a method of authenticating a client computing device to a server, the client computing device and the server both parties to a common authentication approach, the client computing device including an encrypted identifier containing a secret, in which the client computing device cannot decrypt the encrypted identifier, in which the client computing device encrypts the encrypted identifier using the common authentication approach and sends the encrypted encrypted identifier to the server, and in which the server decrypts the encrypted encrypted identifier, using the common authentication approach and a server secret, so as to determine the secret. Related systems, servers, client computing devices, pairs of computer program products comprising a server program product and a client computing device program product, the server program product, or the client computing program product, are disclosed.

Abstract: A method in a first entity for authenticating itself to a second entity by proving to the second entity that it is in possession of a full secret without sending the full secret to the second entity, the method comprising: receiving in the first entity an input from a user, the full secret having been divided into at least a first factor and a second factor and the input relating to the second factor of the full secret; reconstructing in the first entity the full secret from at least the first factor and the input; and carrying out a calculation in the first entity using the reconstructed full secret and sending the results of the calculation to the second entity, wherein the results provide an input to a pairing calculation in the second entity.

Abstract: A method in a first entity for authenticating itself to a second entity by proving to the second entity that it is in possession of a full secret without sending the full secret to the second entity, the method comprising: receiving in the first entity an input from a user, the full secret having been divided into at least a first factor and a second factor and the input relating to the second factor of the full secret; reconstructing in the first entity the full secret from at least the first factor and the input; and carrying out a calculation in the first entity using the reconstructed full secret and sending the results of the calculation to the second entity, wherein the results provide an input to a pairing calculation in the second entity. The second entity carries out the pairing calculation to determine whether the client is in possession of the secret. The first entity may be a client and the second entity may be a server.

Abstract: A method in a first entity for authenticating itself to a second entity by proving to the second entity that it is in possession of a full secret without sending the full secret to the second entity, the method comprising: receiving in the first entity an input from a user, the full secret having been divided into at least a first factor and a second factor and the input relating to the second factor of the full secret; reconstructing in the first entity the full secret from at least the first factor and the input; and carrying out a calculation in the first entity using the reconstructed full secret and sending the results of the calculation to the second entity, wherein the results provide an input to a pairing calculation in the second entity. The second entity carries out the pairing calculation to determine whether the client is in possession of the secret. The first entity may be a client and the second entity may be a server.

Abstract: A method in a first entity for authenticating itself to a second entity by proving to the second entity that it is in possession of a full secret without sending the full secret to the second entity, the method comprising: receiving in the first entity an input from a user, the full secret having been divided into at least a first factor and a second factor and the input relating to the second factor of the full secret; reconstructing in the first entity the full secret from at least the first factor and the input; and carrying out a calculation in the first entity using the reconstructed full secret and sending the results of the calculation to the second entity, wherein the results provide an input to a pairing calculation in the second entity.

Abstract: A method in a first entity for authenticating itself to a second entity by proving to the second entity that it is in possession of a full secret without sending the full secret to the second entity, the method comprising: receiving in the first entity an input from a user, the full secret having been divided into at least a first factor and a second factor and the input relating to the second factor of the full secret; reconstructing in the first entity the full secret from at least the first factor and the input; and carrying out a calculation in the first entity using the reconstructed full secret and sending the results of the calculation to the second entity, wherein the results provide an input to a pairing calculation in the second entity.

Abstract: A method for verifying a person's identity in order to gain access to electronic data, a data network, a physical location, or enable a commercial transaction. A request for identity verification is processed over a data network and the system is initiated which (i) transmits a disposable pass phrase over a data network to the user, (ii) prompts the user to vocalize the disposable pass phrase, a pass phrase, and user id, (iii) compares the recited speech of the user to the stored voiceprint of the user, the stored pass phrase and id of the user, and the generated disposable pass phrase, then (iv) issues a token or signal that represents whether the user was verified or not.