期刊文献+

基于秘密分享的高效隐私保护四方机器学习方案 被引量:3

An Efficient Privacy Preserving 4PC Machine Learning Scheme Based on Secret Sharing
下载PDF
导出
摘要 机器学习技术的广泛应用使得用户数据面临严重的隐私泄露风险,而基于安全多方计算技术的隐私保护分布式机器学习协议成为广受关注的研究领域.传统的安全多方计算协议为了实现恶意敌手模型下的安全性,需要使用认证秘密分享、零知识证明等工具,使得协议实现效率较低.为了得到更高效的协议,Chaudhari等人提出Trident四方协议框架,在三方协议的基础上,引入一个诚实参与方作为可信第三方来执行协议;而Koti等人提出的Swift框架,在参与方诚实大多数的三方协议背景下,通过一个筛选过程选出一个诚实参与方作为可信第三方来完成协议,并将该框架推广到诚实大多数的四方协议.在这样的计算框架下,作为可信第三方会拥有所有用户的敏感数据,违背了安全多方计算的初衷.针对此问题,设计了一个基于(2,4)秘密分享的四方机器学习协议,改进Swift框架的诚实参与方筛选过程,以确定出2个诚实参与方,并通过他们执行一个半诚实的安全两方计算协议,高效地完成计算任务.该协议将在线阶段的25%通信负载转移到了离线阶段,提高了方案在线阶段的效率. The wide application of machine learning technology makes user data face a serious risk of privacy leakage, and the privacy-preserving distributed machine learning protocol based on secure multi-party computation technology has become a widely concerned research field. In order to obtain a more efficient protocol, Chaudhari et al. proposed the Trident quadrilateral protocol framework. On the basis of the tripartite protocol, an honest participant is introduced as a trusted third party to execute the protocol, and the Swift framework proposed by Koti et al. is to select an honest participant as a trusted third party to complete the protocol through a screening process under the background of a three-party protocol with honest majority of participants. The framework to an honest-majority quadrilateral protocol is generalized. Under such a computing framework, a trusted third party obtains sensitive data of all users, which violates the original intention of secure multi-party computation. To solve this problem, a four-party machine learning protocol based on(2,4) secret sharing is designed. By improving the honest party screening process of the Swift framework, two honest parties can be determined and a semi-honest secure two-party computing protocol which can efficiently complete computing tasks is executed. The protocol transfers 25% of the communication load from the online phase to the offline phase, which improves the efficiency of the online phase of the scheme.
作者 阎允雪 马铭 蒋瀚 Yan Yunxue;Ma Ming;Jiang Han(School of Software,Shandong University,Jinan 250101;Key Laboratory of Software Engineering of Shandong Province(Shandong University),Jinan 250101)
出处 《计算机研究与发展》 EI CSCD 北大核心 2022年第10期2338-2347,共10页 Journal of Computer Research and Development
基金 国家自然科学基金项目(62172258) 山东省软件工程重点实验室科技创新基地专项(11480004042015)。
关键词 安全多方计算 隐私保护 机器学习 秘密分享 恶意敌手 secure multi-party computation privacy preserving machine learning secret sharing malicious adversaries
  • 相关文献

参考文献4

二级参考文献43

  • 1闫友彪,陈元琰.机器学习的主要策略综述[J].计算机应用研究,2004,21(7):4-10. 被引量:56
  • 2Yao 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.
  • 3Goldreich 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.
  • 4Kolesnikov V, Schneider T. Improved garbled circuit: Free XOR gates and applications [G] //LNSC 5126: Automata, Languages and Programming. Berlin: Springer, 2008: 486- 498.
  • 5Kolesnikov 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.
  • 6Pinkas 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.
  • 7Naor 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.
  • 8Zahur S, Rosulek M, Evans D. Two halves make a whole [G] //LNCS 9057 : Advances in Cryptology (EUROCRYPT 2015). Berlin.. Springer, 2015:220-250.
  • 9Pinkas B. Fair secure two-party computation [G] //LNCS 2656: Advances in Cryptology (Eurocrypt 2003). Berlin: Springer, 2003:87-105.
  • 10Lindell 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.

共引文献129

同被引文献25

引证文献3

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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