Enhancing Data Security through Rainbow Antimagic Graph Coloring for Secret-Share Distribution and Reconstruction

TL;DR

This paper introduces a novel approach using Rainbow Antimagic Graph Coloring to enhance secret-sharing schemes, improving data security and reconstruction among multiple participants.

Contribution

It proposes integrating Rainbow Antimagic coloring into secret-sharing schemes, offering improved security and efficient data reconstruction methods.

Findings

Enhanced data security through graph coloring techniques

Effective secret reconstruction with multiple communication rounds

Improved robustness of secret-sharing schemes

Abstract

Now-a-days, ensuring data security has become an increasingly formidable challenge in safeguarding individuals' sensitive information. Secret-sharing scheme has evolved as a most successful cryptographic technique that allows a secret to be divided or distributed among a group of participants in such a way that only a subset of those participants can reconstruct the original secret. This provides a safe level of security and redundancy, ensuring that no single individual possesses the complete secret. The implementation of Rainbow Antimagic coloring within these schemes not only safeguards the data but also ensures an advanced level of information security among multi-participant groups. Additionally, the retrieved data is reconstructed and can be disseminated to all group participants via multiple rounds of communication.