An Efficient Pdp Scheme For Distributed Cloud Storage To Support Dynamic Scalability On Multiple Storage Servers

Abstract

The confirmation examination without downloading makes it particularly important for large-size files and folders typically including many clients’ files to make sure whether these data have been tampered with or deleted without downloading the latest version of data. Provable data possession is such a probabilistic proof technique for a storage provider to establish the integrity and ownership of clients’ data without downloading data. Consequently it is able to put back traditional hash and signature functions in storage outsourcing. Various PDP schemes have been recently proposed such as Scalable PDP and Dynamic PDP. Though these schemes mainly focus on PDP issues at untrusted servers in a single cloud storage provider and are not appropriate for a multi-cloud environment. Furthermore clients need to know the exact position of each file block in a multi-cloud environment. The confirmation process in such a case will lead to high communication overheads and calculation costs at client sides as well. Consequently it is of utmost necessary to design a cooperative PDP model to decrease the storage and network overheads and improve the transparency of verification activities in cluster-based cloud storage systems. A cooperative PDP scheme should give features for timely detecting abnormality and renewing multiple copies of data.

Authors and Affiliations

Ch. Rajeshwari| Balaji Institute of Technology & Science Narsampet warangal, choppararaji@gmail.com, S. Suresh| Balaji Institute of Technology & Science Narsampet warangal

Keywords

Related Articles

A new Security approach for integrating wireless adhoc network using octant bit computation and routing test

Ad hoc networks are a kind of network that has no centralized body and in order to communicate with the nodes it has no fixed topology.In this paper we propose to use binary masking of octant bits and shared cryptogr...

Implementation And Evaluation Of Privacy Preserving Protocol

Now a day’s web search portals provide information to different kinds of people. But it is providing irrelevant information that is not related to user requirements. To improve results accuracy we introducing new f...

Improved Privacy Preserving Profile Matching in Online Social Networks

Social networking became popular because of its digital communication technologies tools for extending the social circle of people. Privacy preservation became a significant issue in social networking. This work disc...

The Dynamic Load Balancing Method On Game Theory For Distributed Systems

The load balancing model is aimed at the public cloud which has several nodes with scattered computing resources in different geographic locations. When the environment is very large and difficult these divisions sim...

Defeating Ddos Attack By Using Software Puzzle Scheme

Denial of-administration and passed on DoS are among the genuine dangers to cutting edge security, and customer bewilder, which requests a customer to perform computationally exorbitant operations before being yielde...

Download PDF file
  • EP ID EP16428
  • DOI -
  • Views 353
  • Downloads 10

How To Cite

Ch. Rajeshwari, S. Suresh (2014). An Efficient Pdp Scheme For Distributed Cloud Storage To Support Dynamic Scalability On Multiple Storage Servers. International Journal of Science Engineering and Advance Technology, 2(12), 985-988. https://europub.co.uk/articles/-A-16428