International Journal of Computer Techniques - Volume 2 Issue 2, 2015

RESEARCH ARTICLE

OPEN ACCESS

PROFICIENT APPROACH OF DATA INTEGRITY PROTECTION IN

CLOUD STORAGE USING REGENERATING CODE
1

Karthik N (M.Tech )1,S.Sivamohan2

Department of CSE, 2Department of IT,
SRM University, Ramapuram Campus
Chennai-600089

-------------------------**********************----------------Abstract:
Its not an easy work to strongly preserve all crucial data everywhere it has the need
in countless applications for clients in the cloud server. To reservation of our information in
cloud, it may not be fully honest because client doesnt have duplicate of entire data in the
cloud. Then some authors never tell us data honour over its user and CSP level by assessment
of data earlier and later which is uploaded in cloud. Hence we have to found new projected
system for this by our data analysis protocol algorithm to check the honour of data earlier the
client and later data was inserted in cloud. The highly secured data tested by client earlier and
later with the help of CSP with our actual programmed data analysis protocol from user as
well as cloud equal into the cloud with honesty. Likewise we take planned the multiple server
data assessment algorithm with the control of each updated data will be outsourced before
equal for server repair access point for upcoming data recovery from the, am cloud data
server. Our proposed scheme professionally checks integrity in effective way so that data
integrity as well as safety can be continued in all belongings by seeing disadvantages of
remaining approaches.

-------------------------**********************----------------1. INTRODUCTION
CLOUD server deals an on request data
outsourcing service, and is gaining
popularity due to its bounce and low
maintenance cost. The security alarms rise
when data storage is outsourced to thirdparty cloud storage providers. It is
necessary to enable cloud clients to verify
the honour of their outsourced data, in case
their data have been by chance corrupted
or spitefullydo a deal by Hacker attacks.
One main use of cloud storage is extended
term storage, which represents a data that
is written once and infrequently read.
While the stored data are infrequently
read, it remains necessary to guarantee its
honour for disaster recovery or compliance
with allowedrequests. It is having a huge
amount of backup data, entire file
checking becomes expensive. Proof of
ISSN: 2394-2231

retrieve and proof of data possession have

so been planned to verify the honour of a
big file by spot-checking only a segment
of the file thru various cryptographic.
Assume that we

Fig 1.1. Cloud Computing Steps

Contract out storage the data to the server,

which could be a storage site or a cloud

http://www.ijctjournal.org

Page 36

International Journal of Computer Techniques - Volume 2 Issue 2, 2015

storage earner. If we detect frauds in our

outsourced data (e.g., when a server
crashes or is bargained), then we should
support the data which was corrupted and
restore the original data from the server
and it was retrieved from backup data.
Placing all data in a server if the user
found single failure in a server then
support team will raise the ticket related to
that issue and the problem will be resolved
based
on
the
ticket.An
acceptableclarification is to beline data
across multiple servers.To repair a failed
server, we can read data from the other
ongoing servers.Rebuild the corrupted data
from the server which was failed,
andpulling the data into new server. Proof
of retrieve and proof of proposition are
originally planned for the single-server
case. MR-PDP and HAIL range integrity
checks to a multi-server setting using
duplication
and
deleted
coding,
respectively. In case of low storage space
in the server face with matching issue. The
size show that huge space of system
storage server commonly understanding
disk or sector failures, some of the datas
may be permanently deleted from the
server. For e.g. annualized replacement
rate (ARR) for space in production server
storage systems is around 2% to 4%. May
be the data lost from the cloud server.
2. FMSR Code Implementation
Functional
Minimum
Storage
Regenerating (FMSR) codes in Cloud, on
which our Data Integrity Protection system
is established. FMSR codes fit to
maximum distance separable (MDS)
codes. An MDS code is distinct by the
parameters, where k<n. It encodes a file F
of size jFj into n pieces of size jFj=k
respectively. An MDS code shapes that the
unique file can be rebuilt from any k out of
n pieces that is the total size of data
required.
3. Basic Operations of FMSR-DIP
Codes

ISSN: 2394-2231

Our goal is to augment the basic file

actionsUpload,Copy, and Repair of
NCCloud with the DIP feature. Through
upload, FMSR DIP codes enlarge the code
chunk size by a factor of n0=k0 (due to the
AECC). Through transfer and repair,
FMSR DIP codes preserve the same
transfer bandwidth requirements (with up
to a small constant overhead) when the
stored chunks are notcorrupted. Likewise,
we present an added Check operation,
which confirms the honour of a small part
of the stored chunks by downloading
random rows from the servers and
checking their reliabilities. In the
subsequent, we accept that FMSRDIP
codes operate in units of bytes. we discuss
how we reduce this assumption to trade
security for performance.
4. RSA ALGORITHM
A
digital
signature
scheme
classicallycontains of three algorithms:
A key generation algorithm that selects a
private key regularly at random from a set
of possible private keys.The output of
algorithm and the private key and a
matching public key.A signing algorithm
that, and it will give a message and a
private key, produces a signature. A
signature validating algorithm that, give a
message, public key and aautograph,
alsoreceives or discards the message's
claim to validate.
Two main properties are essential. First,
the genuineness of a signature generated
from a secure message and secure private
key can be verified by using the matching
public key. And then it should be
computationally infeasible to produce a
valid signature for a gathering without
knowing that gathering's private key. A
digital
signature
is
averification
mechanism that permits the creator of
message to attach a code that act as
aautograph. It is produced by taking the
hash of message and encrypting the
message with creator private key.

