1 / 7

Enhanced Security Mechanism for User Identification and Key Distribution

This paper introduces a novel approach for user identification and key distribution, providing enhanced security features. The scheme involves key generation and anonymous user identification phases. The proposed system uses a secure channel and hash functions for data protection. The process includes service requests, session key generation, and verification steps. The scheme aims to prevent attacks and ensure secure communication.

hana
Télécharger la présentation

Enhanced Security Mechanism for User Identification and Key Distribution

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. New Efficient User Identification and Key Distribution Scheme Providing Enhanced Security Authors: Y. Yang, S. Wang, F. Bao, J. Wang, and R. H. Deng Source: Computers & Security, Vol. 23, No. 2, pp 697-704, 2004 Speaker: Cheng-Chi Lee 1

  2. Wu-Hsu Scheme • Their scheme consists of two phases: • Key Generation • Anonymous User Identification 2

  3. Wu-Hsu Scheme (cont.) • Key Generation SCPC (Smart Card Producing Center) Ui N=pq ed=1 mod (p-1)(q-1) Public: N, e, g, f Secret: d, p, q f: hash function Secure channel Si=IDid mod N Keep Si Computes Si for user or service provider 3

  4. Wu-Hsu Scheme (cont.) • Anonymous User Identification Pj Ui (1) Service request (2) z=gkSj mod N (3) z (4) a=ze/IDj x=Sif(at||T) y=get Note: k and t are random number, and Kij is a session key. (5) (x, y, T) Kij=atx=ykx=gektx (6) Check T and verify IDi =? (x/f(yk||T))e 4

  5. Attack on Wu-Hsu Scheme • Anonymous User Identification Pj Ui (1) Service request (2) z=gkSj mod N (3) z (4) a=ze/IDj x=Sif(at||T) y=get (5) (x, y, T) Kij=atx=ykx=gektx (6) Check T and verify IDi =? (x/f(yk||T))e x/f(yk||T)=Si 5

  6. Yang et al. Scheme • Their scheme consists of two phases: • Key Generation: it is the same as Wu-Hsu scheme. • Anonymous User Identification 6

  7. Yang et al. Scheme (cont.) • Anonymous User Identification Pj Ui (1) Service request (2) z=gkSj-1 mod N (4) a=zeIDj Kij=at x=get s=gtSif(x,T) y=EKij(IDi) Note: k and t are random number, and Kij is a session key. (3) z (5) (x, s, y, T) Kij=at=xk=gket (6) IDi=DKij(IDi) xIDif(x,T) =? se 7

More Related