Authentication schemes with no verification table

摘要

In 2000, Hwang and Yeh presented an improved version of Peyravian and Zunic’s scheme by using the server’s public key. In 2003, Lin and Hwang indicated that Hwang and Yeh’s scheme suffers from the denial-of-service attack and proposed a password authentication scheme with secure password updating. However, the verification table needed in both Hwang and Yeh’s and Lin and Hwang’s schemes makes these schemes vulnerable to the stolen-verifier attack. To overcome their drawback, we propose two authentication schemes with no verification table in this paper.