CROct 23, 2018

nGraph-HE: A Graph Compiler for Deep Learning on Homomorphically Encrypted Data

arXiv:1810.10121v3199 citations
Originality Incremental advance
AI Analysis

This addresses data privacy concerns in deep learning by making homomorphic encryption more accessible, though it is incremental as it builds on existing graph compiler technology.

The paper tackles the challenge of deploying deep learning models on homomorphically encrypted data by introducing nGraph-HE, a graph compiler extension that simplifies the process and enables optimizations, resulting in integration with frameworks like TensorFlow and improved efficiency through techniques such as constant folding and HE-SIMD packing.

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.

Code Implementations2 repos
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes