Fetching the paper…
Reading the bibliography…
Homomorphic encryption enables arbitrary computation over data while it remains encrypted.
R. L. Rivest, L. Adleman, and M. L. Dertouzos, “On data banks and privacy homomorphisms,” Foundations of secure computation , 1978
1978
Earlier work this paper cites.
T. ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms,” Transactions on Information Theory , 1985
1985
Earlier work this paper cites.
A. C.-C. Yao, “How to generate and exchange secrets,” in Foundations of Computer Science . IEEE, 1986
1986
Earlier work this paper cites.
K. Hornik, “Approximation capabilities of multilayer feedforward networks,” Neural networks , 1991
1991
Earlier work this paper cites.
F. Piazza, A. Uncini, and M. Zenobi, “Artificial neural networks with adaptive polynomial activation function,” 1992
1992
Earlier work this paper cites.
Y. LeCun, Y. Bengio et al. , “Convolutional networks for images, speech, and time series,” The handbook of brain theory and neural networks , 1995
1995
Earlier work this paper cites.
V. K. A. Hoover and M. Goldbaum, “Locating blood vessels in retinal images by piece-wise threhsold probing of a matched filter response,” 2000
2000
Earlier work this paper cites.
R. Agrawal and R. Srikant, “Privacy-preserving data mining,” in Sigmod Record . ACM, 2000
2000
Earlier work this paper cites.
C. Dugas, Y. Bengio, F. Bélisle, C. Nadeau, and R. Garcia, “Incorporating second-order functional knowledge for better option pricing,” in NIPS , 2001
2001
Earlier work this paper cites.
American Academy of Ophthalmology, “International clinical diabetic retinopathy disease severity scale detailed table.” 2002
2002
Earlier work this paper cites.
L. Ma and K. Khorasani, “Constructive feedforward neural networks using hermite polynomial activation functions,” Transactions on Neural Networks , 2005
2005
Earlier work this paper cites.
N. Brisebarre, J.-M. Muller, and A. Tisserand, “Computing machine-efficient polynomial approximations,” Transactions on Mathematical Software , 2006
2006
Earlier work this paper cites.
G. E. Hinton and R. R. Salakhutdinov, “Reducing the dimensionality of data with neural networks,” science , vol. 313, no. 5786, pp. 504–507, 2006
2006
Earlier work this paper cites.
C. Dwork, “Differential privacy: A survey of results,” in International Conference on Theory and Applications of Models of Computation . Springer, 2008
2008
Earlier work this paper cites.
V. Kolesnikov and T. Schneider, “Improved garbled circuit: Free xor gates and applications,” in International Colloquium on Automata, Languages, and Programming . Springer, 2008
2008
Earlier work this paper cites.
J. Brickell and V. Shmatikov, “Privacy-preserving classifier learning,” in International Conference on Financial Cryptography and Data Security . Springer, 2009
2009
Earlier work this paper cites.
J. Deng, W. Dong, R. Socher, L.-J. Li, K. Li, and L. Fei-Fei, “Imagenet: A large-scale hierarchical image database,” in Computer Vision and Pattern Recognition, 2009. CVPR 2009. IEEE Conference on . IEEE, 2009, pp. 248–255
2009
Earlier work this paper cites.
C. Gentry et al. , “Fully homomorphic encryption using ideal lattices.” in STOC , 2009
2009
Earlier work this paper cites.
F. D. McSherry, “Privacy integrated queries: An extensible platform for privacy-preserving data analysis,” SIGMOD , 2009
2009
Earlier work this paper cites.
K. Chaudhuri, C. Monteleoni, and A. D. Sarwate, “Differentially private empirical risk minimization,” JMLR , 2011
2011
Earlier work this paper cites.
X. Glorot, A. Bordes, and Y. Bengio, “Deep sparse rectifier neural networks,” in AISTATS , 2011
2011
Earlier work this paper cites.
R. Hall, S. E. Fienberg, and Y. Nardi, “Secure multiple linear regression based on homomorphic encryption,” Journal of Official Statistics , 2011
2011
Earlier work this paper cites.
M. Naehrig, K. Lauter, and V. Vaikuntanathan, “Can homomorphic encryption be practical?” in ACM Workshop on Cloud computing security . ACM, 2011
2011
Earlier work this paper cites.
Y. Bengio, “Deep learning of representations for unsupervised and transfer learning,” in Proceedings of ICML Workshop on Unsupervised and Transfer Learning , 2012, pp. 17–36
2012
Earlier work this paper cites.
S. Song, K. Chaudhuri, and A. D. Sarwate, “Stochastic gradient descent with differentially private updates,” in Global Conference on Signal and Information Processing (GlobalSIP), 2013 IEEE . IEEE, 2013, pp. 245–248
2013
Cited alongside, same era.
Z. Brakerski and V. Vaikuntanathan, “Efficient fully homomorphic encryption from (standard) lwe,” Journal on Computing , 2014
2014
Cited alongside, same era.
J. Chung, C. Gulcehre, K. Cho, and Y. Bengio, “Empirical evaluation of gated recurrent neural networks on sequence modeling,” arXiv , 2014
2014
Cited alongside, same era.
D. Harvey, “Faster arithmetic for number-theoretic transforms,” Journal of Symbolic Computation , 2014
2014
Cited alongside, same era.
R. Livni et al. , “On the computational efficiency of training neural networks,” in NIPS , 2014
2014
Cited alongside, same era.
W. Wen et al. , “Learning structured sparsity in deep neural networks,” in NIPS , 2016
2016
Later among the works it cites.
2017
Later among the works it cites.
F. Bourse, M. Minelli, M. Minihold, and P. Paillier, “Fast homomorphic evaluation of deep discretized neural networks,” IACR Cryptology ePrint Archive , vol. 2017, p. 1114, 2017
2017
Later among the works it cites.
H. Chabanne, A. de Wargny, J. Milgram, C. Morel, and E. Prouff, “Privacy-preserving classification on deep neural network.” IACR Cryptology ePrint Archive , 2017
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
P. Xie, M. Bilenko, T. Finley, R. Gilad-Bachrach, K. Lauter, and M. Naehrig, “Crypto-nets: Neural networks over encrypted data,” arXiv , 2014
2014
Cited alongside, same era.
M. Fredrikson, S. Jha, and T. Ristenpart, “Model inversion attacks that exploit confidence information and basic countermeasures,” in Proceedings of the 22Nd ACM SIGSAC Conference on Computer and Communications Security , ser. CCS ’15. New York, NY, USA: ACM, 2015, pp. 1322–1333. [Online]. Available: http://doi.acm.org/10.1145/2810103.2813677
2015
Cited alongside, same era.
2015
Cited alongside, same era.
S. Ioffe and C. Szegedy, “Batch normalization: Accelerating deep network training by reducing internal covariate shift,” in ICML , 2015
2015
Cited alongside, same era.
O. Russakovsky, J. Deng, H. Su, J. Krause, S. Satheesh, S. Ma, Z. Huang, A. Karpathy, A. Khosla, M. Bernstein et al. , “Imagenet large scale visual recognition challenge,” International Journal of Computer Vision , 2015
2015
Cited alongside, same era.
R. Shokri and V. Shmatikov, “Privacy-preserving deep learning,” in Proceedings of the 22nd ACM SIGSAC conference on computer and communications security . ACM, 2015, pp. 1310–1321
2015
Cited alongside, same era.
2015
Cited alongside, same era.
2017
Later among the works it cites.
J. H. Cheon, J. Jeong, J. Lee, and K. Lee, “Privacy-preserving computations of predictive medical models with minimax approximation and non-adjacent form,” in International Conference on Financial Cryptography and Data Security . Springer, 2017
2017
Later among the works it cites.
Z. Ghodsi, T. Gu, and S. Garg, “Safetynets: Verifiable execution of deep neural networks on an untrusted cloud,” in NIPS , 2017
2017
Later among the works it cites.
I. Giacomelli, S. Jha, M. Joye, C. D. Page, and K. Yoon, “Privacy-preserving ridge regression with only linearly-homomorphic encryption,” Cryptology ePrint Archive, 2017
2017
Later among the works it cites.
E. Hesamifard, H. Takabi, and M. Ghasemi, “Cryptodl: Deep neural networks over encrypted data,” arXiv , 2017
2017
Later among the works it cites.
J.-H. Luo, J. Wu, and W. Lin, “Thinet: A filter level pruning method for deep neural network compression,” arXiv , 2017
2017
Later among the works it cites.
V. Migliore, C. Seguin, M. M. Real, V. Lapotre, A. Tisserand, C. Fontaine, G. Gogniat, and R. Tessier, “A high-speed accelerator for homomorphic encryption using the karatsuba algorithm,” ACM Trans. Embed. Comput. Syst. , vol. 16, no. 5s, pp. 138:1–138:17, Sep. 2017. [Online]. Available: http://doi.acm.org/10.1145/3126558
2017
Later among the works it cites.
P. Mohassel and Y. Zhang, “Secureml: A system for scalable privacy-preserving machine learning,” in Symposium on Security and Privacy . IEEE, 2017
2017
Later among the works it cites.
N. Papernot, M. Abadi, U. Erlingsson, I. Goodfellow, and K. Talwar, “Semi-supervised knowledge transfer for deep learning from private training data,” ICLR , 2017
2017
Later among the works it cites.
P. Ramachandran, B. Zoph, and Q. V. Le, “Swish: a self-gated activation function,” arXiv , 2017
2017
Later among the works it cites.
B. D. Rouhani, M. S. Riazi, and F. Koushanfar, “Deepsecure: Scalable provably-secure deep learning,” arXiv , 2017
2017
Later among the works it cites.
2017
Later among the works it cites.
M. Albrecht, M. Chase, H. Chen, J. Ding, Goldwasser et al. , “Homomorphic encryption standard,” 2018
2018
Closest in time.
H. Bae, J. Jang, D. Jung, H. Jang, H. Ha, and S. Yoon, “Security and Privacy Issues in Deep Learning,” ArXiv e-prints , Jul. 2018
2018
Closest in time.
2018
Closest in time.
A. Sanyal, M. J. Kusner, A. Gascón, and V. Kanade, “TAPAS: Tricks to Accelerate (encrypted) Prediction As a Service,” ArXiv e-prints , Jun. 2018
2018
Closest in time.
B. Toghi and D. Grover, “MNIST Dataset Classification Utilizing k-NN Classifier with Modified Sliding Window Metric,” ArXiv e-prints , Sep. 2018
2018
Closest in time.
M. Voets, K. Møllersen, and L. Ailo Bongo, “Replication study: Development and validation of deep learning algorithm for detection of diabetic retinopathy in retinal fundus photographs,” ArXiv e-prints , Mar. 2018
2018
Closest in time.