[Resource Topic] 2019/350: nGraph-HE: A Graph Compiler for Deep Learning on Homomorphically Encrypted Data

Welcome to the resource topic for 2019/350

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

Authors: Fabian Boemer, Yixing Lao, Rosario Cammarota, 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.

ePrint: https://eprint.iacr.org/2019/350

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .