CHET: An Optimizing Compiler for Fully-Homomorphic Neural-Network Inferencing

被引:153
作者
Dathathri, Roshan [1 ]
Saarikivi, Olli [2 ]
Chen, Hao [2 ]
Laine, Kim [2 ]
Lauter, Kristin [2 ]
Maleki, Saeed [2 ]
Musuvathi, Madanlal [2 ]
Mytkowicz, Todd [2 ]
机构
[1] Univ Texas Austin, Austin, TX 78712 USA
[2] Microsoft Res, Redmond, WA USA
来源
PROCEEDINGS OF THE 40TH ACM SIGPLAN CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION (PLDI '19) | 2019年
关键词
Homomorphic encryption; domain-specific compiler; neural networks; privacy-preserving machine learning; ENCRYPTION;
D O I
10.1145/3314221.3314628
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Fully Homomorphic Encryption (FHE) refers to a set of encryption schemes that allow computations on encrypted data without requiring a secret key. Recent cryptographic advances have pushed FHE into the realm of practical applications. However, programming these applications remains a huge challenge, as it requires cryptographic domain expertise to ensure correctness, security, and performance. CHET is a domain-specific optimizing compiler designed to make the task of programming FHE applications easier. Motivated by the need to perform neural network inference on encrypted medical and financial data, CHET supports a domain-specific language for specifying tensor circuits. It automates many of the laborious and error prone tasks of encoding such circuits homomorphically, including encryption parameter selection to guarantee security and accuracy of the computation, determining efficient tensor layouts, and performing scheme-specific optimizations. Our evaluation on a collection of popular neural networks shows that CHET generates homomorphic circuits that outperform expert-tuned circuits and makes it easy to switch across different encryption schemes. We demonstrate its scalability by evaluating it on a version of SqueezeNet, which to the best of our knowledge, is the deepest neural network to be evaluated homomorphically.
引用
收藏
页码:142 / 156
页数:15
相关论文
共 42 条
[1]  
Abadi M, 2016, PROCEEDINGS OF OSDI'16: 12TH USENIX SYMPOSIUM ON OPERATING SYSTEMS DESIGN AND IMPLEMENTATION, P265
[2]  
Acar A., 2017, ABS170403578 CORR
[3]  
[Anonymous], 2017, ABS170508963 CORR
[4]  
Bajard Jean-Claude, 2017, Selected Areas in Cryptography - SAC 2016. 23rd International Conference. Revised Selected Papers: LNCS 10532, P423, DOI 10.1007/978-3-319-69453-5_23
[5]  
Benhamouda F, 2017, PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P2423
[6]  
Bos Joppe W., 2013, Cryptography and Coding. 14th IMA International Conference, IMACC 2013. Proceedings: LNCS 8308, P45, DOI 10.1007/978-3-642-45239-0_4
[7]   Fast Homomorphic Evaluation of Deep Discretized Neural Networks [J].
Bourse, Florian ;
Minelli, Michele ;
Minihold, Matthias ;
Paillier, Pascal .
ADVANCES IN CRYPTOLOGY - CRYPTO 2018, PT III, 2018, 10993 :483-512
[8]  
Brakerski Zvika, 2014, ACM Transactions on Computation Theory, V6, DOI 10.1145/2633600
[9]   EFFICIENT FULLY HOMOMORPHIC ENCRYPTION FROM (STANDARD) LWE [J].
Brakerski, Zvika ;
Vaikuntanathan, Vinod .
SIAM JOURNAL ON COMPUTING, 2014, 43 (02) :831-871
[10]  
Carpov S., 2015, P 3 INT WORKSH SEC C, P13