Shared keys based on multiple features

1. A non-transitory computer-readable medium having processor-executable instructions stored thereon for secret sharing based on multiple features of an input, the processor-executable instructions, when executed, facilitating performance of the following:

receiving a registration input from a user;

obtaining features from the registration input;

obtaining a plurality of shared keys based on the features of the registration input;

generating a secret key according to a shared secret scheme and the plurality of shared keys;

generating a plurality of challenge-response pairs using the plurality of shared keys, wherein each challenge-response pair includes a response corresponding to a string in decrypted form and a challenge corresponding to the string of the response in the challenge-response pair encrypted by one of the plurality of shared keys;

associating a shared key parameter of each shared key with a respective challenge;

storing each challenge with its associated shared key parameter and storing each response; and

encrypting an element to be protected by the secret key using the secret key.

2. The non-transitory computer-readable medium according to claim 1 , wherein the shared secret scheme is based on Shamir's scheme, Blakley's scheme, or the Chinese remainder theorem.

3. The non-transitory computer-readable medium according to claim 1 , Wherein obtaining the plurality of shared keys based on the features of the registration input further comprises:

applying binary concatenation to each feature of the registration input to obtain each respective shared key.

4. The non-transitory computer-readable medium according to claim 1 , Wherein obtaining the plurality of shared keys based on the features of the registration input further comprises:

applying a hashing algorithm to each feature of the registration input to obtain each respective shared key.

5. The non-transitory computer-readable medium according to claim 1 , wherein obtaining the plurality of shared keys based on the features of the registration input further comprises:

using each feature of the registration input as each respective shared key.

6. The non-transitory computer-readable medium according to claim 1 , wherein the same response is used for each of the plurality of challenge-response pairs.

7. The non-transitory computer-readable medium according to claim 1 , wherein a plurality of responses are used for the plurality of challenge-response pairs.

8. The non-transitory computer-readable medium according to claim 7 , wherein each response is stored with an associated shared key parameter.

9. The non-transitory computer-readable medium according to claim 1 , wherein each challenge of the challenge-response pairs is a single-dimension parameter.

10. A method for secret sharing based on multiple features of an input, the method comprising:

receiving, by a computing system, a registration input from a user;

obtaining, by the computing system, features from the registration input;

obtaining, by the computing system, a plurality of shared keys based on the features of the registration input;

generating, by the computing system, a secret key according to a shared secret scheme and the plurality of shared keys;

generating, by the computing system, a plurality of challenge-response pairs using the plurality of shared keys, wherein each challenge-response pair includes a response corresponding to a string in decrypted form and a challenge corresponding to the string of the response in the challenge-response pair encrypted by one of the plurality of shared keys;

associating, by the computing system, a shared key parameter of each shared key with a respective challenge;

storing, by the computing system, each challenge with its associated shared key parameter and storing each response; and

encrypting, by the computing system, an element to be protected by the secret key using the secret key.

11. The method according to claim 10 , wherein the shared secret scheme is based on Shamir's scheme, Blakley's scheme, or the Chinese remainder theorem.

12. The method according to claim 10 , wherein obtaining the plurality of shared keys based on the features of the registration input further comprises:

applying binary concatenation to each feature of the registration input to obtain each respective shared key.

13. The method according to claim 10 , wherein obtaining the plurality of shared keys based on the features of the registration input further comprises:

applying a hashing algorithm to each feature of the registration input to obtain each respective shared key.

14. The method according to claim 10 , wherein obtaining the plurality of shared keys based on the features of the registration input further comprises:

using each feature of the registration input as each respective shared key.

15. The method according to claim 10 , wherein the same response is used for each of the plurality of challenge-response pairs.

16. The method according to claim 10 , wherein a plurality of responses are used for the plurality of challenge-response pairs.

17. The method according to claim 16 , wherein each response is stored with an associated shared key parameter.

18. The method according to claim 10 , wherein each challenge of the challenge-response pairs is a single-dimension parameter.

19. A non-transitory computer-readable medium having processor-executable instructions stored thereon for secret sharing based on multiple features of an input; the processor-executable instructions, when executed, facilitating performance of the following:

receiving a registration input from a user;

obtaining features from the registration input;

obtaining a plurality of feature keys based on the features of the registration input;

generating a secret key and a plurality of shared keys according to a shared secret scheme;

generating a plurality of challenge-response pairs using the plurality of shared keys, wherein each challenge-response pair includes a unique response generated from a plain response and a shared key, and further includes a challenge corresponding to the unique response in the challenge-response pair encrypted by one of the plurality of feature keys;

associating a shared key parameter of each shared key with a respective challenge;

storing each challenge and each plain response; and

encrypting an element to be protected by the secret key using the secret key.

20. The non-transitory computer-readable medium according to claim 19 , wherein the shared secret scheme is based on Shamir's scheme, Blakley's scheme, or the Chinese remainder theorem.