Abstract: Disclosed herein is a method including identifying a first instance of a first secret; receiving and hashing a first instance of first data from a first source to generate a first instance of first hashed data, wherein the first instance of the first data from the first source is discarded; computing a first mapping function between the first instance of the first hashed data and the first instance of the first secret, wherein the first mapping function is stored and the first instance of the first hashed data and the first instance of the first secret are discarded; receiving and hashing a second instance of the first data from the first source to generate a second instance of the first hashed data; and applying the first mapping function to the second instance of the first hashed data to generate a second instance of the first secret.

Abstract: Disclosed herein is a method including identifying a first key seed for an external key; generating a second key seed from a first instance of first data from a first source; computing a mapping function between the first key seed and the second key seed, where the mapping function is stored and the first key seed and second key seed are discarded; generating a third key seed from a second instance of second data from a second source; applying the mapping function to the third key seed to generate a fourth key seed; and regenerating the external key using the fourth key seed.

Abstract: Disclosed herein is a method including identifying a first instance of a first secret; receiving and hashing a first instance of first data from a first source to generate a first instance of first hashed data, wherein the first instance of the first data from the first source is discarded; computing a first mapping function between the first instance of the first hashed data and the first instance of the first secret, wherein the first mapping function is stored and the first instance of the first hashed data and the first instance of the first secret are discarded; receiving and hashing a second instance of the first data from the first source to generate a second instance of the first hashed data; and applying the first mapping function to the second instance of the first hashed data to generate a second instance of the first secret.

Abstract: Technology is disclosed for a method that may comprise: identifying an owner key seed; identifying a receiver key seed; determining a delta between the owner key seed and the receiver key seed; and storing the delta with a trusted third party in a manner that is inaccessible by a receiver. The delta may be provided to the receiver based on a transfer condition being satisfied.

Abstract: Disclosed herein is a method including identifying a first instance of a first secret; receiving and hashing a first instance of first data from a first source to generate a first instance of first hashed data, wherein the first instance of the first data from the first source is discarded; computing a first mapping function between the first instance of the first hashed data and the first instance of the first secret, wherein the first mapping function is stored and the first instance of the first hashed data and the first instance of the first secret are discarded; receiving and hashing a second instance of the first data from the first source to generate a second instance of the first hashed data; and applying the first mapping function to the second instance of the first hashed data to generate a second instance of the first secret.

Abstract: Technology is disclosed for a method that may comprise: identifying an owner key seed; identifying a receiver key seed; determining a delta between the owner key seed and the receiver key seed; and storing the delta with a trusted third party in a manner that is inaccessible by a receiver. The delta may be provided to the receiver based on a transfer condition being satisfied.

Abstract: Disclosed herein is a method including identifying a first key seed for an external key; generating a second key seed from a first instance of first data from a first source; computing a mapping function between the first key seed and the second key seed, where the mapping function is stored and the first key seed and second key seed are discarded; generating a third key seed from a second instance of second data from a second source; applying the mapping function to the third key seed to generate a fourth key seed; and regenerating the external key using the fourth key seed.