Cryptology ePrint Archive: Report 2021/1538

SIMC: ML Inference Secure Against Malicious Clients at Semi-Honest Cost

Nishanth Chandran and Divya Gupta and Sai Lakshmi Bhavana Obbattu and Akash Shah

Abstract: Secure inference allows a model owner (or, the server) and the input owner (or, the client) to perform inference on machine learning model without revealing their private information to each other. A large body of work has shown efficient cryptographic solutions to this problem through secure 2- party computation. However, they assume that both parties are semi-honest, i.e., follow the protocol specification. Recently, Lehmkuhl et al. showed that malicious clients can extract the whole model of the server using novel model-extraction attacks. To remedy the situation, they introduced the client-malicious threat model and built a secure inference system, MUSE, that provides security guarantees, even when the client is malicious.

In this work, we design and build SIMC, a new cryptographic system for secure inference in the client malicious threat model. On secure inference benchmarks considered by MUSE, SIMC has 23 − 29× lesser communication and is up to 11.4× faster than MUSE. SIMC obtains these improvements using a novel protocol for non-linear activation functions (such as ReLU) that has > 28× lesser communication and is up to 43× more performant than MUSE. In fact, SIMC's performance beats the state-of-the-art semi-honest secure inference system!

Finally, similar to MUSE, we show how to push the majority of the cryptographic cost of SIMC to an input independent preprocessing phase. While the cost of the online phase of this protocol, SIMC++, is same as that of MUSE, the overall improvements of SIMC translate to similar improvements to the preprocessing phase of MUSE.

Category / Keywords: cryptographic protocols / secure inference

Original Publication (in the same form): USENIX 2022

Date: received 22 Nov 2021

Contact author: oslbhavana at gmail com, Divya Gupta at microsoft com, nichandr at microsoft com, akashshah08 at ucla edu

Available format(s): PDF | BibTeX Citation

Version: 20211122:113241 (All versions of this report)

Short URL: ia.cr/2021/1538


[ Cryptology ePrint archive ]