fgdfhdsfhh

To Provide Security for Storage Services in Cloud Computing
D.Shravani, Dr. S. Zahoor Ul Huq
1 M .Tech (C.S.E), G. Pulla Reddy Engineering College (Autonomous), JNTU Ananthapur University,
Computer Science and Engineering, Kurnool, Andhra Pradesh, India.
[e-mail]
2Associate professor Dept of Computer Science and Engineering, G. Pulla Reddy Engineering College (Autonomous) JNTU Ananthapur University, Kurnool, Andhra Pradesh, India. [e-mail] Abstract-- Cloud computing is the delivery of computing and storage capacity as a service to a community of end-recipients. Cloud computing entrusts services with a user 's data, software and computation over a network. Cloud storage enables users to remotely store their data and enjoy the on-demand high quality cloud applications without the burden of local hardware and software management. Though the benefits are clear, such a service is also relinquishing users, physical possession of their outsourced data, which unavoidably poses new security risks toward the correctness of the data in cloud. In order to address this new problem and further achieve a secure and dependable cloud storage service, we propose in this paper a flexible distributed storage integrity auditing mechanism, utilizing the homomorphism token and distributed erasure-coded data. The proposed design allows users to audit the cloud storage with very lightweight communication and computation cost. The auditing result not only ensures strong cloud storage correctness guarantee, but also simultaneously achieves fast data error localization, i.e., the identification of misbehaving server. Considering the cloud data are dynamic in nature, the proposed design further supports secure and efficient dynamic operations on outsourced data, including block modification, deletion, and append. Analysis shows the proposed scheme is highly efficient and resilient against Byzantine failure, malicious data modification attack, and even

References: [1]. H. Shacham and B. Waters, “Compact proofs of retrievability,” in Proc. of ASI- ACRYPT’08. Springer-Verlag, 2008, pp. 90–107. [2]. G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song, “Provable data possession at untrusted stores,” in Proc. of CCS’07. New York, NY, USA: ACM, 2007, pp. 598–609. [3]. A. Juels and B. S. Kaliski, Jr., “Pors: proofs of retrievability for large files,” in Proc. of CCS’07. New York, NY, USA: ACM, 2007, pp. 584–597. [4]. Amazon.com, “Amazon s3 availability event: July 20, 2008,” Online at http:// status.aws.amazon.com/s3-20080720.html, July 2008. [5]. J. Black, S. Halevi, H. Krawczyk, T. Krovetz, and P. Rogaway. UMAC: Fast and secure message authentication. In CRYPTO, volume 1666 of LNCS, pages 216–233, 1999. [6]. K. D. Bowers, A. Juels, and A Oprea. HAIL: A High-availability and integrity layer for cloud storage, 2008. IACR ePrint manuscript 2008/489. Asynchronous verifiable secret sharing and proactive cryptosystems. In 9th ACM CCS, pages 88–97, 2002. [8.]C. Cachin and S. Tessaro. Asynchronous verifiable information dispersal. In 24th IEEE SRDS, pages 191–202, 2005. [9]. L. Carter and M. Wegman. Universal hash functions. Journal of Computer and System Sciences, 18(3), 1979. [10]. R. Curtmola, O. Khan, and R. Burns. Robust remote data checking. In 4th ACM StorageSS, 2008. [12]. K. D. Bowers, A. Jules, and A Oprea. Proofs of retrievability: Theory and implementation, 2008. IACR ePrint manuscript 2008/175. [13]. A. Herzberg, M. Jakobsson, H. Krawczyk, and M. Yung. Proactive public key and signature systems. In 4th ACM CCS, pages 100–110, 1997. [14]. A. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung. Proactive secret sharing, or: How to cope with perpetual leakage. In CRYPTO, volume 1963 of LNCS, pages 339–352, 1995. [15]. A. Juels and B. Kaliski. PORs: Proofs of retrievability for large files. In 14th ACM CCS, pages 584–597, 2007. [16].H. Krawczyk. LFSR-based hashing and authentication. In CRYPTO, volume 839 of LNCS, pages 129–139, 1994. [17].M. Lillibridge, S. Elnikety, A. Birrell, M. Burrows, and M. Isard. A cooperative Internet backup scheme. In USENIX Annual Technical Conference, pages 29–41, 2003. [26]. M. Bellare, R. Canetti, and H. Krawczyk, “Keying hash functions for message authentication,” in Proc. of Crypto’96, volume 1109 of LNCS. Springer-Verlag, 1996, pp. 1–15. [27]. T. Schwarz and E. L. Miller, “Store, forget, and check: Using algebraic signatures to check remotely administered storage,” in Proc. of ICDCS’06, 2006, pp. 12–12.