An Empirical Model of Data Deduplication Technique over Cloud

  IJETT-book-cover  International Journal of Engineering Trends and Technology (IJETT)          
  
© 2017 by IJETT Journal
Volume-45 Number-9
Year of Publication : 2017
Authors : K.Srilakshmi, N.V.AshokKumar, C.P.V.N.J Mohan Rao

Citation 

K.Srilakshmi, N.V.AshokKumar, C.P.V.N.J Mohan Rao "An Empirical Model of Data Deduplication Technique over Cloud", International Journal of Engineering Trends and Technology (IJETT), V45(9),461-466 March 2017. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group

Abstract
We are proposing an empirical model of data deduplication technique over cloud data. Even though various traditional approaches proposed by various authors from years of research, every approach has its own pros and cons. Cloud acts as resource area for data owners and End users. In this model we reduce the duplication of the data components without violating privacy and privileges or access permissions of the while sharing between multiple data owner. Our proposed model improves the performance and maintains data confidentiality than the traditional approaches.

 References

[1] S. Marium, Q. Nazir, A. Ahmed, S. Ahthasham and Aamir M. Mirza, “Implementation of EAP with RSA for Enhancing The Security of Cloud Computig”,International Journal of Basic and Applied Science,vol 1, no. 3, pp. 177-183,2012.
[2] Q. Wang, C. Wang,K.Ren, W. Lou and Jin Li “Enabling Public Audatability and Data Dynamics for Storage Security in Cloud Computing”, IEEE Transaction on Parallel and Distributed System, vol. 22, no. 5, pp. 847 859,2011.
[3] B. Dhiyanesh “A Novel Third Party Auditability and Dynamic Based Security in Cloud Computing” , International Journal of Advanced Research in Technology, vol. 1,no. 1, pp. 29 -33, ISSN: 6602 3127, 2011
[4] P. Mell and T. Grance, “The NIST definition of cloud computing,”National Institute of Standards and Technology, Tech. Rep., 2009.
[5] M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. H.
[6] T. Velte, A. Velte, and R. Elsenpeter, Cloud Computing: A Practical Approach, 1st ed. New York, NY, USA: McGraw-Hill, Inc., 2010, ch. 7. Stoica, and M. Zaharia, “A view of cloud computing,” Commun. ACM,
[7] L. N. Bairavasundaram, G. R. Goodson, S. Pasupathy, and J. Schindler, “An analysis of latent sector errors in disk drives,” in SIGMETRICS, L. Golubchik, M. H. Ammar, and M. Harchol- Balter, Eds. ACM, 2007, pp. 289–300.
[8] B. Schroeder and G. A. Gibson, “Disk failures in the real world: What does an mttf of 1, 000, 000 hours mean to you?” in FAST. USENIX, 2007, pp. 1–16.
[7] M. Lillibridge, S. Elnikety, A. Birrell, M. Burrows, and M. Isard, “A cooperative internet backup scheme,” in USENIX Annual Technical Conference, General Track.USENIX, 2003, pp. 29–41.
[9] Y. Deswarte, J. Quisquater, and A. Saidane, “Remote probity checking,” in The Sixth Working Conference on Probity and Internal Control in Information Systems(IICIS). Springer Netherlands, November 2004.
[10] M. Naor and G. N. Rothblum, “The complexity of online memory checking,” J. ACM, vol. 56, no. 1, 2009.
[11] A. Juels and B. S. K. Jr., “Pors: proofs of retrievability for large files,” in ACM Conference on Computer and Communications Security, P. Ning, S. D. C. di Vimercati, and P. F. Syverson, Eds. ACM, 2007, pp. 584–597.
[12] T. J. E. Schwarz and E. L. Miller, “Store, forget, and check: Using algebraic signatures to check remotely administered storage,” in ICDCS. IEEE Computer Society, 2006, p. 12.
[13] D. L. G. Filho and P. S. L. M. Barreto, “Demonstrating data possession and uncheatable data transfer,” IACR Cryptology ePrint Archive, vol. 2006, p.150, 2006.
[14] F. Seb´e, J. Domingo-Ferrer, A. Mart´?nez-Ballest´e, Y. Deswarte, and J.-J. Quisquater, “Efficient remote data possession checking incritical information.
[15] Cong Wang, Sherman S.M, Qian Wang, Kui Ren, Wenjing Lou “Privacy-Preserving Public Auditing for Secure Cloud Storage”.

Keywords
Our proposed model improves the performance and maintains data confidentiality than the traditional approaches.