(M.Tech) CSE, Dept. of Computer Science and EngineeringAssistant Professor, Dept. of Computer Science and Engineering Priyadarshini Institute of Technology & Science
— Provable data possession (PDP) is a strategy for guaranteeing the trustworthiness of information away outsourcing.
In this paper, we address the construction of a proficient PDP scheme for disseminated distributed storage to bolster the versatility
of administration and information migration, in which we consider the presence of different cloud administration providers to
agreeably store and keep up the customers' information. We display an cooperative PDP (CPDP) scheme based on homomorphic
verifiable response and hash file indexing order. We demonstrate the security of our scheme based on multi-proven zeroknowledge proof system, which can fulfill culmination, information soundness, and zero-information properties. In addition, we
verbalize execution optimization instruments for our scheme, and specifically exhibit a proficient technique for selecting ideal
parameter qualities to minimize the computation expenses of customers and capacity administration providers. Our examinations
demonstrate that our solution presents lower computation and communication overheads in comparison with non-helpful
VIJAY KUMAR,CH.HARIKA."Cooperative Provable Data Possession for Multi-Cloud Server Storage". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1192-1202, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1270.pdf,
: Storage Security, Provable Data Possession, Interactive Protocol, Zero-knowledge, Multiple Cloud,
 B. Sotomayor, R. S. Montero, I. M. Llorente, and I. T. Foster, “Virtual infrastructure management in private and hybrid clouds,” IEEE Internet Computing, vol. 13, no. 5, pp. 14–22, 2009.
 G. Ateniese, R. C. Burns, R. Curtmola, J. Herring, L. Kissner, Z. N. J. Peterson, and D. X. Song, “Provable data possession at untrusted stores,” in ACM Conference on Computer and Communications Security, P. Ning, S. D. C. di Vimercati, and P. F. Syverson, Eds. ACM, 2007, pp. 598– 609.
 A. Juels and B. S. K. Jr., “Pors: proofs of retrievability for large files,” in ACMConference on Computer and Communications Security, P. Ning, S. D. C. di Vimercati, and P. F. Syverson, Eds. ACM, 2007, pp. 584–597.
 G. Ateniese, R. D. Pietro, L. V. Mancini, and G. Tsudik, “Scalable and efficient provable data possession,” in Proceedings of the 4th international conference on Security and privacy in communication netowrks, SecureComm, 2008, pp. 1–10.
 C. C. Erway, A. K¨upc¸ ¨u, C. Papamanthou, and R. Tamassia, “Dynamic provable data possession,” in ACM Conference on Computer and Communications Security, E. Al-Shaer, S. Jha, and A. D. Keromytis, Eds. ACM, 2009, pp. 213–222.
 H. Shacham and B. Waters, “Compact proofs of retrievability,” in ASIACRYPT, ser. Lecture Notes in Computer Science, J. Pieprzyk, Ed., vol. 5350. Springer, 2008, pp. 90–107. .
 Q. Wang, C.Wang, J. Li, K. Ren, and W. Lou, “Enabling public verifiability and data dynamics for storage security in cloud computing,” in ESORICS, ser. Lecture Notes in Computer Science, M. Backes and P. Ning, Eds., vol. 5789. Springer, 2009, pp. 355–370.
 Y. Zhu, H. Wang, Z. Hu, G.-J. Ahn, H. Hu, and S. S. Yau, “Dynamic audit services for integrity verification of outsourced storages in clouds,” in SAC, W. C. Chu, W. E. Wong, M. J Palakal, and C.-C. Hung, Eds. ACM, 2011, pp. 1550–1557.
 K. D. Bowers, A. Juels, and A. Oprea, “Hail: a highavailability and integrity layer for cloud storage,” in ACM Conference on Computer and Communications Security, E. Al-Shaer, S. Jha, and A. D. Keromytis, Eds. ACM, 2009, pp. 187–198.
 Y. Dodis, S. P. Vadhan, and D. Wichs, “Proofs of retrievability via hardness amplification,” in TCC, ser. Lecture Notes in Computer Science, O. Reingold, Ed., vol. 5444. Springer, 2009, pp. 109–127.
 L. Fortnow, J. Rompel, and M. Sipser, “On the power of multiprover interactive protocols,” in Theoretical Computer Science, 1988, pp. 156–161.
 Y. Zhu, H. Hu, G.-J. Ahn, Y. Han, and S. Chen, “Collaborative integrity verification in hybrid clouds,” in Applications and Worksharing, CollaborateCom, Orlando, Florida, USA, October 15-18, 2011, pp. 197–206.
 M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. H. Katz, A. Konwinski, G. Lee, D. A. Patterson, A. Rabkin, I. Stoica, and M. Zaharia, “Above the clouds: A berkeley view of cloud computing,” EECS Department, University of California, Berkeley, Tech. Rep., Feb 2009.
 D. Boneh and M. Franklin, “Identity-based encryption from the weil pairing,” in Advances in Cryptology (CRYPTO’2001),vol. 2139 of LNCS, 2001, pp. 213–229.