Trident: Efficient 4PC Framework for Privacy Preserving Machine Learning

被引:96
作者
Chaudhari, Harsh [1 ]
Rachuri, Rahul [2 ,3 ]
Suresh, Ajith [1 ]
机构
[1] Indian Inst Sci, Bangalore, Karnataka, India
[2] Aarhus Univ, Aarhus, Denmark
[3] Int Inst Informat Technol Bangalore, Bangalore, Karnataka, India
来源
27TH ANNUAL NETWORK AND DISTRIBUTED SYSTEM SECURITY SYMPOSIUM (NDSS 2020) | 2020年
关键词
MPC;
D O I
10.14722/ndss.2020.23005
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Machine learning has started to be deployed in fields such as healthcare and finance, which involves dealing with a lot of sensitive data. This propelled the need for and growth of privacy-preserving machine learning (PPML). We propose an actively secure four-party protocol (4PC), and a framework for PPML, showcasing its applications on four of the most widely-known machine learning algorithms - Linear Regression, Logistic Regression, Neural Networks, and Convolutional Neural Networks. Our 4PC protocol tolerating at most one malicious corruption is practically more efficient than Gordon et al. (ASIACRYPT 2018) as the 4th party in our protocol is not active in the online phase, except input sharing and output reconstruction stages. Concretely, we reduce the online communication as compared to them by 1 ring element. We use the protocol to build an efficient mixed-world framework (Trident) to switch between the Arithmetic, Boolean, and Garbled worlds. Our framework operates in the offline-online paradigm over rings and is instantiated in an outsourced setting for machine learning, where the data is secretly shared among the servers. Also, we propose conversions especially relevant to privacy-preserving machine learning. With the privilege of having an extra honest party, we outperform the current state-of-the-art ABY3 (for three parties), in terms of both rounds as well as communication complexity. The highlights of our framework include using minimal number of expensive circuits overall as compared to ABY3. This can be seen in our technique for truncation, which does not affect the online cost of multiplication and removes the need for any circuits in the offline phase. Our B2A conversion has an improvement of 7x in rounds and 18 x in the communication complexity. In addition to these, all of the special conversions for machine learning, e.g. Secure Comparison, achieve constant round complexity. The practicality of our framework is argued through improvements in the benchmarking of the aforementioned algorithms when compared with ABY3. All the protocols are implemented over a 64-bit ring in both LAN and WAN settings. Our improvements go up to 187x for the training phase and 158 x for the prediction phase when observed over LAN and WAN.
引用
收藏
页数:18
相关论文
共 59 条
[1]  
Abril V. A, 2019, BRISTOL FASHION MPC
[2]   Indications of nonlinear deterministic and finite-dimensional structures in time series of brain electrical activity: Dependence on recording region and brain state [J].
Andrzejak, RG ;
Lehnertz, K ;
Mormann, F ;
Rieke, C ;
David, P ;
Elger, CE .
PHYSICAL REVIEW E, 2001, 64 (06) :8-061907
[3]  
[Anonymous], FC
[4]  
[Anonymous], 2015, CRYPTO
[5]  
[Anonymous], CRYPTO
[6]  
[Anonymous], CCS
[7]  
[Anonymous], 2007, VIFF VIRTUAL IDEAL F
[8]   Optimized Honest-Majority MPC for Malicious Adversaries - Breaking the 1 Billion-Gate Per Second Barrier [J].
Araki, Toshinori ;
Barak, Assi ;
Furukawa, Jun ;
Lichter, Tamar ;
Lindell, Yehuda ;
Nof, Ariel ;
Ohara, Kazuma ;
Watzman, Adi ;
Weinstein, Or .
2017 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP), 2017, :843-862
[9]   High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority [J].
Araki, Toshinori ;
Furukawa, Jun ;
Lindell, Yehuda ;
Nof, Ariel ;
Ohara, Kazuma .
CCS'16: PROCEEDINGS OF THE 2016 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2016, :805-817
[10]  
Archer D. W., 2018, COMPUT J