Privacy-Preserving Verifiable Collaborative Learning with Chain Aggregation

Ming Zhou, Zhen Yang, Haiyang Yu, Yingxu Lai, Zhanyu Ma
{"title":"Privacy-Preserving Verifiable Collaborative Learning with Chain Aggregation","authors":"Ming Zhou, Zhen Yang, Haiyang Yu, Yingxu Lai, Zhanyu Ma","doi":"10.1109/IC-NIDC54101.2021.9660520","DOIUrl":null,"url":null,"abstract":"As many countries have promulgated laws on the protection of user data privacy, how to legally use user data has become a hot topic. With the emergence of collaborative learning, also known as federated learning, multiple participants can create a common, robust, and secure machine learning model aimed at addressing such critical issues of data sharing as privacy, security, and access, etc. Unfortunately, existing research shows that collaborative learning is not as secure as it claims, and the gradient leakage is still a key problem. To deal with this problem, a collaborative learning solution based on chained secure multi-party computing has been proposed recently. However, there are two security issues in this scheme that remain unsolved. First, if semi-honest users collude, the honest users' gradient also leaks. Second, if one of the users fails, it also cannot guarantee the correctness of the aggregation results. In this paper, we propose a privacy-preserving and verifiable chain collaborative learning scheme to solve this problem. First, we design a gradient encryption method, which can solve the problem of gradient leakage. Second, we create a verifiable method based on homomorphic hash technology. This method can ensure the correctness of users' aggregation results. At the same time, it can also track users who aggregate wrong. Compared with other solutions, our scheme is more efficient.","PeriodicalId":264468,"journal":{"name":"2021 7th IEEE International Conference on Network Intelligence and Digital Content (IC-NIDC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 7th IEEE International Conference on Network Intelligence and Digital Content (IC-NIDC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC-NIDC54101.2021.9660520","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

As many countries have promulgated laws on the protection of user data privacy, how to legally use user data has become a hot topic. With the emergence of collaborative learning, also known as federated learning, multiple participants can create a common, robust, and secure machine learning model aimed at addressing such critical issues of data sharing as privacy, security, and access, etc. Unfortunately, existing research shows that collaborative learning is not as secure as it claims, and the gradient leakage is still a key problem. To deal with this problem, a collaborative learning solution based on chained secure multi-party computing has been proposed recently. However, there are two security issues in this scheme that remain unsolved. First, if semi-honest users collude, the honest users' gradient also leaks. Second, if one of the users fails, it also cannot guarantee the correctness of the aggregation results. In this paper, we propose a privacy-preserving and verifiable chain collaborative learning scheme to solve this problem. First, we design a gradient encryption method, which can solve the problem of gradient leakage. Second, we create a verifiable method based on homomorphic hash technology. This method can ensure the correctness of users' aggregation results. At the same time, it can also track users who aggregate wrong. Compared with other solutions, our scheme is more efficient.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有链聚合的可验证协同学习
随着许多国家都颁布了保护用户数据隐私的法律,如何合法使用用户数据成为了一个热门话题。随着协作学习(也称为联邦学习)的出现,多个参与者可以创建一个通用的、健壮的、安全的机器学习模型,旨在解决数据共享的关键问题,如隐私、安全性和访问等。遗憾的是,现有的研究表明,协作学习并不像它声称的那样安全,梯度泄漏仍然是一个关键问题。针对这一问题,最近提出了一种基于链式安全多方计算的协同学习解决方案。然而,该方案中有两个安全问题尚未解决。首先,如果半诚实用户串通,诚实用户的梯度也会泄漏。其次,如果其中一个用户失败,也不能保证聚合结果的正确性。在本文中,我们提出了一个隐私保护和可验证的链协同学习方案来解决这一问题。首先,我们设计了一种梯度加密方法,该方法可以解决梯度泄漏问题。其次,我们创建了一种基于同态哈希技术的可验证方法。该方法可以保证用户聚合结果的正确性。同时,它还可以追踪聚合错误的用户。与其他方案相比,我们的方案效率更高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Improving Dense FAQ Retrieval with Synthetic Training A Security Integrated Attestation Scheme for Embedded Devices Zero-Shot Voice Cloning Using Variational Embedding with Attention Mechanism Convolutional Neural Network Based Transmit Power Control for D2D Communication in Unlicensed Spectrum WCD: A New Chinese Online Social Media Dataset for Clickbait Analysis and Detection
×
引用
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