On magic matching sets having many magic parameters in information networks

Graphical passwords have been proposed as a possible alternative to text-based schemes, but graphical passwords, in storage and communication, require much more storage space than text based passwords, and network transfer delay is also a concern for them. An idea of "graphical structure plus number theory" (GSPNT) for designing new type of passwords is an alternative to typical graphical passwords. Magic matching set having many magic parameters is one of graphical passwords produced by GSPNT. Some results on magic matching sets are obtained and interesting problems are proposed at the end of this article.

[1]  Bing Yao,et al.  Exploring New Cryptographical Construction of Complex Network Data , 2016, 2016 IEEE First International Conference on Data Science in Cyberspace (DSC).

[2]  Hui Sun,et al.  On Couple Magic Total Labellings of Graphs for Designing New Graphical Cryptographs , 2017, 2017 4th International Conference on Information Science and Control Engineering (ICISCE).

[3]  Theresa-Marie Rhyne,et al.  Future Directions in Computer Graphics and Visualization: From CG&A's Editorial Board , 2015, IEEE Computer Graphics and Applications.

[4]  Ying Zhu,et al.  Graphical passwords: a survey , 2005, 21st Annual Computer Security Applications Conference (ACSAC'05).

[5]  Jin Xu,et al.  On Generalized Total Graceful Labellings of Graphs , 2018, Ars Comb..

[6]  R. Shepard Recognition memory for words, sentences, and pictures , 1967 .

[7]  Bing Yao,et al.  Twin Odd-graceful Trees Towards Information Security , 2017 .

[8]  Wang Hongyu,et al.  Labelling Sun-Like Graphs from Scale-Free Small-World Network Models , 2014, 2014 Sixth International Conference on Measuring Technology and Mechatronics Automation.