Provable Multicopy Dynamic Data Possession in Cloud Computing Systems

Authors

  • T. Swetha Singh  M.Tech Scholar, Department of CSE, Vignana Bharathi Institute of Technology Aushapur (V), Ghatkesar (M), R.R., Telangana, India
  • M. Venkateswara Rao  Asstistant Professor, Department of CSE, Vignana Bharathi Institute of Technology Aushapur (V), Ghatkesar (M), R.R., Telangana, India

Keywords:

Cloud Pro Association, MB-PMDDP, PDP

Abstract

Continuously a regularly expanding number of affiliations are picking outsourcing data to remote cloud pro associations (CSPs). Customers can rent the CSPs accumulating establishment to store and recuperate for all intents and purposes endless measure of data by paying costs metered in gigabyte/month. For an extended level of versatility, availability, and strength, a couple of customers may require their data to be recreated on various servers over different server ranches. The more copies the CSP is made a demand to store, the more costs the customers are charged. Along these lines, customers require a strong confirmation that the CSP is securing all data copies that are settled upon in the organization contract, and each one of these copies are unsurprising with the most recent modifications issued by the customers. In this paper, we propose a guide based provable multicopy dynamic data possession (MB-PMDDP) plot that has the going with features: 1) it gives a proof to the customers that the CSP isn't hoodwinking by securing less copies; 2) it supports outsourcing of dynamic data, i.e., it supports square level operations, for instance, piece change, incorporation, deletion, and add; and 3) it empowers affirmed customers to faultlessly get to the record copies set away by the CSP. We give a relative examination of the proposed MB-PMDDP plot with a reference show procured by extending existing provable responsibility for single-copy designs. The theoretical examination is endorsed through exploratory results on a business cloud arrange. Similarly, we show the security against interesting servers, and discuss how to perceive defiled copies by to some degree changing the proposed plot.

References

  1. G Ateniese et al , "Prova le data possession at untrusted stores," in Proc 14th ACM Conf. Comput. Commun. Secur. (CCS), New York, NY, USA, 2007, pp. 598-609.
  2. K Zeng, "Pu licly verifia le re ote data integrity," in Proc 10th Int Conf Inf Commun. Secur. (ICICS), 2008, pp. 419-434.
  3. Y. Deswarte, J.-J Quisquater, and A Saidane, "Re ote integrity chec ing," in Proc 6th Working Conf. Integr. Internal Control Inf. Syst. (IICIS), 2003, pp. 1-11.
  4. D L G Filho and P S L M Barreto, "Demonstrating data possession and uncheatable data transfer," IACR (International Association for Cryptologic Research) ePrint Archive, Tech. Rep. 2006/150, 2006.
  5. F. Sebé, J. Domingo-Ferrer, A. Martinez-Balleste, Y. Deswarte, and J.-J. Quisquater, "Efficient re ote data possession chec ing in critical infor ation infrastructures," IEEE Trans. Knowl. Data Eng., vol. 20, no. 8, pp. 1034-1038, Aug. 2008.
  6. P Golle, S Jarec i, and I Mironov, "Cryptographic pri itives enforcing co unication and storage co plexity," in Proc 6th Int Conf Financial Cryptograph (FC), Berlin, Germany, 2003, pp. 120-135.

Downloads

Published

2018-02-28

Issue

Section

Research Articles

How to Cite

[1]
T. Swetha Singh, M. Venkateswara Rao, " Provable Multicopy Dynamic Data Possession in Cloud Computing Systems, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 3, Issue 1, pp.261-267, January-February-2018.