Achieving flatness: Graph labeling can generate graphical honeywords

Abstract

In this paper, we propose a method to protect the hashed passwords by using topological graphic sequences. This method works effectively even if the password file is leaked. First, the user password is divided based on its length. Then the processed string and the topological graphic sequence are operated for obtaining the real decoy honeywords. In this way, a flatness honeywords generation method is generated. Since every password seems unrealistic, the hacker who steals the hashed password file cannot distinguish between the real passwords and the honeywords. If he uses the honeywords for login, the system will know that it is the intruder’s attack, and then the service provider (SP) can take security measures. Finally, several typical attack methods are analyzed to verify the effectiveness of our scheme. We use the topological graph to generate the honeywords, which is the first application of graphic labeling in the honeywords generation.