SECURE & EFFICIENT AUDIT SERVICE OUTSOURCING FOR DATA INTEGRITY IN CLOUDS

Authors

  • Gyan Prakash

DOI:

https://doi.org/10.20894/IJMSR.117.006.001.008

Abstract

Cloud-based outsourced storage relieves the clients load for storage management and maintenance by providing a comparably low-cost, scalable, location-independent platform. Though, the information that clients no longer have physical control of data specifies that they are facing a potentially formidable risk for missing or corrupted data. To avoid the security risks, inspection services are serious to ensure the integrity and availability of outsourced data and to achieve digital forensics and reliability on cloud computing. Provable data possession (PDP), which is a cryptographic method for validating the reliability of data without retrieving it at an untrusted server, can be used to realize audit services. In this project, profiting from the interactive zero-knowledge proof system, the construction of an interactive PDP protocol to prevent the fraudulence of prover (soundness property) and the leakage of verified data (zero knowledge property).To prove that our construction holds these properties based on the computation DiffieHellman assumption and the rewindable black-box knowledge extractor. An efficient mechanism on probabilistic queries and periodic verification is proposed to reduce the audit costs per verification and implement abnormal detection timely. Also, we present an efficient method for choosing an optimal parameter value to reduce computational overheads of cloud audit services.

Downloads

Download data is not yet available.

Author Biography

Gyan Prakash

Software Engineer, Vee Eee Technologies Solutions Pvt. Ltd.

References

1. A.D. Rabkin, A., Stoica, I., Zaharia, M., 2010. A view of cloud computing. Common. ACM 53 (4), 50–58.

2. Alam, I., C. Perry. "A Customer-Oriented New Service Development Process." Journal of Services Marketing 16, no. 6 (2002): 515-534.

3. Armbrust, M., A. Fox, R. Griffith, A. Joseph, R. Katz, A. Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica and M. Zaharia. “Above the Clouds: A Berkeley View of Cloud Computing." Technical Report, 2009.

4. Ateniese, G., Burns, R.C., Curtmola, R., Herring, J., Kissner, L., Peterson, Z.N.J., Song, D.X., 2007. Provable data possession at untrusted stores. In: Proceedings of the 2007 ACM Conference on Computer and Communications Security, CCS 2007, pp. 598–609.

5. Ateniese, G., Pietro, R.D., Mancini, L.V., Tsudik, G., 2008. Scalable and efficient provable data possession. In: Proceedings of the 4th International Conference on Security and Privacy in Communication Networks, SecureComm, and pp. 1–10.

6. Barreto, P.S.L.M., Galbraith, S.D., O’Eigeartaigh, C., Scott, M., 2007. Efficient pairing computation on supersingular abelian varieties. Des. Codes Cryptogr. 42 (3), 239–271.

7. Beuchat, J.-L., Brisebarre, N., Detrey, J., Okamoto, E., 2007. Arithmetic operators for pairing-based cryptography. In: Cryptographic Hardware and Embedded Systems – CHES 2007, 9th International Workshop, and pp. 239–255.

8. Boneh, D., Boyen, X., Shacham, H., 2004. Short group signatures. In: In Proceedings of CRYPTO 04, LNCS Series. Springer-Verlag, pp. 41–55.Boneh, D., Franklin, M., 2001. Identity-based encryption from the Weil pairing. In: Advances in Cryptology (CRYPTO’2001). Vol. 2139 of LNCS, pp. 213–229.

9. Bowers, K.D., Juels, A., Oprea, A., 2009. Hail: a high-availability and integrity layer for cloud storage. In: 28.ACM Conference on Computer and Communications Security, pp. 187–198.

10. Breidert, C. Estimation of Willingness-to-Pay – Theory, Measurement, Application. Wiesbaden: DUV, 2006.

11. Briscoe, G., and A. Marinos. "Digital Ecosystems in the Clouds: Towards Community Cloud Computing." Digital Ecosystems and Technologies Conference. IEEE Press, 2009.

12. Buyya, R., CS. Yeo, S. Venugopal, J. Broberg, and I. Brandic. "Cloud computing and emerging IT platforms: Vision, hype, and reality for delivering computing as the 5th utility." Future Generation Computer Systems 25, no. 6 (2009): 599-616.

13. Cramer, R., Damgård, I., MacKenzie, P.D., 2000. Efficient zero-knowledge proofs of knowledge without intractability assumptions. In: Public Key Cryptography, pp. 354 373.

Downloads

Published

2019-12-11

Issue

Section

Articles