1 / 4

A New Authentication Scheme with Anonymity for Wireless Environments

A New Authentication Scheme with Anonymity for Wireless Environments. J. Zhu and J. Ma IEEE Transactions on Consumer Electronics, Vol. 50, No. 1, pp. 230-234, 2004. Initial Assumptions. HA. MN. PW MN. N: random number PW MN =h(N||ID MN ) r=h(N||IDHA) ⊕ h(N||IDMN) ⊕ ID HA ⊕ ID MN.

jaegar
Télécharger la présentation

A New Authentication Scheme with Anonymity for Wireless Environments

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. A New Authentication Scheme with Anonymity for Wireless Environments J. Zhu and J. Ma IEEE Transactions on Consumer Electronics, Vol. 50, No. 1, pp. 230-234, 2004

  2. Initial Assumptions HA MN PWMN N: random number PWMN=h(N||IDMN) r=h(N||IDHA) ⊕ h(N||IDMN) ⊕ IDHA ⊕ IDMN (secure channel) Smard card (r, IDHA, h)

  3. First Phase HA MN FA n, (x0)L, IDHA, TMN b, n, (x0)L, TMN, CertFA, n=r ⊕ PWMN x0:random L=h(TMN ⊕ PWMN) TFA, EKRFA(h(above messages)) IDMN=h(N||IDHA) ⊕ n ⊕ IDHA Compute L and x0 c, EKUFA(h(IDMN)||x0), CertHA, THA, EKRHA(h(above and b)) (TCertMN)K k=h(IDMN) ⊕ x0

  4. Second Phase When MN visits FA at i th session MN FA (TCertMN), (xi||TCertMN||other info.)ki ki=h(IDMN) ⊕ xi-1

More Related