Consensus with preserved privacy against neighbor collusion
Silun Zhang1
Thomas Ohlson Timoudas2
Munther A.Dahleh1
1.Laboratory for Information and Decision Systems (LIDS),MIT, Cambridge, MA 02139, USA2.KTH Royal Institute of Technology, 100 44 Stockholm,Sweden
摘要：This paper proposes a privacy-preserving algorithm to solve the average-consensus problem based on Shamir's secret shar-ing scheme, in which a network of agents reach an agreement on their states without exposing their individual states 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.
机标关键词：
论文发表日期：2020-11-05
在线出版日期：2025-08-15（本平台首次上网日期，不代表文献的发表时间）
页数：10( 409-418 )
英文信息