Paper 2017/502
DeepSecure: Scalable Provably-Secure Deep Learning
Bita Darvish Rouhani, M. Sadegh Riazi, and Farinaz Koushanfar
Abstract
This paper proposes DeepSecure, a novel framework that enables scalable execution of the state-of-the-art Deep Learning (DL) models in a privacy-preserving setting. DeepSecure targets scenarios in which neither of the involved parties including the cloud servers that hold the DL model parameters or the delegating clients who own the data is willing to reveal their information. Our framework is the first to empower accurate and scalable DL analysis of data generated by distributed clients without sacrificing the security to maintain efficiency. The secure DL computation in DeepSecure is performed using Yao’s Garbled Circuit (GC) protocol. We devise GC-optimized realization of various components used in DL. Our optimized implementation achieves more than 58-fold higher throughput per sample compared with the best prior solution. In addition to our optimized GC realization, we introduce a set of novel low-overhead pre-processing techniques which further reduce the GC overall runtime in the context of deep learning. Extensive evaluations of various DL applications demonstrate up to two orders-of-magnitude additional runtime improvement achieved as a result of our pre-processing methodology. We also provide mechanisms to securely delegate GC computations to a third party in constrained embedded settings.
Metadata
- Available format(s)
- Category
- Applications
- Publication info
- Preprint.
- Keywords
- Deep LearningSecure Function EvaluationGarbled CircuitContent-Aware Data Pre-processing
- Contact author(s)
- bita @ ucsd edu
- History
- 2017-06-02: received
- Short URL
- https://ia.cr/2017/502
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2017/502, author = {Bita Darvish Rouhani and M. Sadegh Riazi and Farinaz Koushanfar}, title = {{DeepSecure}: Scalable Provably-Secure Deep Learning}, howpublished = {Cryptology {ePrint} Archive, Paper 2017/502}, year = {2017}, url = {https://eprint.iacr.org/2017/502} }