The reviewed record of science sign in
Pith

arxiv: 2005.09042 · v1 · pith:UXVIORWG · submitted 2020-05-18 · cs.CR · cs.LG

BLAZE: Blazing Fast Privacy-Preserving Machine Learning

Reviewed by Pithpith:UXVIORWGopen to challenge →

classification cs.CR cs.LG
keywords blazeppmlsettingdatafastlearningmachinemethod
0
0 comments X
read the original 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, raise 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 (\Z{\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. 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Beyond Latency: A System-Level Characterization of MPC and FHE for PPML

    cs.CR 2026-03 accept novelty 6.0

    System-level evaluation reveals that network constraints and hardware costs, rather than raw latency, often dictate the optimal choice between MPC and FHE for privacy-preserving ML.

  2. High-Throughput and Scalable Secure Inference Protocols for Deep Learning with Packed Secret Sharing

    cs.CR 2026-01 unverdicted novelty 6.0

    Packed Shamir secret sharing yields up to 11x lower communication and 2.6x faster online runtime for secure deep learning inference versus prior Shamir-based methods.