Convergent dispersal: Toward storage-efficient security in a cloud-of-clouds

21Citations
Citations of this article
29Readers
Mendeley users who have this article in their library.

Abstract

Cloud-of-clouds storage exploits diversity of cloud storage vendors to provide fault tolerance and avoid vendor lock-ins. Its inherent diversity property also enables us to offer keyless data security via dispersal algorithms. However, the keyless security of existing dispersal algorithms relies on the embedded random information, which breaks data deduplication of the dispersed data. To simultaneously enable keyless security and deduplication, we propose a novel dispersal approach called convergent dispersal, which replaces original random information with deterministic cryptographic hash information that is derived from the original data but cannot be inferred by attackers without knowing the whole data. We develop two convergent dispersal algorithms, namely CRSSS and CAONT-RS. Our evaluation shows that CRSSS and CAONT-RS provide complementary performance advantages for different parameter settings.

Cite

CITATION STYLE

APA

Li, M., Qin, C., Lee, P. P. C., & Li, J. (2014). Convergent dispersal: Toward storage-efficient security in a cloud-of-clouds. In 6th USENIX Workshop on Hot Topics in Cloud Computing, HotCloud 2014. USENIX Association. https://doi.org/10.22214/ijraset.2020.4087

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free