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

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.