User-preference-aware Private-preserving Average Consensus

Zhenping Chen, Lin X. Cai
{"title":"User-preference-aware Private-preserving Average Consensus","authors":"Zhenping Chen, Lin X. Cai","doi":"10.1109/PACRIM47961.2019.8985093","DOIUrl":null,"url":null,"abstract":"Privacy-preserving average consensus is important for multi-agent systems and has been extensively studied. Considering the more practical scenario that different users may have different privacy preferences, there exists a tradeoff between the convergence time and the data privacy protection. In this paper, we design the added noises with the optimal variances considering the heterogeneous user preferences. We develop a novel definition on the convergence time for ensuring (α, γ)- accuracy, which depicts how fast the consensus protocol can converge to the average with a bounded deviation, α, with a probability no smaller than 1 – γ. We obtain the analytical expression for the upper bound of the convergence time. We design the utility of each agent which is inversely proportional to the privacy preference, such that some user may prefer a lower privacy for a higher utility. With the introduction of the reward- incentive mechanism, we then formulate optimization problems to optimize the distribution and the variance of the added noises. Simulations were conducted to verify the analysis.","PeriodicalId":152556,"journal":{"name":"2019 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM47961.2019.8985093","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Privacy-preserving average consensus is important for multi-agent systems and has been extensively studied. Considering the more practical scenario that different users may have different privacy preferences, there exists a tradeoff between the convergence time and the data privacy protection. In this paper, we design the added noises with the optimal variances considering the heterogeneous user preferences. We develop a novel definition on the convergence time for ensuring (α, γ)- accuracy, which depicts how fast the consensus protocol can converge to the average with a bounded deviation, α, with a probability no smaller than 1 – γ. We obtain the analytical expression for the upper bound of the convergence time. We design the utility of each agent which is inversely proportional to the privacy preference, such that some user may prefer a lower privacy for a higher utility. With the introduction of the reward- incentive mechanism, we then formulate optimization problems to optimize the distribution and the variance of the added noises. Simulations were conducted to verify the analysis.
用户偏好感知私有保护平均共识
隐私保护的平均共识是多智能体系统的一个重要问题,已经得到了广泛的研究。考虑到更实际的场景,不同用户可能有不同的隐私偏好,在收敛时间和数据隐私保护之间存在权衡。在本文中,我们考虑到用户偏好的异质性,设计了具有最优方差的附加噪声。我们提出了保证(α, γ)-精度的收敛时间的新定义,它描述了共识协议以不小于1 - γ的概率收敛到有界偏差α的平均值的速度。得到了收敛时间上界的解析表达式。我们设计了每个代理的效用与隐私偏好成反比,这样一些用户可能更喜欢较低的隐私而不是较高的效用。在引入奖励激励机制的基础上,提出了优化问题,对附加噪声的分布和方差进行优化。通过仿真验证了分析的正确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信