Hash Function based Data Partitioning in Cloud Computing for Secured Cloud Storage

Abstract

There is a necessity to firmly manage, store, and examine enormous quantity of complex data i.e. semi-structure and unstructured to regulate configurations and developments in order to expand the feature and excellence. It is very essential that clouds be secure and protected because of the critical environment of the applications. The foremost security task using cloud is that the holder of the data possibly will not have control of where the data is located. If anyone who desires to exploit the advantages of using cloud computing, one must also use the resource sharing and scheduling delivered by clouds. The data stored on cloud may be possible altered or modified without the knowledge of client. There should be a mechanism that verifies the stored and the data being retrieved is same.Thus we need protection of the data.This paper examines some significant security services including verification, encryption and decryption are provided in cloud computing system. In this paper data partitioning technique is used for privacy conserving and security of data, using third party auditor (TPA) and concept of hash function. A hash function takes a data of variable size and generates a data of fixed length, which is unique for each data. when data is encoded the hash value of encrypted data is also created and it is stored by third party auditor .For retrieval of data, third party auditor decodes the data by random key and creates the hash of the encrypted file attained from cloud then the hash value is matched and compared with one generated by it and the hash value at data holder, this verifies the data exactness. The objective of this work is designing, an effective flexible storage structure to confirm the accessibility of data and data exactness in cloud.

Authors and Affiliations

Parisha . , Pooja Khanna, Puneet Sharma, Sheenu Rizvi

Keywords

Related Articles

Pyramidal Sum Labeling In Graphs

Let G = (V, E) be a graph with p vertices and q edges. A graph G is said to admit Pyramidal Sum labeling if its vertices can be labeled by nonnegative integers 0,1,2 โ€ฆ ๐‘๐‘ž such that the induced edge labels obtained by the...

Student Performance Prediction in Higher Education Using Lion โ€“ Wolf Optimization Algorithm

Students are the future of the country and their education qualification becomes highly important for the growth of the country. Predicting the performance of a students with the help of prediction models, is the one of...

Performance Evaluation of Symmetrical and Asymmetrical Cascaded H Bridge Multilevel Inverter Topology

This paper reviews study of symmetrical and asymmetrical cascaded H-bridge multilevel inverter. Here symmetrical, binary asymmetrical and ternary asymmetrical structure formed by cascading two H-bridge cells are compared...

Fountain Codes: LT And Raptor Codes Implementation

Digital fountain codes are a new class of random error correcting codes designed for efficient and reliable data delivery over erasure channels such as internet. These codes were developed to provide robustness against e...

Download PDF file
  • EP ID EP391918
  • DOI 10.9790/9622-0707100106.
  • Views 116
  • Downloads 0

How To Cite

Parisha . , Pooja Khanna, Puneet Sharma, Sheenu Rizvi (2017). Hash Function based Data Partitioning in Cloud Computing for Secured Cloud Storage. International Journal of engineering Research and Applications, 7(7), 1-6. https://europub.co.uk./articles/-A-391918