Indonesi
an
Journa
l
of El
ect
ri
cal Engineer
ing
an
d
Comp
ut
er
Scie
nce
Vo
l.
12
,
No.
3
,
Decem
ber
201
8
, p
p.
1
1
43
~
115
0
IS
S
N: 25
02
-
4752, DO
I: 10
.11
591/ijeecs
.v1
2
.i
3
.pp
1
1
43
-
11
50
1143
Journ
al h
om
e
page
:
http:
//
ia
es
core.c
om/j
ourn
als/i
ndex.
ph
p/ij
eecs
Secure
an
d Effici
ent Bi
-
Di
rectiona
l Proxy
Re
-
En
cyrption
Tec
hn
iqu
e
Chadr
akala
1
,
S. C.
Li
n
gare
ddy
2
1
Depa
rtment
of
CS
E,
VTU,
Ban
gal
ore
,
Ind
ia
2
Depa
rtment
of
CS
E,
ACE,
Ban
gal
ore
,
Ind
ia
Art
ic
le
In
f
o
ABSTR
A
CT
Art
ic
le
history:
Re
cei
ved
Ja
n
3
, 201
8
Re
vised
A
pr
2
3
, 2
01
8
Accepte
d
Aug
2
1
, 201
8
The
low
cost
av
ai
l
abi
lit
y
of
sm
art
dev
ic
es
and
b
r
oadba
nd
connect
ion
has
le
d
to
rap
id
growth
of
com
m
unic
ation
over
Inte
rne
t.
As
of
today
t
he
int
ern
et
base
d
comm
unic
ation
servi
ce
is
widely
used
in
var
ious
app
li
c
at
i
on
services
such
as
in
E
-
Mail
tra
nsa
ct
ion
of
sensiti
ve
da
ta
(
m
edi
ca
l
d
at
a)
,
o
nli
ne
m
on
e
y
tra
nsac
ti
on
e
tc.
al
l
the
se
serv
ic
e
s
req
uire
s
a
stro
ng
sec
urity
.
Th
e
re
has
be
en
cont
inuous
ongoing
rese
ar
ch
b
y
var
ious
cr
y
p
ta
n
a
l
y
st
to
enh
anc
e
sec
urity
of
cr
y
p
togra
ph
y
espe
cially
in
sem
i
-
untruste
d
serv
er.
How
eve
r
,
per
form
anc
e
,
computat
ion
tim
e
and
ea
se
o
f
use
play
a
si
gnifi
c
ant
rol
e
i
n
using
the
al
gorit
hm
for
implementation.
Prox
y
r
e
-
en
cr
y
pti
o
n
play
s
a
signif
i
ca
nt
ro
le
i
n
prote
c
ti
ng
d
ata
t
hat
are
stored
in
sem
i
-
untruste
d
serve
r
.
Man
y
ex
isti
ng
Pro
x
y
re
-
enc
r
y
p
ti
on
technique
induces
high
computa
tion
over
he
ad
due
to
adop
ti
o
n
of
publi
c
ke
y
cr
y
p
togra
ph
y
s
uch
RS
A
(Riv
et
Sham
ir
Adl
e
m
an)
,
ECC
(El
li
p
ti
c
al
Curv
e
Cr
y
ptog
r
aph
y
)
et
c.
a
nd
it
suffer
from
quant
um
at
ta
ck.
To
addr
ess
thi
s
latt
ic
e
b
ase
d
cr
y
pt
ogra
ph
y
is
ado
pte
d
b
y
var
ious
appr
oac
h
es
which
is
b
ase
d
on
L
ea
rning
W
it
h
Err
or
whi
ch
show
s
resil
i
enc
e
ag
ai
nst
quant
um
at
tacks
such
Chosen
Ciphe
r
data
atta
ck
and
Chosen
Plai
n
T
ex
t
at
t
ac
k.
Th
e
dra
wbac
k
with
exi
sting
la
t
ti
c
e
cr
y
p
togra
ph
y
b
ase
d
appr
oac
h
is
tha
t
they
are
un
idi
re
ct
ion
al
and
adopt
s
bi
li
ne
ar
pai
ring
which
comprom
ise
sec
urity
and
ind
uce
s
high
computat
ion
cost
.
To
addr
ess
thi
s
wor
k
pre
sent
a
Bidi
re
ct
ion
al
P
rox
y
R
e
-
en
cr
y
p
ti
on
sche
m
e
b
y
adopt
ing
lat
ti
c
e
base
d
cr
y
p
togra
ph
y
t
e
chni
que
.
Expe
r
i
m
ent
is
conduc
t
ed
for
computat
i
on
over
hea
d
b
y
v
ar
y
ing
k
e
y
and
da
ta
si
z
e
which
at
t
ai
n
ed
significan
t
per
form
anc
e
improvem
ent
ov
er
ex
isti
ng
Proxy
R
e
-
en
cr
y
ption
sche
m
e.
Ke
yw
or
d
s
:
Crypto
gr
a
phy
Data s
har
in
g
Pr
oxy R
e
-
enc
r
ypti
on
Secu
rity
Copyright
©
201
8
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
:
Chad
rak
al
a
,
Dep
a
rtm
ent o
f C
SE,
VTU, Ba
ng
al
ore,
India
.
Em
a
il
:
chad
ra
ka
la
.p
i@
gm
ail.co
m
1.
INTROD
U
CTION
The
wide
avai
la
bili
ty
low
co
st
broa
db
a
nd/i
nter
net
ser
vice
has
le
d
t
o
th
e
gro
wth
of
finan
ci
al
a
nd
bu
si
ness
acr
oss
var
io
us
in
du
strie
s/organizat
ion
.
T
he
gr
owth
of
inte
rn
et
has
le
d
the
organ
iz
at
io
n
to
deliver
custom
er
ser
vi
ces
onli
ne
su
c
h
as
s
ocial
ne
tworki
ng,
on
li
ne
tra
ns
act
io
n,
an
d
c
us
t
om
er
serv
ic
e
and
s
o
on
.
In
te
r
net
ha
s
be
en
integ
ral
pa
rt
of
e
ver
y
use
r
as
of
t
od
ay
.
D
espite
these
be
nef
it
it
sti
ll
fac
es
sever
al
iss
ue
s
an
d
chall
enges
su
c
h
as
integ
rity
,
confide
ntial
ity
and
pr
ivacy
of
data
w
hich
is
not
trusta
ble
.
T
o
ad
dr
e
s
s
this
,
crypto
gr
a
phy
m
echan
ism
has
bee
n
ad
opte
d.
E
nc
ryptio
n
and
dec
ryptio
n
is
the
integ
ral
par
t
of
c
rypt
ogra
ph
y
m
echan
ism
.
In
Encr
ypti
on
th
e
m
essage
are
encode
d
by
se
nd
e
r
by
ap
plyi
ng
s
om
e
transfor
m
at
ion
te
chni
qu
e
and
in
decr
y
ption
t
he
m
essage
ar
e
dec
ode
d
by
receive
r.
The
c
rypto
gra
ph
ic
te
c
hn
i
qu
e
has
bee
n
a
dopted
i
n
var
i
ou
s
dom
ain
s
s
uch
as
cl
oud,
so
ci
al
ne
tworki
ng,
E
m
ai
l
serv
ic
e
et
c.
w
hen
de
velo
ping
cry
pt
ogra
ph
y
m
echan
ism
gen
erati
ng
unbr
e
akab
le
ci
phe
r
data
is
an
art
no
t
te
ch
nolo
gy.
W
it
h
t
he
avail
ab
il
it
y
of
high
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.
12
, N
o.
3
,
Dece
m
ber
2
01
8
:
1
1
43
–
1
1
50
1144
com
pu
ti
ng
de
vi
ce
and
cl
oud
te
chnolo
gies
ha
ve
le
d
to
de
velop
m
ent
of
strong
cry
ptogra
ph
y
m
echan
is
m
wh
i
c
h
is t
he need
of t
he hou
r.
Let
con
side
r
a
scenari
o
that
a
per
s
on
is
on
va
cat
ion
an
d
he
is
no
t
able
to
acce
ss
internet
/
m
ail.
Yo
u
would
wa
nt
th
e
ser
ver
t
o
f
or
ward
yo
ur
e
nc
od
e
d
m
ai
l
data
to
the
receive
r
B
w
ho
ca
n
de
crypt
the
ci
ph
er
data
us
in
g
his
pri
va
te
key.
A
si
m
ple
way
is
to
st
or
e
the
pri
vate
key
in
m
a
il
se
rv
e
r.
I
n
that
case
wh
e
n
us
e
r
r
ecei
ve
the
m
ai
l
the
s
erv
e
r
dec
od
e
i
t
us
ing
pri
vate
key
that
is
s
t
or
e
d
in
ser
ver
and
re
-
enc
ryp
t
m
essage
us
ing
B’
s
public
key.
Ye
t,
su
ch
m
et
ho
d
is
no
t
desired
so
luti
on,
par
ti
cularly
for
un
t
r
us
te
d
ser
vice
pro
vid
e
r
[
1
-
3],
since
the pr
ov
i
der
c
a
n ob
ta
in
both
your
pr
i
vate k
ey
and actual
d
at
a.
Pr
oxy
Re
-
E
nc
r
ypti
on
[
4]
is
an
ef
fici
ent
stra
te
gy
that
assures
sen
der
sec
ure
stora
ge
a
nd
sh
ari
ng
of
data/m
essage
on
public
sto
rag
e
e
nv
ir
onm
ent
and
s
olv
e
s
key
m
anag
e
m
ent
pr
oble
m
s
[4
-
5].
Pro
xy
Re
-
Encr
y
ption
has
been
ad
opte
d
by
app
li
cat
io
n
do
m
ai
n
rangin
g
from
encr
ypte
d
em
a
il
fo
rw
a
rd
i
ng
[
6],
ve
hi
cula
r
ad
hoc
netw
or
ks
(
VANETs
)
[7
-
8]
di
gital
ri
gh
t
m
anag
em
e
nt
(D
RM
)
[
9
-
1
0],
distrib
uted
com
pu
ti
ng
[
11
-
12]
,
to
gro
up
key
m
a
nag
em
ent
[13].
In
P
roxy
Re
-
Encr
y
ption
sc
hem
e
a
send
er
encode
it
file
us
in
g
public
ke
y
an
d
then
sto
re
the
ci
ph
e
r
data
on
the
s
e
m
i
-
trusted
ser
ver.
W
he
n
receive
r
re
qu
e
st
fo
r
data,
the
send
e
r
send
th
e
pro
xy
key
or re
-
enc
ryptio
n
ke
y
associat
ed
with
the
i
nten
de
d
recei
ver
t
o
t
he
ser
ve
r
as p
r
ox
y. The
n
t
he
r
ecei
ver
receives
the
re
-
enc
rypted
ci
pher
te
xt
t
hen
fi
nally
the
receiver
dec
rypt
t
he
ci
pher
te
xt
with
his
pr
ivate
key
t
o
retrieve
or
i
gina
l
data.
T
he
Pr
oxy
Re
-
Enc
ryptio
n
te
ch
ni
qu
e
ge
ner
al
ly
assures
sec
ur
it
y
(1)
that
the
pro
xy
cannot re
-
e
ncry
pt
the
ci
ph
e
r
data
in
a u
sef
ul
f
or
m
befor
e
re
cei
vin
g
the
enc
ryptio
n
key,
a
nd (
2)
t
hat
neith
er
t
he
receiver
no
r
th
e ser
ver
/
prox
y
can
ob
ta
in
m
ea
ningf
ul in
form
at
ion
of r
e
-
enc
rypted
d
at
a.
The
P
roxy
Re
-
Enc
ryptio
n
is
of
tw
o
f
orm
s
un
i
directi
onal
and
bi
-
directi
on
al
.
If
re
-
e
nc
ryptio
n
ke
y
a
1
,
2
ine
vitably
pe
r
m
it
s
the
pro
xy
to
tra
nsfo
rm
ci
ph
e
r
data
under
a
1
in
to
ci
ph
e
r
data
un
der
a
2
then
it
is
cal
le
d
as u
ni
dir
ect
ion
al
. I
f
re
-
encr
y
ption
key
a
1
,
2
ine
vitably
pe
r
m
it
s
the
prox
y t
o
tra
ns
f
or
m
ci
ph
e
r
data u
nde
r
a
1
into
ci
phe
r
da
ta
unde
r
a
2
an
d
vice
ver
sa
,
t
he
n
it
is
cal
le
d
a
s
bi
directi
onal
.
A
ny
unidirect
ion
al
s
chem
e
can
be
trans
f
orm
ed
into
bid
irect
ion
al
but
conve
rse
shoul
d
ho
l
d.
I
n
[1]
,
[3
]
pr
ese
nted
a
bili
near
pa
irin
g
un
i
directi
onal
Pr
oxy
Re
-
E
nc
ryptio
n
to
pro
te
ct
against
C
PA
(Chose
n
P
la
intext
Atta
ck
).
H
ow
e
ver
it
la
cks
secur
it
y
to
pro
te
ct
attack
against
CC
A
(Cho
se
n
Ci
ph
er
da
ta
Atta
ck)
.
T
o
ad
dr
ess
this
[14]
pr
ese
nted
CC
A
-
secur
e
bid
irect
ion
al
Prox
y
Re
-
Enc
ryptio
n
t
echn
i
qu
e
.
T
o
address
RC
CA
(Rep
ay
able
A
tt
ack
Ch
os
e
n
-
Ci
ph
er
data)
sec
ur
it
y
[15]
pr
e
sente
d
a
un
i
directi
on
al
Pr
oxy
Re
-
E
ncr
y
ption
te
c
hniq
ue.
Bot
h
th
ese
te
chn
i
q
ue
adopt
bili
near
pairi
ng
wh
ic
h
requir
es
hi
gh
com
puta
ti
on
co
st
f
or
m
od
ular
e
xpon
entia
ti
on
i
n
fi
ni
te
fiel
ds
[
16]
wh
ic
h
adopts
public
ke
y base
d
cry
pto
gra
ph
y m
echan
ism
.
To
a
ddress
t
his
la
tt
ic
e
based
crypto
gr
a
phy
m
echan
ism
is
adopted
by
vari
ou
s
a
ppr
oac
he
s.
To
resist
the
qu
a
ntu
m
attack,
[
17
]
pres
ented
the
fir
st
la
tt
ic
e
based
P
roxy
Re
-
Enc
ry
ption
m
echan
is
m
that
reali
zes
non
-
interact
ivit
y
and
collu
sio
n
res
il
ie
nce.
Further
they
pr
ese
nted
,
the
secu
rity
pro
of
of
t
heir
m
et
hodo
l
og
y
is
give
n
in
the
sel
ect
ive
m
od
el
unde
r
the
Lea
rn
i
ng
wi
th
Er
r
o
r
[18]
a
ssu
m
ption
.
As
in
[
18
-
19
]
the
Learn
i
ng
with
Erro
r
assum
ption
an
al
yt
ic
ally
has
strong
c
onnect
ion
to
la
tt
ic
e
hard
ness
ass
um
pt
ion
s,
wh
ic
h
are
ass
um
ed
safe
in
var
i
ou
s
facto
rs
.
Th
ough,
ther
e
are
passible
“at
ta
cks”
on
L
earn
i
ng
with
E
rror,
as
in
[
20
-
22
]
.
The
refor
e
w
he
n
desig
ning
a
L
earn
i
ng
with
Error
we
nee
d
co
ns
ide
r
real
world
e
nvir
onm
ent
threat
as
in
[
20]
am
on
g
them
Searc
h
-
Lea
rn
i
ng
with
Er
r
or
is
m
os
t
eff
ect
ive
at
ta
ck.
In
[23]
pr
ese
nte
d
unidirect
i
onal
and
m
ulti
pl
e
us
a
ge
Pr
oxy
Re
-
E
ncry
ption
te
ch
nique
by
ad
opti
ng
m
ulti
-
li
near
m
ap
[
24
]
co
ns
id
erin
g
stron
g
m
ulti
-
li
near
gro
ups
a
nd
address
the iss
ues of [
14]
in d
esi
gn
i
ng Pro
xy Re
-
E
ncr
ypti
on unidirecti
onal
and m
ulti
ho
p.
This
wor
k
presents
a
Bi
directi
on
al
Proxy
Re
-
enc
ryption
sc
hem
e
by
adoptin
g
la
tt
ic
e
base
d
crypto
gr
a
phy
te
chn
i
qu
e
w
hich
is
m
ult
iho
p
(
it
su
pport
s
m
ul
ti
ple
re
-
enc
ryp
ti
on
s)
.
The
pa
pe
r
orga
nizat
ion
is
as
fo
ll
ows:
I
n
sec
ti
on
tw
o
the
pro
posed
Bi
di
re
ct
ion
al
Pro
xy
Re
-
enc
ryptio
n
schem
e
is
pr
esented.
Sect
ion
three
the expe
rim
ent
al
r
esult a
r
e
dis
cusse
d.
The
last
secti
on
pa
per
is co
nclu
ded wi
th futur
e
wo
rk.
2.
LIT
ERATUR
E SU
RV
E
Y
To
i
m
pr
ove
th
e
secur
it
y
and
com
pu
ta
ti
on
com
plexity
in
i
m
ple
m
enting
cryptogra
ph
y
m
echan
is
m
var
i
ou
s
m
et
ho
do
l
og
ie
s
ha
ve
been
propose
d
in
rece
nt
ti
m
es
am
on
g
the
m
pr
ox
y
Re
-
en
cry
ption
is
th
e
m
os
t
so
rte
d ou
t m
echan
ism
w
hic
h are s
urveyed
bel
ow
.
In
[
25]
pr
ese
nted
a
Pr
oxy
Re
-
Enc
ryptio
n
w
hich
ad
opts
sta
te
of
art
public
key
cryptogr
aph
y.
T
hei
r
m
od
el
dep
en
ds
on
the
validit
y
of
public
ke
y
to
ver
ify
certi
ficat
e.
Be
fo
re
encr
y
pting
a
m
es
sage
sen
de
r
has
to
ver
ify
it
s
certi
ficat
e
[2
6].
In
orde
r
to
ad
dr
ess
the
ov
er
hea
d
cause
d
for
ve
rificat
ion
of
cert
ific
at
e
in
pu
bli
c
key
crypto
gr
a
phy
Id
e
ntit
y
based
Prox
y
Re
-
E
ncr
y
ption
[
27
]
is
pr
ese
nted
,
wh
ic
h
inc
orporates
ide
ntit
y
fo
r
encr
y
ption
[
28
]
.
The
m
o
del
in
[
29]
pr
ov
e
d
ra
ndom
hash
m
od
el
in
rando
m
or
acl
e
is
secu
re
a
nd
[
28
]
i
n
sta
nd
a
rd m
od
el
.
In
[27]
pro
ve
d
a
case
of
st
rong
e
r
sec
ur
it
y
in
sta
ndar
d
m
od
el
f
or
c
ho
s
en
-
ci
pher
data
at
ta
ck.
T
hese
m
od
el
su
pp
or
t
s
only
coa
rse
-
grai
ne
d
data
s
ha
rin
g
i.e.
use
r
se
nd
s
t
he
key
to
pro
xy
ser
ver,
a
ll
ci
ph
er
data
c
an
be
re
-
e
ncr
y
pted
a
nd
the
n
the
int
end
e
d
use
r
can
acce
ss
these
da
ta
,
el
se
the
cip
he
r
data
are
not
acce
ssible
by
any
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
Secure
and
Eff
ic
ie
nt Bi
-
Direc
ti
on
al
Prox
y R
e
-
Ency
rp
ti
on
T
echn
i
qu
e
(C
hadr
ak
al
a)
1145
us
er
a
nd
ci
phe
r
data
can
no
t
be
re
-
e
nc
rypte
d.
T
o
ad
dr
ess
t
his
in
[30]
pr
e
sented
c
onditi
on
al
ba
sed
P
r
oxy
Re
-
Encr
y
ption
w
hi
ch
achie
ved
fine
grai
ne
d
acc
ess
m
echan
ism
wh
ic
h
is
c
onside
red
t
o
be
safe
agai
ns
t
c
ho
s
en
-
ci
ph
e
r
at
ta
ck.
In
[
30
]
t
hey
co
m
bin
ed
the
both
c
onditi
onal
a
nd
ide
ntit
y
bas
ed
P
r
ox
y
Re
-
E
ncr
y
ption
an
d
i
n
[31]
they
com
bin
ed
both
c
onditi
onal
base
d
P
r
ox
y
Re
-
Enc
ryptio
n
an
d
broa
dcas
t
encr
y
ption
a
nd
they
achie
ve
fine
-
gr
ai
ned
acce
s
s
and
ass
ure
se
cur
it
y
against
chosen
ci
phe
r
data
at
ta
ck
an
d
ch
os
e
n
plain
m
essage
at
ta
ck
an
d
they
sup
port one to
m
any u
se
r data
sh
a
rin
g.
In
[
25
]
pr
es
ent
ed
a
Pro
xy
Re
-
Enc
ryptio
n
m
et
hodo
l
og
y
t
o
su
pp
or
t
a
nony
m
ou
s
data
s
ha
rin
g.
In
[
32]
they
exten
ded
this
and
pres
ented
a
bi
-
dir
ect
ion
al
Re
-
E
ncr
y
ption
w
hich
sup
port
m
ulti
hop
(m
ultip
le
re
-
encr
y
ption
s
)
a
m
on
g
two
us
e
r
s.
These
sc
hem
e
su
pport
secu
r
it
y
a
gainst
at
tack
ch
os
en
ci
ph
er
at
ta
ck
in
sta
nd
a
r
d
and
ra
ndom
or
acl
e
m
od
el
,
si
m
il
arly
in
con
t
rast
in
[33]
presente
d
m
ul
ti
ho
p
unid
irect
ion
al
P
roxy
Re
-
Encr
y
ption
te
chn
i
qu
e
.
T
he
is
su
e
with
the
se
te
chn
i
qu
e
s
is
that
they
us
e
d
public
bas
ed
c
rypto
gr
a
phy
suc
h
a
s
RSA,
Di
ff
e
He
llm
an
et
c.
wh
ic
h
induce
hi
gh
key
com
pu
ta
tio
n
ov
e
r
head
a
nd
are
pro
ne
to
qu
a
ntu
m
at
ta
c
k
[17].
To
ad
dress
th
is
[1
7]
prese
nt
ed
a
la
tt
ic
e
base
d
Prox
y
Re
-
Enc
ryptio
n
crypto
gr
a
phy
te
chn
iq
ue
w
hich
is
collusio
n
resil
ie
nt
collusio
n
r
esi
li
ence
and
non
-
interact
ivi
ty
.
Fu
rthe
r
the
y
pr
ovide
d
sec
ur
it
y
under
Le
arn
i
ng
W
it
h
E
rror cas
e.
In
[
34
]
pr
ese
nt
ed
a
la
tt
ic
e
ba
sed
P
r
ox
y
Re
-
Enc
ryptio
n
te
chn
i
qu
e
,
nam
e
ly
Key
-
pri
vate
Prox
y
Re
-
Encr
y
ption.
H
ere
they
identifie
d
the
com
pu
ta
ti
on
ove
rh
e
ad
due
to
bili
ne
ar
pairin
g,
a
doptio
n
of
gro
up
bas
e
d
public
key
cr
yptogra
ph
y
an
d
Lear
ning
W
it
h
Er
ror
c
orrectness
.
Th
ey
al
so
identifie
d
w
he
n
pai
rin
g
is
consi
der
e
d
the
y
will
nev
er
guaran
te
e
lo
ng
te
rm
safety
especial
ly
against
qu
ant
um
attacks.
The
Lea
rn
i
ng
W
it
h
Error
is
a
ha
rdness
pro
blem
and
i
nv
ol
ves
long
-
te
rm
securi
ty
issues,
they
showe
d
that
t
he
existi
ng
Le
arn
i
ng
W
it
h
E
rro
r
is
pro
ne
t
o
r
eal
w
orl
d
at
ta
ck
[
22]
.
To
ad
dress
al
l
these
he
re
the
y
pr
ese
nted
K
e
y
-
pr
i
vate
P
rox
y
Re
-
Encr
y
ption,
w
hich
does
not
le
ak
any
info
rm
at
ion
of
both
sen
de
r
an
d
receive
r
an
d
pro
vid
es
a
ddit
ion
al
confide
ntial
it
y
du
e
to
Pse
udo
-
arb
it
ra
ry
prox
y
key
gen
erati
on.
Thei
r
m
od
el
is
cho
sen
plai
ntext
at
ta
ck
secur
e
in
sta
nd
a
rd
m
od
e
l
and
c
hosen
c
iph
e
r
data
Atta
ck
sec
ur
es
i
n
r
andom
or
acl
e
m
od
el
.
They
appr
oach
is
m
ulti
ho
p
and
un
i
directi
ona
l
and
prov
i
de
d
secu
rity
wit
h
sta
nd
a
r
d
Lea
rn
i
ng
W
it
h
Error.
The
draw
ba
ck
with
this
str
at
egy
is
that
the
pr
oxy
Re
-
E
nc
rypt
ion
in
vo
l
ves
hi
gh
c
om
pu
ta
ti
on
due
to
in
vers
e
tran
sf
or
m
at
i
on
of
pro
xy
ke
ys
an
d
they
are
unidir
ect
ion
al
.
T
o
a
ddress
this
w
ork
pro
pose
a
P
ro
xy
Re
-
Enc
ryption
te
ch
niqu
e
w
hich
is
m
ulti
ho
p
and b
i
-
directi
onal
which
is
presented
in ne
xt secti
on b
el
ow.
3.
PROP
OSE
D MO
DEL
This
wor
k
present
Bi
direc
ti
on
al
P
roxy
Re
-
e
ncr
ypti
on
sc
hem
e
by
ad
opti
ng
la
tt
ic
e
base
d
crypto
gr
a
phic
t
echn
i
qu
e
and
a
rch
it
ect
ure
of
Pr
ox
y R
e
-
enc
r
ypti
on
is
sho
w
n
in
Fig
ure
1.
Figure
1. A
rch
i
te
ct
ur
e
of
Pro
xy
Re
-
Enc
ryptio
n
Let
the
Alic
e
be
pe
rs
on
X
an
d
bo
b
be
pe
rs
on
Y
.
T
he
pro
po
sed
Bi
directi
onal
Pro
xy
Re
-
encr
y
ption
schem
e con
sist
s of foll
owin
g enti
ti
es.
Ge
ne
rat
eK
ey
(
)
:
A
pair
of
public
a
nd
m
as
te
r
key
(
a
X
,
m
X
)
is
th
e
outc
om
e
of
gen
e
rate
key
functi
on
strat
e
gies
f
or
per
s
on
X
.
If
it
rand
om
ly
se
le
ct
s
a
po
ly
nom
ia
l
pa
irs
of
(
h
X
,
n
X
)
∈
F
Q
2
,
with
fixe
d
coeffic
ie
nt
e
quivale
nt
to
0
,
−
1
an
d
the
h
X
has
to
be
c
ongrue
nt
to
1
m
od
a
.
The
public
key
c
onsist
of
a
X
that
po
ly
nom
ia
l
t
X
=
a
∙
n
X
.
1
h
X
%
b
w
ere the
private
key
h
X
is t
he
poly
no
m
ia
l
h
x
.
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.
12
, N
o.
3
,
Dece
m
ber
2
01
8
:
1
1
43
–
1
1
50
1146
Regene
rate
Ke
y
(
m
X
,
m
Y
)
:
The
input
for
re
-
enc
rypt
ion
strat
e
gy
is
m
ast
er
key
m
X
=
h
x
and
m
Y
=
h
Y
. T
he re
-
e
nc
ryptio
n key i
s co
m
pu
te
d
am
ong per
son
X
an
d
Y
as
p
X
→
Y
=
m
X
∙
m
1
h
Y
=
h
X
∙
1
h
Y
.
The
pr
ox
y
ke
y
is
c
om
pu
te
d
w
he
re
neithe
r
pr
ox
y
no
r
X
,
Y
c
an
obta
in
in
form
ation
a
bout
m
ast
er
key
is
a
s
fo
ll
ows,
Let
X
choose
a
n
a
rb
it
r
ary
p
∈
F
Q
b
⁄
an
d
tran
s
m
it
p
to
pro
xy
a
nd
p
∙
h
X
%
b
to
Y
.
Sim
il
arl
y
Y
tra
ns
m
it
s
p
∙
h
X
∙
1
h
Y
%
b
to the
pr
ox
y a
nd the
n
c
om
pu
ta
ti
on
is
done b
y pro
xy as
p
h
X
→
Y
=
h
X
∙
1
h
Y
%
b
.
Encrypt
(
a
X
,
D
)
:
O
n
a
gi
ven
public
key
a
X
a
nd
data
D
∈
F
Q
b
⁄
as
in
put,
t
he
en
crypt
f
unct
ion
pro
du
ces
a cip
her
te
xt
T
X
=
l
X
m
+
D
as an
d pro
du
ces
a tri
vi
al
arb
it
rar
y
po
ly
no
m
ial
m
∈
F
Q
b
⁄
as ou
tpu
t.
ReEncrypt
(
p
X
→
Y
,
T
X
)
:
On
a
giv
e
n
ci
ph
e
rtext
T
X
a
nd
re
-
enc
rypti
on
key
p
X
→
Y
as
in
put.
T
he
ReEncrypt
f
un
ct
io
n
ge
ne
rates
ci
phe
rtext
T
Y
=
T
Y
∙
p
X
→
Y
+
aw
an
d
ge
nerat
es
ar
bitrary
po
ly
nom
ia
l
w
∈
F
Q
b
⁄
as
ou
t
pu
t.
D
ecrypt
(
m
X
,
T
X
)
:
On
a
giv
e
n
ci
ph
e
rtext
T
X
an
d
m
ast
er
key
m
X
=
h
x
as
in
pu
t.
T
he
D
ecrypt
functi
on
proce
ss
X
=
(
T
x
∙
h
x
)
%
b
and pro
duc
es the act
ual d
a
ta
D
=
(
X
%
a
)
as outp
ut.
The
Re
-
Enc
ryp
te
d
ci
pher
d
at
a
form
are
repres
ented
a
s foll
ow
s
:
T
X
=
(
T
x
∙
p
X
→
Y
+
aw
)
(1)
=
(
a
n
X
1
h
X
⁄
m
+
D
)
.
h
X
1
h
Y
⁄
+
aw
=
a
n
X
1
h
Y
⁄
m
+
aw
+
h
X
1
h
Y
⁄
D
Wh
e
n
t
he
re
-
e
ncr
y
pted
ci
ph
e
r
da
ta
is
dec
r
ypte
d,
t
he
rec
ei
ver
m
ulti
plies
the
ci
ph
e
r
da
ta
with
it
s
m
ast
er k
ey
h
X
is as f
ollows
:
T
Y
∙
T
X
=
(
an
X
1
h
Y
⁄
+
aw
+
h
X
1
h
Y
⁄
D
)
.
h
B
(2)
=
an
X
m
+
aw
h
Y
+
h
X
D
The
a
dd
it
io
nal
te
rm
is
get
ridd
en
by
ob
ta
ini
ng
m
od
a
an
d
t
o
obta
in
H
X
=
1
%a
we
r
equ
i
red
m
ast
er
key poly
nom
ial
h
X
, th
ere
fore
(
T
Y
∙
h
Y
)
%
a
=
(
an
X
m
+
aw
h
Y
+
h
X
D
)
%
a
=
D
, wh
ic
h
is t
he
actua
l data.
To
preve
nt
t
he
si
m
ple
ci
ph
e
r
data
on
ly
at
ta
c
k
from
the
rece
iver
we
inclu
de
the
te
rm
w
in
t
he
proces
s
of
re
-
e
nc
ryption.
Let
c
on
si
der
t
hat
the
c
iph
e
r
data
for
m
as
T
Y
=
T
x
∙
p
X
→
Y
=
T
x
∙
h
X
1
h
Y
⁄
i.e.
withou
t
arb
it
ra
ry
w
. T
hen the rec
ei
ver co
uld
c
om
pu
te
th
e m
ast
er k
ey
o
f
the se
nder
bas
ed on crit
eria t
hat
T
Y
∙
h
Y
=
T
X
∙
h
X
is
tr
ue,
since
T
Y
=
T
X
∙
p
X
→
Y
.
N
ow
le
t
c
ons
ider
t
hat
T
X
is
i
nverti
ble
m
od
b
,
t
he
m
al
ic
iou
s/i
ntr
ud
e
r
ca
n
com
pu
te
the
m
ast
er
ke
y
by
e
va
luati
ng
h
X
=
1
T
X
⁄
∙
T
Y
∙
h
Y
.
Our
m
od
el
s
su
pp
ort
m
ulti
ple
re
-
e
ncr
y
ption
s
a
nd
it
is
bi
directi
onal
i.e.
p
X
→
Y
=
h
X
1
h
Y
⁄
,
the
proxy
can
c
om
pu
te
p
Y
→
X
=
1
(
p
X
→
Y
)
=
h
X
1
h
Y
⁄
⁄
.
T
his
s
how
s
how
t
he re
-
e
nc
ryptio
n keys ar
e com
pu
te
d
(
p
X
→
Y
=
m
X
.
1
m
Y
⁄
)
, fo
r bidirect
io
nal
m
et
ho
dolo
gy.
The
propose
d
Bi
directi
on
al
P
roxy
Re
-
e
ncr
y
ption
schem
e
i
s
evaluate
d
an
d
com
par
e
d
w
it
h
existi
ng
Pr
oxy
Re
-
enc
r
ypti
on
sch
em
e
in
te
r
m
s
of
com
pu
ta
ti
on
ov
e
r
head
f
or
var
ie
d
key
an
d
data
siz
e
wh
ic
h
is
sh
ow
n
in b
el
ow sect
io
n.
4.
E
X
PERI
MEN
TAL RES
UL
T
AND A
NAL
YS
IS
We
T
he
e
xp
e
ri
m
ent
is
cond
uc
te
d
on
wind
ows
2007
e
nter
pr
ise
s
operati
ng
syst
em
,
I
-
5
3.2
G
hz
qua
d
cor
e
process
or
,
CUD
A
NVI
DIA
2GB
de
di
cat
ed
gr
a
phic
card,
8
GB
Ram
.
The
Pro
po
s
ed
a
nd
Ex
ist
ing
al
gorithm
[3
4]
is
i
m
ple
m
ented
by
usi
ng
ja
va
crypt
ogra
ph
y
li
br
a
ries
in
ecl
ipse
Ne
on
I
DE
(
versi
on
4.6
)
.
Si
m
ulati
on
is
cond
ucted
by
var
yi
ng
key
s
iz
e
and
kee
pi
ng
the
file
siz
e
co
ns
ta
nt
(1024
byte
s)
a
nd
th
e
com
pu
ta
ti
on
ti
m
e
are
no
te
d
f
or
E
nc
ryptio
n,
Re
-
enc
ryptio
n,
Decr
y
ption
a
nd
T
otal
com
pu
ta
ti
on
ti
m
e
(
m
s)
.
T
he
total
com
pu
ta
ti
on is c
om
po
sed of t
he
e
ntire
process
inclu
di
ng tim
e taken
t
o gen
e
rate
key.
In
Fig
ur
e
2
th
e
key
siz
es
a
r
e
va
ried
a
nd
s
i
m
ulati
on
is
c
onduct
ed
f
or
both
pro
posed
and
existi
ng
m
et
ho
d.
T
he
pe
rfor
m
ance
i
m
pro
vem
ent
of
pro
po
se
d
m
od
el
fo
r
e
ncr
ypti
on
wh
e
n
key
siz
e
is
(2
56
-
1536)
is
16.67%
,
f
or
(
256
-
40
94)
is
13.05%
a
nd
f
or
(32
0
-
4094)
is
14.53%
over
E
xisti
ng
m
od
el
.
An
a
ve
rag
e
i
m
pr
ovem
ent
of
14.
75%
is
ac
hieve
d
by
Pro
pose
d
Mo
del
ov
er
E
xisti
ng
M
odel
interm
of
c
om
pu
ta
ti
on
ti
m
e
for
encr
y
ption.
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
Secure
and
Eff
ic
ie
nt Bi
-
Direc
ti
on
al
Prox
y R
e
-
Ency
rp
ti
on
T
echn
i
qu
e
(C
hadr
ak
al
a)
1147
Figure
2. Com
pu
ta
ti
on ti
m
e fo
r
En
c
ryptio
n f
or v
a
ried key
s
iz
e
In
Fig
ur
e
3
th
e
key
siz
es
a
r
e
va
ried
a
nd
s
i
m
ulati
on
is
c
onduct
ed
f
or
both
pro
posed
and
existi
ng
m
et
ho
d.
The
pe
rfor
m
ance
i
m
pro
vem
ent
of
pro
po
se
d
m
odel
fo
r
re
-
e
nc
ryption
w
hen
ke
y
siz
e
is
(2
56
-
1536)
i
s
94.32%
,
f
or
(
256
-
40
94)
is
95.78%
a
nd
f
or
(32
0
-
4094)
is
95.47%
over
E
xisti
ng
m
od
el
.
An
a
ve
rag
e
i
m
pr
ovem
ent
of
94.
001%
is
achieve
d
by
Propose
d
Mo
del
ov
e
r
E
xisti
ng
Mod
el
inte
rm
of
c
om
pu
ta
ti
on
ti
m
e
for re
-
e
ncr
y
ption.
Figure
3. Com
pu
ta
ti
on ti
m
e fo
r
Re
-
e
ncr
ypti
on for
va
ried
key
size
In
Fig
ur
e
4
th
e
key
siz
es
a
r
e
va
ried
a
nd
s
i
m
ulati
on
is
c
onduct
ed
f
or
both
pro
posed
and
existi
ng
m
et
ho
d.
T
he
pe
rfor
m
ance
i
m
pro
vem
ent
of
pro
po
se
d
m
od
el
fo
r
decr
ypti
on
wh
e
n
key
siz
e
is
(2
56
-
1536)
is
18.97%
,
f
or
(
256
-
40
94)
is
21.26%
a
nd
f
or
(
320
-
4094)
is
20.64%
over
E
xisti
ng
m
od
el
.
An
a
ve
rag
e
i
m
pr
ovem
ent
of
20.
208%
is
achieve
d
by
Propose
d
Mo
del
ov
e
r
E
xisti
ng
Mod
el
inte
rm
of
c
om
pu
ta
ti
on
ti
m
e
for decry
ption.
Figure
4. Com
pu
ta
ti
on ti
m
e fo
r
D
ec
ryptio
n for
var
ie
d key
siz
e
0
0
.05
0
.1
0
.15
0
.2
0
.25
0
.3
0
.35
2
5
6
-15
3
6
2
5
6
-40
9
4
3
2
0
-40
9
4
Co
m
p
u
tatio
n
tim
e
(m
s)
Key
size
(bits
)
Encry
pt
i
on
Tim
e
Exis
tin
g
Mod
el
Pr
o
p
o
sedM
o
d
el
0
0
.1
0
.2
0
.3
0
.4
0
.5
0
.6
2
5
6
-15
3
6
2
5
6
-40
9
4
3
2
0
-40
9
4
Co
m
p
u
tatio
n
tim
e
(m
s)
Key
size
(bits
)
Re
-
encry
pt
i
on
Tim
e
Exis
tin
g
Mod
el
Pr
o
p
o
sedM
o
d
el
0
0
.01
0
.02
0
.03
0
.04
0
.05
2
5
6
-15
3
6
2
5
6
-40
9
4
3
2
0
-40
9
4
Co
m
p
u
tatio
n
tim
e
(m
s)
Key
size
(bits
)
Decry
pt
i
on
Tim
e
Exis
tin
g
Mod
el
Pr
o
p
o
sedM
o
d
el
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.
12
, N
o.
3
,
Dece
m
ber
2
01
8
:
1
1
43
–
1
1
50
1148
In
Fig
ur
e
5
th
e
key
s
iz
es
a
r
e
va
ried
a
nd
s
i
m
ulati
on
is
c
onduct
ed
f
or
both
pro
posed
and
existi
ng
m
et
ho
d.
T
he
pe
rfor
m
ance
im
pro
vem
ent
of
pro
posed
m
od
el
f
or
key
ge
ner
a
ti
on
wh
e
n
key
siz
e
is
(
256
-
15
36)
is
23.08%
,
f
or
(
256
-
40
94)
is
25.12%
a
nd
f
or
(32
0
-
4094)
is
24.43%
over
E
xisti
ng
m
od
el
.
An
a
ve
rag
e
i
m
pr
ovem
ent
of
24.
21%
is
ac
hieve
d
by
Pro
pose
d
Mo
del
ov
er
E
xisti
ng
M
odel
interm
of
c
om
pu
ta
ti
on
ti
m
e
for
key g
e
ne
rati
on.
Figure
5. Com
pu
ta
ti
on ti
m
e fo
r
K
ey
Ge
ner
a
ti
on
for varie
d key si
ze
In
Fig
ur
e
6
th
e
key
siz
es
a
r
e
va
ried
a
nd
s
i
m
ulat
ion
is
c
onduct
ed
f
or
both
pro
posed
and
existi
ng
m
et
ho
d.
T
he
pe
rfor
m
ance
i
m
pro
vem
ent
of
pro
po
se
d
m
od
el
fo
r
Pro
xy
ke
y
gen
erati
on
w
hen
key
siz
e
is
(2
56
-
1536)
is
33.
33%,
for
(
256
-
40
94)
is
35.17%
and
for
(
320
-
4094
)
is
36
.
25
%
ov
e
r
existi
ng
m
od
el
.
An
a
ver
a
ge
i
m
pr
ovem
ent
of
34.
92%
is
ac
hieve
d
by
Pro
pose
d
Mo
del
ov
er
E
xisti
ng
M
odel
interm
of
c
om
pu
ta
ti
on
ti
m
e
for
Pr
oxy
key re
ge
ner
at
io
n.
In
Fig
ur
e
7
th
e
key
siz
es
a
r
e
va
ried
a
nd
s
i
m
ulati
on
is
c
onduct
ed
f
or
both
pro
posed
and
existi
ng
m
et
ho
d.
T
he
pe
rfor
m
ance
i
m
pro
vem
ent
o
f
pro
po
se
d
m
od
el
wh
en
key
siz
e
is
(2
56
-
1536)
is
43.33%
,
f
or
(
256
-
4094)
is
47.02
%
an
d
f
or
(32
0
-
4094)
is
51.
03%
over
Exis
ti
ng
m
od
el
.
A
n
aver
a
ge
im
pr
ovem
ent
of
52.
82%
is
achieve
d by P
r
opos
e
d
M
od
el
ov
e
r
E
xisti
ng
Mod
el
i
nterm
o
f
total
co
m
pu
t
at
ion
ti
m
e.
Figure
6. Com
pu
ta
ti
on ti
m
e fo
r
K
ey
Ge
ner
a
ti
on
for varie
d key si
ze
Figure
7. Total
co
m
pu
ta
ti
on ti
m
e fo
r
v
a
ried
key
size
0
1
2
3
4
2
5
6
-15
3
6
2
5
6
-40
9
4
3
2
0
-40
9
4
Co
m
p
u
tatio
n
tim
e
(m
s)
Key
size
(bits
)
Key
Generati
on
Tim
e
Exis
tin
g
Mod
el
Pr
o
p
o
sedM
o
d
el
0
0
.1
0
.2
0
.3
0
.4
0
.5
0
.6
0
.7
0
.8
2
5
6
-15
3
6
2
5
6
-40
9
4
3
2
0
-40
9
4
Co
m
p
u
tatio
n
tim
e
(m
s)
Key
size
(bits
)
Proxy
Key
Generati
on
Tim
e
Exis
tin
g
Mod
el
Pr
o
p
o
sedM
o
d
el
0
1
2
3
4
5
6
2
5
6
-15
3
6
2
5
6
-40
9
4
3
2
0
-40
9
4
Co
m
p
u
tatio
n
tim
e
(m
s)
Key
size
(bits
)
Total
Com
put
at
i
on
Tim
e
For Vari
ed key
si
ze
Exis
tin
g
Mod
el
Pr
o
p
o
sedM
o
d
el
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
Secure
and
Eff
ic
ie
nt Bi
-
Direc
ti
on
al
Prox
y R
e
-
Ency
rp
ti
on
T
echn
i
qu
e
(C
hadr
ak
al
a)
1149
To
f
ur
t
her
ev
al
uate
robu
st
ne
ss
of
ou
r
str
at
egy
the
file
siz
e
is
var
ie
d
and
keep
i
ng
t
he
key
siz
e
const
ant
at
(25
6
-
4094)
an
d
e
xp
e
rim
ent
are
cond
ucted.
I
n
Figure
8
t
he
fi
le
siz
es
are
va
r
ie
d
an
d
sim
ula
ti
on
is
cond
ucted
f
or
bo
t
h
pro
po
se
d
and
existi
ng
m
et
hod.
Th
e
pe
r
form
ance
i
m
pr
ov
em
ent
of
propose
d
m
od
el
wh
e
n
file
siz
e
is
(1
28
byte
s)
is
57.
86%,
f
or
(25
6
byte
s)
is
52.35%
an
d
f
or
(
512
byte
s)
is
52.
35%
an
d
f
or
(10
24
byte
s)
is
54.
76
ov
e
r
E
xisti
ng
m
od
el
.
A
n
a
ve
rag
e
im
pr
ove
m
ent
of
55.
18
%
is
achieve
d
by
Propose
d
Mod
el
o
ve
r
E
xisti
ng
Mod
el
i
n
te
rm
s of total c
om
pu
ta
ti
on
ti
m
e.
Figure
8. Total
co
m
pu
ta
ti
on ti
m
e fo
r
v
a
ried
fi
le
size.
5.
CONCL
US
I
O
N
Pr
ovi
ding
secu
rity
to
data
with
le
ast
com
pu
ta
ti
on
over
hea
d
is
m
os
t
desired
.
T
he
existi
ng
te
chn
iq
ue
adopts
unidi
re
ct
ion
al
base
d
p
roxy
re
-
e
nc
ryp
ti
on
te
ch
nique.
To
overc
om
e
t
he
qua
ntu
m
se
cur
it
y
issue
of p
ubli
c
key
cry
ptogra
ph
y
m
any
existi
ng
pro
xy
re
-
enc
ryptio
n
ap
proac
hes
ha
ve
adopted
la
tt
ice
based
crypt
ogra
phy
m
echan
ism
whic
h
at
ta
ined
sign
i
ficant
perform
ance
i
m
pr
ov
e
m
ent
bu
t
t
hes
e
te
ch
ni
ques
a
r
e
unidirect
io
na
l
and
induce
decr
y
ption
e
rro
r
f
or
m
ul
ti
ple
re
-
e
nc
ryptio
n.
Her
e
we
pro
posed
a
Bi
directi
onal
Prox
y
Re
-
en
c
ryptio
n
schem
e
by
adopting
la
tt
ic
e
based
c
rypto
grap
hy
te
ch
nique
wh
ic
h
is
m
ulti
-
ho
p.
T
he
pro
pose
d
m
od
el
ac
hieve
s
sign
ific
a
nt
pe
r
fo
rm
ance
i
m
pr
ov
em
ent
in
te
r
m
s
of
com
pu
ta
ti
on
ov
e
rhead
ov
e
r
e
xisti
ng
m
od
el
.
Si
m
ulati
on
is
cond
ucted
by
var
yi
ng
key
and
file
siz
e
an
aver
a
ge
im
pro
vem
ent
of
52.82%
an
d
55.
18
re
sp
ect
iv
el
y
is
achieve
d
by
pr
opos
e
d
Pro
xy
Re
-
enc
ryptio
n
m
od
el
ov
er
exi
sti
ng
m
od
el
in
t
er
m
of
com
pu
ta
ti
on
ove
rh
e
ad.
I
n
fu
t
ur
e
we w
ou
l
d
e
xten
d our
prox
y R
e
-
E
ncr
yp
ti
on
on to
cl
ou
d
e
nv
i
ronm
ent an
d eval
uate th
e p
e
rfor
m
ance.
REFERE
NCE
S
[1]
Giuseppe
Atenie
se,
Kevin
Fu,
Matt
h
ew
Gree
n,
a
nd
Sus
an
Hohen
ber
ger
.
“
Im
prove
d
Prox
y
Re
encr
y
pt
ion
Schemes
with
Appli
ca
t
ion
s to
Secur
e
Distr
ibut
ed
Storage”.
ACM
TISSEC
,
9
(1):1
-
30,
Fe
b
20
06.
[2]
Ton
y
Sm
it
h
.
“
DV
D
Jon:
bu
y
DRM
-
le
ss
T
rac
ks
from
Apple
i
Tune
s
Marc
h
18,
20
05”.
Avai
la
b
le
at
htt
p://ww
w.t
her
e
giste
r.co.
uk
/200
5/03/
18/itunes_p
y
m
usiqu
e.
[3]
Giuseppe
Atenie
se
,
Kevin
Fu,
Matt
h
ew
Gree
n,
a
nd
Sus
an
Hohen
ber
ger
.
“
Im
prove
d
Prox
y
Re
encr
y
pt
ion
Schemes
with
Appli
ca
t
ion
s to
Secur
e
Distr
ibut
ed
Storage”.
In
NDSS
,
p
age
s
29
-
43,
2005
.
[4]
M.
Blaze
,
G.
Bl
eumer
and
M
.
S
tra
uss
,
“
Diver
t
ib
le
Proto
col
s
and
Atom
ic
Prox
y
Cr
y
ptogr
aph
y
”
,
Proc.
Adv
an
ce
s
in
Cryptol
ogy
-
EU
ROCR
Y
PT
’
98
,
Springer,
H
ei
de
l
ber
g,
1998
,
pp.
1
27
-
144.
[5]
Matt
Bl
aze and M
art
in
Str
auss.
“
Atom
ic
prox
y
cr
y
ptogr
aph
y
”
.
Te
chni
ca
l
report
,
A
T
&
T
Re
search
,
1997.
[6]
M.
Bla
ze,
G.
Ble
um
er
,
and
M.
Strauss,
“Dive
rti
ble
proto
col
s
and
at
om
ic
pro
x
y
cr
y
ptogr
aph
y,
”
in
Adv
an
ce
s
in
Cryptol
ogy
–
EU
ROCR
Y
PT’98.
S
pringer
,
1998
,
p
p.
127
–
144
.
[7]
H.
Xiong,
Z
.
C
hen,
and
F.
L
i,
“
Eff
ic
ie
n
t
priv
acy
pre
s
erv
ing
aut
h
ent
i
ca
t
ion
proto
col
for
v
ehi
cu
lar
comm
unic
at
io
ns
wit
h
trustworth
y,
”
S
ec
uri
ty
an
d
Comm
unic
ati
on
Net
works
,
vo
l. 5, no. 12, pp. 1441
–
1451,
2012
.
[8]
Nee
la
m
bike
S,
Chandri
ka
J,
“
An
Eff
icent
Di
stribut
ed
Med
iu
m
Acc
ess
Cont
rol
for
V2I
VA
NET”
,
Indone
si
an
Journal
of
Elec
t
rical
Engi
n
ee
rin
g
and
Computer
Sci
en
ce
(
IJE
EC
S)
.
Vol.
9,
No.
3,
Marc
h
2018,
p
p.
742~751
ISSN
:
2502
-
4752,
DO
I:
10.
11591
/i
j
eec
s.v9.
i3.
pp742
-
75
1.
[9]
S.
Lee,
H
.
Park
,
and
J.
Kim
,
“
A
sec
ure
and
m
ut
ual
profi
ta
bl
edr
m
int
ero
p
era
b
il
i
t
y
sche
m
e,
”
in
Proce
ed
ings
of
I
EEE
Symposium on
C
omputers and
C
omm
unic
ati
ons. IEEE
, 2
010
,
pp
.
75
–
80.
[10]
G.
Ta
b
an,
A
.
A.
C´
ard
ena
s,
and
V.
D.
Gli
gor,
“
Towa
rds
a
sec
ur
e
and
i
nte
rope
r
abl
e
dr
m
arc
hitect
ur
e,”
in
Proce
ed
ings o
f
t
he
ACM
Worksh
op
on
Digi
tal Rights Manage
me
nt
.
ACM
,
2006,
pp.
69
–
78
.
[11]
Nur
Haz
wani
Hus
sin,
Aziz
an
,
M.M,
Ali,
A,
Albre
em,
M.
A.
M,
“
Enc
r
y
pti
o
n
Te
chni
qu
es
and
W
ire
le
ss
Po
we
r
Tra
nsfer
Schem
es”
,
Indone
sian
Journal
of
Elec
t
rical
Engi
n
ee
rin
g
and
Computer
Sci
en
ce
(
IJE
EC
S)
Vol.
9,
No.
1,
Janua
r
y
2018
,
p
p.
183~190 ISS
N:
2502
-
4752,
DO
I:
10.
11591/
ij
e
ec
s.v9.i1.
pp183
-
190.
0
1
2
3
4
5
1
2
8
2
5
6
5
1
2
1
0
2
4
Co
m
p
u
tatio
n
tim
e
(m
s)
File
size
(bytes)
Total
Com
put
at
i
on
Tim
e
For Vari
ed Fi
l
e
Siz
e
Exis
tin
g
Mod
el
Pr
o
p
o
sedM
o
d
el
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.
12
, N
o.
3
,
Dece
m
ber
2
01
8
:
1
1
43
–
1
1
50
1150
[12]
G.
Ateni
ese
,
K.
Fu,
M.
Gree
n,
and
S.
Hohenbe
rge
r
“
Im
prove
d
prox
y
r
e
-
encr
y
pt
ion
sche
m
es
wit
h
appl
i
ca
t
ions
t
o
sec
ure
distr
ibut
e
d
storage
,
”
AC
M
Tr
ansacti
ons
on
Information
and
Syste
m
Sec
u
rity
(
TISSEC’06)
,
vol.
9,
no.
1
,
pp.
1
–
30,
2006
.
[13]
Y.
-
R.
Chen,
J.
T
y
g
ar,
and
W
.
-
G.
Tz
eng
,
“
Se
cur
e
group
ke
y
m
a
nage
m
ent
using
uni
-
direct
ion
al
p
rox
y
re
enc
r
y
p
ti
o
n
sche
m
es,
” in
I
E
EE
In
te
rnationa
l
Confe
ren
ce on Com
pute
r Comm
unic
ati
ons.
IE
EE
,
2011,
pp.
19
52
–
1960.
[14]
R.
Cane
t
ti
and
S.
Hohenbe
rge
r,
“
Chosen
-
ci
pher
te
xt
sec
ur
e
proxy
re
-
enc
r
y
pt
ion,”
in
Proce
ed
in
g
s
of
the
14th
ACM
conf
ere
n
ce on
C
omputer
and
co
mm
unic
ati
ons se
curit
y
.
ACM
,
20
07,
pp
.
185
–
194
.
[15]
B.
L
ibe
rt
and
D.
Vergna
ud
.
“
Unidire
c
ti
ona
l
Chos
en
-
Ciphe
r
te
xt
Se
cur
e
Prox
y
R
e
-
enc
r
y
pt
ion”
.
In
Proc.
o
f
PKC'08
,
LN
CS
4929
,
pp
.
360
-
379,
Spring
er
-
Verl
ag
,
2008
.
[16]
J.
Bae
k,
R.
Saf
avi
-
Nain
i,
and
W
.
Sus
il
o.
“
Cer
ti
ficat
el
ess
Public
Ke
y
En
cr
y
pt
i
on
without
Pairi
ng”.
In
Proc.
of
ISC'05
.
LN
CS
3
650
,
pp
.
134
-
14
8,
Springer
-
V
erlag,
2005
.
[17]
E.
Kirshanova
,
“
Prox
y
re
-
enc
r
y
pt
ion
from
la
tt
i
ce
s
,
”
in
Pub
lic
Key
Cryptography
–
PKC’14.
Spring
e
r
,
2014,
pp.
77
–
94.
[18]
Rege
v,
"O
.
”On
la
ttic
es,
learni
ng
with
err
ors,
ran
dom
li
nea
r
codes
,
and
cr
y
ptograph
y
”
.
In:
Gabow
,
H.N.
,
Fagi
n,
R
.
(
eds.
)
ST
OC
,
pp.
84
–
93.
ACM
(2005).
[19]
Brake
rski,
Z.,
L
angl
ois,
A
.
,
Pe
i
ker
t,
C.
,
Reg
ev,
O.,
St
ehl
´
e,
D.
“
Cla
ss
ic
al
h
ard
ness
o
f
le
arn
ing
with
err
ors”
.
I
n:
Bone
h,
D., R
oug
hgarden,
T.
,
Fe
i
genbaum,
J. (
eds.
)
STO
C
,
pp.
575
–
584.
ACM
(20
13).
[20]
Rcke
rt
,
M.,
Sch
nei
der
,
M.
“
Esti
m
at
ing
the
sec
u
rity
of
l
attice
-
b
ase
d
cr
y
ptos
y
s
tem
s”.
Cryptol
ogy
eP
rint
Archive
,
Report
2010
/137
(2010), htt
p
:/
/
ep
ri
nt.ia
cr
.
org/
.
[21]
Micc
i
anc
io
,
D.
,
Rege
v,
O.
“
L
at
t
i
ce
-
base
d
cr
y
p
tog
rap
h
y
”.
In:
B
ernstei
n,
D.J.,
Bu
ch
mann,
J
.
,
Dahm
en,
E.
(
eds.
)
Post
-
Quantum Crypt
o
graphy
,
pp
.
147
–
191.
Springer
,
Heide
lb
erg
(200
9).
[22]
Li
ndner
,
R.
,
Pei
ker
t,
C
.
“
Bet
t
er
ke
y
size
s
(an
d
a
tt
a
cks)
for
LWE
-
base
d
encr
y
pti
o
n”.
In:
K
iay
i
as,
A.
(
ed.
)
CT
-
RSA
2011
.
LNCS,
vo
l.
6558
,
pp
.
319
–
339.
Springer
,
H
ei
de
lbe
rg (2011)
.
[23]
T.
Fe
i,
L.
Hongda,
and
J.
Chan
g,
“
Multi
-
hop
u
nidi
re
ct
ion
al
pro
x
y
r
e
-
en
cr
y
ption
from
m
ult
il
in
ear
m
aps”
,
I
EIC
E
Tr
ansacti
ons on
Fundament
als of E
lectronic
s,
Co
mm
unic
ati
ons and
Computer
Scienc
es
,
vo
l.
98
,
n
o.
2,
pp
.
762
–
76
6,
2015.
[24]
S.
Garg,
C.
Gen
tr
y
,
and
S.
Halevi,
“
Candi
da
te
m
ult
il
inear
m
ap
s
from
ide
al
latt
ic
es.
”
in
Adv
anc
es
in
Cryptol
og
y
–
Eurocry
pt’13
,
v
ol.
7881
.
Spring
er,
2013
,
pp
.
1
–
1
7.
[25]
J.
Shao,
P.
Li
u
,
G.
W
ei
and
Y.
L
ing,
“
Anon
y
m
ous
prox
y
re
enc
r
y
p
ti
on”
,
Sec
uri
ty
a
nd
Comm
unic
ation
Net
works
,
vo
l.
5,
no
.
5
,
2012
,
p
p.
439
-
449
.
[26]
Bold
y
r
eva,
M.
Fis
chl
in
,
A.
Palac
io
and
B.
W
ari
n
schi,
“
A
Closer
Look
at
PK
I:
Secur
ity
and
Eff
i
cienc
y
”
,
Proc.
PK
C
2007
Springe
r,
Heide
lb
erg
,
200
7,
pp
.
458
-
475
[27]
C.
-
K.
Chu
and
W
.
-
G.
Tz
eng
,
“
Ide
nti
t
y
-
B
ase
d
Prox
y
Re
-
en
cr
ypti
on
w
it
hout
R
andom
Orac
le
s”
,
Proc.
ISC
2007,
Springer
,
Heid
elberg,
2007
,
pp.
1
89
-
202.
[28]
T.
Matsuo,
“
Prox
y
Re
-
enc
r
y
pt
i
on
Sy
st
ems
for
Ide
nti
t
y
-
B
ase
d
Enc
r
y
pti
on
”,
Proc.
PA
I
RING
2007,
Springer
,
Heide
lb
erg
,
200
7,
pp
.
247
-
267
.
[29]
M.
Gree
n
and
G
.
Aten
ie
se
,
“
Ide
nti
t
y
-
Based
Proxy
R
e
-
En
cr
y
pti
on
”,
Proc.
ACNS
2
007,
Springer,
Heide
lb
erg
,
200
7,
pp.
288
-
306
.
[30]
K.
Li
ang,
Z
.
Li
u
,
X.
Ta
n,
D.S.
W
ong
and
C.
Ta
ng,
“
A
CCA
-
Secur
e
ide
n
ti
t
y
-
b
ase
d
condi
ti
o
nal
p
rox
y
re
-
enc
r
y
pt
i
on
without
r
andom ora
cles”,
Proc
.
I
CISC,
2012
,
pp.
231
-
146.
[31]
Moham
m
ad
Rasm
i
AL
-
Mous
a,
Fadi
Al
-
sal
amee
n,
Khal
ed
Al
-
Qa
wasm
i,
“
Us
ing
Enc
r
y
pt
ion
Squa
re
Ke
y
wi
th
On
e
-
dimensional
Ma
tri
x
for
Enh
anc
i
ng
RGB
Color
Im
age
Enc
r
y
pt
i
on
-
Dec
r
y
pti
on
”,
Indone
sian
Jou
rnal
of
El
e
ct
ri
c
al
Engi
ne
ering
and
Computer
Sci
enc
e
(
IJE
ECS)
Vol.
9,
No.
3,
Marc
h
2018,
pp.
771~777
ISS
N
:
2502
-
4752,
DO
I:
10.
11591/ijeecs.
v9.
i3.
pp771
-
777
.
[32]
T.
Matsuda
,
R.
Nishim
aki
and
K.
Ta
nak
a,
“
CCA
Proxy
Re
-
E
ncr
y
p
ti
on
witho
ut
Bil
inear
Map
s
in
the
Standa
r
d
Model”
,
Proc
.
P
KC 2010
Spring
er
,
Heid
el
b
erg
,
2
010,
pp
.
261
-
27
8.
[33]
V.
Kirta
ne
and
C.
P.
Ranga
n
,
“
RS
A
-
TBOS
signcr
y
p
ti
on
with
prox
y
re
-
enc
r
y
p
ti
on”
,
Proceedi
n
gs
o
f
the
8th
A
CM
workshop on
Di
git
al
righ
ts man
ageme
nt
(
DRM
’
08)
,
2008,
pp
.
5
9
-
66.
[34]
Aono,
Y.,
Bo
y
en,
X.,
Phong,
L.
T
.
,
W
ang,
L.
“
Ke
y
-
pr
iva
t
e
prox
y
re
-
enc
r
ypti
on
under
L
W
E”
.
In:
Paul,
G.,
Vaude
nay
,
S
.
(
ed
s.)
INDO
CRY
PT
,
vol
.
8250
,
pp
.
1
–
18.
Springer
,
H
ei
de
lbe
rg,
2013
.
Evaluation Warning : The document was created with Spire.PDF for Python.