VPFLI: Verifiable Privacy-Preserving Federated Learning With Irregular Users Based on Single Server

IF 5.8 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Services Computing Pub Date : 2024-12-23 DOI:10.1109/TSC.2024.3520867
Yanli Ren;Yerong Li;Guorui Feng;Xinpeng Zhang
{"title":"VPFLI: Verifiable Privacy-Preserving Federated Learning With Irregular Users Based on Single Server","authors":"Yanli Ren;Yerong Li;Guorui Feng;Xinpeng Zhang","doi":"10.1109/TSC.2024.3520867","DOIUrl":null,"url":null,"abstract":"Federated learning (FL) is widely used in neural network-based deep learning, which allows multiple users to jointly train a model without disclosing their data. However, the data quality of the users is not uniform, and some users with poor computing ability and outdated equipments called irregular ones may collect low-quality data and thus reduce the accuracy of the global model. In addition, the untrusted server may return wrong aggregation results to cheat the users. To solve these problems, we propose a verifiable privacy-preserving FL protocol with irregular users (VPFLI) based on single server. The protocol is privacy-preserving for the untrusted server and it is proved secure based on drop-tolerant homomorphic encryption. For low-quality datasets, their proportion would be decreased in the aggregation results in order to ensure the accuracy of the global model. Also, the aggregation results can be effectively verified by the users based on linear homomorphic hash. Moreover, VPFLI is proposed based on single server, which is more applicable in reality compare with the previous ones based on two non-colluding servers. The experiments show that VPFLI improves the accuracy of the model from 83.5% to 91.5% based on MNIST dataset compared to the traditional FL protocols.","PeriodicalId":13255,"journal":{"name":"IEEE Transactions on Services Computing","volume":"18 2","pages":"1124-1136"},"PeriodicalIF":5.8000,"publicationDate":"2024-12-23","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/10812050/","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

Federated learning (FL) is widely used in neural network-based deep learning, which allows multiple users to jointly train a model without disclosing their data. However, the data quality of the users is not uniform, and some users with poor computing ability and outdated equipments called irregular ones may collect low-quality data and thus reduce the accuracy of the global model. In addition, the untrusted server may return wrong aggregation results to cheat the users. To solve these problems, we propose a verifiable privacy-preserving FL protocol with irregular users (VPFLI) based on single server. The protocol is privacy-preserving for the untrusted server and it is proved secure based on drop-tolerant homomorphic encryption. For low-quality datasets, their proportion would be decreased in the aggregation results in order to ensure the accuracy of the global model. Also, the aggregation results can be effectively verified by the users based on linear homomorphic hash. Moreover, VPFLI is proposed based on single server, which is more applicable in reality compare with the previous ones based on two non-colluding servers. The experiments show that VPFLI improves the accuracy of the model from 83.5% to 91.5% based on MNIST dataset compared to the traditional FL protocols.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
VPFLI:基于单服务器的不规则用户可验证隐私保护联邦学习
联邦学习(FL)广泛应用于基于神经网络的深度学习中,它允许多个用户在不泄露数据的情况下共同训练一个模型。然而,用户的数据质量是不均匀的,一些计算能力差的用户和过时的设备被称为不规则的用户可能会收集到低质量的数据,从而降低了全局模型的准确性。另外,不受信任的服务器可能返回错误的聚合结果来欺骗用户。为了解决这些问题,我们提出了一种基于单服务器的不规则用户可验证隐私保护FL协议(VPFLI)。该协议对不可信服务器具有保密性,并基于容错同态加密证明了该协议的安全性。对于低质量的数据集,为了保证全局模型的准确性,会降低它们在聚合结果中的比例。此外,基于线性同态哈希的聚合结果可以被用户有效地验证。此外,提出了基于单服务器的VPFLI算法,与以往基于两台非串通服务器的VPFLI算法相比,该算法在实际应用中更具适用性。实验表明,与传统的FL协议相比,VPFLI将基于MNIST数据集的模型准确率从83.5%提高到91.5%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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.
期刊最新文献
Kafka-Thor: A Kafka-based In-Edge Data Streaming Platform for Enhanced V2X Services PeerSync: Accelerating Containerized Model Inference at the Network Edge SMAUG: Semantic-Enhanced Mobile App Usage Data Generation With LLM AC-BaaS: An Asynchronous Cross-Blockchain as a Service for the Internet of Things Efficient and Fault Tolerant Data Stream Processing With Uncertain Data Rates in Serverless Edge Computing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1