Advances, Systems and Applications
Table 3 Comparison of RAIN with other approaches of splitting data
Approach | Summary | Misgivings |
|---|---|---|
Singh et al.[32] | A scheme for n-out-of-m secret sharing of data[33] | Do not provide an algorithm for the actual splitting of the data to be stored. |
Parakh and Kak[34] | Another n-out-of-m scheme | Do not discuss why their scheme should be better than e.g. the one proposed by Rabin[35]. |
Luna et al.[36] | Yet another n-out-of-m scheme, but add an additional concept of Quality of Security (QoSec) to rate individual storage providers. | Solution is tailored to a Grid computing scenario, not to commercial cloud operators. |
RACS[37] | Prevents vendor lock-in and data loss through failures by performing striping of data (in RAID-5 fashion) across multiple cloud providers | Does not offer privacy or confidentiality. |
Mnemosyne[38] | Offers steganographic storage which not only hides data, but also prevents anyone from determining that there is anything hidden in the first place. | Mnemosyne encrypts each block, and thus requires a key management system in addition to the information dispersal algorithm. |
Free Haven[13] | A collaborative distributed storage system, based on peer-to-peer file sharing principles. | Does not provide a new solution for the anonymous communications channel, but uses a set of anonymous remailers as a basis. |
OceanStore[14] | Provides distributed storage | Is not concerned with ensuring anonymity of the individual users. |
ShareMind[16] | Offers distributed privacy-preserving computations | Is not focused on storage, only computation. |