Paper 2019/350
nGraph-HE: A Graph Compiler for Deep Learning on Homomorphically Encrypted Data
Fabian Boemer, Yixing Lao, Rosario Cammarota, and Casimir Wierzynski
Abstract
Homomorphic encryption (HE)---the ability to perform computation on encrypted data---is an attractive remedy to increasing concerns about data privacy in deep learning (DL). However, building DL models that operate on ciphertext is currently labor-intensive and requires simultaneous expertise in DL, cryptography, and software engineering. DL frameworks and recent advances in graph compilers have greatly accelerated the training and deployment of DL models to various computing platforms. We introduce nGraph-HE, an extension of nGraph, Intel's DL graph compiler, which enables deployment of trained models with popular frameworks such as TensorFlow while simply treating HE as another hardware target. Our graph-compiler approach enables HE-aware optimizations-- implemented at compile-time, such as constant folding and HE-SIMD packing, and at run-time, such as special value plaintext bypass. Furthermore, nGraph-HE integrates with DL frameworks such as TensorFlow, enabling data scientists to benchmark DL models with minimal overhead.
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Published elsewhere. To appear in Computing Frontiers 2019
- Keywords
- Homomorphic encryptionintermediate representationdeep learning
- Contact author(s)
- fabian boemer @ intel com
- History
- 2019-04-03: received
- Short URL
- https://ia.cr/2019/350
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2019/350,
author = {Fabian Boemer and Yixing Lao and Rosario Cammarota and Casimir Wierzynski},
title = {nGraph-HE: A Graph Compiler for Deep Learning on Homomorphically Encrypted Data},
howpublished = {Cryptology ePrint Archive, Paper 2019/350},
year = {2019},
note = {\url{https://eprint.iacr.org/2019/350}},
url = {https://eprint.iacr.org/2019/350}
}
