Methods and apparatus for generalized password-based secret sharing
View Patent ↗Generalized password-based secret sharing schemes are provided. A secret sharing method comprises obtaining a secret; obtaining fixed values from one or more parties; setting an element of a column vector of a password-based linear secret sharing scheme based on the secret; randomly selecting values from a field for additional elements of the column vector; setting remaining elements of the column vector to values that ensure that a product of a matrix and the column vector, for each fixed-share party, is equal to the corresponding fixed value; and distributing non-fixed shares to additional parties using a labeling function. In another method, a defining matrix corresponds to the secret and a field of both the secret and a plurality of shares of the secret. A given share for each party in the set is set to the corresponding obtained fixed value. A row in the defining matrix is randomly selected such that an element in the row corresponding to each party in the set is equal to the corresponding obtained fixed value.
1. A secret sharing method for the protection of at least one data item, comprising:
obtaining a secret, wherein said secret protects said at least one data item;
obtaining m fixed values from one or more parties, where m is greater than or equal to one;
setting, using at least one processing device, a first element of a column vector of a password-based linear secret sharing scheme having a size t to a value that depends on said secret;
randomly selecting, using said at least one processing device, values from a field for t−m−1 additional elements of said column vector;
setting, using said at least one processing device, remaining elements of said column vector to values that ensure that a product of an m-by-t matrix and said column vector, for each of said one or more parties, is equal to the fixed value of said corresponding party; and
distributing, using said at least one processing device, non-fixed shares based on said product to at least one device of additional parties during a secret sharing phase using a labeling function, such that said secret is reconstructed during a secret reconstruction phase only when a predefined minimum number of said secret shares are provided to one or more authentication servers.
2. The method of claim 1 , wherein said fixed values comprise a result of a hash function applied to a password of said one or more parties.
3. The method of claim 1 , wherein said fixed value comprises one or more of secret information related to said one or more parties and a password of said one or more parties.
4. The method of claim 1 , wherein said secret protects at least one data item.
5. The method of claim 1 , wherein t shares comprise a minimal authorized set needed for reconstruction of said secret and wherein said t shares must be obtained in a predefined order to reconstruct said secret.
6. The method of claim 1 , wherein a reconstruction of said secret is based on an access structure comprising one or more authorized sets of parties, wherein said authorized sets of parties comprise an ordered set of parties that need to combine shares in a predefined order to reconstruct said secret.
7. A non-transitory machine-readable recordable storage medium having encoded therein executable code of one or more software programs for the protection of at least one data item, wherein the one or more software programs when executed by one or more processing devices implement the following steps:
obtaining a secret, wherein said secret protects said at least one data item;
obtaining m fixed values from one or more parties, where m is greater than or equal to one;
setting, using at least one processing device, a first element of a column vector of a password-based linear secret sharing scheme having a size t to a value that depends on said secret;
randomly selecting, using said at least one processing device, values from a field for t−m−1 additional elements of said column vector;
setting, using said at least one processing device, remaining elements of said column vector to values that ensure that a product of an m-by-t matrix and said column vector, for each of said one or more parties, is equal to the fixed value of said corresponding party; and
distributing, using said at least one processing device, non-fixed shares based on said product to at least one device of additional parties during a secret sharing phase using a labeling function, such that said secret is reconstructed during a secret reconstruction phase only when a predefined minimum number of said secret shares are provided to one or more authentication servers.
8. An apparatus for the protection of at least one data item, comprising:
a memory; and
at least one hardware device, coupled to the memory, operative to implement the following steps:
obtaining a secret, wherein said secret protects said at least one data item;
obtaining m fixed values from one or more parties, where m is greater than or equal to one;
setting, using at least one processing device, a first element of a column vector of a password-based linear secret sharing scheme having a size t to a value that depends on said secret;
randomly selecting, using said at least one processing device, values from a field for t−m−1 additional elements of said column vector;
setting, using said at least one processing device, remaining elements of said column vector to values that ensure that a product of an m-by-t matrix and said column vector, for each of said one or more parties, is equal to the fixed value of said corresponding party; and
distributing, using said at least one processing device, non-fixed shares based on said product to at least one device of additional parties during a secret sharing phase using a labeling function, such that said secret is reconstructed during a secret reconstruction phase only when a predefined minimum number of said secret shares are provided to one or more authentication servers.
9. The apparatus of claim 8 , wherein said fixed values comprise one or more of secret information related to said one or more parties, a password of said one or more parties, and a result of a hash function applied to a password of said one or more parties.
10. A secret sharing method for the protection of at least one data item, comprising:
obtaining a secret, wherein said secret protects said at least one data item;
obtaining at least one fixed value from one or more parties in a set of parties;
obtaining a defining matrix corresponding to said secret for a threshold secret sharing scheme with a threshold and a field of both the secret and a plurality of shares of the secret;
setting, using at least one processing device, a given share for each party in said set of parties to said corresponding obtained fixed value for all parties in said set of parties;
randomly selecting, using said at least one processing device, a row in said defining matrix from all rows of said defining matrix such that an element in said row corresponding to each of said one or more parties in said set of parties is equal to said corresponding obtained fixed value; and
distributing, using at least one processing device, non-fixed shares from the elements of the selected row to at least one device of corresponding parties not in said set of parties during a secret sharing phase, such that said secret is reconstructed during a secret reconstruction phase only when a predefined minimum number of said secret shares are provided to one or more authentication servers.
11. The method of claim 10 , wherein said random row selection further requires that an element in said row corresponding to said secret is equal to said secret.
12. The method of claim 10 , wherein said fixed values comprise a result of a hash function applied to a password of said one or more parties.
13. The method of claim 10 , wherein said fixed value comprises one or more of secret information related to said one or more parties and a password of said one or more parties.
14. The method of claim 10 , wherein said secret protects at least one data item.
15. The method of claim 10 , wherein t shares comprise a minimal authorized set needed for reconstruction of said secret and wherein said t shares must be obtained in a predefined order to reconstruct said secret.
16. A non-transitory machine-readable recordable storage medium having encoded therein executable code of one or more software programs for the protection of at least one data item, wherein the one or more software programs when executed by one or more processing devices implement the following steps:
obtaining a secret, wherein said secret protects said at least one data item;
obtaining at least one fixed value from one or more parties in a set of parties;
obtaining a defining matrix corresponding to said secret for a threshold secret sharing scheme with a threshold and a field of both the secret and a plurality of shares of the secret;
setting, using at least one processing device, a given share for each party in said set of parties to said corresponding obtained fixed value for all parties in said set of parties;
randomly selecting, using said at least one processing device, a row in said defining matrix from all rows of said defining matrix such that an element in said row corresponding to each of said one or more parties in said set of parties is equal to said corresponding obtained fixed value; and
distributing, using at least one processing device, non-fixed shares from the elements of the selected row to at least one device of corresponding parties not in said set of parties during a secret sharing phase, such that said secret is reconstructed during a secret reconstruction phase only when a predefined minimum number of said secret shares are provided to one or more authentication servers.
17. An apparatus for the protection of at least one data item, comprising:
a memory; and
at least one hardware device, coupled to the memory, operative to implement the following steps:
obtaining a secret, wherein said secret protects said at least one data item;
obtaining at least one fixed value from one or more parties in a set of parties;
obtaining a defining matrix corresponding to said secret for a threshold secret sharing scheme with a threshold and a field of both the secret and a plurality of shares of the secret;
setting, using at least one processing device, a given share for each party in said set of parties to said corresponding obtained fixed value for all parties in said set of parties;
randomly selecting, using said at least one processing device, a row in said defining matrix from all rows of said defining matrix such that an element in said row corresponding to each of said one or more parties in said set of parties is equal to said corresponding obtained fixed value; and
distributing, using said at least one processing device, non-fixed shares from the elements of the selected row to at least one device of corresponding parties not in said set of parties during a secret sharing phase, such that said secret is reconstructed during a secret reconstruction phase only when a predefined minimum number of said secret shares are provided to one or more authentication servers.
18. The apparatus of claim 17 , wherein said random row selection further requires that an element in said row corresponding to said secret is equal to said secret.
19. The apparatus of claim 17 , wherein said fixed values comprise one or more of secret information related to said one or more parties, a password of said one or more parties, and a result of a hash function applied to a password of said one or more parties.
20. The apparatus of claim 17 , wherein t shares comprise a minimal authorized set needed for reconstruction of said secret and wherein said t shares must be obtained in a predefined order to reconstruct said secret.