Yanzhao Tian

Bio: Yanzhao Tian is an academic researcher from Beijing University of Posts and Telecommunications. The author has contributed to research in topics: Password & Login. The author has an hindex of 1, co-authored 1 publications receiving 2 citations.

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

Matching-Type Image-Labelings of Trees

Abstract: A variety of labelings on trees have emerged in order to attack the Graceful Tree Conjecture, but lack showing the connections between two labelings. In this paper, we propose two new labelings: vertex image-labeling and edge image-labeling, and combine new labelings to form matching-type image-labeling with multiple restrictions. The research starts from the set-ordered graceful labeling of the trees, and we give several generation methods and relationships for well-known labelings and two new labelings on trees.

Toward Developing a Password Breach Detection Technique for Serving the Purpose of Honeywords

Abstract: In the era of computer systems, user authentication, both online and offline, is an unavoidable step for securing users’ privacy. Password-based authentication is popularly adopted for its simplicity in this context. In password-based authentication, a set of credentials (mostly username and password) is required to identify the unique user. But this method of authentication is vulnerable to inversion attack paradigm. In inversion attack, the adversary obtains the plaintext password by cracking the hashed value of the password. Honeyword-based authentication has been introduced to combat such attacks. In this strategy, certain dummy passwords or honeywords are saved along with the user’s original password. When an adversary tries to enter one of the honeywords to log into the system, an alarm message is sent to the authority via an auxiliary server called honeychecker. Although this technique is useful to address this type of security threat, the requirement of additional space to store the honeywords is still an overhead. Driven by these drawbacks, this work is aimed to propose a strategy which can serve the purpose of honeywords but in a more cost-effective way. In this technique, the concept of tokenization is utilized. Theoretical and experimental analyses have been done to assess the viability of the proposed scheme. A comparative study between the proposed scheme and honeyword-based authentication has been carried out based on required storage cost and resiliency against MSV attack. From our rigorous analysis, it is found that our scheme shows promising results in terms of other usability and security features as well.

On Elegant Labelling and Magic Labelling of Large-Scale Graphs

Abstract: In this paper, we deduce the equivalence relationship among strongly c-elegant labelling, super-edge magic total labelling, edge antimagic total labelling, and super t , 1 -magical labelling. We study some properties of the graph with a strongly c-elegant labelling. On the basis of small-scale graphs with strongly c-elegant labelling, several types of large-scale graphs are constructed through graph operations, and we further prove the existence of their strongly c-elegant labelling. In addition, we also define a transformation of strongly c-elegant labelling, which provides a method for the transformation between several strongly c-elegant labellings of a graph.

Graph Operations For Graphic Lattices and Graph Homomorphisms In Topological Cryptosystem

Abstract: We introduce graph operations: adding-removing edge or vertex operations, vertex-splitting and vertex-coinciding operations, edge-splitting and edge-coinciding operations, cycle-coinciding and cycle-splitting operations, H-coinciding and H-splitting operations, and so on. Next we build up graph operation lattices, self-isomorphic graph (anti-)homomorphisms, stochastic-graphic lattices and operation scale-free network lattices in topological coding. We show that our lattices introduced here possess the property like that of collision resistant hash functions.

Graph Colorings and Labelings Having Multiple Restrictive Conditions in Topological Coding

Abstract: With the fast development of networks, one has to focus on the security of information running in real networks. A technology that might be able to resist attacks equipped with AI techniques and quantum computers is the so-called topological graphic password of topological coding. In order to further study topological coding, we use the multiple constraints of graph colorings and labelings to propose 6C-labeling, 6C-complementary labeling, and its reciprocal-inverse labeling, since they can be applied to build up topological coding. We show some connections between 6C-labeling and other graph labelings/colorings and show graphs admitting twin-type 6C-labelings, as well as the construction of graphs admitting twin-type 6C-labelings.