Graph Theory for Computer Science

14From Nodes to Keys: Graph-Based Cryptosystems for Secure Communication

Meera Saraswathi¹, Dhanyashree², K. N. Meera³* and Yuqing Lin^4,5

¹Division of Applied Sciences and Humanities, School of Engineering, Cochin University of Science and Technology, Kochi, Kerala, India

²Department of Mathematics, Mangalore Institute of Technology & Engineering, Moodabidri, Dakshina Kannada, Karnataka, India

³Department of Mathematics, Amrita School of Engineering, Amrita Vishwa Vidyapeetham, Bengaluru, India

⁴School of Information and Physical Sciences, College of Engineering, Science and Environment, The University of Newcastle, Callaghan, NSW, Australia

⁵School of Sciences, Jimei University, Xiamen, China

Abstract

Secure communication is vital for all network types, ensuring data confidentiality, integrity, and authenticity. Techniques like cryptographic algorithms, message obfuscation, and identity-based channels achieve this. Graph-based cryptosystems utilize graph theory to bolster security. Graphs serve as models for networks, presenting data and generating cryptographic keys. They visually represent nodes and edges, aiding in vulnerability assessment and security optimization. Graphs organize complex data, aiding cryptographic algorithms and facilitating encryption and decryption. They also generate keys, utilizing graph properties. Labeling methods assign unique labels or colors to graph elements, serving as cryptographic keys or parameters. This chapter focuses on utilizing graph-based ...