Chameleon: A Hybrid Secure Computation Framework for Machine Learning Applications

01/10/2018
by   M. Sadegh Riazi, et al.
0

We present Chameleon, a novel hybrid (mixed-protocol) framework for secure function evaluation (SFE) which enables two parties to jointly compute a function without disclosing their private inputs. Chameleon combines the best aspects of generic SFE protocols with the ones that are based upon additive secret sharing. In particular, the framework performs linear operations in the ring Z_2^l using additively secret shared values and nonlinear operations using Yao's Garbled Circuits or the Goldreich-Micali-Wigderson protocol. Chameleon departs from the common assumption of additive or linear secret sharing models where three or more parties need to communicate in the online phase: the framework allows two parties with private inputs to communicate in the online phase under the assumption of a third node generating correlated randomness in an offline phase. Almost all of the heavy cryptographic operations are precomputed in an offline phase which substantially reduces the communication overhead. Chameleon is both scalable and significantly more efficient than the ABY framework (NDSS'15) it is based on. Our framework supports signed fixed-point numbers. In particular, Chameleon's vector dot product of signed fixed-point numbers improves the efficiency of mining and classification of encrypted data for algorithms based upon heavy matrix multiplications. Our evaluation of Chameleon on a 5 layer convolutional deep neural network shows 133x and 4.2x faster executions than Microsoft CryptoNets (ICML'16) and MiniONN (CCS'17), respectively.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/18/2023

Online Efficient Secure Logistic Regression based on Function Secret Sharing

Logistic regression is an algorithm widely used for binary classificatio...
research
09/28/2022

Faster Secure Comparisons with Offline Phase for Efficient Private Set Intersection

In a Private section intersection (PSI) protocol, Alice and Bob compute ...
research
12/05/2019

FMPC: Secure Multiparty Computation from Fourier Series and Parseval's Identity

FMPC is a novel multiparty computation protocol of arithmetic circuits b...
research
08/21/2022

Efficient Multiparty Protocols Using Generalized Parseval's Identity and the Theta Algebra

We propose a protocol able to show publicly addition and multiplication ...
research
06/08/2020

ARIANN: Low-Interaction Privacy-Preserving Deep Learning via Function Secret Sharing

We propose ARIANN, a low-interaction framework to perform private traini...
research
01/30/2018

PrivPy: Enabling Scalable and General Privacy-Preserving Computation

We introduce PrivPy, a practical privacy-preserving collaborative comput...
research
04/07/2021

Prism: Private Verifiable Set Computation over Multi-Owner Outsourced Databases

This paper proposes Prism, a secret sharing based approach to compute pr...

Please sign up or login with your details

Forgot password? Click here to reset