REVIEW
Graph multicoloring in solving node malfunction and attacks in a secret-sharing network
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original 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.
Discussion (0). Continue with ORCID to comment.