Construction of New Graphical Passwords with Graceful-Type Labellings on Trees

Sun, Hua; Zhang, Xiaohui; Yao, Bing

doi:10.1109/imcec.2018.8469525

Cited by 4 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Topsnutgpws based on techniques of graph theory, in recent years, have been investigated fast and produce abundant fruits (Ref. [43], [44], [46]).…”

Section: A Researching Backgroundmentioning

confidence: 99%

Using Chinese Characters To Generate Text-Based Passwords For Information Security

Yao,

Mu,

Sun

et al. 2019

Preprint

Self Cite

View full text Add to dashboard Cite

Graphical passwords (GPWs) are in many areas of the current world, in which the two-dimensional code has been applied successfully nowadays. Topological graphic passwords (Topsnut-gpws) are a new type of cryptography, and they differ from the existing GPWs. A Topsnut-gpw consists of two parts: one is a topological structure (graph), and one is a set of discrete elements (a graph labelling, or coloring), the topological structure connects these discrete elements together to form an interesting "story". It is not easy to remember passwords made up of longer bytes for many Chinese people. Chinese characters are naturally topological structures and have very high information density, especially, Chinese couplets form natively public keys and private keys in authentication. Our idea is to transform Chinese characters into computer and electronic equipments with touch screen by speaking, writing and keyboard for forming Hanzi-gpws (one type of Topsnut-gpws). We will translate Chinese characters into graphs (Hanzi-graphs), and apply mathematical techniques (graph labellings) to construct Hanzi-gpws, and next using Hanzigpws produces text-based passwords (TB-paws) with longer bytes as desired. We will explore a new topic of encrypting networks by means of algebraic groups, called graphic groups (Ablian additive finite group), and construct several kinds of self-similar Hanzi-networks, as well as some approaches for the encryption of networks, an important topic of researching information security. The stroke order of writing Chinese characters motivates us to study directed Hanzi-gpws based on directed graphs. We will introduce flawed graph labellings on disconnected Hanzi-graphs such that each Hanzi-gpw with a flawed graph labelling can form a set of connected Topsnut-gpws, like a group. Moreover, we introduce connections between different graphic groups that can be used to encrypt networks based on community partition.

show abstract

“…Topsnutgpws based on techniques of graph theory, in recent years, have been investigated fast and produce abundant fruits (Ref. [43], [44], [46]).…”

Section: A Researching Backgroundmentioning

confidence: 99%

Using Chinese Characters To Generate Text-Based Passwords For Information Security

Yao,

Mu,

Sun

et al. 2019

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…G is bipartite with its own bipartition (X, Y ). The symbol f max (X) < f min (Y ) is defined by max{f (x) : x ∈ X} < min{f (y) : y ∈ Y } and we call f a set-ordered ε-labelling of G. As known, many set-ordered ε-labellings have good properties, and have been connected with other labellins equivalently ( [16], [17], [18], [19], [20]). However, determining a graph whether admits a set-ordered ε-labelling seems to be not easy.…”

Section: G Set-ordered Matchingsmentioning

confidence: 99%

Topological Graphic Passwords And Their Matchings Towards Cryptography

Yao¹,

Sun²,

Zhang³

et al. 2018

Preprint

Self Cite

View full text Add to dashboard Cite

Graphical passwords (GPWs) are convenient for mobile equipments with touch screen. Topological graphic passwords (Topsnut-gpws) can be saved in computer by classical matrices and run quickly than the existing GPWs. We research Topsnut-gpws by the matching of view, since they have many advantages. We discuss: configuration matching partition, coloring/labelling matching partition, set matching partition, matching chain, etc. And, we introduce new graph labellings for enriching Topsnut-matchings and show these labellings can be realized for trees or spanning trees of networks. In theoretical works we explore Graph Labelling Analysis, and show first that every graph admits our extremal labellings and set-type labellings in graph theory. Many of the graph labellings mentioned are related with problems of set matching partitions to number theory, and yield new objects and new problems to graph theory.

show abstract

“…As the first exploration, we will apply spanning trees of dynamic networks as the models of encryption, and use every-zero graphic groups to be as desired data base of Topsnut-gpws, and then change the Topsnut-gpws of N (t) by various every-zero graphic groups under the equivalent coloring/labellings or under the different configurations of graphs ( [30], [22], [18], [16], [17], [19], [32]).…”

Section: Graphic Groupsmentioning

confidence: 99%

Connection Between Text-based Passwords and Topological Graphic Passwords

Yao

Sun

et al. 2018

2018 IEEE 4th Information Technology and Mechatronics Engineering Conference (ITOEC)

Self Cite

View full text Add to dashboard Cite

Topological graphic passwords (Topsnut-gpws) are one of graph-type passwords, but differ from the existing graphical passwords, since Topsnut-gpws are saved in computer by algebraic matrices. We focus on the transformation between textbased passwords (TB-paws) and Topsnut-gpws in this article. Several methods for generating TB-paws from Topsnut-gpws are introduced; these methods are based on topological structures and graph coloring/labellings, such that authentications must have two steps: one is topological structure authentication, and another is text-based authentication. Four basic topological structure authentications are introduced and many text-based authentications follow Topsnut-gpws. Our methods are based on algebraic, number theory and graph theory, many of them can be transformed into polynomial algorithms. A new type of matrices for describing Topsnut-gpws is created here, and such matrices can produce TB-paws in complex forms and longer bytes. Estimating the space of TB-paws made by Topsnutgpws is very important for application. We propose to encrypt dynamic networks and try to face: (1) thousands of nodes and links of dynamic networks; (2) large numbers of Topsnut-gpws generated by machines rather than human's hands. As a try, we apply spanning trees of dynamic networks and graphic groups (Topsnut-groups) to approximate the solutions of these two problems. We present some unknown problems in the end of the article for further research.

show abstract

Construction of New Graphical Passwords with Graceful-Type Labellings on Trees

Cited by 4 publications

References 9 publications

Using Chinese Characters To Generate Text-Based Passwords For Information Security

Using Chinese Characters To Generate Text-Based Passwords For Information Security

Topological Graphic Passwords And Their Matchings Towards Cryptography

Connection Between Text-based Passwords and Topological Graphic Passwords

Contact Info

Product

Resources

About