Please use this identifier to cite or link to this item:
標題: 適用於多伺服器之有效率遠端通行碼確認機制
An efficient and User-Friendly Remote Password Authentication Scheme for Multi-Server Architecture
作者: 楊子慶
Yang, Tzu-Chin
關鍵字: Authentication
key agreement
multi-server architceture
出版社: 資訊科學研究所
摘要: 由於分散式網路日益發達,網路技術日趨成熟,寬頻網路速度更加快速,越來越多伺服器願意提供透過網路來服務使用者的方法。甚至會有多個伺服器組成群體同時提供服務給使用者。因此多重伺服器架構之通行碼身份認證技術在現今也成為重要的研究方向。雖然在2001年以後已有學者把通行碼認證方法的研究方向從單一伺服器延伸到多重伺服器的架構上。然而他們所提出之方法有些需要花費大量的計算時間,有些需在智慧卡中存入大量的資料,且都沒有提供安全的變更密碼功能。所以我們提出了一個新穎且有效率的多伺服器架構之通行碼認證系統。相較之下,我們不僅利用單向赫序函數以及訊息認證碼來加快運算速度,我們亦提供金鑰協定、相互認證以及安全變更密碼的功能,同時也能滿足一般通行碼認證系統中所需之安全性與便利性。
Password authentication is used to validate the legal user to access the server and receive the server's service. In addition, key agreement protocol is developed to provide the secure service communication between the communication parties. However, since the networks and information technology has grown quickly, most of services over networks are developed into a multi-server architecture. The traditional single-server password authentication schemes are no longer suitable for remote user authentication. Although some multi-server password authentication schemes had been proposed in past, but they need much computation cost and don't provide security change password stage. In this thesis, we combine user password authentication with key agreement protocol to propose a new efficient solution for a multi-server environment. In the scheme, user only needs to register to the Register Center once and subsequently can retrieve services provided by different servers. Moreover, users can freely choose their own passwords. Furthermore, we also provide the change password stage such that user can use new password to login all servers. In addition, the proposed scheme adopts hash function and exclusive-or operation rather than cryptographic encryption, therefore its computation cost is very low.
Appears in Collections:資訊科學與工程學系所



Show full item record
TAIR Related Article

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.