電子商務(wù)和數(shù)位生活研討會英文版

1、further security enhancement for optimal strong-password authentication protocoltzung-her chen, gwoboa horng, wei-bin lee ,kuang-long lin 3/27/2004電子商務(wù)與數(shù)位生活研討會1outlinenintroductionnreview of ku-chen scheme nthe problem of ku-chen scheme nthe proposed scheme nsecurity analysis nconclusions 電子商務(wù)與數(shù)位生活研

2、討會2introductionnin 2000, sandirigama et al. proposed sas scheme lowered storage, processing, and transmission overheads.nin 2001, lin, sun, and hwang proposed an enhanced password authentication scheme, called the ospa.電子商務(wù)與數(shù)位生活研討會3introductionnin 2002,ospa protocol has been shown vulnerable to the

3、stolen-verifier attack and the impersonation attack. nin 2003, ku and chen proposed a new improved version for the ospa protocolnin this paper, an improved scheme with mutual authentication is proposed.電子商務(wù)與數(shù)位生活研討會4review of ku-chen schemennotation: h(.) : collision-resistant hash function t : login

4、 times k : long-term secret key : exclusive-or operation電子商務(wù)與數(shù)位生活研討會5review of ku-chen schemenregistration phase nauthentication phase 電子商務(wù)與數(shù)位生活研討會6id, h2(pw 1)chooses his identity id and password pw and computes h2(pw 1) calculates verifier v1=h2(pw 1) h(id k)store id, v1,t=1 into the verification

5、table電子商務(wù)與數(shù)位生活研討會7id, service requestt=i c1=h(pw i) h2(pw i)c2=h2(pw (i +1) h(pw i)c3=h(h3(pw (i +1) t)find i from verification table by the id電子商務(wù)與數(shù)位生活研討會8check c1, c2c1,c2,c3get h2(pw i) by vi h(id k)y1=c1 h2(pw i)=h(pw i) y2=c2 y1=h2(pw (i +1)check if h(y1)=h2(pw i) h(h(y2) t)=c3vi+1=h2(pw (i +1)

6、 h(id k) store id ,t=i+1, and vi+1電子商務(wù)與數(shù)位生活研討會9the problem of ku-chen schementhe user is authenticated by the remote server.nbut, remote server is not authenticated by the user (server impersonation attack ).電子商務(wù)與數(shù)位生活研討會10the proposed schemenregistration phase nauthentication phase 電子商務(wù)與數(shù)位生活研討會11id,

7、 h2(pw 1) chooses his identity id and password pw and computes h2(pw 1) calculates verifier v1=h2(pw 1) h(id k)store id, v1 into the verification table電子商務(wù)與數(shù)位生活研討會12id, r h2(pw i)h(r) h2(pw i)check rc1=h(pw i) h2(pw i)c2=h2(pw (i +1) h(pw i)c3=h(h3(pw (i +1) t)choose r randomly and compute r h2(pw i

8、)get h2(pw i) by vi h(id k) r =(r h2(pw i) h2(pw i)電子商務(wù)與數(shù)位生活研討會13check c1, c2c1,c2,c3y1=c1 h2(pw i)=h(pw i) y2=c2 y1=h2(pw (i +1)check if h(y1)=h2(pw i) h(h(y2) t)=c3vi+1=h2(pw (i +1) h(id k) store id and vi+1電子商務(wù)與數(shù)位生活研討會14security analysis npassword guess attacknimpersonation attacknstolen-verifier attacknserver impersonation attack 電子商務(wù)與數(shù)位生活研討會15conclusions nwe point out the possible server impersonation problem in the ku-chen scheme and propose an enhanced ver