Cloud computing has been imagined as the cutting edge engineering of IT Enterprise. Rather than conventional arrangements, where the IT administrations are under legitimate physical, consistent and work force controls, Cloud Computing moves the application programming and databases to the extensive server farms, where the administration of the information and administrations may not be completely reliable. With Cloud computing and capacity, clients can get to and to share assets offered by cloud specialist co-ops at a lower peripheral cost. With Cloud computing and capacity administrations, information is put away in the cloud, as well as routinely shared among countless in a gathering. In this venture, we propose a protection saving evaluating plan for imparted information to vast gatherings in the cloud. We use hash marks to process check data on shared information, so that the TPA can review the accuracy of shared information, however can't uncover the character of the endorser on every piece. Hash mark and Keys are created by Merkle Hash Tree. We can execute reviewing plan to perform productive open inspecting to secure both character and information protection in cloud situations. And furthermore clients can get to the information from information proprietor through cloud supplier continuously dynamic cloud environment.
 M. J. Atallah, K. Pantazopoulos, J. R. Rice, and E. E. Spafford, “Secure outsourcing of scientific computations,” Trends in Software Engineering, vol. 54, pp. 215-272 2002.  D. Benjamin and M. J. Atallah, “Private and cheatingfree outsourcing of algebraic computations,” Proc. Sixth Annual Conference on Privacy, Security and Trust, pp. 240-245, 2008.  C.Wang, K. Ren, and J.Wang, “Secure and practical outsourcing of linear programming in cloud computing,” IEEE INFOCOM 2011, pp. 820-828, 2011.  X. Chen, J. Li, J. Ma, Q. Tang, and W. Lou, “New Algorithms for Secure Outsourcing of Modular Exponentiations,” Proc. 17th European Symposium on Research in Computer Security, pp. 541-556, 2012.  G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song, “Provable Data Possession at Untrusted Stores,” Proc. 14th ACM Conf. Computer and Comm. Security, pp. 598-609, 2007.  A. Juels, J. Burton, and S. Kaliski, “PORs: Proofs of Retrievability for Large Files,” Proc. 14th ACM Conf. Computer and Comm. Security, pp. 584-597, 2007.  H. Shacham and B. Waters, “Compact Proofs of Retrievability,” Advances in Cryptology-Asiacrypt’08, pp. 90-107, 2008.  G. Ateniese, R.D. Pietro, L. V. Mancini, and G. Tsudik, “Scalable and Efficient Provable Data Possession,” Proc. 4th International Conference on Security and Privacy in Communication Networks, 2008  F. Sebe, J. Domingo-Ferrer, A. Martinez-balleste, Y. Deswarte, and J. Quisquater, “Efficient Remote Data Integrity checking in Critical Information Infrastructures,” IEEE Transactions on Knowledge and Data Engineering, vol. 20, no. 8, pp. 1-6, 2008.  R. Curtmola, O. Khan, R. Burns, and G. Ateniese, “MR-PPDP: Multiple-Replica Provable Data Possession,” Proc. 28th IEEE International Conference on Distributed Computing Systems, pp. 411-420, 2008.  Y. Zhu, H. Wang, Z. Hu, G. J. Ahn, H. Hu, and S. S. Yau, “Efficient Provable Data Possession for Hybrid Clouds,” Proc. 17th ACM Conference on Computer and Communications Security, pp. 756-758, 2010.  C. Wang, K. Ren, W. Lou, and J. Li, “Toward Publicly Auditable Secure Cloud Data Storage Services,” IEEE Network, vol. 24, no. 4, pp. 19-24, July/Aug. 2010.  Q. Wang, C. Wang, K. Ren, W. Lou, and J. Li, “Enabling Public Auditability and Data Dynamics for Storage Security in Cloud Computing,” IEEE Trans. Parallel and Distributed Systems, vol. 22, no. 5, pp. 847-859, May 2011.