图多重着色在解决秘密共享网络中节点故障与攻击问题中的应用
Graph multicoloring in solving node malfunction and attacks in a secret-sharing network
AI总结:
针对秘密共享网络中存在攻击者窃密及节点故障/离线的问题,本文采用图多重着色技术,重点研究单攻击者、故障节点数可变场景下的问题求解。
摘要:
我们观察到一种网络场景:秘密的各个部分被分发至网络中的各个节点。网络内有一组攻击者正主动试图获取完整秘密,同时还存在部分节点发生故障或离线的问题。本文中,我们采用图多重着色技术来解决这一问题,重点研究单个攻击者、故障节点数量可变的场景。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。