PPolyNets: Achieving High Prediction Accuracy and Efficiency With Parametric Polynomial Activations

Recently, to implement cloud-based machine learning approaches while maintaining data privacy, a scheme named CryptoNets is proposed to perform prediction on encrypted data using neural networks. By applying the leveled homomorphic encryption scheme, CryptoNets enables the cloud server to securely run the computation process without participations of other parties. Since the encryption scheme only supports polynomial operations, the authors simply use square activation as a substitution of the conventional activations, obtaining a relatively low prediction accuracy on the MNIST dataset (98.95%). Later work try to improve the accuracy by using polynomial approximations of the ReLU activation with large neural networks, which introduce heavy computation cost, making the prediction process impractical. In this paper, to achieve better prediction performance, we propose new parametric polynomial (PPoly) activations, which can adaptively learn the parameters during the training phase. Using our PPoly activations, we achieve higher accuracy (99.33%, 99.64%, and 99.70%) with shallow and narrow networks, guaranteeing the efficiency of prediction process. We conduct extensive experiments to show the expressiveness of our PPoly activations and discuss the tradeoff between accuracy and efficiency for the prediction on encrypted data.

[1]  Craig Gentry,et al.  Homomorphic Evaluation of the AES Circuit , 2012, IACR Cryptol. ePrint Arch..

[2]  Lawrence D. Jackel,et al.  Backpropagation Applied to Handwritten Zip Code Recognition , 1989, Neural Computation.

[3]  Roi Livni,et al.  On the Computational Efficiency of Training Neural Networks , 2014, NIPS.

[4]  Craig Gentry,et al.  (Leveled) fully homomorphic encryption without bootstrapping , 2012, ITCS '12.

[5]  Pascal Paillier,et al.  Fast Homomorphic Evaluation of Deep Discretized Neural Networks , 2018, IACR Cryptol. ePrint Arch..

[6]  Frederik Vercauteren,et al.  Somewhat Practical Fully Homomorphic Encryption , 2012, IACR Cryptol. ePrint Arch..

[7]  Rachel Player,et al.  Simple Encrypted Arithmetic Library-SEAL , 2017 .

[8]  Sergey Ioffe,et al.  Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift , 2015, ICML.

[9]  Yann LeCun,et al.  The mnist database of handwritten digits , 2005 .

[10]  Shai Halevi,et al.  Algorithms in HElib , 2014, CRYPTO.

[11]  Mauro Barni,et al.  A privacy-preserving protocol for neural-network-based computation , 2006, MM&Sec '06.

[12]  Zvika Brakerski,et al.  Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP , 2012, CRYPTO.

[13]  Hassan Takabi,et al.  CryptoDL: Deep Neural Networks over Encrypted Data , 2017, ArXiv.

[14]  Jian Sun,et al.  Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classification , 2015, 2015 IEEE International Conference on Computer Vision (ICCV).

[15]  Michael Naehrig,et al.  Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme , 2013, IMACC.

[16]  Vinod Vaikuntanathan,et al.  Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages , 2011, CRYPTO.

[17]  Geoffrey E. Hinton,et al.  On the importance of initialization and momentum in deep learning , 2013, ICML.

[18]  Pascal Paillier,et al.  Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.

[19]  Yann LeCun,et al.  Regularization of Neural Networks using DropConnect , 2013, ICML.

[20]  Ronald L. Rivest,et al.  ON DATA BANKS AND PRIVACY HOMOMORPHISMS , 1978 .

[21]  Constance Morel,et al.  Privacy-Preserving Classification on Deep Neural Network , 2017, IACR Cryptol. ePrint Arch..

[22]  Vinod Vaikuntanathan,et al.  Efficient Fully Homomorphic Encryption from (Standard) LWE , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[23]  Craig Gentry,et al.  Fully homomorphic encryption using ideal lattices , 2009, STOC '09.

[24]  Taher ElGamal,et al.  A public key cyryptosystem and signature scheme based on discrete logarithms , 1985 .

[25]  Michael Naehrig,et al.  CryptoNets: applying neural networks to encrypted data with high throughput and accuracy , 2016, ICML 2016.