Protected Dispersed Deduplication Systems along with Enhanced Dependability
Keywords:
Deduplication, distributed storage system, reliability, secret sharingAbstract
Files deduplication can be a way of getting rid of identical copies associated with facts, and contains been traditionally used inside fog up hard drive to minimize space for storage in addition to upload bandwidth. Nonetheless, there's merely one replicate for each data file located inside fog up even if this type of data file is usually had by simply a huge number associated with end users. Because of this, deduplication program enhances hard drive employment though decreasing stability. On top of that, the challenge associated with comfort for hypersensitive facts likewise arises once they are generally outsourced by simply end users to fog up. Looking to tackle these safety troubles, that report creates the very first attempt to formalize the idea associated with distributed reputable deduplication program. Most of us offer brand new distributed deduplication methods along with increased stability in which the facts sections are generally distributed across many fog up hosts.
The safety requirements associated with facts confidentiality in addition to marking consistency are reached by simply adding some sort of deterministic secret sharing plan inside distributed hard drive methods, instead of employing convergent encryption just as previous deduplication methods. Security evaluation displays which our deduplication methods are generally protected when it comes to your classifications specific within the offered safety model. As a substantiation associated with concept, most of us apply your offered methods in addition to show how the borne cost to do business is extremely restricted inside sensible circumstances.
References
[1] Jin Li, Xiaofeng Chen, Xinyi Huang, Shaohua Tang and Yang Xiang, “Secure Distributed Deduplication Systems with Improved Reliability”, IEEE Transactions on Computers,2015.
[2] J. Gantz and D. Reinsel, “The digital universe in 2020: Big data, bigger digi tal shadows, and biggest growth in the
far east,” http://www.emc.com/collateral/analyst-reports/idcthe-“ digital-universe-in-2020.pdf, Dec 2012.
[3] M. O. Rabin, “Fingerprinting by random polynomials,” Centre for Research in Computing Technology, Harvard University, Tech. Rep. Tech. Report TR-CSE-03-01, 1981.
[4] J. R. Douceur, A. Adya, W. J. Bolosky, D. Simon, and M. Theimer, “Reclaiming space from duplicate files in a serverless distributed file system.” in ICDCS, 2002, pp. 617–624.
[5] M. Bellare, S. Keelveedhi, and T. Ristenpart, “Dupless: Serveraided encryption for deduplicated storage,” in USENIX Security Symposium, 2013.
[6] ——, “Message-locked encryption and secure deduplication,” in EUROCRYPT, 2013, pp. 296–312.
[7] G. R. Blakley and C. Meadows, “Security of ramp schemes,” in Advances in Cryptology: Proceedings of CRYPTO ’84, ser. Lecture Notes in Computer Science, G. R. Blakley and D. Chaum, Eds. Springer-Verlag Berlin/Heidelberg, 1985, vol. 196, pp. 242–268.
[8] A. D. Santis and B. Masucci, “Multiple ramp schemes,” IEEE Transactions on Information Theory, vol. 45, no. 5, pp. 1720–1728, Jul. 1999.
[9] M. O. Rabin, “Efficient dispersal of information for security, load balancing, and fault tolerance,” Journal of the ACM, vol. 36, no. 2, pp. 335–348, Apr. 1989.
[10] A. Shamir, “How to share a secret,” Commun. ACM, vol. 22, no. 11, pp. 612–613, 1979.
[11] J. Li, X. Chen, M. Li, J. Li, P. Lee, and W. Lou, “Secure deduplication with efficient and reliable convergent key management,” in IEEE Transactions on Parallel and Distributed Systems, 2014, pp. vol. 25(6), pp. 1615–1625.
[12] S. Halevi, D. Harnik, B. Pinkas, and A. Shulman-Peleg, “Proofs of ownership in remote storage systems.” in ACM Conference on Computer and Communications Security, Y. Chen, G. Danezis, and V. Shmatikov, Eds. ACM, 2011, pp. 491–500.
[13] J. S. Plank, S. Simmerman, and C. D. Schuman, “Jerasure: A library in C/C++ facilitating erasure coding for storage applications - Version 1.2,” University of Tennessee, Tech. Rep. CS-08-627 August 2008.
[14] J. S. Plank and L. Xu, “Optimizing Cauchy Reed-solomon Codes for fault-tolerant network storage applications,” in NCA-06: 5th IEEE International Symposium on Network Computing Applications, Cambridge, MA, July 2006.
[15] C. Liu, Y. Gu, L. Sun, B. Yan, and D. Wang, “R-admad: High reliability provision for large-scale de-duplication archival storage systems,” in Proceedings of the 23rd international conference on Supercomputing, pp. 370–379.
[16] M. Li, C. Qin, P. P. C. Lee, and J. Li, “Convergent dispersal: Toward storage-efficient security in a cloud-of-clouds,” in The 6th USENIX Workshop on Hot Topics in Storage and File Systems, 2014.
[17] P. Anderson and L. Zhang, “Fast and secure laptop backups with encrypted de-duplication,” in Proc. of USENIX LISA, 2010.
[18] Z. Wilcox-O’Hearn and B. Warner, “Tahoe: the least-authority filesystem,” in Proc. of ACM StorageSS, 2008.
[19] A. Rahumed, H. C. H. Chen, Y. Tang, P. P. C. Lee, and J. C. S. Lui, “A secure cloud backup system with assured deletion and version control,” in 3rd International Workshop on Security in CloudComputing, 2011.
[20] M. W. Storer, K. Greenan, D. D. E. Long, and E. L. Miller, “Securedata deduplication,” in Proc. of StorageSS, 2008.
Downloads
Published
Issue
Section
Categories
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
This work is licensed under a Creative Commons Attribution 4.0 International License.
Under this license, authors retain ownership of the copyright for their articles. By submitting to the International Journal of Advanced Research in Science, Management, and Technology (IJARSMT), authors grant the journal the right of first publication. Users are free to share, copy, and redistribute the material in any medium or format, and to adapt, remix, transform, and build upon the material for any purpose, including commercially, provided that appropriate credit is given to the original author(s) and the journal, a link to the license is provided, and any changes made are indicated.