http://www.ijctjournal.org

Page 37

International Journal of Computer Techniques - Volume 2 Issue 2,, 2015

algorithm or using Fermat's little theorem

ask q-2 mod q
6. VERIFYING

Reject the signature if 0 < r < qqor

0 < s <qq is not satisfied.

Calculate w = s -11 mod q

Calculate u1 = H (m).w mod q

Calculate u2= r . w mod q

Calculate v = ((gu1 y u2) mod p )

mod q

Fig 4.1 Encrypt and Decrypt Process

The signature is valid if v = r

7. CONCLUSION

5. SIGNING
Let H be the hashing function and m is the

There are many welfares of using

message:

cloud calculating such as cost efficiency,

v
k
Generate a random each message value

quick arrangement,, improved convenience

where

r=(gk

etc. However, there are yet many hands-

mod p ) mod q In thisimprobable

improbable case that

onproblems which have to be resolved.

r = 0, start again with a different random

The data privacy as the one. Many

kCalculate s = k -1
1 ( H (m) + xr ) mod q.

researchers

In the improbable case that s = 0, start

minimize the data safety issue in this

again with a different random k

domain with different resolutions that

0 < k <q
q Calculate

The

donated

their

efforts

to

signature is (r, s).

described in this work. A literature survey

The first two steps

ps amount to creating a

of the works in the part of cloud

new each message key value. The modular

computing data security is shown and the

exponentiation

most

results of assessment are presented.. These

computationally exclusive part of the

results point near the fact that most oof

validation operation, and it may be

researchers

calculated earlier than the message hash is

encryption technique to improve the safety

identified. The flexible inverse k-1

k mod q

of data in cloud computing situation

situation.

here

is

the

show

their

attention

in

is the second most luxurious part,

pa and it
strength also be computed before the

REFERENCES

message hash is identified.. It may be

[1] H. Abu-Libdeh,
Libdeh, L. Princehouse, and H.
Weatherspoon, RACS: A Case for Cloud

figured using the extensive Euclidean

ISSN: 2394-2231
2231

http://www.ijctjournal.org

Page 38

International Journal of Computer Techniques - Volume 2 Issue 2, 2015

Storage Diversity, Proc.First ACM Symp.

Cloud Computing (SoCC 10), 2010.
[2] M. Armbrust, A. Fox, R. Griffith, A.D.
Joseph, R. Katz, A. Konwinski, G. Lee, D.
Patterson, A. Rabkin, I. Stoica, and M.
Zaharia, A View of Cloud Computing,
Comm. ACM, vol. 53,no. 4, pp 50-58,
2010.
[3] G. Ateniese, R. Burns, R. Curtmola, J.
Herring, O. Khan, L. Kissner, Z. Peterson,
and D. Song, Remote Data Checking
Using Provable Data Possession, ACM
Trans. Information and System Security,
vol. 14, article 12, May 2011.
[4] K. Bowers, A. Juels, and A. Oprea,
HAIL: A High-Availability and Integrity
Layer for Cloud Storage, Proc. 16th
ACM Conf. Computer and Comm.
Security (CCS 09), 2009.
[5] K. Bowers, A. Juels, and A. Oprea,
Proofs of Retrievability: Theory and
Implementation, Proc. ACM Workshop
Cloud ComputingSecurity (CCSW 09),
2009.

[9] R. Curtmola, O. Khan, and R. Burns,

Robust Remote Data Checking, Proc.
ACM Fourth Intl Workshop Storage
Security and Survivability (StorageSS
08), 2008.
[10] R. Curtmola, O. Khan, R. Burns, and
G. Ateniese, MR-PDP: Multiple-Replica
Provable Data Possession, Proc. IEEE
28th Intl Conf. Distributed Computing
Systems (ICDCS 08), 2008.
[11] A. Dimakis, P. Godfrey, Y. Wu, M.
Wainwright, and K. Ramchandran,
Network Coding for Distributed Storage
Systems,IEEE
Trans.
Information
Theory, vol. 56, no. 9, 4539-4551,
Sept. 2010.
[12] D. Ford, F. Labelle, F.I. Popovici, M.
Stokel, V.-A. Truong, L. Barroso, C.
Grimes, and S. Quinlan, Availability in
Globally Distributed Storage Systems,
Proc. Ninth USENIX Symp. Operating
Systems Design and Implementation
(OSDI 10), Oct. 2010.

[6] B. Chen, R. Curtmola, G. Ateniese, and

R. Burns, Remote Data Checking for
Network
Coding-Based
Distributed
Storage Systems,Proc. ACM Workshop
Cloud Computing Security (CCSW 10),
2010.
[7] H.C.H. Chen and P.P.C. Lee,
Enabling Data Integrity Protection in
Regenerating-Coding-Based
Cloud
Storage, Proc. IEEE 31st Symp. Reliable
Distributed Systems (SRDS 12), 2012.
[8] L. Chen, NIST Special Publication
800-108, Recommendation for Key
Derivation Using Pseudorandom Functions
(Revised),http://csrc.nist.gov/Publications/
nistpubs/800-108/sp800-108.pdf,Oct.
2009.

ISSN: 2394-2231

http://www.ijctjournal.org

Page 39