DOE OSTI · 2587501
Privacy-Preserving Average Consensus With Beaver Triple and Communication Obfuscation
Abstract
A privacy-preserving average consensus algorithm is proposed that synergizes the Beaver triple in secret sharing theory and noise obfuscation. The algorithm safeguards the initial values of agents against passive adversaries in a multiagent system. It is proved that the proposed algorithm can concurrently ensure average consensus and privacy, while also reducing the online computation and communication overhead compared to encryption-based ones. In addition, it imposes a less stringent condition for privacy preservation compared to certain noise-obfuscation techniques.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Wang, Peng [Shanghai Jiao Tong Univ. (China)] (ORCID:0000000223725587), Lu, Yang [Lancaster Univ., Bailrigg (United Kingdom)] (ORCID:000000018981098X), Lian, Jianming [Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)] (ORCID:0000000312705350), Pan, Lulu [Shanghai Jiao Tong Univ. (China)] (ORCID:0000000177249240), Shao, Haibin [Shanghai Jiao Tong Univ. (China)] (ORCID:000000033343625X), Li, Ning [Shanghai Jiao Tong Univ. (China)] (ORCID:0000000310259641). 2025-02-06. Privacy-Preserving Average Consensus With Beaver Triple and Communication Obfuscation. https://doi.org/10.1109/tac.2025.3539731
Cite the original work for its findings. Save a collection to share your selection of sources.