Graph multicoloring in solving node malfunction and attacks in a secret-sharing network

TL;DR

This paper explores the use of graph multicoloring techniques to enhance the security and robustness of secret-sharing networks against node malfunction and targeted attacks.

Contribution

It introduces a novel application of graph multicoloring to model and mitigate node malfunction and attack scenarios in secret-sharing networks.

Findings

Effective modeling of attack and malfunction scenarios

Improved strategies for secure secret distribution

Insights into network robustness

Abstract

We observe a network scenario where parts of a secret are distributed among its nodes. Within the network, a group of attackers is actively trying to obtain the complete secret, while there is also the issue of some nodes malfunctioning or being absent. In this paper, we address this problem by employing graph multicoloring techniques, focusing on the case of a single attacker and varying numbers of malfunctioning nodes.