Systems and methods for distributing and securing data
View Patent ↗A robust computational secret sharing scheme that provides for the efficient distribution and subsequent recovery of a private data is disclosed. A cryptographic key may be randomly generated and then shared using a secret sharing algorithm to generate a collection of key shares. The private data may be encrypted using the key, resulting in a ciphertext. The ciphertext may then be broken into ciphertext fragments using an Information Dispersal Algorithm. Each key share and a corresponding ciphertext. Fragment are provided as input to a committal method of a probabilistic commitment scheme, resulting in a committal value and a decommittal value. The share for the robust computational secret sharing scheme may be obtained by combining the key share, the ciphertext fragment, the decommittal value, and the vector of committal values.
1. A method for securing data, the method comprising:
generating a plurality of fragments from the data;
applying by a hardware processor a sharing mechanism of a computational secret sharing scheme to the data to produce a plurality of shares;
computing a set of committal values and a set of decommittal values from the plurality of shares;
producing each fragment in the plurality of fragments by combining a share, a decommittal value, and at least two committal values of the set of committal values;
transmitting the plurality of fragments over a plurality of communication channels; and
storing each fragment on at least one data repository.
2. The method of claim 1 wherein producing each fragment in the plurality of fragments comprises combining a share, a decommittal value, and the entire set of committal values.
3. The method of claim 1 wherein storing each fragment on at least one data repository comprises storing each fragment at different geographic locations.
4. The method of claim 1 wherein storing each fragment on at least one data repository comprises storing each fragment at different physical locations on the at least one data repository.
5. The method of claim 1 wherein the at least one data repository comprises a distributed file system.
6. The method of claim 1 wherein the computational secret sharing scheme is selected from the group consisting of the Shamir, Blakley, and Krawczyk secret sharing schemes.
7. The method of claim 1 wherein computing the set of committal values and the set of decommittal values from the plurality of shares comprises employing a probabilistic commitment scheme.
8. The method of claim 1 wherein transmitting the produced fragments over the plurality of communication channels comprises transmitting each produced fragment over a different communication channel.
9. A method for securing data comprising;
producing by a hardware processor a plurality of key shares by applying a secret sharing scheme to a cryptographic key;
producing a plurality of ciphertext chunks from a ciphertext by applying an information dispersal algorithm to the ciphertext, wherein the ciphertext is created by encrypting the data with the cryptographic key;
computing n committal values and a set of decommittal values by applying a commitment scheme to each of the key shares and ciphertext chunks, where n is an integer equal to or greater than two;
producing a plurality of data fragments, wherein each data fragment is a function of a key share, a ciphertext chunk, a decommittal value, and at least two committal values of the n committal values;
transmitting the plurality of data fragments over communication channels; and
storing the data fragments on different logical storage devices, whereby the data is recoverable from a predefined number of the data fragments.
10. The method of claim 9 wherein storing the data fragments on different logical storage devices comprises storing the data fragments on different logical storage devices.
11. A non-transitory computer readable medium comprising instructions that, when executed by processing circuitry, cause a computer system to carry out a method for securing data, the method comprising:
generating a plurality of fragments from the data;
applying by a hardware processor a sharing mechanism of a computational secret sharing scheme to the data to produce a plurality of shares;
computing a set of committal values and a set of decommittal values from the plurality of shares;
producing each fragment in the plurality of fragments by combining a share, a decommittal value, and at least two committal values of the set of committal values;
transmitting the produced fragments over a plurality of communication channels; and
storing each fragment on at least one data repository.
12. The non-transitory computer readable medium of claim 11 wherein producing each fragment in the plurality of fragments comprises combining a share, a de committal value, and the entire set of committal values.
13. The non-transitory computer readable medium of claim 11 wherein storing each fragment on at least one data repository comprises storing each fragment at different geographic locations.
14. The non-transitory computer readable medium of claim 11 wherein storing each fragment on at least one data repository comprises storing each fragment at different physical locations on the at least one data repository.
15. The non-transitory computer readable medium of claim 11 wherein the at least one data repository comprises a distributed file system.
16. The non-transitory computer readable medium of claim 11 wherein the computational secret sharing scheme is selected from the group consisting of the Shamir, Blakley, and Krawczyk secret sharing schemes.
17. The non-transitory computer readable medium of claim 11 wherein computing the set of committal values and the set of decommittal values from the plurality of shares comprises employing a probabilistic commitment scheme.
18. The non-transitory computer readable medium of claim 11 wherein transmitting the produced fragments over the plurality of communication channels comprises transmitting each produced fragment over a different communication channel.
19. A non-transitory computer readable medium comprising instructions that, when executed by processing circuitry, cause a computer system to carry out a method for securing data comprising;
producing by a hardware processor a plurality of key shares by applying a secret sharing scheme to a cryptographic key;
producing a plurality of ciphertext chunks by applying an information dispersal algorithm to a ciphertext, wherein the ciphertext is created by encrypting the data with the cryptographic key;
computing n committal values and a set of decommittal values by applying a commitment scheme to each of the key shares and ciphertext chunks, where n is an integer equal to or greater than two;
producing a plurality of data fragments, wherein each data fragment is a function of a key share, a ciphertext chunk, a decommittal value, and at least two committal values of the n committal values;
transmitting the data fragments over communication channels; and
storing the data fragments on different logical storage devices, whereby the data is recoverable from a predefined number of the data fragments.
20. The non-transitory computer readable medium of claim 19 wherein storing the data fragments on different logical storage devices comprises storing the data fragments on different logical storage devices.