Figure - available from: Security and Communication Networks
This content is subject to copyright. Terms and conditions apply.
Source publication
Graphical password (GPW) is one of various passwords used in information communication. The QR code, which is widely used in the current world, is one of GPWs. Topsnut-GPWs are new-type GPWs made by topological structures (also, called graphs) and number theory, but the existing GPWs use pictures/images almost. We design new Topsnut-GPWs by means o...
Similar publications
![The grim reaper surface in R3\documentclass[12pt]{minimal}...](profile/Francisco-Martin-22/publication/333770046/figure/fig3/AS:960273724760069@1605958505487/The-grim-reaper-surface-in-R3documentclass12ptminimal-usepackageamsmath_Q320.jpg)
![The Δ\documentclass[12pt]{minimal} \usepackage{amsmath}...](profile/Francisco-Martin-22/publication/333770046/figure/fig5/AS:960273724747805@1605958505802/The-Ddocumentclass12ptminimal-usepackageamsmath-usepackagewasysym_Q320.jpg)
In this paper we provide a full classification of complete translating graphs in R3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbf {R}}^3$$\end{document}. We a...
Automated game balancing has often focused on single-agent scenarios. In this paper we present a tool for balancing multi-player games during game design. Our approach requires a designer to construct an intuitive graphical representation of their meta-game target, representing the relative scores that high-level strategies (or decks, or character...
The black-box nature of deep learning models prevents them from being completely trusted in domains like biomedicine. Most explainability techniques do not capture the concept-based reasoning that human beings follow. In this work, we attempt to understand the behavior of trained models that perform image processing tasks in the medical domain by b...
Previous studies have supported a graphical approach to solve one-variable inequalities, but there is a lack of research studies in which the data suggest productive ways of doing so. In response, this study investigates ways in which pre-service teachers engage in four tasks designed to understand the nature of their understanding and actions in s...
The neighborhood M-polynomial is effective in recovering neighborhood degree sum based topological indices that predict different physicochemical properties and biological activities of molecular structures. Topological indices can transform the information found in molecular graphs and networks into numerical characteristics and thus make a major...
Citations
... Complex passwords, while more secure, are often difficult to remember, leading users to compromise security by writing them down or reusing passwords across multiple accounts [12]. In response to these challenges, graphical passwords have been suggested as a replacement form of authentication [13][14][15]. ...
The rapid advancement of information technology (IT) has given rise to a new era of efficient and fast communication and transactions. However, the increasing adoption of and reliance on IT has led to the exposure of personal and sensitive information online. Safeguarding this information against unauthorized access remains a persistent challenge, necessitating the implementation of improved computer security measures. The core objective of computer security is to ensure the confidentiality, availability, and integrity of data and services. Among the mechanisms developed to counter security threats, authentication stands out as a pivotal defense strategy. Graphical passwords have emerged as a popular authentication approach, yet they face vulnerability to shoulder-surfing attacks, wherein an attacker can clandestinely observe a victim’s actions. Shoulder-surfing attacks present a significant security challenge within the realm of graphical password authentication. These attacks occur when an unauthorized individual covertly observes the authentication process of a legitimate user by shoulder surfing the user or capturing the interaction through a video recording. In response to this challenge, various methods have been proposed to thwart shoulder-surfing attacks, each with distinct advantages and limitations. This study thus centers on reviewing the resilience of existing recognition-based graphical password techniques against shoulder-surfing attacks by conducting a comprehensive examination and evaluation of their benefits, strengths, and weaknesses. The evaluation process entailed accessing pertinent academic resources through renowned search engines, including Web of Science, Science Direct, IEEE Xplore, ProQuest, Scopus, Springer, Wiley Online Library, and EBSCO. The selection criteria were carefully designed to prioritize studies that focused on recognition-based graphical password methods. Through this rigorous approach, 28 studies were identified and subjected to a thorough review. The results show that fourteen of them adopted registered objects as pass-objects, bolstering security through object recognition. Additionally, two methods employed decoy objects as pass-objects, enhancing obfuscation. Notably, one technique harnessed both registered and decoy objects, amplifying the security paradigm. The results also showed that recognition-based graphical password techniques varied in their resistance to different types of shoulder-surfing attacks. Some methods were effective in preventing direct observation attacks, while others were vulnerable to video-recorded and multiple-observation attacks. This vulnerability emerged due to attackers potentially extracting key information by analyzing user interaction patterns in each challenge set. Notably, one method stood out as an exception, demonstrating resilience against all three types of shoulder-surfing attacks. In conclusion, this study contributes to a comprehensive understanding of the efficacy of recognition-based graphical password methods in countering shoulder-surfing attacks by analyzing the diverse strategies employed by these methods and revealing their strengths and weaknesses.
... Wang et al. [9,2] designed a topological coding consisting of topological structure and graph colorings. According to the order of vertex-edge-vertex, Yao et al. [8] arrange the labels or colors of each edge and two end-vertices of a graph H with p vertices and q edges in topological matrix T code = (U, E, V ) T 3×q corresponds a graph H with V (H) = (U V ) * and E(H) = E * , where U = (β(u 1 ), β(u 2 ), . . . ...
We use topological graphs to generate topological coding, which is a fundamental technology in number theory, algebra, and has potential application value in asymmetric encryption systems. This article proposes a method of using topological graph sequences to generate topological coding for protecting hash ciphers, which can effectively protect hash ciphers even in the event of password leakage. We use topology graphs with labelings and colorings to generate graph lattice, which is the application of graph markers in asymmetric encryption systems. There are various kinds of graph labeling, one of them is a harmonious labeling. In order to further study topological coding, we use the graph harmonious-type labelings and colorings to propose (k, d)-harmonious labelling , since they can be applied to build up a new approach of asymmetric encryption. Finally, several typical attack methods about graph lattice analyzed to verify the effectiveness of our scheme.
... Topological authentication is an interdisciplinary research topic of graph theory, algebra, discrete mathematics, and other disciplines. Wang et al. [5,6] designed a class of topology code composed of topology structure and graph labellings, and its difficulty is based on some mathematical problems such as graph isomorphism and graceful tree conjecture. Yao et al. [7,8] proposed a new type of matrix combined with graph labelling technology to generate complex forms and longer byte text passwords. ...
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.
... We show the relationships between labelings on trees by producing several image-labelings from the set-ordered graceful labeling. Such results can be applied to molecular structures [17] and asymmetric cryptosystem [18], therefore, the theoretical research on labeling is meaningful. ...
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.
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. Firstly, we introduce the concept of the zero-divisor graph and construct zero-divisor graph sequences by using the corresponding zero-divisor matrices. Secondly, the honeywords with high flatness are constructed by using the sequence of zero-divisor graphs. Thirdly, the security analysis verifies the effectiveness of the scheme. Fourthly, 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.
The security of passwords generated by the graphic lattices is based on the difficulty of the graph isomorphism, graceful tree conjecture, and total coloring conjecture. A graphic lattice is generated by a graphic base and graphical operations, where a graphic base is a group of disjointed, connected graphs holding linearly independent properties. We study the existence of graphic bases with odd-graceful total colorings and show graphic lattices by vertex-overlapping and edge-joining operations; we prove that these graphic lattices are closed to the odd-graceful total coloring.
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.
