Secure Distributed Deduplication Systems with Improved Reliability

Main Article Content

C.Kavitha Sree
Dr.S.Prem Kumar


Data deduplication is a method for removing duplicate copies of data, and has been extensively used in cloud storage to decrease storage space and upload bandwidth. On the other hand, there is only one copy for each file stored in cloud even if such a file is owned by a huge number of users. Accordingly, deduplication system progress storage utilization while reducing reliability. In addition, the dare of privacy for sensitive data also take place when they are outsourced by users to cloud. Planning to address the above security test, this paper constructs the first effort to celebrate the idea of scattered reliable deduplication system. This paper recommends a new distributed deduplication systems with upper dependability in which the data chunks are distributed from corner to cornering multiple cloud servers. The safety needs of data privacy and tag stability are also accomplish by introducing a deterministic secret sharing scheme in distributed storage systems, instead of using convergent encryption as in previous deduplication systems.

Article Details

How to Cite
C.Kavitha Sree, CH.Shashikala, and Dr.S.Prem Kumar, “Secure Distributed Deduplication Systems with Improved Reliability”, Int. J. Comput. Eng. Res. Trends, vol. 2, no. 12, pp. 908–912, Dec. 2015.
Research Articles


J. Gantz and D. Reinsel, “The digital universe in 2020: Bigdigital shadows and biggest growth in the fareast,”, Dec 2012. [2] M. O. Rabin, “Fingerprinting by random polynomials,” Center for Research in Computing Technology, Harvard University, Tech.Rep. Tech. Report TR-CSE-03-01, 1981.

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.

M. Bellare, S. Keelveedhi, and T. Ristenpart, “Dupless: Server-aided encryption for deduplicated storage,” in USENIX Security Symposium, 2013.

“Message-locked encryption and secure deduplication,” in EUROCRYPT, 2013, pp. 296–312.

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.

A. D. Santis and B. Masucci, “Multiple ramp schemes,” IEEE Transactions on Information Theory, vol. 45, no. 5, pp. 1720–1728,Jul. 1999.

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.

A. Shamir, “How to share a secret,” Commun. ACM, vol. 22, no. 11,pp. 612–613, 1979.

J. Li, X. Chen, M. Li, J. Li, P. Lee, and W. Lou, “Secure deduplica-tion with efficient and reliable convergent key management,” in IEEE Transactions on Parallel and Distributed Systems, 2014, pp. vol.25(6), pp. 1615–1625.

S. Halevi, D. Harnik, B. Pinkas, and A. ShulmanPeleg, “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.

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.

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.

C. Liu, Y. Gu, L. Sun, B. Yan, and D. Wang, “Radmad: High reliability provision for large-scale deduplication archival storage systems,” in Proceedings of the 23rd international conference on Supercomputing, pp. 370–379.

Most read articles by the same author(s)

1 2 > >>