System and method for processing a shared secret
First Claim
1. In a network comprising a number of computing devices, each arranged to securely store at least one share in a secret k for which n shares are required to reconstruct the secret and to which access to a number m of said shares can be reliably provided at any given time, a method of constructing shares in a secret comprising:
- determining n shares for an n-of-n secret sharing scheme, each share comprising a value y;
storing at least some of said shares in said computing devices such that at least m of said n shares are reliably accessible, wherein m is less than n; and
determining the shared secret k including;
determining that (n-m) shares of said n shares will be unreliably accessible;
generating (n-m) public shares consistent with the shared secret k and the shares value y, wherein each of the (n-m) public shares represents one of the unreliably accessible shares;
storing the (n-m) public shares in a reliably accessible location; and
combining any set of m of said n shares with said (n-m) public shares to regenerate the secret k.
4 Assignments
0 Petitions
Accused Products
Abstract
A method of constructing shares in a secret is disclosed. The method operates in a network comprising a number of computing devices, each arranged to securely store at least one share in the secret k for which n shares are required to reconstruct the secret and to which access to a number m of the shares can be reliably provided at any given time. The method comprises the steps of: determining n shares for an n-of-n secret sharing scheme, each share comprising a value y; storing at least some of the shares in the computing devices such that at least m of the n shares are reliably accessible; determining the shared secret k according to the shares y; determining a further (n-m) shares consistent with the shared secret k and the shares y; and storing the additional shares in a reliably accessible location.
-
Citations
10 Claims
-
1. In a network comprising a number of computing devices, each arranged to securely store at least one share in a secret k for which n shares are required to reconstruct the secret and to which access to a number m of said shares can be reliably provided at any given time, a method of constructing shares in a secret comprising:
-
determining n shares for an n-of-n secret sharing scheme, each share comprising a value y; storing at least some of said shares in said computing devices such that at least m of said n shares are reliably accessible, wherein m is less than n; and determining the shared secret k including; determining that (n-m) shares of said n shares will be unreliably accessible; generating (n-m) public shares consistent with the shared secret k and the shares value y, wherein each of the (n-m) public shares represents one of the unreliably accessible shares; storing the (n-m) public shares in a reliably accessible location; and combining any set of m of said n shares with said (n-m) public shares to regenerate the secret k. - View Dependent Claims (10)
-
-
2. In a network comprising a number of computing devices, each arranged to securely store at least one share in a secret k for which n shares are required to reconstruct the secret and to which access to a number m of said shares can be reliably provided at any given time, a method of reconstructing said secret comprising:
-
securely obtaining m shares from one or more secret share holders including at least one of said computing devices, wherein m is less than n; obtaining (n-m) public shares that are consistent with the secret k and the shares value y from a reliably accessible location, wherein each of the (n-m) public shares represents an unreliably accessible share; and constructing the shared secret k according to said m shares and said (n-m) public shares.
-
-
3. In a network comprising a number of computing devices, each arranged to securely store at least one share in a secret k for which n shares are held by n number of secret share holders and required to reconstruct the secret and to which access to a number m of said shares can be reliably provided at any given time, a method of updating said secret comprising:
-
reconstructing said secret k according to the steps of; securely obtaining m shares from one or more secret share holders including at least one of said computing devices, wherein m is less than n; obtaining (n-m) public shares that are consistent with the secret k and the shares value y from a reliably accessible location, wherein each of the (n-m) public shares represents an unreliably accessible share and wherein the (n-m) public shares are not included in the n shares held by the n number of secret share holders; and constructing the shared secret k according to said m shares and said (n-m) public shares; deducing from the obtained shares the values of the shares for the unobtained n-m shares of the secret, each of the unobtained n-m shares being associated with one of the unreliably accessible shares; determining for each location from which a share was securely obtained a new share value y′
;determining a new shared secret k′
according the new share values y′ and
the unobtained share values;storing at least some of said new shares in said computing devices such that at least m of said new shares and said unobtained shares are reliably accessible; generating additional (n-m) public shares which are consistent with the new share values and the unobtained share values; and storing the additional (n-m) public shares in a reliably accessible location. - View Dependent Claims (4, 5)
-
-
6. Apparatus for constructing shares in a secret and operable within a network comprising a number of computing devices, each arranged to securely store at least one share in a secret k for which n shares are required to reconstruct the secret and to which access to a number m of said shares can be reliably provided at any given time, comprising:
a client device configured to; determine n shares for an n-of-n secret sharing scheme, each share comprising a value y; cause at least some of said shares to be stored in said computing devices such that at least m of said n shares are reliably accessible, wherein m is less than n; and determine the shared secret k including; determining that (n-m) shares of said n shares will be unreliably accessible; generating (n-m) public shares consistent with the shared secret k and the shares value y, wherein each of the (n-m) public shares represents an unreliably accessible share; causing the (n-m) public shares to be stored in a reliably accessible location; and combining any set of m of said n shares with said (n-m) public shares to regenerate the secret k.
-
7. Apparatus for reconstructing a secret and operable in a network comprising a number of computing devices, each arranged to securely store at least one share in a secret k for which n shares are required to reconstruct the secret and to which access to a number m of said shares can be reliably provided at any given time, comprising:
a client device configured to; securely obtain m shares from one or more secret share holders including at least one of said computing devices, wherein m is less than n; obtain (n-m) public shares that are consistent with the secret k from a reliably accessible location, wherein each of the (n-m) public shares represents an unreliably accessible share; and construct the shared secret k according to said m shares and said (n-m) public shares.
-
8. A non-transitory computer readable medium that includes computer readable instructions that can cause a computer to construct a secret by:
-
determining n shares for an n-of-n secret sharing scheme, each share comprising a value y; storing at least some of said shares in said computing devices such that at least m of said n shares are reliably accessible, wherein m is less than n; determining the shared secret k including; determining that (n-m) shares of said n shares will be unreliably accessible; generating (n-m) public shares consistent with the shared secret k and the shares value y, wherein each of the (n-m) public shares represents the unreliably accessible share; storing the further shares in a reliably accessible location; and combining any set of m of said n shares with said (n-m) public shares to regenerate the secret k.
-
-
9. A non-transitory computer readable medium that includes computer readable instructions that can cause a computer to re-construct a secret by:
-
securely obtaining m shares from one or more secret share holders including at least one of said computing devices, wherein m is less than n; obtaining (n-m) public shares that are consistent with the secret k and the shares value y from a reliably accessible location, wherein each of the (n-m) public shares represents an unreliably accessible share; and constructing the shared secret k according to said m shares and said (n-m) public shares.
-
Specification