Differential Privacy and Prediction Uncertainty of Gossip Protocols in General Networks

Yufan Huang, Richeng Jin, H. Dai
{"title":"Differential Privacy and Prediction Uncertainty of Gossip Protocols in General Networks","authors":"Yufan Huang, Richeng Jin, H. Dai","doi":"10.1109/GLOBECOM42002.2020.9322558","DOIUrl":null,"url":null,"abstract":"Recent advances in social media and information technology have enabled much faster dissemination of information, while at the same time raise concerns about privacy leakage after various privacy breaches. Therefore, the privacy guarantees of information dissemination protocols have attracted increasing research interests, among which the gossip protocols assume vital importance in various information exchange applications. Very recently, the rigorous framework of differential privacy has been introduced to measure the privacy guarantees of gossip protocols in the simplified complete network scenario. In this work, we extend the study to general networks. First, lower bounds of the differential privacy guarantees are derived for the gossip protocols in general networks in both synchronous and asynchronous settings. The prediction uncertainty of the source node given a uniform prior is also determined. It is found that source anonymity is closely related to some key network structure parameters in the general network setting. Then, we investigate information spreading in wireless networks with unreliable communications, and quantity the tradeoff between differential privacy guarantees and information spreading efficiency. Finally, considering that the attacker may not be present in the beginning of the information dissemination process, the scenario of delayed monitoring is studied and the corresponding differential privacy guarantees are evaluated.","PeriodicalId":12759,"journal":{"name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","volume":"25 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOBECOM42002.2020.9322558","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Recent advances in social media and information technology have enabled much faster dissemination of information, while at the same time raise concerns about privacy leakage after various privacy breaches. Therefore, the privacy guarantees of information dissemination protocols have attracted increasing research interests, among which the gossip protocols assume vital importance in various information exchange applications. Very recently, the rigorous framework of differential privacy has been introduced to measure the privacy guarantees of gossip protocols in the simplified complete network scenario. In this work, we extend the study to general networks. First, lower bounds of the differential privacy guarantees are derived for the gossip protocols in general networks in both synchronous and asynchronous settings. The prediction uncertainty of the source node given a uniform prior is also determined. It is found that source anonymity is closely related to some key network structure parameters in the general network setting. Then, we investigate information spreading in wireless networks with unreliable communications, and quantity the tradeoff between differential privacy guarantees and information spreading efficiency. Finally, considering that the attacker may not be present in the beginning of the information dissemination process, the scenario of delayed monitoring is studied and the corresponding differential privacy guarantees are evaluated.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通用网络中八卦协议的差分隐私和预测不确定性
最近社交媒体和信息技术的进步使信息的传播速度大大加快,同时也引起了人们对各种隐私泄露事件后隐私泄露的担忧。因此,信息传播协议的隐私保障问题引起了越来越多的研究兴趣,其中八卦协议在各种信息交换应用中起着至关重要的作用。最近,人们引入了严格的差分隐私框架来衡量流言协议在简化的完整网络场景下的隐私保证。在这项工作中,我们将研究扩展到一般网络。首先,推导了一般网络中同步和异步两种情况下八卦协议差分隐私保证的下界。在给定均匀先验条件下,确定了源节点的预测不确定性。研究发现,在一般的网络设置中,源匿名性与一些关键的网络结构参数密切相关。然后,我们研究了不可靠通信无线网络中的信息传播,并量化了差分隐私保证与信息传播效率之间的权衡。最后,考虑到攻击者在信息传播初期可能不存在,研究了延迟监控场景,并评估了相应的差分隐私保障。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
AirID: Injecting a Custom RF Fingerprint for Enhanced UAV Identification using Deep Learning Oversampling Algorithm based on Reinforcement Learning in Imbalanced Problems FAST-RAM: A Fast AI-assistant Solution for Task Offloading and Resource Allocation in MEC Achieving Privacy-Preserving Vehicle Selection for Effective Content Dissemination in Smart Cities Age-optimal Transmission Policy for Markov Source with Differential Encoding
×
引用
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