In cloud computing systems, data owner more often than not store immense volume information on the cloud
servers hence customers may get to the information from Cloud servers without knowing their region in this association outsourcing customer information among untrusted cloud servers, reliable verify, effective information outsourcing and framework execution is a testing issue .keeping in mind the end goal to address the above issues we utilize Centralized Cloud Service Provider to enhance the System Performance by decreasing the time many-sided quality .Therefore, every Client solicitation is overseen by incorporated Cloud Service Provider. In order to provide the reliable verification during uploading and
downloading User has to answer the Security Question. Security Questions and Answers are provided by user during the
registration phase. So during Uploading/Downloading operation If user is normal then he can answer that security questions if
he/she is intruder then he/she cannot answer that questions. Thus, utilizing this we can give more Security. Additionally, we
can give the Security to transferred information and the summary by utilizing the encryption algorithm in this manner we can
accomplish proficient information out sourcing with information respectability. Moreover, the respectability test convention
must be proficient keeping in mind the end goal to spare the verifier's expense.
Mummadi Sravana Sandhya,N.Parashuram,Dr S.Prem Kumar."Efficient PDP Scheme for Distributed Cloud Storage Framework.". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 09,pp.580-584, SEPTEMBER - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I911.pdf,
 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.
 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.
10] K. D. Bowers, A. Juels, and A. Oprea, ―Hail: a high-availability 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.