Privacy-Preserving Average Consensus for Multi-agent Systems with Directed Topologies

Xinyue Qiao, Yuxin Wu, De-yuan Meng
{"title":"Privacy-Preserving Average Consensus for Multi-agent Systems with Directed Topologies","authors":"Xinyue Qiao, Yuxin Wu, De-yuan Meng","doi":"10.1109/ICCSS53909.2021.9722003","DOIUrl":null,"url":null,"abstract":"In the process of forming average consensus, the privacy that the agents do not want to disclose may be maliciously speculated and used by others. To avoid breaches of privacy for multi-agent systems subject to directed topologies, we propose a novel privacy-preserving average consensus algorithm that employs an improved Laplacian-type control protocol. It is shown that all agents can achieve accurate average consensus without the weight-balance condition despite directed topologies. To ward off internal malicious agents, we add edge-based zero-sum interference signals in the process of transferring information. Thus, by introducing a private parameter, all agents can be protected against malicious eavesdroppers who know the entire topology and can intercept communication links. Two simulation examples are presented to demonstrate the validity of our algorithms for realizing the average consensus under the impacts of malicious adversaries.","PeriodicalId":435816,"journal":{"name":"2021 8th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 8th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSS53909.2021.9722003","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In the process of forming average consensus, the privacy that the agents do not want to disclose may be maliciously speculated and used by others. To avoid breaches of privacy for multi-agent systems subject to directed topologies, we propose a novel privacy-preserving average consensus algorithm that employs an improved Laplacian-type control protocol. It is shown that all agents can achieve accurate average consensus without the weight-balance condition despite directed topologies. To ward off internal malicious agents, we add edge-based zero-sum interference signals in the process of transferring information. Thus, by introducing a private parameter, all agents can be protected against malicious eavesdroppers who know the entire topology and can intercept communication links. Two simulation examples are presented to demonstrate the validity of our algorithms for realizing the average consensus under the impacts of malicious adversaries.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有有向拓扑的多智能体系统的隐私保护平均一致性
在形成平均共识的过程中,代理人不愿披露的隐私可能被他人恶意推测和利用。为了避免受定向拓扑约束的多智能体系统的隐私泄露,我们提出了一种新的隐私保护平均共识算法,该算法采用改进的拉普拉斯型控制协议。结果表明,尽管存在定向拓扑,但所有智能体都可以在没有权重平衡条件的情况下获得准确的平均一致性。为了抵御内部恶意代理,我们在信息传递过程中加入了基于边缘的零和干扰信号。因此,通过引入私有参数,可以保护所有代理免受了解整个拓扑结构并可以拦截通信链接的恶意窃听者的攻击。给出了两个仿真实例,验证了算法在恶意攻击影响下实现平均共识的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Research on the Prediction Model of Key Personnel's Food Crime Based on Stacking Model Fusion A Multidimensional System Architecture Oriented to the Data Space of Manufacturing Enterprises Semi-Supervised Deep Clustering with Soft Membership Affinity Moving Target Shooting Control Policy Based on Deep Reinforcement Learning Prediction of ship fuel consumption based on Elastic network regression model
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1