保护隐私对抗邻居共谋的共识
Consensus with Preserved Privacy against Neighbor Collusion
摘要：
基于Shamir的秘密共享方案，提出了一种解决平均一致性问题的隐私保护算法。在该方案中，网络中的多个智能体在达成一致之前，不会暴露各自的状态。与其他方法不同的是，该算法使网络抵抗任何给定数量的邻居的共谋（即使所有邻居的共谋）。这项工作的另一个优点是，这样的方法可以保护网络共识过程从窃听。
英文摘要：
This paper proposes a privacy-preserving algorithm to solve the average consensus problem based on Shamir's secret sharing scheme, in which a network of agents reach an agreement on their states without exposing their individual state until an agreement is reached. Unlike other methods, the proposed algorithm renders the network resistant to the collusion of any given number of neighbors (even with all neighbors' colluding). Another virtue of this work is that such a method can protect the network consensus procedure from eavesdropping.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
