Novel Approach for Secure Data deduplication System
ARADHYULA VENKATA RAMU, D.RAVI KIRAN, , ,
Affiliations M.Tech (CSE), Priyadrshini Institute of Technology & Management
Data deduplication is a strategy for evaluating duplicate copies of information and has been broadly
utilized as a part of cloud storage to abatement storage space and transfer data transmission. Then again, there is stand
out duplicate for every record put away in cloud regardless of the fact that such a document is claimed by countless. In
like manner, deduplication framework progress storage use while diminishing unwavering quality. Moreover, the
challenge of protection for delicate information likewise happens when they are outsourced by clients to cloud. Wanting
to address the above security test, this paper builds the first push to commend the thought of scattered dependable
deduplication framework. This paper prescribes another disseminated deduplication frameworks with upper reliability in
which the information pieces are circulated from corner to cornering various cloud servers. The wellbeing needs of
information security and label strength are likewise performed by presenting a deterministic mystery sharing plan in
appropriated storage frameworks, rather than utilizing convergent encryption as a part of past deduplication frameworks.
ARADHYULA VENKATA RAMU,D.RAVI KIRAN."Novel Approach for Secure Data deduplication System". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 10,pp.896-901, October- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1019.pdf,
 J. Gantz and D. Reinsel, “The digital universe in 2020: Bigdigital shadows and biggest growth in the fareast,” http://www.emc.com/collateral/analystreports/idcthe-digital-universe-in-2020.pdf, Dec 2012.
 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.