{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:41:34Z","timestamp":1760244094666,"version":"build-2065373602"},"reference-count":25,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2022,11,14]],"date-time":"2022-11-14T00:00:00Z","timestamp":1668384000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Natural Science Foundation of China","award":["41971407"],"award-info":[{"award-number":["41971407"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>Advances in network technology have enhanced the concern for network security issues. In order to address the problem that hopping graph are vulnerable to external attacks (e.g., the changing rules of fixed graphs are more easily grasped by attackers) and the challenge of achieving both interactivity and randomness in a network environment, this paper proposed a scheme for a dynamic graph based on chaos and cryptographic random mapping. The scheme allows hopping nodes to compute and obtain dynamically random and uncorrelated graph of other nodes independently of each other without additional interaction after the computational process of synchronous mirroring. We first iterate through the chaos algorithm to generate random seed parameters, which are used as input parameters for the encryption algorithm; secondly, we execute the encryption algorithm to generate a ciphertext of a specified length, which is converted into a fixed point number; and finally, the fixed point number is mapped to the network parameters corresponding to each node. The hopping nodes are independently updated with the same hopping map at each hopping period, and the configuration of their own network parameters is updated, so that the updated graph can effectively prevent external attacks. Finally, we have carried out simulation experiments and related tests on the proposed scheme and demonstrated that the performance requirements of the random graphs can be satisfied in both general and extreme cases.<\/jats:p>","DOI":"10.3390\/info13110537","type":"journal-article","created":{"date-parts":[[2022,11,15]],"date-time":"2022-11-15T02:32:16Z","timestamp":1668479536000},"page":"537","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic Random Graph Protection Scheme Based on Chaos and Cryptographic Random Mapping"],"prefix":"10.3390","volume":"13","author":[{"given":"Zhu","family":"Fang","sequence":"first","affiliation":[{"name":"School of Electronic Information, Wuhan University, Wuhan 430065, China"}],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Zhengquan","family":"Xu","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, Wuhan 430079, China"}],"role":[{"role":"author","vocab":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,11,14]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Jajodia, S., Ghosh, A.K., Swarup, V., Wang, C., and Wang, X.S. (2011). Moving Target Defense: Creating Asymmetric Uncertainty for Cyber Threats, Springer Publishing Company.","DOI":"10.1007\/978-1-4614-0977-9"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/MSP.2014.30","article-title":"Moving-target defenses for computer networks","volume":"12","author":"Carvalho","year":"2014","journal-title":"IEEE Secur. Priv."},{"key":"ref_3","first-page":"3949292","article-title":"A Cyber Deception Defense Method Based on Signal Game to Deal with Network Intrusion","volume":"2020","author":"Gao","year":"2022","journal-title":"Secur. Commun. Netw."},{"key":"ref_4","first-page":"968","article-title":"Research and development of moving target defense technology","volume":"53","author":"Cai","year":"2016","journal-title":"J. Comput. Res. Dev."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Maleki, H., Valizadeh, S., Koch, W., Bestavros, A., and van Dijk, M. (2016, January 24). Markov modeling of moving target defense games. Proceedings of the 2016 ACM Workshop on Moving Target Defense, Vienna, Austria.","DOI":"10.1145\/2995272.2995273"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Zhang, L., Guo, Y., Yuwen, H., and Wang, Y. (2016, January 16\u201319). A port hopping based dos mitigation scheme in sdn network. Proceedings of the 2016 12th International Conference on Computational Intelligence and Security (CIS), Wuxi, China.","DOI":"10.1109\/CIS.2016.0077"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1109\/TNSM.2018.2889842","article-title":"Fast IP hopping randomization to secure hop-by-hop access in SDN","volume":"16","author":"Chang","year":"2018","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Luo, Y.-B., Wang, B.-S., Wang, X.-F., Hu, X.-F., Cai, G.-L., and Sun, H. (2015, January 20\u201322). Rpah: Random port and address hopping for thwarting internal and external adversaries. Proceedings of the 2015 IEEE Trustcom\/BigDataSE\/ISPA, Helsinki, Finland.","DOI":"10.1109\/Trustcom.2015.383"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"164","DOI":"10.2478\/popets-2021-0042","article-title":"Three years later: A study of mac address randomization in mobile devices and when it succeeds","volume":"2021","author":"Fenske","year":"2021","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Hong, S., Xu, L., Wang, H., and Gu, G. (2015, January 8\u201311). Poisoning network visibility in software-defined networks: New attacks and countermeasures. Proceedings of the NDSS, San Diego, CA, USA.","DOI":"10.14722\/ndss.2015.23283"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Albanese, M., Benedictis, A.D., Jajodia, S., and Sun, K. (2013, January 4\u20138). A moving target defense mechanism for manets based on identity virtualization. Proceedings of the Communications & Network Security, Berlin, Germany.","DOI":"10.1109\/CNS.2013.6682717"},{"key":"ref_12","unstructured":"Xu, J., Kalbarczyk, Z., and Iyer, R.K. (2003, January 6\u20138). Transparent runtime randomization for security. Proceedings of the 22nd International Symposium on Reliable Distributed Systems, Florence, Italy."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Park, Y., Chang, S.-Y., and Krishnamurthy, L.M. (2016, January 29\u201330). Watermarking for detecting freeloader misbehavior in software-defined network. Proceedings of the International Conference on Computing, Greater Noida, India.","DOI":"10.1109\/ICCNC.2016.7440628"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Chang, S.-Y., Hu, Y.-C., and Liu, Z. (2015, January 28\u201330). Securing wireless medium access control against insider denial-of-service attackers. Proceedings of the 2015 IEEE Conference on Communications and Network Security (CNS), Florence, Italy.","DOI":"10.1109\/CNS.2015.7346848"},{"key":"ref_15","unstructured":"Al-Shaer, E., Duan, Q., and Jafarian, J.H. (2012, January 3\u20135). Random host mutation for moving target defense. Proceedings of the International Conference on Security and Privacy in Communication Systems, Padua, Italy."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"3471","DOI":"10.1016\/j.comnet.2007.02.006","article-title":"Defending against hitlist worms using network address space randomization","volume":"51","author":"Antonatos","year":"2007","journal-title":"Comput. Netw."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Dunlop, M., Groat, S., Urbanski, W., Marchany, R., and Tront, J. (2011, January 7\u201310). Mt6d: A moving target ipv6 defense. Proceedings of the 2011-MILCOM 2011 Military Communications Conference, Baltimore, MD, USA.","DOI":"10.1109\/MILCOM.2011.6127486"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/S0097-8493(98)00033-8","article-title":"Comparison of MPEG encryption algorithms","volume":"22","author":"Qiao","year":"1998","journal-title":"Comput. Graph."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Ellis, S.R. (2013). A Cryptography Primer. Computer and Information Security Handbook, Morgan Kaufmann.","DOI":"10.1016\/B978-0-12-803843-7.00003-X"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Tyagi, A., Pandey, N., and Gupta, K. (2016, January 11\u201313). PFSCL based Linear Feedback Shift Register. Proceedings of the International Conference on Computational Techniques in Information & Communication Technologies, New Delhi, India.","DOI":"10.1109\/ICCTICT.2016.7514646"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1302","DOI":"10.1109\/12.5994","article-title":"Linear feedback shift register design using cyclic codes","volume":"37","author":"Wang","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Jetzek, U. (2018). Galois Fields, Linear Feedback Shift Registers and Their Applications, Carl Hanser Verlag.","DOI":"10.1007\/978-3-446-45613-6"},{"key":"ref_23","unstructured":"Marinet, F. (2001). Pseudo-Random Number Generator. (US20010023423A1), U.S. Patent, Publication number: EP1143616A1."},{"key":"ref_24","unstructured":"Lee, H.C.J., and Thinh, V.L.L. (2004, January 26\u201329). Port hopping for resilient networks. Proceedings of the IEEE 60th Vehicular Technology Conference, 2004, VTC2004-Fall, Los Angeles, CA, USA."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Chen, D., Qing, D., and Wang, D. (2012, January 18\u201321). AES Key Expansion Algorithm Based on 2D Logistic Mapping. Proceedings of the 2012 Fifth International Workshop on Chaos-Fractals Theories and Applications (IWCFTA), Dalian, China.","DOI":"10.1109\/IWCFTA.2012.81"}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/13\/11\/537\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:17:53Z","timestamp":1760145473000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/13\/11\/537"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,14]]},"references-count":25,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2022,11]]}},"alternative-id":["info13110537"],"URL":"https:\/\/doi.org\/10.3390\/info13110537","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2022,11,14]]}}}