SECURITY AND PRIVACY PRESERVING IN CLOUD
COMPUTING
ABSTRACT
TPA eliminates the involvement of the client through the auditing of whether his data
stored in the cloud is indeed intact, which can be important in achieving economies
of scale for Cloud Computing.
The trust based cloud depends on both cloud users as well as TPA. If any changes
appear in the content of the remote file the intimation will be immediately posted to
the file owner without any delay.
It describes a secure cloud storage system supporting privacy-preserving public
auditing, and further extend to enable the TPA to perform audits for multiple users
efficiently.
EXISTING SYSTEM
To securely introduce an effective third party auditor (TPA), the following two
fundamental requirements have to be met:
1) TPA should be able to efficiently audit the cloud data storage without demanding
the local copy of data, and introduce no additional on-line burden to the cloud user;
2) The third party auditing process should bring in no new vulnerabilities towards
user data privacy.
DISADVANTAGES
No user data privacy
Security risks towards the correctness of the data in cloud
Data encryption is large so the disadvantage is small users with
limited computational power (PDAs, mobile phones etc.).
The main drawback of this scheme is the high resource costs it
requires for the implementation.
PROPOSED SYSTEM
We focus on cloud data storage security, which has always been an important aspect
of quality of service.
To ensure the correctness of users’ data in the cloud, we propose an effective and
flexible distributed scheme with two salient features, opposing to its predecessors.
By utilizing the homomorphism token with distributed verification of erasure-coded
data, our scheme achieves the integration of storage correctness insurance and data
error localization, i.e., the identification of misbehaving server(s).
Unlike most prior works, the new scheme further supports secure and efficient
dynamic operations on data blocks, including: data update, delete and append.
ADVANTAGES
We utilize the public key based homomorphic authenticator and
uniquely integrate it with random mask technique to achieve a
privacy-preserving public auditing system for cloud data storage
security while keeping all above requirements in mind.
To support efficient handling of multiple auditing tasks, we further
explore the technique of bilinear aggregate signature to extend our
main result into a multi-user setting, where TPA can perform
multiple auditing tasks simultaneously.
Extensive security and performance analysis shows the proposed
schemes are provably secure and highly efficient.
We also show how to extent our main scheme to support batch
auditing for TPA upon delegations from multi-users.
OVERALL SYSTEM DESIGN
DATA FLOW DIAGRAM
L ogin
Yes No
User Exists
No
Authenticated Create Account
User
Yes
K ey Generation
Up load Files
Store into File
Database
S tore into image
Database
Download Files
Display The Files
MODULES
Privacy Preserving Public Auditing
Batch Auditing
Data Dynamics
Simply Archives
Sentinels
Verification Phase
PRIVACY PRESERVING PUBLIC AUDITING
Homomorphic authenticators are unforgeable verification metadata
generated from individual data blocks, which can be securely
aggregated in such a way to assure an auditor that a linear
combination of data blocks is correctly computed by verifying
only the aggregated authenticator. Overview to achieve privacy-
preserving public auditing, we propose to uniquely integrate the
homomorphic authenticator with random mask technique. In our
protocol, the linear combination of sampled blocks in the server’s
response is masked with randomness generated by a pseudo
random function (PRF).
BATCH AUDITING
With the establishment of privacy-preserving public
auditing in Cloud Computing, TPA may concurrently
handle multiple auditing delegations upon different
users’ requests. The individual auditing of these tasks for
TPA can be tedious and very inefficient. Batch auditing
not only allows TPA to perform the multiple auditing
tasks simultaneously, but also greatly reduces the
computation cost on the TPA side.
DATA DYNAMICS
Hence, supporting data dynamics for privacy-preserving
public risk auditing is also of paramount importance.
Now we show how our main scheme can be adapted to
build upon the existing work to support data dynamics,
including block level operations of modification,
deletion and insertion. We can adopt this technique in
our design to achieve privacy-preserving public risk
auditing with support of data dynamics
SIMPLY ARCHIVES
This problem tries to obtain and verify a proof that the data that
is stored by a user at remote data storage in the cloud (called
cloud storage archives or simply archives) is not modified by the
archive and thereby the integrity of the data is assured. Cloud
archive is not cheating the owner, if cheating, in this context,
means that the storage archive might delete some of the data or
may modify some of the data. While developing proofs for data
possession at untrusted cloud storage servers we are often limited
by the resources at the cloud server as well as at the client.
SENTINELS
In this scheme, unlike in the key-hash approach scheme,
only a single key can be used irrespective of the size of the
file or the number of files whose retrievability it wants to
verify. Also the archive needs to access only a small portion
of the file F unlike in the key-has scheme which required
the archive to process the entire file F for each protocol
verification. If the prover has modified or deleted a
substantial portion of F, then with high probability it will
also have suppressed a number of sentinels.
VERIFICATION PHASE
The verifier before storing the file at the archive,
preprocesses the file and appends some Meta data to the
file and stores at the archive. At the time of verification the
verifier uses this Meta data to verify the integrity of the
data. It is important to note that our proof of data integrity
protocol just checks the integrity of data i.e. if the data has
been illegally modified or deleted. It does not prevent the
archive from modifying the data.
REQUIREMENT SPECIFICATION
Hardware Requirements
System : Pentium IV 2.4 GHz
Hard Disk : 40 GB
Floppy Drive : 1.44 Mb
Monitor : 15 VGA Colour
Mouse : Logitech
Ram : 512 Mb
Software Requirements
Operating system : Windows XP
Technology Used : Microsoft Visual Studio Coding
Language : ASP.NET
Data Base : Microsoft SQL Server
CONCLUSION
Seeing the popularity of outsourcing archival storage to the
cloud, it is desirable to enable clients to verify the integrity of
their data in the cloud.
We design and implement a practical data integrity
protection (DIP) scheme for functional minimum storage
regenerating (FMSR) codes under a multiserver setting.
Our DIP scheme preserves the fault tolerance and repair
traffic saving properties of FMSR. To understand the
practicality of the integration of FMSR and DIP, we analyze
its security strength, evaluate its running time overhead via
testbed experiments, and conduct monetary cost analysis.
