Cloud Storage Security Deduplication Scheme Based on Dynamic Bloom Filter


Xi-ai Yan, Wei-qi Shi, Hua Tian, Journal of Information Processing Systems Vol. 15, No. 6, pp. 1265-1276, Dec. 2019  

https://doi.org/10.3745/JIPS.04.0143
Keywords: Bloom Filter, Cloud Storage, Data Deduplication, Privacy Protection
Fulltext:

Abstract

Data deduplication is a common method to improve cloud storage efficiency and save network communication bandwidth, but it also brings a series of problems such as privacy disclosure and dictionary attacks. This paper proposes a secure deduplication scheme for cloud storage based on Bloom filter, and dynamically extends the standard Bloom filter. A public dynamic Bloom filter array (PDBFA) is constructed, which improves the efficiency of ownership proof, realizes the fast detection of duplicate data blocks and reduces the false positive rate of the system. In addition, in the process of file encryption and upload, the convergent key is encrypted twice, which can effectively prevent violent dictionary attacks. The experimental results show that the PDBFA scheme has the characteristics of low computational overhead and low false positive rate.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from November 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.




Cite this article
[APA Style]
Yan, X., Shi, W., & Tian, H. (2019). Cloud Storage Security Deduplication Scheme Based on Dynamic Bloom Filter. Journal of Information Processing Systems, 15(6), 1265-1276. DOI: 10.3745/JIPS.04.0143.

[IEEE Style]
X. Yan, W. Shi, H. Tian, "Cloud Storage Security Deduplication Scheme Based on Dynamic Bloom Filter," Journal of Information Processing Systems, vol. 15, no. 6, pp. 1265-1276, 2019. DOI: 10.3745/JIPS.04.0143.

[ACM Style]
Xi-ai Yan, Wei-qi Shi, and Hua Tian. 2019. Cloud Storage Security Deduplication Scheme Based on Dynamic Bloom Filter. Journal of Information Processing Systems, 15, 6, (2019), 1265-1276. DOI: 10.3745/JIPS.04.0143.