130 likes | 145 Views
This paper presents a novel verifier-based key agreement protocol for three parties that eliminates the need for the server's public key. The protocol ensures secure communication and authentication using memorable passwords. Security analysis shows protection against password guessing attacks and masquerading attempts by intruders.
E N D
Efficient verifier-based key agreement protocol for three parties without server’s public key Source: Applied Mathematics and Computation 167 (2005)996-1003 Author: Sung-Woon Lee, Hyun-Sung Kim, Kee-Young Yoo Presenter: Li-Tzu Chang
Outline • Introduction • Efficient verifier-based key agreement protocol for three-parties • Security analysis • Conclusions
trusted server password table passwordA passwordB session key Introduction • Three-party
Outline • Introduction • Efficient verifier-based key agreement protocol for three-parties • Security analysis • Conclusions
Proposed protocol • Register A B AS (vA) (vB) vA , vB (password table)
Proposed protocol A B AS (A,XA) (A,XA,B,XB) (XB) (XSB) (XSA)
Proposed protocol A B AS (A,XA,B,XB,XSA, XSB) (XSA) (XSB) (vBS) (vAS)
Proposed protocol A B AS (vSB) (vSA)
Outline • Introduction • Efficient verifier-based key agreement protocol for three-parties • Security analysis • Conclusions
Security analysis • AS可透過vAS、vBS確認Alice和Bob的合法身份且確定收到訊息;Alice和Bob可透過vSA、vSB認證AS的深份和收到訊息 • Attackers can’t directly compute the passwords or the session key • Against attackers masquerade clients or server • Using ‘⊕ ‘ operation to against password guessing attack
Outline • Introduction • Efficient verifier-based key agreement protocol for three-parties • Security analysis • Conclusions
Conclusions • proposed a new verifier-based key agreement protocol for three-parties, which does not require servers public key but requires each client only to remember a memorable password.