Research And Design On Identify Authentication Protocols Based On Pathword

Identification authentication is very important in everyday life, especially in the online world.It can confirm the user’s identity, and to some extent it can also ensure user’s information security.Password authentication is a simple and effective method, and it is the most popular one. Inpassword authentication systems, the security of password is very important. With possible means,invaders may steal passwords of legitimate users. It will bring losses to users, such as systemdamages, data losses, secrets stolen and direct or indirect economy loss. In the password systems,one-time password means that user uses different password each time when they login in system. Incryptography theory, one-time password has the highest security.In this paper, we first present a pathword protocol based on random walks and challenge/response mechanisms. A person randomly walks on small-world networks according to chaosfunctions. The values of the path nodes passed successively by the person become a stringsequence, which is as a one-time password in the protocol. We then present a pathword protocolbased on Dalton Boards and challenge/response mechanisms. Each node in Dalton Boards iscorresponding to a character and the character is the value of the node. Several balls can fall inDalton Boards at one time, and the values of nodes of one path become a string sequence. Theone-time pathword is obtained from the module operation of different string sequences. At last, wepresent another pathword protocol based on minority games. The participants play this gamerepeatedly and game results are recorded simultaneously. The record is represented by a charactersequence, which is as a one-time password in the protocol.Most traditional one-time password protocols base on math algorithms. Comparing to them,our protocols based on physical models, which include small-world network models and Daltonboard ones, as well as minority game. There exists randomness in these models. We exploit it topropose three novel one-time pathword protocols. We also analyze the security of the correspondingprotocols. Compared to other one-time password protocols, our protocols have low computationalcomplexity, simple realization, and higher security.