TOWARDS SECURE & DEPENDABLE STORAGE SERVICES IN CLOUD COMPUTING

Guided By Prof. Dinesh Singh

Dept of CSE, PESIT

Presented By
Mahesh Gonda
MTech CSE , 1st Sem , Roll No - 29

SYNOPSIS
INTRODUCTION EXISTING SYSTEM PROPOSED SYSTEM ALGORITHMS APPLICATIONS CONCLUSION

INTRODUCTION
Enjoy the cloud applications without the burden of local hardware and software management. The proposed design allows users to audit the cloud storage with very lightweight communication and computation cost.

The proposed design further supports secure and efficient dynamic operations on outsourced data, including block modication , deletion, and append.
The proposed scheme is highly efficient and resilient against Byzantine failure, malicious data modication attack, and even server colluding attacks

EXISTING SYSTEM AND LIMITATIONS

Byzantine Error Occurrence.
Does not guarantee the data availability in case of server failures. In this system doesnt have any correctness measure of data

PROPOSED SYSTEM
Flexibale Distributed Adutiting Mechanism Storage Correctness Dynamic Data Support Delete , append and modification of blocks Utilizing the Homomorphic Token with distributed verication of erasure-coded data for identication of the misbehaving server(s) Highly efficient and resilent against Byzantine failures Malicious data modication attack Server colluding attacks.

PROPOSED SYSTEM ARCHITECTURE

DESCRIPTION
There are Two models is the proposed system 1. SYSTEM MODEL User: Cloud Server(CS) Third Party Auditor (TPA) . 2. ADVERSARY MODEL

ALGORITHMS USED

Token Pre-computation Correctness Verification and Error Localization Error recovery

TOKEN PRE-COMPUTATION
Before file distribution the user pre-computes a certain number of short verification tokens on individual vector.
User wants to make sure the storage correctness for the data in the cloud, he challenges the cloud servers with a set of randomly generated block indices. Each cloud server computes a short signature over the specified blocks and returns them to the user.

CORRECTNESS VERIFICATION AND ERROR LOCALIZATION

Error localization is a key prerequisite for eliminating errors in storage systems. Proposed scheme outperforms correctness verification and error localization (misbehaving server identification) The response values from servers for each challenge not only determine the correctness of the distributed storage, but also contain information to locate potential data error(s).

ERROR RECOVERY
The user can reconstruct the original file by downloading the data vectors from the first m servers, assuming that they return the correct response values.
The data corruption is detected, the comparison of pre-computed tokens and received response values can guarantee the identification of misbehaving server(s) (again with high probability)

APPLICATION
MICROSOFT APPs GOOGLE Docs

OFFICE 365
FINANCE AMAZON web services

CONCLUSION
In this scheme is to achieve the assurance of cloud data integrity and availability Fast localization Dynamic Data Support Dependability

When Social Web Meets Semantic Web : Web 2.5

REFERENCES
[1] C. Wang, Q. Wang, K. Ren, and W. Lou, Ensuring data storage security in cloud computing, in Proc. of IWQoS09, July 2009, pp. 19. [2] Amazon.com, Amazon web services (aws), Online at http:// aws.amazon.com/, 2009. [3] Sun Microsystems, Inc., Building customer trust in cloud computing with transparent security, Online at https://www.sun.com/offers/details/sun transparency.xml , November 2009. [4] M. Arrington, Gmail disaster: Reports of mass email deletions, Online at http://www.techcrunch.com/2006/12/28/gmail-disasterreports-of-mass-email-deletions/ , December 2006. [5] J. Kincaid, MediaMax/TheLinkup Closes Its Doors, Online at http://www.techcrunch.com/2008/07/10/mediamaxthelinkup-closes-its-doors/ , July 2008.

14