**BLAZE: Blazing Fast Privacy-Preserving Machine Learning**

*Arpita Patra and Ajith Suresh*

**Abstract: **Machine learning tools have illustrated their potential in many significant sectors such as healthcare and finance, to aide in deriving useful inferences. The sensitive and confidential nature of the data, in such sectors, raises natural concerns for the privacy of data. This motivated the area of Privacy-preserving Machine Learning (PPML) where privacy of the data is guaranteed. Typically, ML techniques require large computing power, which leads clients with limited infrastructure to rely on the method of Secure Outsourced Computation (SOC). In SOC setting, the computation is outsourced to a set of specialized and powerful cloud servers and the service is availed on a pay-per-use basis. In this work, we explore PPML techniques in the SOC setting for widely used ML algorithms-- Linear Regression, Logistic Regression, and Neural Networks.

We propose BLAZE, a blazing fast PPML framework in the three server setting tolerating one malicious corruption over a ring ($\mathbb{Z}_{2^{\ell}}$). BLAZE achieves the stronger security guarantee of fairness (all honest servers get the output whenever the corrupt server obtains the same). Leveraging an input-independent preprocessing phase, BLAZE has a fast input-dependent online phase relying on efficient PPML primitives such as: (i) A dot product protocol for which the communication in the online phase is independent of the vector size, the first of its kind in the three server setting; (ii) A method for truncation that shuns evaluating expensive circuit for Ripple Carry Adders (RCA) and achieves a constant round complexity. This improves over the truncation method of ABY3 (Mohassel et al., CCS 2018) that uses RCA and consumes a round complexity that is of the order of the depth of RCA (which is the same as the underlying ring size).

An extensive benchmarking of BLAZE for the aforementioned ML algorithms over a 64-bit ring in both WAN and LAN settings shows massive improvements over ABY3. Concretely, we observe improvements up to $\mathbf{333\times}$ for Linear Regression, $\mathbf{53 \times}$ for Logistic Regression and $\mathbf{276\times}$ for Neural Networks over WAN. Similarly, we show improvements up to $\mathbf{2610\times}$ for Linear Regression, $\mathbf{54\times}$ for Logistic Regression and $\mathbf{278\times}$ for Neural Networks over LAN.

**Category / Keywords: **cryptographic protocols / MPC, PPML, Privacy-preserving Machine Learning, Multi-party Computation

**Original Publication**** (with major differences): **The Network and Distributed System Security Symposium (NDSS) 2020
**DOI: **10.14722/ndss.2020.24202

**Date: **received 15 Jan 2020, last revised 5 Feb 2020

**Contact author: **ajith at iisc ac in,arpita@iisc ac in

**Available format(s): **PDF | BibTeX Citation

**Note: **This article is the full and extended version of an earlier article to appear in NDSS 2020.

**Version: **20200205:103117 (All versions of this report)

**Short URL: **ia.cr/2020/042

[ Cryptology ePrint archive ]