Consensus with preserved privacy against neighbor collusion
Name
11768_2020_23_ReferencePDF.pdf
Size
468.23 KB
Format
Adobe PDF
Checksum (MD5)
3004f774e1acba353f064201eab118e4
Author(s)
Zhang, Silun
Ohlson Timoudas, Thomas
Dahleh, Munther A
Date Issued
December 2020
Journal
Control Theory and Technology
Publisher
Springer Science and Business Media LLC
Citation
Zhang, Silun et al. "Consensus with preserved privacy against neighbor collusion." Control Theory and Technology 18, 4 (December 2020): 409–418 © 2020, South China University of Technology, Academy of Mathematics and Systems Science, CAS and Springer-Verlag GmbH Germany, part of Springer Nature
Version
Author's final manuscript
Abstract
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 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.
MIT Department
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s11768-020-00023-x
