作者: Bin‐Tsan Hsieh , Hung‐Min Sun , Tzonelih Hwang
DOI: 10.15388/INFORMATICA.2003.014
关键词: Password strength 、 S/KEY 、 Authentication protocol 、 Password 、 One-time password 、 Password cracking 、 Computer science 、 Zero-knowledge password proof 、 Computer security 、 Challenge–response authentication
摘要: In an internet environment, such as UNIX, a remote user has to obtain the access right from server before doing any job. The procedure of obtaining acess is called authentication protocol. User via memorable password provides convenience without needing auxiliary devices, smart card. A protocol username and should basically withstand off-line guessing attack, stolen verifier DoS attack. Recently, Peyravian Zunic proposed one transmission change Later, Tseng et al. (2001) pointed out that Zunic's protocols can not therefore improved defeat Independently, Hwang Yeh also showed suffer some secury flaws, was presented. this paper, we show both al.'s are insecure against Moreover, all Zunic's, al.'s, Yeh's