Data Integrity and Availability in Cloud Computing Based on Megastore

Article Preview

Abstract:

Cloud computing provides means of increasing the capacity or adding the capabilities which releases the heavy data user. It provides gigantic storage for data and faster computing to the customers on the internet. It transfers database and application software from the data owner to the cloud where management and maintenance of data take place. Security of data in cloud is one of the major issues which acts as an obstacle in the development of cloud computing. In this paper, an efficient model is proposed to protect the data in the process of transferring data to the cloud and get the data from the cloud. We take many precautions and measures to guarantee the security of data. To shield owners data from the malicious third party, RSA is used to encrypt data to cipher text. Because it is difficult to search data from the encrypted data, we take the technique of index the document by the keyword and then encrypt the index and send index with encrypted original data. To check the integrity of data, digital signature is taken to identify modifications of data. This article also introduces the concrete the underlying datacenter structure named Megastore and how Megastore functions seamlessly width owners while owners store data and retrieve data from the underlying datacenter. Megastore stores fine-gained partitions of data into different datacenters and the partitioning allows us to synchronously replicate each write to across wide area with reasonable latency and support seamless failover between different datacenters.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1062-1066

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Juels A, Burton J, Kaliski S. PORs: proofs of retrievability for large files. Proceedings of CCS'07, pp.584-597, 2007.

Google Scholar

[2] SLAs with cloudproof. Technical report . Microsoft Research May 2010. Shacham H, Waters B. Compact Proofs of Retrievability, Proceedings of Asiacrypt'08 , 5350, pp.90-107, (2008).

DOI: 10.1007/978-3-540-89255-7_7

Google Scholar

[3] Bowers KD, Juels A, Oprea A. Proofs of retrievability: theory and implementation, Cryptology e-Print Archive. Report 2008/175; 2008a.

Google Scholar

[4] Bowers KD, Juels A, Oprea A. HAIL: a high-availability and integrity layer for cloud storage, Cryptology e-Print Archive. Report 2008/489, 2008b.

DOI: 10.1145/1653662.1653686

Google Scholar

[5] Chor B, Goldreich O, Kushilevitz E, Sudan M. Private information retrieval, In Proceedings of the 36th annual symposium on foundations of computer science, IEEE, p.41–51, (1995).

DOI: 10.1109/sfcs.1995.492461

Google Scholar

[6] L. Lamport. The part-time parliament . ACM Trans. Comput. Syst., 16(2): 133-169, (1998).

DOI: 10.1145/279227.279229

Google Scholar

[7] F. Chang, J. Dean, S. Ghemawat, W. C. Hsieh, D. A. Wallach, M. Burrows, T. Chandra, A. Fikes, and R. E. Gruber. Bigtable: A distributed storage system for structured data. ACM Trans. Comput. Syst., 26(2): 1-26, (2008).

DOI: 10.1145/1365815.1365816

Google Scholar