• 沒有找到結果。

Enhanced Authentication Scheme with Anonymity for Roaming Service in Global Mobility Networks

N/A
N/A
Protected

Academic year: 2022

Share "Enhanced Authentication Scheme with Anonymity for Roaming Service in Global Mobility Networks"

Copied!
1
0
0

加載中.... (立即查看全文)

全文

(1)

題名: Enhanced Authentication Scheme with Anonymity for Roaming Service in Global Mobility Networks

作者: Chang, C. C.;Lee, C. Y.;Chiu, Y. C.

關鍵詞: Authentication;Roaming;Key agreement;The forgery attack;Energy consumption 日期: 2009-03

上傳時間: 2009-12-17T06:57:26Z 出版者: Asia University

摘要: User authentication is an important security mechanism for recognizing legal roaming users. In 2006, Lee, Hwang, and Liao proposed an enhanced

authentication scheme with user anonymity for roaming environments. This article shows that Lee?Hwang?Liao?s scheme cannot provide anonymity under the forgery attack. Moreover, the heavy computation cost may consume battery power expeditiously for mobile devices. Therefore, we propose a novel authentication scheme to overcome these weaknesses that is efficient, secure, and suitable for battery-powered mobile devices in global mobility networks.

參考文獻

相關文件

“Blue Teen from Hong Kong had an interesting project ~ Bluetooth critical zone control system automatic authentication and sterilization system for centralized butchery in order

 Local, RADIUS, LDAP authentication presents user with a login page.  On successful authentication the user is redirected to

Is end-to-end congestion control sufficient for fair and efficient network usage. If not, what should we do

However, if the EAP Identity does match a client Identifier and the CredentialState is Accepted the EAP server proceeds with the authentication process and verifies the credential

It is useful to augment the description of devices and services with annotations that are not captured in the UPnP Template Language. To a lesser extent, there is value in

In outline, we locate first and last fragments of a best local alignment, then use a linear-space global alignment algorithm to compute an optimal global

The proof is suitable for R n if the statement is that every closed set in R n is the intersection of a countable collection of open sets.. All we need is to change intervals

In this thesis, we have proposed a new and simple feedforward sampling time offset (STO) estimation scheme for an OFDM-based IEEE 802.11a WLAN that uses an interpolator to recover