Participation-Dependent Privacy Preservation in Cross-Silo Federated Learning

IF 5.5 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Yanling Qin;Xiangping Zheng;Qian Ma;Guocheng Liao;Xu Chen
{"title":"Participation-Dependent Privacy Preservation in Cross-Silo Federated Learning","authors":"Yanling Qin;Xiangping Zheng;Qian Ma;Guocheng Liao;Xu Chen","doi":"10.1109/TSC.2024.3506479","DOIUrl":null,"url":null,"abstract":"In cross-silo federated learning (FL), clients of common interest cooperatively train a global model without sharing local sensitive data, but they still face potential privacy leakage due to privacy threats from malicious attackers. Although some articles have proposed effective privacy-preserving mechanisms for FL (such as differential privacy (DP)), clients in cross-silo FL are usually different companies or organizations who may behave selfishly to optimize their own benefits. In this article, we study DP-based cross-silo FL where clients selfishly decide their participation levels (i.e., data sizes for model trainings) and privacy leakage tolerance levels to trade off between model accuracy loss and privacy loss, and we model clients’ interactions as a participation-dependent privacy preservation game. It is challenging to analyze the game since the comprehensive impact of participation levels and privacy leakage tolerance levels on model accuracy is unclear and the behaviors of heterogeneous clients are coupled in a highly complex manner. To capture the impact of participation and privacy preservation behaviors, we first characterize the optimality gap of DP-based cross-silo FL for both convex and non-convex models, where the privacy leakage tolerance levels and the participation levels are coupled nonlinearly. We model clients’ costs based on the optimality gap, and prove that clients’ selfish participation-dependent privacy preservation game is a potential game. To analyze the optimal strategies of heterogeneous clients in a stable state, we derive the closed-form expression for the unique Nash equilibrium (NE), where clients may choose full participation or partial participation, and the equilibrium privacy preservation strategy depends on clients’ accuracy-privacy preference ratios. We analyze the social efficiency of the NE by calculating the price of anarchy (PoA) and show that the PoA increases with the number of clients and the heterogeneity of clients’ model accuracy preferences. To improve the social efficiency achieved at equilibrium, we design a socially efficient incentive mechanism that allows clients with large model accuracy preferences to compensate clients with small model accuracy preferences. Extensive experiments verify our theoretical results for both the convex and non-convex models as well as both the i.i.d. data distribution case and the non-i.i.d. data distribution case.","PeriodicalId":13255,"journal":{"name":"IEEE Transactions on Services Computing","volume":"18 1","pages":"342-356"},"PeriodicalIF":5.5000,"publicationDate":"2024-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Services Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10767289/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

In cross-silo federated learning (FL), clients of common interest cooperatively train a global model without sharing local sensitive data, but they still face potential privacy leakage due to privacy threats from malicious attackers. Although some articles have proposed effective privacy-preserving mechanisms for FL (such as differential privacy (DP)), clients in cross-silo FL are usually different companies or organizations who may behave selfishly to optimize their own benefits. In this article, we study DP-based cross-silo FL where clients selfishly decide their participation levels (i.e., data sizes for model trainings) and privacy leakage tolerance levels to trade off between model accuracy loss and privacy loss, and we model clients’ interactions as a participation-dependent privacy preservation game. It is challenging to analyze the game since the comprehensive impact of participation levels and privacy leakage tolerance levels on model accuracy is unclear and the behaviors of heterogeneous clients are coupled in a highly complex manner. To capture the impact of participation and privacy preservation behaviors, we first characterize the optimality gap of DP-based cross-silo FL for both convex and non-convex models, where the privacy leakage tolerance levels and the participation levels are coupled nonlinearly. We model clients’ costs based on the optimality gap, and prove that clients’ selfish participation-dependent privacy preservation game is a potential game. To analyze the optimal strategies of heterogeneous clients in a stable state, we derive the closed-form expression for the unique Nash equilibrium (NE), where clients may choose full participation or partial participation, and the equilibrium privacy preservation strategy depends on clients’ accuracy-privacy preference ratios. We analyze the social efficiency of the NE by calculating the price of anarchy (PoA) and show that the PoA increases with the number of clients and the heterogeneity of clients’ model accuracy preferences. To improve the social efficiency achieved at equilibrium, we design a socially efficient incentive mechanism that allows clients with large model accuracy preferences to compensate clients with small model accuracy preferences. Extensive experiments verify our theoretical results for both the convex and non-convex models as well as both the i.i.d. data distribution case and the non-i.i.d. data distribution case.
跨ilo 联合学习中依赖参与的隐私保护
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Services Computing
IEEE Transactions on Services Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
11.50
自引率
6.20%
发文量
278
审稿时长
>12 weeks
期刊介绍: IEEE Transactions on Services Computing encompasses the computing and software aspects of the science and technology of services innovation research and development. It places emphasis on algorithmic, mathematical, statistical, and computational methods central to services computing. Topics covered include Service Oriented Architecture, Web Services, Business Process Integration, Solution Performance Management, and Services Operations and Management. The transactions address mathematical foundations, security, privacy, agreement, contract, discovery, negotiation, collaboration, and quality of service for web services. It also covers areas like composite web service creation, business and scientific applications, standards, utility models, business process modeling, integration, collaboration, and more in the realm of Services Computing.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信