A Novel Approach to Secure Distance Matrix Domination in Fundamental Graphs

Authors

  • Dr.M Nazreen Banu Associate Professor, Department of Mathematics, Thassim Beevi Abdul Kader College for Women, Ramanathapuram
  • Dr. Pankit S. Gandhi Associate Professor, Department of Mathematics, Kishinchand Chellaram College, Mumbai
  • C. Ruby Sharmila Assistant Professor, Department of Mathematics, Tamilnadu College of Engineering, Coimbatore
  • A.Atkinswestley Associate Professor, Department of Mathematics, K.Ramakrishnan College Of Engineering, Tiruchirapalli
  • J. Juli Amala Rani Assistant Professor, Department of Mathematics, Panimalar Engineering College, Chennai
  • G. Suganthi Assistant professor, Department of Mathematics, Sona College of Technology, Salem
  • Dr.B.Sivasankari Professor (Mathematics), Department of Agricultural Economics, Agricultural College and Research Institute, Madurai

Keywords:

Domination, Dominating set, Secure distance matrix domination, Distance domination, complete graph.

Abstract

Distance matrix domination in fundamental graphs plays a critical role in various applications, such as network design, communication systems, and social network analysis. Ensuring the security of these distance matrices is essential to protecting the integrity and privacy of the underlying graph structure. This paper presents a novel approach to secure distance matrix domination by integrating advanced cryptographic techniques and privacy-preserving mechanisms.We propose the use of homomorphic encryption to allow computations on encrypted distance matrices, safeguarding data while maintaining functionality. Additionally, secure multi-party computation (MPC) enables collaborative domination in distributed networks without revealing individual node or edge data. To further protect graph structure, we employ graph perturbation techniques and differential privacy, ensuring that sensitive details about the graph are not exposed.Randomized shortest path computations are introduced to obscure direct inferences about the graph's topology, while zero-knowledge proofs (ZKP) allow verification of domination results without revealing the distance matrix. A decentralized framework leveraging blockchain ensures that the domination process remains transparent and secure. Finally, machine learning algorithms are integrated for real-time anomaly detection, enhancing the robustness of the domination process against adversarial attacks.This novel approach enhances the security and privacy of distance matrix domination in fundamental graphs, making it applicable to sensitive and large-scale network environments. The proposed methods ensure both accuracy and confidentiality, offering a significant advancement in secure graph analysis and optimization.

Downloads

Published

2024-09-22

How to Cite

Dr.M Nazreen Banu, Dr. Pankit S. Gandhi, C. Ruby Sharmila, A.Atkinswestley, J. Juli Amala Rani, G. Suganthi, & Dr.B.Sivasankari. (2024). A Novel Approach to Secure Distance Matrix Domination in Fundamental Graphs. Journal of Computational Analysis and Applications (JoCAAA), 33(08), 315–325. Retrieved from https://eudoxuspress.com/index.php/pub/article/view/1288

Issue

Section

Articles

Similar Articles

<< < 7 8 9 10 11 12 13 14 15 16 > >> 

You may also start an advanced similarity search for this article.