Honeywords Generation Mechanism Based on Zero-Divisor Graph Sequences

Yanzhao Tian

doi:10.1109/TSC.2023.3329013

Honeywords Generation Mechanism Based on Zero-Divisor Graph Sequences

2023-11-01

0

PRE

AI

DOI：10.1109/TSC.2023.3329013

Original

Original request for help

Save

Abstract

En 中文

The identity authentication of most applications is based on a symbolic password. However, incidents of password leakage emerge one after another, which brings serious hidden danger to the users' information security. For decades, various schemes have been proposed to solve the problem of information protection. However, most schemes neglect the timely detection of password leakage. The present paper introduces a password leak detection method based on zero-divisor graph sequences. Specifically, it is to construct an algorithm for generating honeywords with high smoothness. First, we introduce the concept of the zero-divisor graph and construct zero-divisor graph sequences by using the corresponding zero-divisor matrices. Second, the honeywords with high flatness are constructed by using the sequence of zero-divisor graphs. Third, the security analysis verifies the effectiveness of the scheme. Fourth, compared with other honeywords schemes, our scheme has more obvious advantages, in the aspects of honeywords generated flatness, DoS resistance, and storage resources occupied by honeywords.

Keywords:

Authentication

honeywords

zero-divisor graph matrix

zero-divisor graph

graphic labeling

topological coding

Honeywords Generation Mechanism Based on Zero-Divisor Graph Sequences

Abstract

Journal

Organization