Indonesi
an
Journa
l
of El
ect
ri
cal Engineer
ing
an
d
Comp
ut
er
Scie
nce
Vo
l.
1
3
,
No.
2
,
Febr
uar
y
201
9
, pp.
626
~
633
IS
S
N: 25
02
-
4752, DO
I: 10
.11
591/ijeecs
.v1
3
.i
2
.pp
626
-
633
626
Journ
al h
om
e
page
:
http:
//
ia
es
core.c
om/j
ourn
als/i
ndex.
ph
p/ij
eecs
Checkin
g integ
rity
of
d
ata and
re
covery i
n the
cloud
environ
ment
Neh
a Na
r
ayan Kulk
arni
,
S
hita
lku
mar
A.
Jain
Depa
rtment
o
f
C
om
pute
r
Engi
n
e
eri
ng,
MIT
Ac
ad
em
y
of
Eng
ine
er
ing,
Mah
ara
shtr
a
,
Indi
a
Art
ic
le
In
f
o
ABSTR
A
CT
Art
ic
le
history:
Re
cei
ved
Ju
n
1
1
, 2
018
Re
vised
N
ov
2
2
, 2
018
Accepte
d
Dec
3
, 2
018
Cloud
computin
g
provid
es
m
an
y
servi
ce
s
to
a
cce
ss
the
m
d
y
n
amic
al
l
y
over
the
int
ern
et
as
p
er
th
e
user
'
s
d
emand.
The
d
at
a
is
g
ro
wing
in
tre
m
end
ous
amount
and
it
should
be
m
ana
ged
cor
re
ctl
y
wher
e
storag
e
servic
e
prov
es
ef
fic
i
ent
.
The
Data
stored
on
line
ca
n
b
e
ha
cked
b
y
th
e
third
p
arty
so
to
sec
ur
e
thi
s
data
ver
if
y
ing
int
egr
ity
is
essent
ial.
Be
ca
use
of th
e hum
an error
or n
at
ur
a
l disast
er
,
the
d
at
a
m
a
y
g
et
d
el
e
te
d
from
the
cl
oud
serv
ers.
Th
ere
for
e,
the
re
is
a
req
uire
m
ent
of
i
m
proving
the
ex
isti
ng
al
gor
it
hm
to
r
ec
ov
er
data
eff
icientl
y
.
Man
y
a
lgori
thms
ar
e
proposed,
bu
t
they
l
ac
k
in
eff
i
ci
en
c
y
,
comput
ational
cos
t
,
and
re
li
ab
il
i
t
y
.
The
proposed
sy
stem
in
th
is
pa
per
is
h
avi
ng
th
e
fe
at
ur
e
of
ver
if
y
ing
data
in
te
grity
using
Id
e
nti
t
y
B
ase
d
R
emote
Da
ta
Inte
gr
ity
Ch
ec
k
ing
and
rec
ov
er
y
usi
ng
the
XO
R
ope
rat
ion
.
W
hen
th
e
data
is
unav
ai
l
abl
e
to
th
e
user,
th
e
propos
ed
s
y
st
em
provi
des
fle
xib
il
i
t
y
fo
r
the
user
to
r
egain
data
from
the
r
emote
serv
e
r.
Ke
yw
or
d
s
:
Cl
oud
se
rv
e
r
Data inte
gri
ty
Data rec
overy
Rem
ote b
ack
up se
rv
e
r
Copyright
©
201
9
Instit
ut
e
o
f Ad
vanc
ed
Engi
n
ee
r
ing
and
S
cienc
e
.
Al
l
rights re
serv
ed
.
Corres
pond
in
g
Aut
h
or
:
Neh
a
N
a
rayan
Ku
l
karni
,
Dep
a
rtm
ent o
f C
om
pu
te
r
E
ng
i
neer
i
ng
,
MIT Ac
adem
y
of E
ng
i
neer
i
ng
,
Pune
,
4121
05, M
ahar
as
htra, I
nd
ia
.
Em
a
il
:
neh
ak
ulk
ar
ni28
1@gm
ai
l.com
1.
INTROD
U
CTION
The
Cl
oud
c
om
pu
ti
ng
is
t
he
nex
t
phase
of
t
he
i
ntern
et
ev
ol
ution
w
hich
w
ou
l
d
pro
vid
e
c
om
pu
ta
ti
on
al
powe
r,
st
or
a
ge
serv
ic
e,
in
fr
ast
ru
ct
ur
e
a
nd
platfor
m
for t
he
use
r t
o
m
ai
ntain
the
data.
T
he c
loud
te
ch
nolo
gy
is
a
te
chnolo
gy
w
hi
ch
has
ev
olv
e
d,
widely
use
d
an
d
m
ov
in
g
a
head
to
pro
vide
the
sto
ra
ge
s
pace
on
li
ne
.
C
loud
com
pu
ti
ng
m
od
el
distrib
utes
ov
e
r
the
virt
ua
li
zed
po
ol
of
s
har
e
d
res
ource
s.
T
he
use
r
ca
n
dem
and
a
s
well
as
release
the
res
ources
as
per
t
he
us
e
a
nd
re
quirem
ent
[1
]
.
Cl
oud
com
pu
ti
ng
br
i
ngs
out
m
any
of
the
be
nef
it
s
to
the
us
e
r.
F
or
e
xam
ple,
1)
Cl
oud
us
e
r
can
re
du
ce
t
he
sto
rage
infr
ast
ru
ct
ur
e
cost.
2)
T
he
cl
oud
us
er
ca
n
r
equ
e
st
serv
ic
e
a
nd
pa
y
as
pe
r
us
e.
3)
T
he
us
er
can
acce
ss
data
c
om
fo
rtably
in
de
pende
nt
of
pl
ace.
T
her
e
a
re
m
an
y
po
te
ntial
serv
i
ces
that
the
cl
oud
pro
vid
es
t
he
use
r,
an
d
th
ey
cou
l
d
be
m
anag
e
d
virtu
al
l
y.
The
c
on
ce
pt
of
t
he
cl
oud
e
vo
l
ve
d from
the f
un
da
m
ental
s o
f
t
he netw
ork.
The
s
er
vices
prov
i
ded
by
the
c
loud
play
s
im
po
rta
nt
r
ole
bec
ause
t
he
m
assive
am
ount
of
da
ta
is
sto
red
on
li
ne
a
nd
m
any
app
li
cat
io
ns
are
dep
l
oyed
on
the
cl
ou
d
pro
vid
in
g
ser
vices
to
t
he
us
er
.
Cl
oud
com
pu
ti
ng
s
erv
ic
e
works
wit
h
s
om
e serv
ic
e m
od
el
s as
f
ollow
:
a)
SaaS
(Soft
ware
as
a
Ser
vice)
:
Cl
oud
m
od
el
t
hat
pro
vid
es
ac
cess
to
t
he
s
oft
war
e
th
rou
gh
t
he
we
b
w
her
ea
s
the user
does
not
ha
s c
on
tr
ol
o
ve
r
t
he
in
fr
ast
ru
ct
ur
e.
E
xam
ple:
G
oogle
D
ocs, M
ic
ro
s
oft
Office
, Dr
opBox.
b)
PaaS
(P
la
tf
orm
as
a
Ser
vice
)
:
T
he
Cl
oud
Ser
vice
P
rovid
er
(CSP
)
pro
vid
es
t
he
neces
s
ary
hardw
a
re
a
nd
platfo
rm
fo
r
t
he
d
e
velo
per
s
[2
]
. Ex
am
ple:
Flexisca
le
, Giz
m
ox.
c)
IaaS
(In
fr
ast
ruct
ur
e
as
a
Se
rvi
ce):
This
m
odel
al
lows
the
use
r
t
o
acce
ss
vi
rtual
a
nd
physi
cal
en
vir
on
m
ent.
The
softwa
re,
app
li
cat
io
n,
op
erati
ng
syst
em
is
m
anag
ea
ble
to
the
us
e
r.
E
xam
ple:
Am
az
on
Web
Se
rv
ic
e,
Ci
sco
cl
oud
ve
rse.
T
he
de
plo
ym
ent
m
od
el
s
for
cl
oud
c
om
pu
ti
ng
are:
1)
P
ub
li
c
cl
ou
d:
Op
e
n
acce
ss
t
o
net
w
ork
pu
blicl
y.
2)
P
rivate
c
loud:
Op
e
n
to
the
a
utho
rized
e
nd
us
ers
.
3)
C
om
m
un
it
y
cl
oud
:
This
cl
oud
is
Evaluation Warning : The document was created with Spire.PDF for Python.
Ind
on
esi
a
n
J
E
le
c Eng &
Co
m
p
Sci
IS
S
N:
25
02
-
4752
Checki
ng inte
gri
ty
o
f d
ata a
nd rec
overy i
n
t
he
cl
ou
d
e
nvir
onme
nt
(
Ne
ha
Nara
y
an K
ulka
rn
i
)
627
acce
ssible
t
o
a
cat
egory
of
the
us
ers
w
ho
sat
is
fies
the
poli
cy
f
or
a
uthorizat
io
n.
4)
Hy
br
id
cl
oud
:
It
i
nt
eg
rates
the
featu
res
of
pu
blic,
pri
vat
e,
c
omm
un
it
y
cl
oud
[
3,
4].
Cl
oud
c
om
pu
ti
ng
pro
vid
es
th
e
pay
-
as
-
pe
r
-
use
serv
ic
e.
The
da
ta
stored
onli
ne
can
be
dam
aged
by
the
na
tural
disaste
r
or
hum
an
m
istak
es.
T
he
re
ar
e
existi
ng
s
olu
ti
on
s
as
well
a
s
the
e
nh
a
ncem
e
nts
a
re
i
n
pro
gress
f
or
the
rec
ov
e
ry
in
natu
ra
l
disaste
rs
,
s
om
e
are
discusse
d
in
the
pap
e
r
[5
]
.
Her
e
,
we
hav
e
discusse
d
the
hum
an
perspecti
ve
a
nd
s
olu
ti
on
f
or
the
rec
ov
e
r
y
of info
rm
ation
because
of
t
he hu
m
an
fa
ults.
T
he
esse
ntial
pa
ram
et
ers
cons
idere
d
for
chec
king
t
he
integ
r
it
y
of
the
da
ta
are
validit
y,
c
onsist
ency,
and
acc
ur
acy
.
The
i
nteg
rity
of
the
sto
re
d
dat
a
can
ge
t
af
fect
ed
beca
us
e
of
m
al
ic
iou
s
at
ta
cks
or
un
c
onsci
ou
s
ness
error
s
of
the
in
div
id
ual.
The
data
integ
rity
is
ve
rified
w
he
n
the
data
own
er
gets
the
pro
of
t
hat
it
s
outs
ource
d
data
is
i
ntact
a
ccur
at
el
y
in
th
e
cl
oud.
Cl
ou
d
ser
vice
pro
vid
er
does
not
pro
vid
e
the
dat
a
integ
rity
che
ckin
g
exp
li
ci
tl
y
f
or
t
he
us
e
rs
[
6].
T
hey
pro
vid
e
M
D5
ta
g
value
,
but
t
his
is
ins
uff
ic
ie
nt
as
the
ta
g
cha
nge
w
hen
the
data
is
m
od
i
fied.
T
he
data
owne
r,
an
organ
iz
at
io
n
nee
ds
t
o
t
ru
s
t
the
t
hir
d
par
t
y
ser
vice
or
te
chnolo
gy
t
o
st
or
e
da
ta
secur
el
y
us
in
g
var
i
ou
s
cl
ou
d
s
erv
ic
es.
Howe
ver,
the
prob
le
m
arises
wh
e
n
the
data
ow
ner
is
una
ble
to
c
on
t
ro
l
or
au
dit
data
st
or
e
d
outsi
de
of
the
tru
ste
d
zo
ne
of
t
he
data
owne
r.
T
his
in
de
pende
nt
se
rv
i
ce
create
s
the
pro
blem
of
data
le
aka
ge
or
losin
g
pr
i
vacy
of
the
ow
ner.
T
he
data
of
t
he
cl
ie
nt
is
al
ways
susc
ep
ti
ble
and
co
nf
i
den
ti
al
wh
ic
h
s
houl
d
no
t
be
disclos
ed
t
o
t
he
unau
thoriz
ed
us
e
rs.
The
re
are
m
a
ny
m
et
h
od
s
pr
opos
e
d
f
or
sec
ur
i
ng
sensiti
ve
data
su
c
h
as
e
nc
ryp
ti
on
of
data
be
fore
uploa
ding
but
this
al
one
is
ins
uffici
ent
t
o
guara
ntee
th
e
data
secur
it
y
[
7].
S
o,
in
the
pro
pose
d
syst
em
apar
t
from
the
data
owne
r,
t
he
cl
oud
serv
e
r
we
ha
ve
involve
d
the
a
dm
in
who
ac
ts
as
a
t
hir
d
-
par
ty
au
di
tor
to
buil
d
tru
st
betwee
n
the
m
.
St
il
l,
there
is
a
possibil
it
y
of
data
le
aka
ge
so
we
hav
e
us
e
d
t
he
m
od
el
of
c
halle
ng
e
an
d
respo
ns
e
for
the
A
dm
in.
Also,
we
hav
e
ad
de
d
the
secu
rity
par
a
m
et
er
to
protect
the
dat
a again
st t
he A
dm
in an
d
t
he
c
loud se
rv
e
r.
The
vo
l
um
e
of
data
in
the
cl
ou
d
is
inc
reasin
g
expo
nen
ti
al
ly
in
str
uctu
red
as
well
as
in
a
n
unstr
uctu
red
way,
a
nd
he
nc
e,
the
re
is
a
ne
ed
f
or
ef
fici
ent
data
rec
overy
from
histor
ic
al
data.
Data
sto
r
ed
in
the
rem
ot
e
data
centers
is
al
s
o
incre
asi
ng
w
hi
ch
can
res
ult
in
seve
re
issu
e
s
relat
ed
to
da
ta
su
ch
as
bre
achin
g
a
nd
dat
a
loss.
Howe
ver,
there
need
t
he
ef
fici
ent
an
d
com
patible
m
et
ho
d
for
the
data
rec
ove
ry
beca
us
e
the
data
m
a
y
get
de
le
te
d
by
the
hu
m
an
error
s
or
m
od
ifie
d
by
the
un
auth
or
iz
e
d
us
e
r
[8,
19]
.
In
th
e
fi
nan
ci
al
w
orl
d,
if
the
ser
ve
r
gets
crash
e
d
or
dat
a
corrupts
the
n
it
directl
y
i
m
p
act
s
causin
g
ec
onom
ic
loss.
Ther
e
a
re
m
any
pro
po
se
d
al
go
r
it
h
m
for
data
recov
ery,
bu
t
they
fail
beca
us
e
of
ine
ff
ic
ie
ncy
and
inc
om
patib
il
it
y.
Her
e
,
w
e
ha
ve
disc
us
s
ed
a
n
al
gorithm
u
sin
g XO
R
operati
on and
bac
kup serv
e
r for
recovery
of the
dat
a.
1.1.
Li
ter
atu
re Sur
vey
We
hav
e
disc
usse
d
var
i
ous
te
chn
i
qu
e
s
f
or
c
he
ckin
g
inte
gr
it
y,
Proof
of
Re
trie
va
bili
ty
,
and
rec
ov
e
ry
of
the
data
i
n
this
sect
io
n
of
li
te
ratur
e
s
urvey.
T
he
cl
ie
nt'
s
data
is
sensiti
ve
s
o,
we
nee
d
to
e
ns
ure
the
sec
uri
ty
of
data.
It
is
c
ru
ci
al
to
ver
ify
acc
ess
co
ntr
ol
for
m
anag
in
g t
he
data.
T
he
re
is
var
i
ou
s
acce
ss
con
t
ro
ls
su
c
h
a
s
Use
r
-
Ba
sed,
R
ole
-
B
ased,
a
nd
Attr
ibu
te
-
Ba
se
d.
T
he
syst
em
con
ta
ins
the
rec
or
d
o
f
the
us
e
r
with
their
al
lo
cat
ed
per
m
issi
on
a
nd
a
uthorizat
io
n
to
m
anag
e
data
in
t
he
U
ser
-
Ba
se
d
c
on
trol.
In
Role
-
Ba
sed,
t
he
use
rs
are
cat
egorized
us
ing
t
heir
assig
ne
d
r
oles.
I
n
Attrib
ute
Ba
sed
th
e
acce
ss
poli
cy
is
def
ine
d
an
d
the
us
e
r
obey
in
g
the
po
li
cy
can
m
anag
e the
d
at
a
.
The
a
uthor
of
the
pa
pe
r
[
9
]
ha
s
disc
us
se
d
th
e
RSA
base
d
ha
sh
a
nd
RS
A
base
d
ta
g.
RS
A
al
go
rithm
works
by
par
ti
t
ion
in
g
the
data
into
t
he
bloc
ks
and
gen
e
rati
ng
the
pro
of
.
T
he
auth
or
has
al
s
o
disc
us
se
d
the
MD5
al
gorithm
.
The
MD
5
functi
on
pro
duc
es
t
he
m
essage
dig
est
w
hen
the
com
pacted
file
is
pro
vid
e
d
a
s
in
pu
t
to
the
functi
on.
T
he
pro
du
ce
d
outp
ut
is
co
de
d
a
nd
a
dded
t
o
t
he
or
i
gin
al
file
.
T
his
a
ppen
de
d
f
il
e
is
use
d
by
MD5
t
o
pro
du
ce
a
hash of the
f
il
e. T
he
co
m
par
iso
n o
f
the
av
ai
la
ble
record
and t
he
gen
e
rated
h
as
h i
s un
der
ta
ke
n.
The
e
nc
ryptio
n
al
gorithm
MAC
giv
e
s
m
essage
aut
hen
ti
cat
io
n
t
o
c
heck
inte
gr
it
y.
M
AC
acc
epts
var
i
ous
siz
e
blo
c
ks
a
nd
a
crypt
ographi
c
key
w
hich
he
lps
in
ge
ner
at
in
g
the
a
uth
e
ntic
at
ed
co
de.
The
owne
r
posses
s
es
the
secret key a
nd
m
essage which
is u
se
d
t
o veri
fy the i
ntegr
it
y
.
In
pa
per
[
10
]
,
t
he
a
uthor
ha
s
s
how
n
the
c
on
tr
ibu
ti
on
t
o
I
D
-
CDIC
w
hich
ad
dresses
t
he
key
m
anag
em
ent
issue
an
d
c
omplex
ce
rtific
at
e
m
anag
em
ent.
The
a
uthor
propose
d
the
pro
tocol
ba
sed
on
RSA
sig
natu
r
e
an
d
su
pp
or
te
d
var
i
able siz
e file
bl
ock an
d p
ub
li
c
aud
it
in
g.
The
pa
pe
r
[
11
]
discuss
e
s
the
ID
-
D
PDP
prot
oco
l.
T
he
a
uthor
has
co
ntri
bute
d
to
the
I
D
-
DPDP
w
hic
h
ver
ifie
s
the
data
integ
rity
wit
hout
retrievi
ng
the
w
hole
file
.
T
his
prot
oco
l
el
i
m
inate
d
the
com
plex
ce
rtific
at
e
m
anag
em
ent an
d su
pport
ed
m
ul
ti
-
cl
ou
d sc
enar
i
o.
It uses
BLS sig
natu
re
schem
e fo
r
sec
ur
it
y.
The
a
uthor
of
t
he
pa
pe
r
[
1
2
]
pro
vid
es
detai
l
stud
y
of
the
ID
-
PU
IC
sc
hem
e.
ID
-
P
UI
C
ver
ifi
es
wh
et
her
the d
at
a is
uplo
aded an
d
i
ntact
correctl
y. It
w
orks wit
h
t
he h
ard c
ode
of D
i
f
fie Hell
m
an
an
d bil
inear
pairi
ng.
In
pa
per
[
1
3
]
the
a
uthor
ha
s
s
how
n
the
im
pl
e
m
entat
ion
of
t
he
P
r
oof
of
St
or
a
ge.
P
OS
is
t
he
powe
rful
crypto
gr
a
phic
m
et
ho
d
f
or
outsource
d
data.
Existi
ng
P
OS
work
with
sin
gl
e
us
er
en
vir
onm
ent
.
The
a
uthor
ha
s
introd
uced
ne
w
featu
res
dedup
li
cat
io
n
for
the
cr
os
s
-
us
e
r
us
in
g
H
om
o
m
orp
hic
Au
t
hen
t
ic
at
ion
T
ree
it
so
lve
s
pr
i
vate k
ey
ge
ner
at
io
n pro
ble
m
.
Evaluation Warning : The document was created with Spire.PDF for Python.
IS
S
N
:
2502
-
4752
Ind
on
esi
a
n
J
E
le
c Eng &
Co
m
p
Sci,
Vo
l.
1
3
, N
o.
2
,
Fe
bru
ary
201
9
:
6
26
–
633
628
The
pa
per
[1
4
]
pro
vid
es
the
detai
le
d
stu
dy
of
t
he
Re
m
ote
Data
P
os
sessi
on
te
ch
nique.
This
m
et
ho
d
ver
ifie
s
the
pr
i
vacy o
f
t
he
a
uth
entic
at
or
for
t
he
cl
ou
d.
It s
uppo
rts b
l
ock
-
le
ss v
e
rificat
io
ns.
In
pa
per
[
1
5
]
t
he
auth
or
ha
s
discuss
e
d
the
EC
AL
m
et
ho
d.
T
hi
s
m
et
ho
d
is
a
dy
nam
ic
PO
R
w
hich
st
or
e
s
encode
d
lo
g, a
nd these
lo
gs
a
re
garbled,
to s
ecur
e
them
f
rom
the ser
v
er
.
In
pa
pe
r
[1
6
]
the
a
uthor
ha
s
sho
wn
the
c
ontrib
utio
n
t
o
t
he
Me
ssa
ge
L
ock
P
OR.
It
a
ddresses
the
pro
blem
of
dat
a
retrieva
bili
ty
and
the
c
ross
-
use
r
dedu
plica
tio
n.
T
he a
uthor
has
pro
po
se
d s
om
e m
od
ific
at
i
on
i
n
the ex
ist
in
g P
OR whic
h
la
ck
the
dedu
plica
ti
on
.
In
pa
per
[
1
7
]
the
aut
hor
has
pro
vid
e
d
the
discuss
i
on
of
diff
e
re
nt
m
et
h
od
s
relat
ed
t
o
the
Pro
of
of
Re
trie
vab
il
it
y. The
Ba
sic
Stat
ic
m
et
ho
d
enc
r
ypts
fe
w
bits
of d
at
a,
so
st
or
a
ge
re
du
ces
w
hi
ch
m
ini
m
iz
e
the
loa
d
on
the
cl
ie
nt.
T
his
sc
hem
e
reduces
t
he
pro
of si
ze
an
d
netw
ork
ba
ndwi
dth
ut
il
iz
ation
. I
t
li
m
it
s
the
capaci
ty
and
com
pu
ta
ti
on
al
ov
e
r
head
on
t
he
ser
ve
r
a
s
wel
l
as
t
he
cl
ie
nt
s
ide.
Hi
gh
Av
ai
la
bili
ty
and
I
nt
egr
it
y
Lay
er
(
HAIL)
checks
co
rr
ect
ness
a
nd
p
r
ovides
hi
gh
a
vaila
bili
ty
of
stora
ge
.
It
av
oid
s
the
serv
e
r
re
dund
ancy.
Th
e
ve
rif
ic
at
ion
of the
file
is d
e
pende
nt on
t
he verifie
r who i
nt
eracts wit
h
t
he
server
.
The
pa
pe
r
[
1
8
]
,
desc
ribes
different
al
gorith
m
s
dev
el
oped
f
or
r
eco
ver
y of
the
data
su
c
h
a
s
Cold
bac
k
-
up,
H
ot
back
-
up,
PC
S,
HSDRT,
Lin
ux
Bo
x,
ERGO
T.
Com
par
i
ng
PCS
with
the
oth
e
r
m
eth
ods,
we
ca
n
obser
ve
that
PCS
is
m
anag
ea
ble,
facil
e
an
d
reli
able
f
or
rec
overy.
P
CS
is
e
xec
uted
de
pe
nd
i
ng
on
cong
ru
e
nce
ser
vice.
HSDRT
is
us
e
f
ul
f
or
the
m
ob
il
e
cl
ie
nt.
T
his
m
et
hod
needs
e
xc
essive
e
xec
ution
co
st.
T
his
sc
hem
e
is
no
t
resist
ant
to
duplica
ti
on
of
t
he
data
.
A
nothe
r
m
et
ho
d
i
s
the
Ef
fici
ent
Rou
ti
ng
Groun
ded
on
Ta
xono
m
y
(ERGO
T
).
The
execu
ti
on
of
E
RGOT
is
bas
ed
on
a
gram
m
a
tical
eval
uation.
ERGO
T
e
xec
ut
e
on
the
ba
sis
of
se
rv
ic
e
il
lustrati
on
and
in
vocat
ion
f
or
data
retrie
val
[
1
9
]
.
Li
nux
B
ox
m
od
el
pro
vid
es
the
sim
ple
back
up
m
et
ho
d
an
d
l
ow
-
c
os
t
i
m
ple
m
entat
io
n.
It
pro
vid
es
the
e
ff
ic
ie
ncy
f
or
m
igrati
on
of
the
cl
ie
nt
f
ro
m
one
cl
oud
to
ot
her.
Wh
e
n
the
stora
ge
request
to
syn
c
an
d
backu
p
i
t
works
f
or
f
ul
l
stora
ge
rat
he
r
tha
n
the
sin
gl
e
file
this
is
the
dr
a
wb
ac
k
of
this
m
et
ho
d.
The
e
xecu
ti
on
of
t
he
c
old
ba
ckup
str
at
egy
sta
rts
if
the
f
un
ct
io
ning
of
t
he
syst
em
is
c
eased.
If
t
he
syst
e
m
is
op
er
at
ing
c
orrectl
y,
this
al
go
rith
m
is
no
t
e
xecut
ed.
T
he
Ho
t
ba
ckup
al
gorith
m
wo
rk
s
i
n
a
n
act
ive
netw
or
k usin
g a su
bs
ti
tuti
on poli
cy
an
d u
nc
onstrai
ne
d p
ro
ce
dure
for
a
servi
ce co
nf
i
gurati
on.
In
pa
per
[
20]
,
the
a
uthor
has
im
pr
ov
e
d
the
operati
onal
c
omplexit
y
us
i
ng
E
ff
ic
ie
nt
i
ntegr
it
y
ver
ific
at
i
on
schem
e
(EIVS
)
an
d
Safety
i
nt
egr
it
y verificat
ion
sch
em
e
(S
I
VS
)
. T
hese
sc
hem
es
are buil
t
us
in
g
t
he
c
onc
ept o
f
Schnorr
Sig
nat
ur
e
. T
his
propo
sed
m
od
el
r
e
du
ces the c
os
t a
nd the
co
m
plexi
ty
.
1.2.
Contrib
ut
ion
of
ou
r
work
The
s
umm
ary
of co
ntributi
on
s in
t
his p
a
pe
r
i
s as foll
ow:
a)
We
ha
ve
pr
opose
d
a
syst
e
m
by
integ
rati
ng
fe
at
ur
e
of
ve
rifyi
ng
th
e
i
nteg
rity
of
the
data
us
i
ng
ID
-
RD
IC
a
nd
pro
po
se
d
t
he
al
gorithm
f
or r
ec
ov
e
ry
of
t
he da
ta
u
sin
g X
OR
op
e
rati
on
on th
e cloud.
b)
We
pro
ve
t
he
i
ncr
ease
d
sec
uri
ty
fo
r
the
ou
ts
ource
d
data
in
the
cl
ou
d,
an
d
the
data
ca
n
be
retrie
ved
in
th
e
or
i
gin
al
f
orm
at.
c)
We
hav
e
al
so
us
e
d
Ell
ipti
ca
l
Curve
Digital
Sign
at
ur
e
Al
gorithm
con
si
der
i
ng
the
sec
ur
it
y
pe
rs
pecti
ve
towa
rd
s
d
at
a
stora
ge.
d)
We s
how
that t
his syste
m
is eff
ic
ie
nt,
sec
ur
e
and pract
ic
al
to
im
ple
m
ent.
2.
PROP
OSE
D SYSTE
M
The
pro
posed
syst
e
m
is
i
m
pl
e
m
ented
with
the
hardware
s
pecifica
ti
ons
s
uch
as
Co
rei3
Process
or
,
100GB
Ha
r
d
D
isk,
4G
B
RAM
an
d
the
softwa
re
s
pecifica
ti
on
c
onfig
ur
at
io
n
re
quire
d
a
re
W
i
ndows
7,
J
DK1.8,
My
SQ
L, a
nd
Ap
ac
he Tom
cat
8
.
The
a
ppr
oac
h
of
t
he
existi
ng
m
od
el
is
co
nsi
der
e
d
f
or
c
he
ckin
g
the
i
nteg
rity
of
the
data
and
in
the
pro
po
se
d
syst
e
m
we
ha
ve
c
ontrib
uted
by
a
ddin
g
the
secu
rity
par
am
et
er
fo
r
c
hec
king
int
egr
it
y
al
so
a
dded
the
featur
e
of r
ec
overy with
t
he
l
og
m
ai
ntenan
c
e
in
th
e
syst
em
.
T
he
sig
nifica
nt
co
ntri
bu
ti
on
relat
ed
t
o
this
pro
j
ect
is
a
recovery
of
data
an
d
ve
rifyi
ng
the
int
egr
it
y.
T
he
int
egr
it
y
is
ver
i
fied
usi
ng
the
R
e
m
ote
Data
I
nt
egr
it
y
Checki
ng
us
i
ng
Ell
ipti
cal
Curv
e
C
rypto
gr
a
ph
y.
The
data
recovery
wor
ks
with
the
ce
nt
ral
cl
oud
se
rv
e
r
an
d
rem
ote
back
up
serv
e
r
if
s
ome
data
is
tam
per
ed
.
Re
co
very
is
execu
te
d
us
in
g
the
XOR
op
e
rati
on
al
ong
with
has
hing
f
or
se
cur
it
y
f
unct
ion.
T
he
syst
em
c
on
sist
s
of
five
diff
e
re
nt
net
w
ork
e
ntit
ie
s
kn
own
a
s
Data
Owner,
User,
Ad
m
in,
Ce
ntral
Cl
ou
d
Ser
ver
,
a
nd
Ba
ckup
Cl
oud
Se
rv
e
r.
Ce
ntral
Cl
oud
se
r
ver
sto
res
t
he
ou
ts
our
ced
data
of
the
cl
ie
nt.
Ba
ckup
ser
ve
r
sto
res
the
rep
l
ic
a
of
the
file
m
ai
ntained
on
the
se
r
ver
.
Dat
a
Owner
ca
n
operate
us
in
g t
he
funct
ion
to
uploa
d,
m
od
ify
, del
et
e,
dow
nl
oad
a
file
an
d
view
the
log
s
. T
he
us
e
r
can
perf
or
m
only
the
op
e
rati
o
n
of
dow
nlo
a
ding
a
f
il
e.
A
dm
in
ro
l
e
is
to
act
as
a
ud
it
or
t
o
c
omm
un
ic
at
e
with
the
se
rv
e
r.
Dat
a
ow
ner
up
l
oads
the
fil
e
on
t
he
Cl
oud
at
the
sam
e
tim
e
file
is
stored
on
the
bac
ku
p
ser
ve
r
al
so
.
The
up
l
oad
e
d
data
is
encr
y
pted
usi
ng
t
he
X
OR
op
erati
on
a
nd
st
ored
a
s
a
n
ar
ray.
Data
owne
r
r
equ
e
st
the
A
dm
in
to
ve
rify
the
Data
In
te
gr
it
y
for
th
e
file
.
Ad
m
in
then
pro
du
ce
s
a
chall
eng
e
a
nd
sen
d
it
to
the
serv
e
r.
T
he
integ
rity
pr
oof
is
produc
e
d
Evaluation Warning : The document was created with Spire.PDF for Python.
Ind
on
esi
a
n
J
E
le
c Eng &
Co
m
p
Sci
IS
S
N:
25
02
-
4752
Checki
ng inte
gri
ty
o
f d
ata a
nd rec
overy i
n
t
he
cl
ou
d
e
nvir
onme
nt
(
Ne
ha
Nara
y
an K
ulka
rn
i
)
629
by the se
r
ver
a
nd sen
t t
o
the
Ad
m
in. Whe
n t
he
A
dm
in g
et
s
the ac
knowle
dgm
ent, the
A
dm
in v
erifies
th
e p
r
oof
to
ack
nowle
dg
e
the
data
own
er
with
the
sta
tus
of
the
data.
The
data
owne
r
recei
ves
a
sta
tus
wh
et
her
th
e
data
integrity
is
veri
fied
or
fail
ed.
Wh
e
n
t
he
data
owne
r
trie
s
t
o
m
od
ify
the
file
the
data
owne
r
recei
ves
a
se
cur
it
y
qu
e
sti
on
w
hich
is
store
d
by
t
he
owne
r
w
hile
ou
ts
ourcin
g
t
he
file
.
I
f
t
he
a
nswer
m
at
ches,
the
ow
ner
can
m
od
ify
el
se
data
owne
r
is
not
able
to
m
od
ify
.
Wh
e
n
the
us
er
want
s
to
dow
nlo
a
d
a
file
,
the
us
e
r
has
a
sea
rch
op
ti
on
wh
e
re
the
us
er
can
searc
h
usi
ng
t
he
ta
gs
a
nd
re
quest
the
da
ta
owner
for
th
e
file
acce
ss.
Wh
e
n
the
data
owne
r
receives
a
r
e
quest
fro
m
the
use
r, t
he
ow
ner h
as a
uthority
to
acce
pt
or
den
y
the access
. If
t
he o
wn
e
r
af
fir
m
s the
request,
t
he
n
t
he
us
er
ca
n
down
l
oad
the
file
from
the
cl
ou
d
se
rv
e
r.
I
f
the
file
c
orr
up
ts
or
get
m
od
ifie
s
t
hen
the
data
inte
gr
it
y
f
ai
ls,
so
there
w
e
ha
ve
im
ple
m
ented
t
he
al
gor
it
h
m
for
the
da
ta
recove
ry.
At
the
i
niti
al
sta
ge,
w
e
hav
e
m
et
adata
store
d
in
t
he
fi
le
us
in
g
the
X
OR
oper
at
ion
s
o
f
ro
m
the
rem
ote
bac
kup
ser
ver
we
ca
n
fetch
th
e
fil
e
an
d
cr
os
s
XO
R
to
retai
n
the
or
i
gin
al
file
.
F
or
e
ver
y
ac
ti
on
i
n
t
he
syst
e
m
,
we
m
ai
nta
in
the
lo
gs.
T
he
data
owne
r
an
d
the
us
er
ha
ve
aut
hority
to
vie
w
the
lo
gs
.
T
he
A
dm
in
has
the
a
uthority
to
vie
w
the
lo
gs.
E
ve
n
the
Ad
m
in
can
vie
w
the
re
gistere
d
us
er
with
t
he
ir
r
ole
in
t
he
syst
e
m
.
Fig
ure
1.
ex
plains
t
he
flo
w
of
pro
pose
d
fr
am
ewo
r
k.
Figure
1.
Propo
sed
F
ram
ewo
r
k
3.
RESEA
R
CH MET
HO
D
3.1.
Ide
nt
i
ty
Based
Rem
ot
e
Data I
nt
e
grit
y Checkin
g
The
I
D
-
RD
IC
schem
e
enab
le
s
the
cl
ie
nt
to
c
heck
t
hat
the dat
a
is
cor
rectl
y
intac
t
with
the
serv
e
r.
T
he
existi
ng
al
gorithm
s
hav
e
c
ompli
cat
ed
key
m
anag
em
ent
pro
cedure
wh
e
rea
s
ID
-
RD
IC
m
ini
m
iz
es
the
com
plexity
and
th
e
key
m
ai
ntenance
c
ost
by
us
i
ng
t
he
ho
m
om
or
ph
ic
key
m
od
el
.
I
D
-
RDIC
int
rod
uc
ed
t
he
co
nce
pt
of
t
he
trusted
au
dito
r
to
inc
lu
de
t
he
sk
il
lful
obj
ect
who
ca
n
c
hec
k
the
i
nteg
rity
.
Once
the
data
is
outso
ur
ce
d
to
the
serv
e
r,
us
i
ng
S
et
up
al
gorithm
gen
e
rates
t
he
ke
ys.
Usi
ng
the
pr
i
vate
key
a
nd
the
cl
ie
nt
i
d
w
e
extract
t
he
fe
at
ur
es
of
the
file
[
21
]
.
In
ta
g
gen
e
ra
ti
on
al
gorithm
,
the
pr
e
-
proce
ssing
op
e
rati
ons
are
exe
cute
d
us
i
ng
to
ke
nizat
ion
con
ce
pt
a
nd
ca
lc
ulate
te
rm
fr
equ
e
ncy
f
or
th
e
file
an
d
sto
re
it
in
the
data
ba
se.
T
he
A
dm
i
n
se
nd
s
a
chall
eng
e
with
th
e
file
na
m
e
and
the
cl
i
ent
ide
ntit
y
if
the
data
owner
request
for
t
he
integrity
ve
rif
i
cat
ion
.
As
the
cl
oud
serv
e
r recei
ves
a c
halle
ng
e
fr
om
the TPA, it
g
e
ner
at
es
the
pro
of
us
i
ng the
cli
ent id, c
halle
ng
e
, fi
le
and t
he
ta
g.
This
pro
of
gets
f
orwarde
d
t
o
t
he
T
PA
for
ve
rificat
ion.
Wh
e
n
T
PA
r
ecei
ve
s
the
pr
oof,
it
us
es
pro
of,
cl
ie
nt
id
,
chall
enge
,
file
to
ve
rify
the p
r
oof.
I
f
t
he
proof
ve
rifies,
t
hen
the
TP
A
se
nd
s
the
res
pons
e
t
o
the
ow
ner
w
it
h
th
e
data inte
gr
it
y s
ta
tus.
Proced
ure f
or
ID
-
R
DI
C:
Inpu
t:
Fil
e "F
" is u
plo
a
de
d
t
o
the
Cl
oud ser
ver
Out
p
ut:
Data
In
te
gr
it
y St
at
us
Proced
ure:
Step
1: G
e
ne
ra
t
e k
ey
p
ai
r
a
nd Setu
p
c
urve
pa
ram
et
ers
Step
2: G
e
ne
ra
te
tags
by r
ea
di
ng the
file
Step
3: G
e
ne
ra
te
the pr
oof for
the
file
Step
4: V
e
rify
the pr
oof
sta
tu
s
Step
5: Se
nd th
e pro
of v
e
rific
at
ion
stat
us t
o t
he data
ow
ner
Evaluation Warning : The document was created with Spire.PDF for Python.
IS
S
N
:
2502
-
4752
Ind
on
esi
a
n
J
E
le
c Eng &
Co
m
p
Sci,
Vo
l.
1
3
, N
o.
2
,
Fe
bru
ary
201
9
:
6
26
–
633
630
3.2.
El
li
pt
ic
al
Cu
r
ve Digi
ta
l
Signature
Al
go
ri
th
m
(EC
D
SA
)
The
sec
ur
it
y
of
the
data
rem
ai
ns
una
ff
ect
e
d
by
ECDS
A,
bu
t
it
produc
es
the
dig
it
al
sign
at
ure
a
nd
ver
ifie
s
the
sig
natu
re.
ECDS
A
is dif
fer
e
nt fro
m
AES
an
d ano
t
her
al
gorit
hm
as
it
do
e
s not
e
ncr
ypt
the
d
at
a b
ut
it
pr
ov
ides
the
secur
it
y,
or
it
protect
s
the
da
ta
by
m
aking
su
re
w
hether
th
e
data
ta
m
per
.
The
dig
it
al
sig
natu
re
ver
ific
at
io
n
in
ECDS
A
is
done
us
in
g
the
publ
ic
key,
so
it
is
safe
an
d
sec
ur
e
.
The
public
ke
y
do
es
no
t
pro
duc
e
the
pri
vate
key
.
ECD
SA
use
s
160
bits
t
o
m
ake
it
m
or
e
sec
ur
e
[
22
]
.
ECD
SA
us
es
S
HA
-
1
c
rypto
grap
hi
c
has
h
functi
on
to
ge
ne
rate
a
has
h
for
the
st
or
e
d
file
wh
ic
h
is
20
byte
s.
EC
DSA
use
s
the
has
h
val
ue
of
the
file
to
sig
n.
SHA
-
1
is
the
r
andom
al
go
rit
hm
wh
ic
h
has
ver
y
le
ss
c
ha
nc
e
of
has
h
c
olli
sion
.
For
E
C
DSA,
NIST
(
Nati
on
al
In
sti
tute
of
Stand
a
r
ds
a
nd
Tec
hnology)
a
nd
S
ECG
(
Stan
dard
s
of
Ef
fici
ent
C
rypto
gr
a
phic
G
rou
p)
has
sta
te
d
th
e
sta
nd
a
rd
c
urve
par
am
et
ers whi
ch a
re
m
or
e
se
cur
e
a
nd
ef
fici
ent.
T
he se
c
ur
i
ty
pr
ovide
d
by
ECDS
A f
or
ke
y
siz
e
160
bits
is
sim
il
ar
to
the
RS
A
with
key
siz
e
1024
bits.
T
hu
s
ECD
SA
is
prefe
rr
e
d.
ECDS
A
sec
ur
it
y
li
es
wit
h
the tra
p door p
rinciple as
w
e
can
us
e
only
th
e point
of ad
diti
on
a
nd m
ulti
plica
ti
on
.
Proced
ure f
or
ECDSA
:
Inpu
t:
Fil
e sto
red o
n
t
he
Cl
oud ‘F
.'
Out
p
ut:
Ver
i
ficat
ion
of t
he di
gital
sign
at
ur
e
and d
at
a i
nteg
r
it
y.
Proced
ure:
Step
1: Usi
ng t
he NIST a
nd S
ECG
def
i
ned e
qu
at
io
n
t
he
sys
tem
d
raw t
he
c
urve.
Step
2: T
he po
i
nt ly
ing
on th
e
curve is
sel
ect
ed refe
rr
e
d
as
"
Po
int
of
Or
igi
n"
‘
G
.'
Step
3: G
e
ne
ra
te
a r
a
ndom
n
um
ber
r
efer
re
d as
pri
vate
key ‘
A.
'
Step
4: Usi
ng t
he po
i
nt of
or
i
gin
a
nd
pr
i
vate k
ey
, t
he publi
c k
ey
is
ge
ner
a
te
d
‘
Q.
Step
5: G
e
ne
ra
te
d
igit
al
sig
na
ture usin
g has
h value
of t
he
fil
e ‘
H'
an
d t
he p
rivate
key ‘
A.
'
Step
6: V
e
rify
the d
i
gital
signat
ur
e
us
in
g ‘S'
and the
public
key ‘
Q.
'
If
t
he
c
oor
din
a
te
s o
f
P
a
nd R
m
at
ch
then
the
dig
it
al
sig
natu
r
e is ve
rified
.
3.3.
Pr
opose
d A
l
go
ri
th
m
We h
a
ve
pro
posed
a
n
al
gorith
m
fo
r
data
rec
overy.
Ma
ny
al
gorithm
s
are d
e
velo
ped b
ut som
e
of
them
la
ck
the
feat
ur
e
of
acc
ur
acy
,
c
os
t
-
ben
e
fit,
an
d
c
om
patibil
it
y.
In
t
he
pro
pos
ed
al
gorithm
we
hav
e
c
onside
red
th
e
accuracy
a
nd
c
os
t
ben
e
fici
al
m
od
el
for
the
us
er
.
T
he
entit
ie
s
involve
d
in
the
pro
posed
al
gorithm
are
Cl
oud
stora
ge,
Ba
c
kup
ser
ver,
an
d
t
he
cl
ie
nt.
T
he
pro
po
se
d
al
go
r
it
h
m
enh
ance
s
the
data
pri
va
cy
fo
r
t
he
rem
otely
store
d
data.
H
ere,
we
ha
ve
use
d
XO
R
ope
r
at
ion
on
the
da
ta
and
a
rand
om
var
ia
ble
w
hich
gets
st
or
e
d
in
an
encr
y
pted
a
rr
a
y patt
ern.
Proced
ure f
or
t
he
pr
oposed
algorithm
:
Inpu
t:
Fil
e “F
” is u
plo
a
de
d
a
t C
loud sto
ra
ge
“cs."
Out
p
ut:
If
t
he se
rv
e
rs
c
ras
hes
or f
il
e "F”
is
de
le
te
d
the
n
rec
ov
e
r
t
he
file
“
F
."
Proced
ure:
Step
1: Assi
gn
the cli
ent id
“cli
ent_id"
t
o
th
e
data ow
ner
Step
2: P
rod
uc
e a v
al
ue
“s”
for ea
ch
u
se
r
s =m
’
XO
R cl
i
ent_id
Stor
e
this at
re
m
ote serv
er “
rs
."
Step
3: If the
user
m
od
ifie
s th
e file
"F” T
he
n we
nee
d
to
s
om
e
m
et
adata fil
e “f1."
f1
=
h1 XOR si
Stor
e
this
f1 at
bo
t
h
se
rv
e
rs
i
n i
nteger ar
ray p
at
te
rn
Step
4: IF the
fi
le
“F" d
el
et
es
from
"cs” Th
e
n for
recovery
of f
il
e “F” is
as
:
h1
=
f
1
X
OR si
Re
turn this
h1
to searc
h
t
he
file
F
Dow
nlo
a
d
the
requested
d
at
a
to the clie
nt fra
m
e
4.
RES
ULTS
A
NA
L
YS
I
S
The
f
ollow
i
ng
resu
lt
s
a
re
de
rived
f
r
om
the
pro
posed
syst
e
m
fo
r
var
i
ou
s
f
il
es
for
t
he
res
ult
analy
sis.
The
res
ults
ar
e
de
rive
d
by
te
sti
ng
t
he
pro
po
s
ed
syst
em
for
diff
e
re
nt
fi
le
s
rangin
g
from
7K
B
a
nd
furthe
r.
Fig
ure
2
.
s
ho
ws
t
he
pro
pos
ed
syst
e
m
res
ults
of
ti
m
e
req
ui
red
f
or
ta
g
ge
ner
at
io
n
and
dig
it
al
si
gn
at
ur
e
ver
ific
at
io
n.
T
ag
ge
ner
at
io
n
t
i
m
e
and
sig
nat
ur
e
ve
rificat
io
n
ti
m
e
increase
s
acco
r
ding
t
o
the
file
siz
e.
Fig
ure
3
sh
ows
t
he
pr
opose
d
syst
em
resu
lt
s
of
tim
e
req
ui
red
for
data
integrity
ve
rificat
ion
a
nd
file
recovery
ti
m
e.
W
e
can i
nfer
that t
i
m
e fo
r
d
at
a i
nt
egr
it
y ve
rificat
ion
is
m
ini
m
al
com
par
ed
t
o
th
e file
size.
Evaluation Warning : The document was created with Spire.PDF for Python.
Ind
on
esi
a
n
J
E
le
c Eng &
Co
m
p
Sci
IS
S
N:
25
02
-
4752
Checki
ng inte
gri
ty
o
f d
ata a
nd rec
overy i
n
t
he
cl
ou
d
e
nvir
onme
nt
(
Ne
ha
Nara
y
an K
ulka
rn
i
)
631
Fig
ure
2.
Tim
e
r
e
qu
ire
d f
or
ta
g gen
e
rati
on a
nd sig
natu
re
ve
rificat
ion
Fig
ure
3.
Tim
e
r
e
qu
ire
d f
or
da
ta
integr
it
y an
d fil
e recove
ry
Figure
4
dem
on
strat
es
t
he
c
om
par
ison
of
e
xi
sti
ng
syst
em
and
pr
opos
e
d
sy
stem
resu
lt
s.
From
al
l
abo
ve
resu
lt
s
we
ca
n
ob
s
er
ve
that
t
he
tim
e
req
uire
d
f
or
the
ta
g
ge
ner
at
io
n
dif
fe
r
with
the
c
ha
nge
in
t
he
te
xt
pa
tt
ern
con
te
nt
of
the
f
il
e
and
the
a
verage
le
ngth
of
t
he w
ord a
nd
t
he
sentence
. T
im
e
req
uire
d
for c
halle
nge
para
m
et
er
dep
e
nds
on
t
he
sam
e
par
a
m
et
ers
of
the
file
.
Pro
of
Gene
rati
on
a
nd
P
roof
Ver
i
ficat
ion
execu
te
s
by
dig
it
al
sign
at
ur
e g
e
ne
rati
on
a
nd v
eri
ficat
ion
w
it
h
re
sp
ect
to
t
he
fil
e. W
e
ca
n
see
the
ti
m
e
cost
req
ui
red
for
p
r
oc
essing
ov
e
r 1 MB
file
is re
du
ce
d w
hich
c
on
t
rib
utes
to inc
rease t
he per
form
ance
of the syst
em
.
Fig
ure
4.
Com
par
is
on of
Tim
e re
qu
ire
d f
or
1MB t
ext
file
in
e
xisti
ng and
pro
po
se
d
syst
e
m
0
0
.
0
5
0
.
1
0
.
1
5
0
.
2
0
.
2
5
0
.
3
0
.
3
5
0
.
4
0
.
4
5
0
.
5
9
K
B
1
4
K
B
2
0
K
B
3
5
K
B
j
av
a
.txt
n
et
.t
x
t
p
y
t
h
o
n
.txt
c.t
x
t
Ti
m
e require
d
i
n
Seco
nd
F
i
l
e
na
m
e and s
i
ze
T
ag
G
en
er
at
i
o
n
D
i
g
i
t
al
Sign
at
u
re
V
eri
fi
c
at
i
o
n
0
0
.2
0
.4
0
.6
0
.8
1
9
KB
1
4
K
B
2
0
K
B
3
5
K
B
jav
a.t
x
t
n
et.txt
p
y
th
o
n
.
tx
t
c.
tx
t
Tim
e
required
in
Seco
nd
File
na
m
e
a
nd siz
e
D
ata Int
eg
r
ity
Ver
fif
icatio
n
Reco
v
er
File
T
ag
G
en
erat
i
o
n
Ch
al
l
en
g
e
Pro
o
f
G
en
erat
i
o
n
Pro
o
f
V
eri
fi
c
at
i
o
n
E
x
i
s
t
i
n
g
Sy
s
t
em
2
0
.3
0
.
4
1
.
4
6
.
5
Pro
p
o
s
ed
Syste
m
6
.
2
4
0
.
1
5
0
.
7
0
8
7
0
.
9
4
6
8
0
5
10
15
20
25
Ti
m
e in Seco
nd
Tim
e
required to p
roce
s
s
1MB
text
fi
le
Evaluation Warning : The document was created with Spire.PDF for Python.
IS
S
N
:
2502
-
4752
Ind
on
esi
a
n
J
E
le
c Eng &
Co
m
p
Sci,
Vo
l.
1
3
, N
o.
2
,
Fe
bru
ary
201
9
:
6
26
–
633
632
Table
1 s
hows
the
outc
om
es
r
el
at
ed t
o t
he
se
cur
it
y
pro
pe
rtie
s
of
the
syst
em
.
It
cou
ld
be
ob
s
er
ved
that
the
pro
po
se
d
s
yst
e
m
hav
e
im
pro
ved
the
fe
at
ur
e
of
rec
over
y
of
t
he
data
a
nd
the
a
vaila
bi
li
ty
of
t
he
data
in
the
existi
ng syst
em
.
Table
1.
C
om
par
iso
n of t
he
se
cur
it
y p
rope
rtie
s
Secu
rity p
rop
erties
Exis
tin
g
Sy
ste
m
Prop
o
sed
Sy
ste
m
Au
th
en
ticatio
n
Yes
Yes
Co
n
f
i
d
en
tiality
Yes
Yes
Secu
rity
Yes
Yes
Integ
rity
Yes
Yes
Reco
v
ery
No
Yes
Av
ailab
ility
No
Yes
Table
2
sho
ws
the
res
ult
of
th
e
pro
posed
syst
e
m
fo
r
data
re
cov
e
ry
f
ro
m
the
cl
oud
st
or
a
ge
.
From
the
resu
lt
it
is
dem
on
st
rated
that
t
he
acc
ur
acy
of
the r
ec
overy
of
the te
xt f
il
e is
100%
w
it
ho
ut
loss
of the
d
at
a
after
recoveri
ng the
file
. Th
is
m
akes s
yst
em
r
el
ia
b
le
, accurat
e an
d
e
ff
ic
ie
nt
for r
ecov
e
ry
of
t
he data
.
Table
2
.
Or
i
gina
li
ty
o
f
the
rec
ov
e
re
d
file
File Na
m
e
Origin
al File
Size(
KB)
Reco
v
ered File Siz
e(KB)
ed
u
catio
n
.txt
46
46
b
ig
d
ata.txt
218
218
b
o
at.txt
605
605
p
roject.tx
t
1025
1025
recov
ery.tx
t
2513
2513
An
al
ysi
ng
al
l
t
he
a
bove
re
su
l
ts
it
is
pr
ov
e
d
that
the
pro
pos
ed
syst
em
pro
vid
es
acc
ur
acy
,
inc
rease
d
perform
ance,
e
ff
ic
ie
nt
a
nd
re
du
ce
d
cost
f
or
i
m
ple
m
entat
io
n
with
the
ob
j
e
ct
ive
of
ve
rifyi
ng
data
inte
gr
it
y
an
d
recoveri
ng
dat
a from
the clou
d.
As
the
pro
pose
d
syst
em
h
ave b
ac
kup ser
ve
r
this p
r
ov
i
de
s h
ig
h
av
ai
la
bili
ty
f
or
data m
ai
ntained on t
he
cl
oud.
5.
CON
CLUSI
ON
The
pr
opos
e
d
s
yst
e
m
has
t
he
f
eat
ur
e
of
ve
rif
yi
ng
the
integ
ri
ty
an
d
rec
ov
e
ring d
at
a from
secur
e
cl
ou
d
stora
ge
with
t
he
rem
ote
back
up
cl
ou
d
ser
ver.
W
e
hav
e
inte
gr
at
e
d
the
data
recove
ry
featur
e
us
in
g
XOR
op
e
rati
on
al
on
g
with
t
he
data
integrity
us
i
ng
I
den
ti
ty
Ba
sed
Re
m
ote
Data
In
te
gri
ty
Checki
ng
an
d
E
ll
ipti
cal
Curve
Digital
Sign
at
ur
e
Al
gorithm
.
W
e
can
ob
s
er
ve
that
t
he
tim
e
req
ui
red
for
t
he
op
e
rati
on
is
sm
al
l
wh
erea
s
the
tim
e
increases
with
the
i
nc
rease
in
the
file
siz
e.
The
propose
d
syst
em
satisfies
the
pro
pe
rtie
s
of
data
pri
vacy
,
confide
ntial
it
y,
and
i
nteg
rity
.
Con
si
der
i
ng
t
he
secur
it
y
m
od
el
we
ha
ve
de
m
on
strat
ed
tha
t
the
ab
ov
e
des
ign
e
d
syst
e
m
is eff
ic
ie
nt,
c
om
fo
rta
bl
e an
d pr
act
ic
al
to im
ple
m
ent.
Th
ough
t
he
pr
opos
e
d
syst
em
inte
gr
at
es
m
a
ny
featu
res,
a
per
s
pecti
ve
re
ga
rd
i
ng
netw
ork
issue
ca
n
be
consi
der
e
d
se
pa
ratel
y
with
va
rio
us
possibil
it
ie
s.
Wh
il
e
desi
gn
i
ng
this
syst
e
m
,
the
us
e
ca
se
c
on
si
der
s
th
e
file
al
ways
goes
to
a
destinat
io
n
without
loss
.
Hen
ce
,
we
ca
n
consi
der
t
he
ne
twork
iss
ues
f
or
furthe
r
f
utur
e
wor
k
in
this
syst
em
.
Also,
the
high
a
vaila
bili
ty
m
od
ule
can
be
integrate
d
with
the
syst
e
m
us
in
g
the
co
nc
ept
of
cl
us
te
rin
g
t
o prov
i
de
the
conti
nuous se
rv
ic
e
acce
ss to
t
he
cl
ie
nts.
REFERE
NCE
S
[1]
A.
Razaque
a
nd
S.
S.
Ri
zvi
.
P
riva
c
y
pre
serv
in
g
m
odel
:
a
new
s
che
m
e
for
aud
it
i
ng
cl
oud
stak
eho
lde
rs
.
Journal
o
f
Cloud
Computing
.
201
7;
6(1):7
.
[2]
M.
S.
Kira
z
.
A
comprehe
nsi
ve
m
et
a
-
ana
l
y
sis
of
cr
y
p
togra
phi
c
sec
ur
ity
m
ec
h
ani
sm
s
for
cl
oud
computing
.
Jou
rnal
of
Ambie
nt
Intelli
g
enc
e
and
Hum
an
ized
Computing
.
2016;
7(5):731
–
760.
[3]
A.
Kum
ar.
W
orld
of
c
loud
computing
&
se
cur
ity
.
In
te
rnati
onal
Journal
of
Cloud
Computin
g
and
Serv
ices
Sci
en
ce
.
2012;
1(2):53
.
[4]
P.
S.
Challag
i
dad,
A
.
S.
Dal
awa
i,
and
M.
N.
Bir
je
.
Eff
ic
i
ent
and
Rel
ia
b
le
Dat
a
Re
cove
r
y
Techni
qu
e
in
Cloud
Com
puti
ng
.
Inte
rnet
of
Things
and
Cloud
Co
mputing.
Sp
ecial
Iss
ue:
Ad
vanc
es
in
C
loud
and
In
te
rnet
of
Things
.
2017;
5(1)
:13
-
1
8.
[5]
G.
Li
,
Q.
Zh
a
ng,
W
.
Li
,
and
Z.
Feng.
The
d
esi
g
n
and
v
eri
fi
catio
n
of
disast
er
re
co
ver
y
stra
te
gi
es
in
cl
oud
disaste
r
re
cover
y
ce
nt
er.
Indone
si
an
Journal
o
f El
ec
tri
cal
Engi
n
eer
ing
and
Compu
te
r Sc
ie
nc
e
.
201
3;
11(10):6179
–
6186.
Evaluation Warning : The document was created with Spire.PDF for Python.
Ind
on
esi
a
n
J
E
le
c Eng &
Co
m
p
Sci
IS
S
N:
25
02
-
4752
Checki
ng inte
gri
ty
o
f d
ata a
nd rec
overy i
n
t
he
cl
ou
d
e
nvir
onme
nt
(
Ne
ha
Nara
y
an K
ulka
rn
i
)
633
[6]
K.
N.
Sevis a
nd
E.
Sek
er.
Sur
ve
y
on
data
in
tegrit
y
in cl
oud
,
in
C
y
b
er
Secu
r
ity
and
Cloud
Com
puti
ng
(CSC
loud
).
2016
IEE
E
3rd Int
ernati
onal
Con
fe
ren
ce
on
.
I
EEE
.
201
6;
pp.
167
–
171.
[7]
N.
Garg
and
S.
Bawa
.
Com
par
at
iv
e
anal
y
sis
of
c
loud
d
ata
int
egr
ity
auditing
proto
col
s.
Journal
of
Net
work
and
Co
mputer
Appl
ic
a
ti
ons
.
20
16;
66:17
–
32
.
[8]
S.
G.
W
orku,
Z
.
Ti
ng
,
and
Q.
Zhi
-
Guang
.
Surv
e
y
on
c
loud
data
int
egr
i
t
y
proof
technique,
in
Infor
m
at
ion
Se
cur
ity
(As
ia
JCIS
).
2012
Se
v
ent
h
Asia Joi
nt
Confe
renc
e
on
.
I
EE
E
.
2012;
pp.
85
–
91.
[9]
C.
V.
Desai
and
G.
B
.
J
et
h
ava
.
Surve
y
on
data
in
te
grit
y
c
hec
k
ing
te
chn
iq
ues
in
cl
oud
dat
a
storage.
Int
ernati
onal
Journal
.
2014
;
4
(12).
[10]
Y.
Yu,
L.
Xue,
M.
H.
Au,
W
.
Sus
il
o,
J.
Ni
,
Y.
Zha
ng
,
A.
V.
Va
sila
kos,
and
J.
S
hen
.
C
loud
da
ta
i
nte
grity
ch
ec
kin
g
wit
h
an
id
ent
i
t
y
-
base
d
auditing
m
e
ch
ani
sm
from
rsa.
Fut
ure
Gen
e
rati
on
Computer
Sy
stems
.
2016;
62:
85
–
91.
[11]
H.
Li
u
,
Y.
Mu,
J.
Zha
o
,
C
.
Xu,
H.
W
ang,
L.
Ch
en,
and
Y.
Yu.
Id
ent
i
t
y
-
ba
sed
prova
bl
e
d
ata
poss
ession
rev
isit
ed:
Secur
ity
anal
y
s
is a
nd
g
ene
r
ic c
on
struct
ion
.
Comp
ute
r St
andards
&
I
nte
rface
s
.
20
17;
54:10
–
19
.
[12]
H
.
W
ang,
D.
He,
and
S.
T
ang.
Id
entit
y
-
bas
ed
prox
y
-
ori
ente
d
data
uplo
adi
n
g
and
r
emote
d
a
ta
int
egr
ity
chec
king
in
publi
c
cl
oud
.
I
E
EE
Tr
ansacti
ons
on
Information
Forensic
s and
S
ec
urit
y
.
2016;
11
(6):1165
–
1176.
[13]
K.
He,
J.
C
hen,
R
.
Du,
Q.
W
u,
G.
Xue,
an
d
X.
Z
hang
.
De
y
pos:
Dedup
li
c
a
ta
bl
e
d
y
namic
pr
oof
of
storage
fo
r
m
ult
i
-
user
envi
ronm
en
ts
.
IE
EE Tr
ansa
ct
ions o
n
Computers
.
2016;
65(1
2):3631
–
3645.
[14]
W
.
Shen,
G.
Yang
,
J.
Yu,
H.
Zha
ng
,
F.
Kong,
and
R.
Hao.
Re
m
ote
data
poss
ession
checki
ng
wi
th
priv
acy
-
pr
ese
r
vin
g
aut
hen
ti
c
at
ors fo
r
cl
oud
storag
e
.
Fut
ure
Gen
eration Compute
r Sy
stems
.
2017;
76:
136
–
145.
[15]
M.
Mohammad
Et
emad
an
d
A
.
K ̈up
̧
c
̈u
.
Gene
ric
eff
i
cient
d
y
n
amic
proofs
of
Ret
r
ie
v
abi
l
ity
,
in
Proceedi
ng
s
of
the
2016
ACM
on
Cl
oud
Computing Sec
urit
y
Worksh
op.
ACM
,
2016
,
pp.
85
–
96
.
[16]
D.
Vasilopoul
os,
M.
Onen
,
K.
E
lkhiy
aou
i,
and
R.
Molv
a.
Mess
age
-
loc
k
e
d
proofs
of
ret
r
ie
vab
il
ity
w
it
h
sec
ure
dedupl
i
ca
t
ion,
in
Proceedi
ngs o
f
t
he
2016
ACM
on
Cloud
Comput
i
ng
Sec
uri
ty Workshop.
ACM
,
20
16,
pp
.
73
–
83
.
[17]
R.
A.
Hegd
e
an
d
M.
Pr
aka
s
h.
A
sur
ve
y
on
p
roof
of
re
trie
vab
il
ity
and
it
s
tech
nique
s.
[18]
K.
Popha
le
,
P.
Pat
il,
R
.
Shel
ake
,
and
S.
Sapk
al
.
Se
ed
bloc
k
algorithm:
R
emote
sm
art da
t
a
-
ba
ck
up
t
ec
hniqu
e
for
cl
oud
computing
.
In
te
r
nati
onal Journal
of Adv
an
ce
d
Res
earc
h
in
Comp
ute
r
and
Comm
u
nic
ati
on
Eng
ine
e
ring
.
2015;
4(3).
[19]
M.
Raj
e
and
D.
Mukhopadh
ya
y
.
Algor
it
hm
fo
r
bac
k
-
up
and
r
e
cove
r
y
of
data
st
ore
d
on
cl
oud
along
with
au
the
n
t
ic
a
ti
on
of
the user
,
in
In
formation
Techn
ology
(
ICIT)
,
2
015
Inte
rnat
ional
Confe
renc
e
on
.
I
EE
E
.
2015
,
pp
.
175
–
180.
[20]
H.
Deng
,
S.
Xiul
i,
and
T
.
Ji
ngsong.
A
d
ouble
efficien
t
i
nte
grity
ve
rif
ic
a
ti
on
sche
me
to
c
loud
storag
e
data
.
TEL
KOMNIKA
Indone
sian J
ourn
al
of
Elec
tric
al
Engi
ne
ering
.
20
14;
12(9):7007
-
7
013.
[21]
Y.
Yu,
M.
H
.
Au,
G.
At
eni
es
e,
X
.
Huang
,
W
.
Sus
il
o,
Y.
D
ai
,
a
nd
G.
Min
.
Id
entit
y
-
base
d
remote
data
in
te
gr
ity
ch
ec
kin
g
with
per
f
ec
t
da
t
a
priv
acy
p
rese
r
ving
for
cl
oud
s
tora
ge
.
I
EE
E
Tr
ansacti
ons
on
In
formation
Foren
si
cs
and
Se
curity
.
2017;
12(4):767
–
778.
[22]
A.
Khali
que,
K.
Singh,
and
S.
Sood.
Im
ple
m
ent
at
ion
of
elliptic
cur
ve
dig
it
a
l
sig
nat
ure
al
gori
thm
.
Inte
rnat
ional
jo
urnal
of
comput
er
app
li
cations
.
2010
; 2(2):21
–
27.
Evaluation Warning : The document was created with Spire.PDF for Python.