Journal of Computer Technology & Applications
A Shareable Secure and Privacy Preserving Auditing Scheme for Cloud Storage Security
Abstract
AbstractCloud data security has been a concern as the cloud is considered untrusted environment. People across the globe can have cloud storage services in pay per use fashion. In this environment, enterprises store their valuable data in cloud. However, due to security concerns most of the cloud data owners are concerned about the integrity of data that has been outsourced. Many schemes came into existence in order to have integrity of data. Some schemes focused on cryptographic primitives while other schemes focused on provable data possession schemes. In this paper, we proposed and implemented a shareable secure and privacy preserving auditing scheme for cloud storage security. It makes use of mechanisms to recover data if data is corrupted or subjected to illegal tampering. We built a prototype application that shows the proof of concept. The empirical results suggest that the proposed approach is able to protect outsourced data to cloud.Keywords: Cloud computing, auditing, data integrity, privacy preservationCite this ArticleRaju Dara, Doddikousari Kumari. A Shareable Secure and Privacy Preserving Auditing Scheme for Cloud Storage Security. Journal of Computer Technology & Applications. 2016; 7(3): 18–24p.References (15)
- Deswarte Y, Quisquater J.-J, Saïdane A. Remote integrity checking. In Integrity and Internal Control in Information Systems VI . Berlin, Germany: Springer - Verlag, 2004, 1–11p.
- Filho D.L.G, Barreto P.S.L.M. Demonstrating data possession and uncheatable data transfer. Cryptology ePrint Archive, Tech.Rep. 2006/150, 2006 Online. Available from http://eprint.iacr.org/
- Ateniese G et al. Provable data possession at untrusted stores. In Proc.14th ACM Conf. Comput. Commun. Secur. (CCS), New York, NY, USA, 2007; 598–609p.
- Juels A., Kaliski B.S, Jr. PORs: Proofs of retrievability for large files. In Proc.14th ACM Conf. Comput. Commun. Secur. 2007; 584–597p.
- Ateniese G, Pietro R. Di, Mancini L. V, and Tsudik G. Scalable and efficient provable data possession. in Proc. 4th Int. Conf. Secur. Privacy Commun. Netw. 2008; Art. ID 9.
- Erway C, Küpçü A, Papamanthou C, and Tamassia R. Dynamic provable data possession. In Proc. 16th ACM Conf. Comput. Commun. Secur. 2009; 213–222p.
- Wang Q, Wang C, Li J, Ren K, and Lou W. Enabling public verifiability and data dynamics for storage security in cloud computing. In Computer Security. Berlin, Germany: Springer-Verlag. 2009; 355–370p.
- Wang C, Wang Q, Ren K, and Lou W. Privacy-preserving public auditing for data storage security in cloud computing. In Proc. IEEE INFOCOM. Mar 2010; 1–9p.
- Wang C, Chow S. S. M , Wang Q, Ren K, and Lou W. Privacy-preserving public auditing for secure cloud storage . IEEE Trans. Comput. Feb. 2013; 62(2): 362–375p.
- Worku S. G, Xu C, Zhao J, and He X. Secure and efficient privacy preserving public auditing scheme for cloud storage. Comput. Elect. Eng. 2013; 40(5): 1703–1713p.
- Yang K and Jia X. An efficient and secure dynamic auditing protocol for data storage in cloud computing . IEEE Trans. Parallel Distrib. Syst. Sep 2013; 24(9): 1717–1726p.
- Wang C, Wang Q, Ren K, Cao N, and Lou W. Toward secure and dependable storage services in cloud computing . IEEE Trans. Service Comput. Apr/Jun 2012; 5(2): 220 – 232p.
- Zhu Y, Hu H, Ahn G.-J, and Yu M. Cooperative provable data possession for integrity verification in multicloud storage. IEEE Trans. Parallel Distrib. Syst. Dec 2012; 23(12): 2231–2244p.
- Bowers K. D, Juels A, and Oprea A. Proofs of retrievability: Theory and implementation. In Proc. ACM Workshop Cloud Comput. Secur. 2009; 43–54p.
- Dodis Y, Vadhan S, Wichs D. Proofs of retrievability via hardness amplification. In Theory of Cryptography. Berlin, Germany: Springer-Verlag. 2009; 109–127p. Cite this Article Raju Dara, Doddikousari Kumari. A Shareable Secure and Privacy Preserving Auditing Scheme for Cloud Storage Security . Journal of Computer Technology & Applications. 2016; 7(3): 18–24p.