Internati
o
nal
Journal of Ele
c
trical
and Computer
Engineering
(IJE
CE)
Vol.
5, No. 6, Decem
ber
2015, pp. 1468~
1
471
I
S
SN
: 208
8-8
7
0
8
1
468
Jo
urn
a
l
h
o
me
pa
ge
: h
ttp
://iaesjo
u
r
na
l.com/
o
n
lin
e/ind
e
x.ph
p
/
IJECE
Password Authentication
for
Multicast Host Using Zero
Knowledge Proof
S
eet
ha
R
a
n
gan
a
t
h
a
n
,
R
.
Sara
va
na
n
Scho
o
l
of
Inf
o
rmatio
n
Technolo
g
y
an
d En
g
i
neer
ing
,
VIT University
, Vellor
e
,
Tam
il Nadu
, Ind
i
a
Article Info
A
B
STRAC
T
Article histo
r
y:
Received Feb 13, 2015
Rev
i
sed
Ju
l 17
,
20
15
Accepte
d Aug 1, 2015
The p
a
s
s
w
ord which is
a m
o
re s
ecur
e
and valuable data shou
ld be h
i
g
h
l
y
protected from eavesdropper
.
This pape
r presen
ts how password r
e
quired f
o
r
authen
tic
ation of
m
e
m
b
ers
of group com
m
unicati
on is
s
ecurel
y
d
e
liv
ered
b
y
the source or
i
n
itiator of
the
group. Th
e p
a
ssword deliver
y uses zer
o
knowledge proo
f and sent to the
group member in an encr
y
p
ted f
o
rmat using
cipher blo
c
k mode encr
y
p
tion. The password deliver
ed is a One Time
Password
which can be used for certain
amount of time in order
to ensure a
highly
secure co
mmunication en
vironment amon
g the group.
Keyword:
Au
t
h
en
tiction
One
tim
e
pass
wo
rd
Prove
r
Verifie
r
Zer
o
kno
w
l
ed
ge pr
oo
f
Copyright ©
201
5 Institut
e
o
f
Ad
vanced
Engin
eer
ing and S
c
i
e
nce.
All rights re
se
rve
d
.
Co
rresp
ond
i
ng
Autho
r
:
Seetha. R
,
Scho
o
l
of
Inf
o
rmatio
n
Technolo
g
y
an
d Eng
i
n
eer
i
n
g,
VIT Un
iv
ersity,
Katp
ad
i, Vellore, 63
200
7,
Tamiln
ad
u
,
In
d
i
a.
Em
a
il: rseeth
a
@v
it.ac.i
n
1.
INTRODUCTION
A
zero
-
kn
ow
led
g
e
p
a
ssw
o
rd
p
r
oo
f
(ZK
P
P)
[
1
], [2
] is a co
llab
o
r
a
tiv
e m
e
t
h
od
fo
r
t
h
e pr
ov
er
to
p
r
ov
e
t
o
t
h
e ve
ri
fi
er
t
h
at
i
t
kno
ws t
h
e pa
ssw
or
d,
wi
t
h
o
u
t
re
veal
i
ng a
n
y
ot
her i
n
f
o
rm
at
i
on t
o
t
h
e ve
ri
fi
er
. A
ZK
P
P
pre
v
e
n
t
s
any
one fr
om
veri
fy
i
ng g
u
esses f
o
r t
h
e pass
wo
rd
. A com
m
on use of a zero
-
k
n
o
w
l
e
d
g
e pas
s
w
o
r
d
p
r
oo
f in
au
then
ticatio
n
system
s
in
clu
d
e
th
e p
r
ov
er
wan
t
s
t
o
pro
v
e
its id
en
tity to
th
e v
e
rifier (Sou
rce
or ho
st,
th
e gro
u
p
m
e
m
b
er
)
u
s
i
n
g a p
a
sswo
rd
w
ith
ou
t allow
i
ng an
yon
e t
o
lear
n an
yth
i
n
g
ab
ou
t th
e p
a
ssw
o
rd
gene
rat
e
d
an
d
del
i
v
ere
d
t
o
t
h
em
.
Passwo
r
d
s
in
var
i
ou
s fo
r
m
ats
[
3
],
[4
] ar
e imp
o
r
t
an
t
data for on
e to
g
e
t auth
enticated by
them
selves
to access valuable services and
resources.
The One Ti
m
e
Password (OTP) whic
h is used nowadays
is valid
fo
r
onl
y
ce
rt
ai
n am
ount
o
f
t
i
m
e or
fo
r
one
sessi
on
.
OTP
pr
o
v
i
d
e a
hi
gh
l
y
secure e
n
vi
r
onm
ent
com
p
ari
n
g t
o
t
h
e t
r
a
d
i
t
i
onal
st
at
i
c
passw
or
ds
whi
c
h ca
n
be easi
l
y
t
r
ace
d
by
eaves
d
r
o
ppe
rs.
S
u
c
h
O
T
P i
s
hi
g
h
l
y
u
s
eful
i
n
sm
art
card aut
h
ent
i
cat
i
o
n,
on
l
i
n
e fu
n
d
t
r
a
n
s
act
i
ons a
n
d s
o
o
n
.
OTP
ge
ne
rat
i
on i
s
car
ri
ed
out
usi
n
g
ps
eud
o
ran
d
o
m
num
ber
gene
rat
o
r a
n
d
has
h
f
u
nct
i
o
ns t
h
at
are
di
f
f
i
c
ul
t
t
o
re
vers
e. O
T
P ca
n
be
ge
nerat
e
d
bas
e
d
on
t
i
m
e
sy
nchr
o
n
i
zat
i
on bet
w
een
t
h
e so
urce a
n
d t
h
e pa
rt
i
c
i
p
at
i
ng
host
or
bas
e
d o
n
p
r
e
v
i
o
us
passw
o
r
d
or
b
a
sed
on
som
e
chal
l
e
nge
s t
o
ge
nerat
e
OT
P ra
n
dom
l
y
.
In
th
is
p
a
p
e
r th
e p
a
sswo
rd
deliv
ered
b
y
the p
r
o
v
e
r (sou
rce/in
itiato
r o
f
th
e g
r
ou
p) is an
OTP. Th
e
OTP ge
ne
rat
e
d
i
s
sent
t
o
t
h
e
gr
o
up m
e
m
b
er requi
ri
n
g
aut
h
ent
i
cat
i
on i
n
a
n
enc
r
y
p
t
e
d f
o
rm
usi
ng ci
p
h
e
r
bl
oc
k
ch
ain
i
ng
m
o
d
e
(CBC) alon
g
with
o
t
h
e
r
d
e
tails lik
e n
o
n
ce o
f
jo
in
ing
h
o
s
t
,
no
n
ce of
source/in
itiato
r
and
ho
st
id
.
The pa
pe
r i
s
orga
ni
sed as
fol
l
ows:
Sect
i
o
n II det
a
i
l
s
t
h
e a
l
go
ri
t
h
m
s
used i
n
t
h
e pr
op
os
ed m
odel
,
Sectio
n III fo
cu
ses
on
related
work
carried ou
t, and
Sectio
n IV
propo
ses th
e au
t
h
en
ticatio
n
al
g
o
rithm
th
a
t
u
s
es
zero
k
now
ledg
e p
r
oo
f
.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
J
ECE
I
S
SN
:
208
8-8
7
0
8
Pa
ssw
o
r
d Au
then
tica
tion
fo
r
Mu
ltica
s
t Ho
st
U
s
ing
Zero
K
n
o
w
led
g
e
Pro
o
f (S
eeth
a
Ranga
na
than
)
1
469
2. E
X
ISTI
NG
ALGO
RITH
MS
A
N
D
PR
OTOC
OLS F
O
R
A
U
THEN
TICATI
O
N
2.
1. T
i
me
-b
as
ed One
-ti
me
P
a
ssw
or
d
Al
g
o
r
i
t
hm
(T
OT
P)
TOTP
[5] algorithm
co
m
putes a on
e-tim
e password (OT
P
) using a s
h
a
r
ed secret key a
nd the curre
nt
tim
e
. TOTP is an exam
ple of
a has
h
-base
d
message au
th
en
ticatio
n
co
d
e
(HM
A
C).
In
t
h
is alg
o
r
ith
m
a secret
k
e
y is co
m
b
in
ed
with
t
h
e cu
rren
t tim
esta
m
p
u
s
in
g
a
cr
y
p
t
o
g
r
a
phi
c
h
a
sh f
u
nct
i
on t
o
ge
ner
a
t
e
a o
n
e-t
i
m
e
pass
wo
rd
. T
h
e
m
a
i
n
adva
nt
a
g
e i
s
TO
TP
pass
words are s
h
ort-lived
pass
words.
Param
e
ters use
d
in
T
O
TP:
TC = (un
i
x
time(now)
-
un
ix
time(T0
)) / TS
TOTP
=
HO
T
P
(Sec
retKey
,
TC) (
H
OTP
is
defi
ned
bel
o
w
)
TOTP
-V
al
ue =
TOT
P
m
od
10
d,
w
h
ere
d
i
s
t
h
e desi
re
d
n
u
m
b
er
of
di
gi
t
s
of
t
h
e
one
-t
i
m
e passw
or
d.
Wh
ere TC
– integ
e
r tim
e co
un
ter, T0-Start
ti
m
e
, TS – ti
m
e
step
cou
n
t
Let K
be a
secret key and C
be a counter
HM
AC (
K
,C
)
= SH
A1
(K
⊕
0x
5c
5c..
.
∥
SHA1(K
⊕
0x3636...
∥
C)) be
an HM
AC calculated wit
h
the SHA-1 cry
p
togra
p
hic has
h
algorith
m
.
A Trun
cate
fun
c
tio
n selects 4 b
y
tes fro
m
th
e resu
lt of th
e HM
AC i
n
a de
fi
ne
d m
a
nner
suc
h
t
h
at
H
M
AC
–
bas
e
d
One
Ti
m
e
Passwo
r
d
(
H
OTP
)
i
s
gi
ven
as
HOT
P (K
,C) =
Tr
uncate
(
H
M
AC(K
,C
))
& 0x7FF
FFF
FF.
The
m
a
s
k
is
use
d
t
o
set the m
o
st
si
gni
fi
ca
nt
bi
t
t
o
0, t
o
pre
v
e
n
t
t
h
e n
u
m
b
er f
r
o
m
bei
ng i
n
t
e
r
p
ret
e
d as
ne
gat
i
ve.
2.
2. Ci
pher
B
l
ock Ch
ai
ni
n
g
(CB
C
)
CBC [1
] is the m
o
st wid
e
ly u
s
ed
b
l
o
c
k
cip
h
e
r m
o
d
e
.
In
th
is m
o
d
e
of en
cryp
tion plain
tex
t
i
s
rando
m
i
zed
u
s
in
g
prev
i
o
u
s
ci
p
h
e
r tex
t
b
l
o
c
k. Th
e ad
v
a
n
t
age of CBC is equ
a
l p
l
ai
n
tex
t
blo
c
k
s
g
e
t en
cryp
t to
d
i
fferen
t
ciph
er tex
t
b
l
o
c
k
s
, hen
ce
redu
cing
t
h
e ch
an
ce of at
tack
in
g. CBC i
s
d
e
fin
e
d
as:
C
i
= E(K, P
i
⊕
C
i-1
) f
o
r i=
1,…
…
.,
n
2.
3.
Z
ero Kn
o
w
l
e
dge
Pr
oo
f (Z
KP)
A zer
o-
kn
o
w
l
e
dge
pr
o
o
f
pr
ot
ocol
[
6
]
,
[
7
]
al
lows
o
n
e pa
rt
y
,
cal
l
e
d pr
ove
r,
t
o
co
nvi
nce an
ot
he
r pa
rt
y
,
called
v
e
r
i
f
i
er
, th
at pr
ov
er
kn
ow
s so
m
e
f
acts w
ith
ou
t
re
veal
i
n
g
t
o
t
h
e
veri
fi
er a
n
y
i
n
f
o
rm
at
i
on ab
out
hi
s
k
now
ledg
e.
Fi
gu
re
1.
M
a
gi
cal
C
a
ve
ZKP ca
n be e
xpl
ai
ne
d t
h
ro
u
gh
op
eni
ng t
h
e
secret
do
o
r
o
f
a cave usi
n
g t
h
e m
a
gi
c wor
d
s exam
pl
e.
Th
e st
o
r
y say
s
, so
m
e
o
n
e
wh
o kno
w
s
th
e m
a
g
i
c w
o
rd
s can
open the
secret
door t
o
e
n
ter i
n
to c
a
ve.
T
o
every
one else
, it see
m
s to be a rock.
Assume, Alice kn
o
w
s t
h
e
secret
of t
h
e ca
ve.
S
h
e
want
s t
o
pr
ove
he
r
k
now
ledg
e
to Bo
b, b
u
t
sh
e do
esn
’
t w
a
n
t
t
o
r
e
v
eal
t
h
e m
a
gic words.
He
re
’s
how s
h
e
convinces
him
:
1)
B
o
b st
a
n
ds
at
poi
nt
P.
2
)
A
lice
w
a
lk
s
all th
e w
a
y
up
to
th
e cav
e
door
at
p
o
i
n
t
Q
3)
Al
i
ce c
o
n
f
i
r
m
s
, usi
ng t
h
e
m
a
gi
c wo
r
d
s t
o
ope
n t
h
e sec
r
et
do
o
r
i
f
she
h
a
s t
o
3
.
RELATE
D WORK
So
m
e
related
wo
rk
s are Password
Au
t
h
en
tication Pro
t
o
c
o
l
(PAP), C
h
alleng
e
h
a
nd
sh
ak
e
Aut
h
ent
i
cat
i
o
n
Prot
ocol
(C
H
A
P)
, Zer
o
Kn
owl
e
dge
-Pas
s
w
o
r
d
A
u
t
h
e
n
t
i
cat
i
on Pr
ot
oco
l
(ZK-
PA
P)
. PAP i
s
m
o
st widely used a
u
the
n
tica
tion
prot
oc
ol t
o
validate
use
r
s acces
sing t
o
se
rve
r
res
o
urces.
It is a
si
m
p
le
pr
ot
oc
ol
w
h
i
c
h
t
r
ansm
it
s ASC
II val
u
es of
p
a
ssw
or
d ent
e
re
d o
v
er t
h
e net
w
o
r
k a
nd
henc
e consi
d
ere
d
i
n
secure
.
The PAP
involves
tw
o s
t
e
p
s pr
o
c
e
ss
1)
User who
want
s to acces
s the
serve
r
res
o
ur
ce
s
logins usi
n
g usernam
e
and pass
word.
2)
The
server or
s
y
ste
m
in turn
v
a
l
i
d
at
es t
h
e
us
ernam
e
and
pa
ssw
or
d e
n
t
e
re
d
an
d ei
t
h
e
r
a
c
c
e
pt
s
or
denies
the se
rvice accordingly.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
SN
:
2
088
-87
08
IJECE
Vol. 5, No. 6, D
ecem
ber
2015 :
1468 –
1471
1
470
PA
P [8
],
[9
] uses th
r
ee typ
e
s o
f
p
a
c
k
ets na
mely authentic
ate-request,
us
ed by
t
h
e use
r
t
o
sen
d
use
r
nam
e
and
pass
word, a
u
the
n
ticate-ack,
use
d
by system
to allow access
and
a
u
the
n
ticate-nak, use
d
by
s
y
ste
m
to de
ny access
.
CH
A
P
[9
]-
[11] is a th
r
ee
way h
a
nd
sh
ak
in
g au
t
h
en
ticatio
n pr
o
t
o
c
o
l
b
a
sed
o
n
ch
alleng
e-r
e
sp
on
se
m
o
d
e
l. It is
mo
re secure th
an PAP as th
e
p
a
sswo
r
d
is
no
t tran
sm
itted
o
v
e
r th
e
n
e
two
r
k
an
d
is
k
e
p
t
secret b
u
t
requires t
h
at both t
h
e
user a
n
d system
to know the
pl
ainte
x
t of the
secret
. CHAP
provides protection a
g
ainst
repl
ay
at
t
acks
by
usi
ng a
n
i
n
crem
ent
a
l
l
y
changi
ng
va
ri
ab
l
e
and of a
vari
able challenge
-
val
u
e. T
h
e
protoc
ol
wo
rk
s as
f
o
llo
w:
1)
The sy
st
em
sends
a
few
by
t
e
s o
f
c
h
al
l
e
nge
m
e
ssage t
o
t
h
e
user
.
2)
The use
r
se
n
d
s
a
re
sp
o
n
se
m
e
ssage w
h
i
c
h
h
a
s
a val
u
e
cal
cul
a
t
e
d usi
n
g o
n
e -way
has
h
f
unct
i
o
n
on the c
h
allenge and sec
r
et c
o
m
b
ined.
3)
Th
e system
in
tu
rn
app
lies th
e sam
e
h
a
sh
fun
c
tion
to
ret
r
iev
e
th
e
v
a
lu
e. If the v
a
lu
e
o
b
t
ained
matches, acces
s is gra
n
ted
otherwise it is
de
nied.
C
HAP
uses
fo
ur t
y
pes
of
pac
k
et
s nam
e
l
y
, Chal
l
e
nge
w
h
i
c
h
i
s
used
by
t
h
e
sy
st
em
t
o
send chal
l
e
n
g
e
m
e
ssage, R
e
sp
ons
e i
s
used b
y
t
h
e user t
o
send t
h
e c
o
m
put
ed val
u
e, S
u
ccess use
d
by
t
h
e sy
st
em
t
o
gra
n
t
access and
De
ny us
ed by t
h
e
syst
e
m
to deny
access to the
user.
In
ZK-PAP
[12
]
, th
e au
th
en
t
i
catio
n
pro
cess is in
itiated
b
y
th
e user
wh
o
send
s th
e
u
s
er n
a
m
e
an
d
no
nce
N
1
.
Th
e sy
st
em
sends a
resp
o
n
se
m
e
ssage
on
c
oncat
e
n
at
i
n
g t
h
e
ran
d
o
m
sessi
on
key
k,
N
1
(use
r
nonce
)
,
N2 (sy
s
te
m
nonce) a
n
d enc
r
ypts
us
ing
has
h
of
pa
ssword value c
o
rres
pondin
g t
o
usernam
e
received.
The
user i
n
t
u
r
n
ap
pl
i
e
s t
h
e s
a
m
e
hash f
u
nct
i
on a
nd
ret
r
i
e
v
e
s bac
k
t
h
e
no
nce N
1
.
If m
a
t
c
hes,
ret
r
i
e
ve
s
t
h
e key
k ot
her
w
i
s
e de
ni
es. I
f
m
a
t
c
h
occu
rs, t
h
e use
r
sen
d
s t
h
e
n
o
n
ce N
2
t
o
t
h
e
sy
st
em
encry
p
t
e
d usi
ng t
h
e se
ssi
o
n
key k. T
h
e
syste
m
decrypts
and c
h
ecks
its nonc
e
N2.
If m
a
tch occurs, the
use
r
is al
lowe
d t
o
acce
ss the
resources else
denie
d
access
.
4. P
A
SS
WO
RD
AUT
HE
NTIC
ATIO
N
ALGO
RITH
M FO
R M
U
LTICAST
H
O
ST – P
R
O
P
OSED
METHOD
The
pr
o
pose
d
al
go
ri
t
h
m
for a
u
t
h
e
n
t
i
cat
i
ng
m
u
lt
i
cast
host
t
o
pa
rt
i
c
i
p
at
e i
n
gr
o
up c
o
m
m
uni
cat
i
on
uses
challenge-respons
e m
e
ssages.
1)
Th
e
ho
st who
w
a
n
t
s to
jo
in
a
g
r
ou
p send
s a
n
o
n
ce
N
t
o
th
e
Sou
r
ce or
in
iti
ato
r
o
f
th
e
gr
ou
p.
2)
Th
e So
urce u
s
es th
e n
o
n
ce
N as an
in
itial v
a
lu
e to
CBC
mo
d
e
o
f
en
cry
p
tio
n
.
Th
e en
cry
p
tio
n
is
per
f
o
r
m
e
d
o
n
OTP|
|
N
|
|
M
|
|
hos
t
_
i
d
, w
h
ere
M
i
s
so
ur
ce non
ce,ho
s
t_
i
d
is th
e id
for
j
o
i
n
ing
h
o
s
t
.
3)
The
user
dec
r
y
p
t
s
an
d ve
ri
f
i
es t
h
e N.
If
m
a
t
c
hes, sen
d
s a re
sp
o
n
se
m
e
ssage co
n
t
ai
ni
ng
M||h
o
s
t_
id u
s
i
n
g M as an
i
n
itial v
a
lu
e
for C
BC en
cry
p
tio
n
o
t
h
e
rwise
d
e
n
i
es.
4)
The S
o
u
r
ce c
h
eck
s i
t
s
no
nc
e M
on d
ecry
p
t
i
ng i
t
an
d s
e
nd
s ack
no
wl
edge
(AC
K
)
m
e
ssage
allo
wing
the
ho
st to jo
in th
e
g
r
ou
p else d
e
n
i
es (DENY).
5)
The h
o
st
n
o
w
j
o
i
n
s t
h
e
gr
o
up
usi
n
g h
o
st
_i
d a
s
l
ogi
n
or
user
nam
e
and OTP
as passw
o
r
d f
o
r t
h
e
m
u
lticast session.
Fi
gu
re
2.
M
u
l
t
i
cast
C
o
m
m
uni
cat
i
ons
Fi
gu
re 3.
Ha
n
d
s
ha
ki
n
g
m
e
ssages bet
w
ee
n S
o
u
r
ce S
an
d Ho
st
H
5. RES
U
LTS AN
D DIS
C
US
SION
The
use
of nonce N a
n
d M prevents
re
play attacks.
Th
oug
h p
a
sswo
rd
is tran
sm
it
ted
ov
er th
e
n
e
two
r
k,
encry
p
t
i
on
of
pass
wo
rd m
a
kes i
t
secure.
M
o
re
ove
r pa
s
s
wo
r
d
ge
nerat
e
d i
s
a one
-t
i
m
e passwo
r
d whi
c
h
p
r
ov
id
es
h
i
gh
secu
rity as p
a
ssword
is sto
r
ed
elsewh
ere.Use o
f
CBC m
o
d
e
of en
cryp
ti
o
n
is
u
s
es
n
once as its
in
itial v
a
lu
e wh
ich
is also
a rando
m
l
y g
e
n
e
rated
nu
m
b
er wh
ich
cou
l
d
be u
s
ed
on
ly on
ce. The ch
ance o
f
attack
in
g
th
e en
cry
p
ted
m
e
ss
ag
e is also
con
s
id
erab
ly less as CBC
m
o
d
e
s o
f
en
cryp
ti
o
n
p
r
od
u
ces
d
i
fferen
t
b
l
o
c
k
s
o
f
ci
p
h
er as
o
u
t
p
u
t
.Th
e
Sou
r
ce
o
r
th
e in
itiato
r
of
th
e group
co
mm
u
n
i
catio
n
also
d
o
e
s no
t reveal an
y
in
fo
rm
atio
n
to
th
e ho
sts.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
J
ECE
I
S
SN
:
208
8-8
7
0
8
Pa
ssw
o
r
d Au
then
tica
tion
fo
r
Mu
ltica
s
t Ho
st
U
s
ing
Zero
K
n
o
w
led
g
e
Pro
o
f (S
eeth
a
Ranga
na
than
)
1
471
6. CO
N
C
L
U
S
I
ON
Th
e al
g
o
r
ith
m
p
r
op
o
s
ed
u
s
es
a r
a
ndo
m
l
y g
e
n
e
r
a
ted
On
e-
time p
a
sswo
r
d
fo
r
t
h
e
h
o
st to
jo
in
t
h
e
g
r
oup
com
m
uni
cat
i
on sessi
on
. T
h
e
encry
p
t
i
o
n al
go
ri
t
h
m
used
t
o
enc
r
y
p
t
t
h
e
res
p
o
n
se m
e
ssage al
s
o
m
a
kes t
h
e
hands
h
a
k
ing
mechanism
more
secure. T
h
e cha
n
ce
of
ea
ves
d
roppe
r
s to access t
h
e c
o
mmunication s
e
ssion is
also
r
e
du
ced as in
fo
r
m
atio
n
ab
ou
t th
e so
ur
ce of
th
e gr
oup
is k
e
p
t
secr
et
u
s
i
n
g zero
kn
ow
l
e
d
g
e
pro
o
f
.
Thu
s
u
s
e
o
f
no
n
c
e as in
itial v
a
lu
e
fo
r CB
C
m
o
d
e
o
f
encryp
tion
an
d
CBC
m
o
d
e
of en
cry
p
tion
p
r
od
u
c
i
n
g
d
i
fferen
t
b
l
o
c
k
s
o
f
cip
h
e
r as
o
u
t
pu
t prov
id
es two
lev
e
l
o
f
security fo
r t
r
ansmittin
g
th
e g
e
n
e
rated
OTP
over inse
cure
net
w
ork in a
secure m
a
nner.
REFERE
NC
ES
[1]
Alfred J. Menezes, Pa
ul C. v
a
n
Oorschot, and
Scott A. Vansto
ne, “Handbook of Applied Cr
yptograph
y
”, CR
C
Press, pp. 228–2
33, 1996
.
[2]
S. M. Bellovin
and M. Merr
itt.
“Encr
y
p
t
ed Key Exchang
e
: Password-Base
d Protocols Secur
e
A
g
ainst Diction
a
r
y
Attacks
”
,
Proceedings of the IEEE S
y
mposium o
n
Research
in
Se
curity and
Priva
c
y
, Oakland, 199
2.
[3]
Kameswara Rao, Sushma Yala
manchili, “Novel
Shoulder Sur
fi
ng Res
i
s
t
ant Authenti
cat
ion
Schemes using
Te
xt
Graphical Passwords”,
Internatio
nal Journal o
f
I
n
formation and
Network Security (
I
JINS)
,
Vol.
1, No. 3
,
pp163
-
170, 2012
.
[4]
Hang Tu, “
A
Securit
y
Enhan
ced Password Authenti
cat
ion
and Update Sc
hem
e
Based o
n
Ellip
tic
Curv
e
Cr
y
p
togr
aph
y
”,
TELKOMNIKA Indonesian Jour
nal of Electrica
l Engin
eering
,
Vol. 12, No. 10
, pp. 7353-7360
,
2014.
[5]
M
’
Raihi D.
, B
e
l
l
are
M
.
,
Hoorna
ert F
.
, Na
cc
ache
D.,
and
O
.
Ranen,
"HOTP: An
HMAC
-Bas
ed One-Tim
e
P
a
s
s
w
ord
Algorithm", RFC 4226, 2005
.
[6]
“Zeroknowledgeproof.”Wikip
e
dia,
TheFreeEn
c
y
c
lopedia
(
http://en.wikiped
i
a.or
g/wiki/Zeroknowledge_proof
).
[7]
Oded Goldrei
c
h,
“
Z
ero Knowled
g
e twen
t
y
ye
ars
after
its
inven
tio
n”,
Unpublished manuscript
, 200
2.
[8]
Leslie Lamport,
“Password Authenti
cat
ion with
I
n
s
ecu
re Communication”,
ACM
,
pp. 770-772
, 19
81.
[9]
F
o
rouzan,
“
D
at
a Com
m
unicatio
n & Ne
twor
king
”, Fourth
Editio
n, McGraw-Hill
Education (Ind
i
a) Pvt Limited, p
p
.
352–353, 2007
.
[10]
W. Simp
son, “R
equest for Commen
ts 1994, PPP Challenge Handshake
Authentication Protocol
(CHAP)”,
Network
Working Group,
California, 1996.
[11]
M
.
W
.
Yous
s
e
f
and Haz
e
m
El-
G
end
y
, “
S
ecurin
g
Authenti
cation
of TCP/IP Layer Two b
y
Mod
i
f
y
ing Challenge-
Handshake Auth
enti
cation Protocol”,
Ad
vanced
C
o
mputing: An
In
ternational Jour
nal (
A
CIJ)
, Vol.
3, No. 2, 2012.
[12]
Nivedita Datta,
“Zero
Knowledge Password Auth
entication Protocol”,
International Journal
of Communication
Networ
k S
ecur
i
t
y
, Vol. 1
,
No
. 4
,
pp. 30-34
, 2012
.
BIOGRAP
HI
ES
OF AUTH
ORS
Seetha R
a
nganathan received h
e
r
B.E Degree fro
m
Madras University
in the
y
e
ar
2003 in the field
of Computer Science
and En
gineering. She recei
ved her M.Tech
Degree
in Computer Science an
d
Engineering fro
m SR
M University
in the
y
e
ar 20
07.
S
h
e is
curren
t
l
y
working
as
As
s
i
s
t
ant P
r
ofes
s
o
r
(Senior) in
th
e S
c
hool of
Information
Technolog
y
a
nd
Engin
eering, VIT Univers
i
ty
Vellore. She
is
purs
u
ing her P
h
D thes
is
in VIT Univers
i
t
y
.Her
a
r
eas
of res
ear
ch includ
es
Graph theor
y
, Algori
t
h
m
analy
s
is, cr
y
p
tog
r
aph
y
, Mobile n
e
tworking
and s
ecurity
.
R Saravanan co
mpleted his doctoral th
esis in
the area of Approximation Algor
ithms in 1997 at
Ramanujan Institute for Advan
ced Stud
y
in
Mathematics and obtained th
e Ph.D degree from
Univers
i
t
y
of M
a
dras
. He
rec
e
iv
ed M
.
E
.
degr
ee
in Computer Science
& Eng
i
neering from College
of Engineering
,
Guind
y
, Anna
University
, Ch
ennai.
He
has
ri
c
h
res
ear
ch exp
e
rienc
e
in
are
a
s
of
algorithms and p
ublished more th
an seventy
f
i
ve r
e
s
earch p
a
pers
i
n
the pe
er rev
i
e
w
ed intern
ation
a
l
journals
and nu
merous research
papers
in nation
a
l jou
r
nals,
int
e
r
n
ation
a
l
and na
ti
onal
confer
ences
.
He s
e
rved as
an
acad
em
ic
coun
cil m
e
m
b
er and
board of s
t
ud
y
m
e
m
b
er in m
a
ny univ
e
rs
it
ies
an
d
autonomous colleges. He h
a
s ab
out two decades
of
teaching and
research
exper
i
ence. He is a
lif
e
member of Computer Society
of India (CSI),
Cr
y
p
to
log
y
Res
earch Society
of
India (CRSI) and
Ram
a
nujan M
a
t
h
em
atic
al S
o
c
i
e
t
y and
als
o
h
e
is
a m
e
m
b
er of
IEE
E
.
Thre
e r
e
s
earch
s
c
hol
ars
completed th
eir
Ph.D under his guidance and superv
ision and ten more his research scholars ar
e
carr
y
ing out th
eir res
ear
ch to
wards
their P
h
.D. His
areas
of res
earch inc
l
u
d
e approxim
a
ti
on
algorithm
s
, m
o
b
ile
com
puting
,
cr
yp
togr
aph
y
, and
network secu
rity.
Evaluation Warning : The document was created with Spire.PDF for Python.