Secure Multiparty Computation and Application in Machine Learning

被引:0
作者
Guo J. [1 ,2 ]
Wang Q. [1 ,2 ]
Xu X. [1 ,2 ]
Wang T. [3 ]
Lin J. [4 ]
机构
[1] State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing
[2] School of Cyber Security, University of Chinese Academy of Sciences, Beijing
[3] Huakong TsingJiao Information Science (Beijing) Limited, Beijing
[4] School of Cyber Security, University of Science and Technology of China, Hefei
来源
Jisuanji Yanjiu yu Fazhan/Computer Research and Development | 2021年 / 58卷 / 10期
基金
中国国家自然科学基金;
关键词
Garbled circuit; Homomorphic encryption; Oblivious transfer; Privacy-preserving machine learning; Secret sharing; Secure multiparty computation (MPC);
D O I
10.7544/issn1000-1239.2021.20210626
中图分类号
学科分类号
摘要
With the emergence and development of artificial intelligence and big data, large-scale data collection and analysis applications have been widely deployed, which introduces the concern of privacy leakage. This privacy concern further prevents data exchanges among originations and results in "data silos". Secure multiparty computation (MPC) allows multiple originations to perform privacy-preserving collaborative data analytics, without leaking any plaintext data during the interactions, making the data "usable but not visible". MPC technologies have been extensively studied in the academic and engineering fields, and derive various technical branches. Privacy-preserving machine learning (PPML) is becoming a typical and widely deployed application of MPC. And various PPML schemes have been proposed to perform privacy-preserving training and inference without leaking model parameters nor sensitive data. In this paper, we systematically analyze various MPC schemes and their applications in PPML. Firstly, we list various security models and objectives, and the development of MPC primitives (i.e., garble circuit, oblivious transfer, secret sharing and homomorphic encryption). Then, we summarize the strengths and weaknesses of these primitives, and list the corresponding appropriate usage scenarios, which is followed by the thorough analysis of their applications in PPML. Finally, we point out the further research direction on MPC and their applications in PPML. © 2021, Science Press. All right reserved.
引用
收藏
页码:2163 / 2186
页数:23
相关论文
共 124 条
  • [1] How to generate and exchange secrets, Proc of 27th Annual Symp on Foundations of Computer Science, pp. 162-167, (1986)
  • [2] Shamir A., How to share a secret, Communications of the ACM, 22, 11, pp. 612-613, (1979)
  • [3] Blakley G R., Safeguarding cryptographic keys, Proc of Managing Requirements Knowledge, International Workshop on IEEE Computer Society, pp. 313-313, (1979)
  • [4] Rabin M O., Transaction protection by beacons, Journal of Computer and System Sciences, 27, 2, pp. 256-267, (1981)
  • [5] Rivest R L, Adleman L, Dertouzos M L., On data banks and privacy homomorphisms, Foundations of Secure Computation, 4, 11, pp. 169-180, (1978)
  • [6] Gentry C., Fully homomorphic encryption using ideal lattices, Proc of the 41st Annual ACM Symp on Theory of Computing, pp. 169-178, (2009)
  • [7] Beaver D, Micali S, Rogaway P., The round complexity of secure protocols, Proc of the 22nd Annual ACM Symp on Theory of Computing, pp. 503-513, (1990)
  • [8] Naor M, Pinkas B, Sumner R., Privacy preserving auctions and mechanism design, Proc of the 1st ACM Conf on Electronic Commerce, pp. 129-139, (1999)
  • [9] Kolesnikov V, Schneider T., Improved garbled circuit: Free XOR gates and applications, Proc of Int Colloquium on Automata, Languages, and Programming, pp. 486-498, (2008)
  • [10] Pinkas B, Schneider T, Smart N P, Et al., Secure two-party computation is practical, Proc of Int Conf on the Theory and Application of Cryptology and Information Security, pp. 250-267, (2009)