Shared keys based on multiple features

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

receiving a registration input from a user;

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

generating a secret key based on the plurality of shared keys according to a shared secret scheme, wherein the secret key is re-creatable using the plurality of shared keys;

generating a plurality of key-feature data elements based on the features of the registration input and the plurality of shared keys, wherein each of the key-feature data elements is based on a respective shared key of the plurality of shared keys and a respective feature of the registration input;

generating a plurality of additional data elements having a similar format as the plurality of key-feature data elements such that the key-feature data elements and the additional data elements are indistinguishable from one another to an attacker;

storing the plurality of key-feature data elements together with the plurality of additional data elements, wherein the secret key is not stored with the plurality of key-feature data elements and the plurality of additional data elements; 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 obtaining the plurality of shared keys based on features of the registration input comprises:

using the features of the registration input as shared keys.

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

generating the shared keys from the features of the registration input.

4. The non-transitory computer-readable medium according to claim 3 , wherein generating the shared keys from the features of the registration input is based on concatenation and/or based on a hashing algorithm.

5. 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.

6. The non-transitory computer-readable medium according to claim 1 , wherein generating the plurality of key-feature data elements further comprises associating a respective shared key and a shared key parameter corresponding to the respective shared key with a respective feature of the registration input; and

wherein generating the plurality of additional data elements includes generating an additional parameter having a similar format as a shared key parameter.

7. The non-transitory computer-readable medium according to claim 1 , wherein generating a respective key-feature data element comprises storing one or more shared key parameters in one or more extended dimensions of a respective feature of the registration input.

8. The non-transitory computer-readable medium according to claim 1 , wherein the number of obtained shared keys is based on the number of features obtained from the registration input.

9. A method for secret sharing utilizing multiple features of an input, the method comprising:

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

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

generating, by the computing system, a secret key based on the plurality of shared keys according to a shared secret scheme, wherein the secret key is re-creatable using the plurality of shared keys;

generating, by the computing system, a plurality of key-feature data elements based on the features of the registration input and the plurality of shared keys, wherein each of the key-feature data elements is based on a respective shared key of the plurality of shared keys and a respective feature of the registration input;

generating, by the computing system, a plurality of additional data elements having a similar format as the plurality of key-feature data elements such that the key-feature data elements and the additional data elements are indistinguishable from one another to an attacker;

storing, by the computing system, the plurality of key-feature data elements together with the plurality of additional data elements, wherein the secret key is not stored with the plurality of key-feature data elements and the plurality of additional data elements; and

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

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

using the features of the registration input as shared keys.

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

generating the shared keys from the features of the registration input.

12. The method according to claim 11 , wherein generating the shared keys from the features of the registration input is based on concatenation and/or based on a hashing algorithm.

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

14. The method according to claim 9 , wherein generating the plurality of key-feature data elements further comprises associating a respective shared key and a shared key parameter corresponding to the respective shared key with a respective feature of the registration input; and

wherein generating the plurality of additional data elements includes generating an additional parameter having a similar format as a shared key parameter.

15. The method according to claim 9 , wherein generating a respective key-feature data element comprises storing one or more shared key parameters in one or more extended dimensions of a respective feature of the registration input.

16. The method according to claim 9 , wherein the number of obtained shared keys is based on the number of features obtained from the registration input.

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

receiving a registration input from a user;

comparing a plurality of features of the registration input with stored features to determine whether the plurality of features of the registration input match with the stored features;

obtaining shared keys based on features of the registration input which match with stored features, wherein obtaining the shared keys based on the features of the registration input which match with stored features comprises using the features of the registration input which match with stored features as the shared keys or generating the shared keys from the features of the registration input which match with stored features;

based on at least K shared keys being obtained out of a total of N shared keys, deriving a secret key using at least the K shared keys, wherein the K shared keys correspond to a sufficient subset of the N shared keys for deriving the secret key; and

decrypting an encrypted element using the derived secret key.

18. The non-transitory computer-readable medium according to claim 17 , wherein determining whether the plurality of features of the registration input match with the stored features is based on exact matching.

19. The non-transitory computer-readable medium according to claim 17 , wherein determining whether the plurality of features of the registration input match with the stored features is based on a distance computation.

20. The non-transitory computer-readable medium according to claim 17 , wherein deriving the secret key is further based on shared key parameters corresponding to the K shared keys.