期刊文献+

基于秘密共享和压缩感知的通信高效联邦学习 被引量:12

Communication-Efficient Federated Learning Based on Secret Sharing and Compressed Sensing
在线阅读 下载PDF
导出
摘要 深度学习技术的快速发展给我们带来了极大的便利,但同时也导致大量隐私数据的泄露.联邦学习允许客户端在只共享梯度的情况下联合训练模型,这看似解决了隐私信息泄露问题,但研究表明联邦学习框架中传输的梯度依然会导致隐私信息泄露.并且,联邦学习的高通信代价的特点难以适用于资源受限的环境.为此,提出了2个通信高效且安全的联邦学习算法,算法使用Top-K稀疏及压缩感知等技术以减少梯度传输造成的通信开销,另外利用安全多方计算中的加法秘密共享对重要的梯度测量值加密,以实现在减少通信开销的同时进一步增强其安全性.2个算法的主要区别是客户端与服务器通信时传递的分别为梯度测量值与梯度测量值的量化结果.在MNIST及Fashion-MNIST数据集上的实验表明,与其他算法相比,本文所提的算法在保证通信代价较低的情况下进一步增加了安全性,同时在模型准确性上也有较好的性能. The rapid development of deep learning technology has brought us great convenience,but it also results in the disclosure of a large number of private data.Federated learning(FL)allows clients to jointly train models only by sharing gradients,which seems to solve the privacy information leakage problem,but some research show that gradients transmitted in FL frameworks can still result in privacy information leakage.Moreover,the high communication cost of FL is difficult to apply to resource-constrained environments.Therefore,we put forward two communication-efficient and secure FL algorithms,which use Top-K sparse and compressed sensing to reduce communication overhead caused by the gradient transmission,and further use additive secret sharing in secure multi-party computation(MPC)to encrypt the important gradient parameter measurements in order to simultaneously realize communication overhead reduction and security enhancement.The main difference between the two algorithms is that the client and server communicate with each other by transmitting the gradient measurement value and the quantization result of the gradient measurement value,respectively.Experiments on MNIST and Fashion-MNIST data show that,compared with other algorithms,the proposed algorithms can further increase the security at a lower communication cost and have better performance in model accuracy.
作者 陈律君 肖迪 余柱阳 黄会 李敏 Chen Lüjun;Xiao Di;Yu Zhuyang;Huang Hui;Li Min(College of Computer Science,Chongqing University,Chongqing 400044;Key Laboratory of Dependable Service Computing in Cyber Physical Society(Chongqing University),Ministry of Education,Chongqing 400044)
出处 《计算机研究与发展》 EI CSCD 北大核心 2022年第11期2395-2407,共13页 Journal of Computer Research and Development
基金 国家自然科学基金项目(62072063) 国家重点研发计划项目(2020YFB1805400) 重庆市研究生科研创新项目(CYB21062)。
关键词 压缩感知 安全多方计算 联邦学习 高效通信 资源受限 compressed sensing security multi-party computation federated learning communication-efficient resource-constrained
  • 相关文献

参考文献4

二级参考文献46

  • 1Yao A. How to generate and exchange secrets [C] //Proc of the 27th IEEE Symp on Foundations of Computer Science (FOCS1986). Los Alamitos, CA: IEEE Computer Society, 1986:162-167.
  • 2Goldreich O, Mieali S, Wigderson A. How to play any mental game--A completeness theorem for protocols with honest majority [C]//Proc of the 19th Annual ACM Syrup on Theory of Computing. New Yorki ACM, 1987:218-229.
  • 3Kolesnikov V, Schneider T. Improved garbled circuit: Free XOR gates and applications [G] //LNSC 5126: Automata, Languages and Programming. Berlin: Springer, 2008: 486- 498.
  • 4Kolesnikov V, Mohassel P, Rosulek M. FleXOR: Flexible garbling for XOR gates that beats ffee-XOR [G] //LNCS 8617 : Advances in Cryptology ( CRYPTO 2014 ). Berlin: Springer, 2014:440-457.
  • 5Pinkas B, Schneider T, Smart N P, et al. Secure two-party computation is practical [G] //LNCS 5912: Advances in Cryptology (ASIACRYPT 2009). Berlin: Springer, 2009: 250-267.
  • 6Naor M, Pinkas B, Sumner R. Privacy preserving auctions and mechanism design [C] //Proc of the 1st ACM Conf on Electronic Commerce. New York: ACM, 1999:129-139.
  • 7Zahur S, Rosulek M, Evans D. Two halves make a whole [G] //LNCS 9057 : Advances in Cryptology (EUROCRYPT 2015). Berlin.. Springer, 2015:220-250.
  • 8Pinkas B. Fair secure two-party computation [G] //LNCS 2656: Advances in Cryptology (Eurocrypt 2003). Berlin: Springer, 2003:87-105.
  • 9Lindell Y, Pinkas B. An efficient protocol for secure two- party computation in the presence of malicious adversaries [G] //LNCS 4515: Advances in Cryptology (EUROCRYPT 2007). Berlin: Springer, 2007:52-78.
  • 10Lindell Y, Pinkas B. Secure two-party computation via cut- and-choose oblivious transfer [G] //LNcs 6597 : Advances in TCC 2011. Berlin: Springer, 2,011:329-346.

共引文献188

同被引文献87

引证文献12

二级引证文献26

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部