匿名使用者認證及金鑰分配方法對於目前的分散式網路來說,可以說是相當的重要,因為這樣才能保護使用者資料的安全性與隱私性。在西元兩千年的時候,李維斌教授是第一個設計了能夠達到使用者認證與金鑰分配的方法;並且在這九年來,不斷的有人對於這種方法做研究與改進,兩千零九年的時候,許建隆教授改進了前人們的方法,設計了一個能夠達到匿名且有效率的使用者認證與金鑰分配方法,但是我們發現了這個最新的方法在安全性上有所瑕疵,並加以改進,設計了一個新的方法,不但能夠達到更安全的要求,還在效率上也有所提升。我們也做了實驗測試,證明了我們的方法在效率上的確好於其它相關的方法。
User identification and key distribution schemes with anonymity are attached great importance to distributed computer networks where the privacy of a service requester can be protected. In 2000, Lee and Chang first presented a user identification scheme that also can simultaneously achieve key exchange requirement while preserving the user anonymity. In 2009, Hsu and Chuang proposed an efficient user identification scheme with key distribution preserving user anonymity for distributed computer networks. In their scheme, (1) each service provider does not need to maintain a password table for identifying users; (2) each user only keeps one secret token and can obtain the services from different service providers; (3) when a new service provider joins the system, the users do not need to update the secret token. In this thesis, we show that the impersonation attack can work in Hsu-Chuang’s scheme and then propose a new method to enhance the security level and the efficiency. By our simulation and analysis, the computation and communication cost is better than related schemes.