{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T21:37:27Z","timestamp":1772314647571,"version":"3.50.1"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3017436","type":"journal-article","created":{"date-parts":[[2020,8,17]],"date-time":"2020-08-17T21:30:27Z","timestamp":1597699827000},"page":"153098-153112","source":"Crossref","is-referenced-by-count":45,"title":["Effective Activation Functions for Homomorphic Evaluation of Deep Neural Networks"],"prefix":"10.1109","volume":"8","author":[{"given":"Srinath","family":"Obla","sequence":"first","affiliation":[]},{"given":"Xinghan","family":"Gong","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8362-2432","authenticated-orcid":false,"given":"Asma","family":"Aloufi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7260-6325","authenticated-orcid":false,"given":"Peizhao","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Takabi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","author":"chebyshev","year":"1853","journal-title":"Théorie des mécanismes connus sous le nom de parallélogrammes"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/S0045-7930(01)00044-5"},{"key":"ref33","first-page":"633","article-title":"Über die analytische darstellbarkeit sogenannter willkürlicher functionen einer reellen veränderlichen","volume":"2","author":"weierstrass","year":"1897","journal-title":"Sitzungsberichte der Königlich Preußischen Akademie der Wissenschaften zu Berlin"},{"key":"ref32","article-title":"Computing blindfolded on data homomorphically encrypted under multiple keys: An extended survey","author":"aloufi","year":"2020","journal-title":"arXiv 2007 09270"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3214303"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3124441"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-00-01120-0"},{"key":"ref36","author":"lagrange","year":"1813","journal-title":"Théorie des Fonctions Analytiques Contenant les Principes du Calcul Différentiel Dégagés de Toute Considération d’Infiniment Petits d’éVanouissans de Limites et de Fluxions et réDuits à l’Analyse Algébrique des Quantités Finies"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457106"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.2307\/3029337"},{"key":"ref28","article-title":"A survey of homomorphic encryption for nonspecialists","volume":"2007","author":"fontaine","year":"2007","journal-title":"EURASIP J Inf Secur"},{"key":"ref27","year":"2020","journal-title":"HElib An Implementation of Homomorphic Encryption"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.98"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2016.07.014"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-19992-4_46"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057074"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"ref23","author":"fan","year":"2012","journal-title":"Somewhat practical fully homomorphic encryption"},{"key":"ref26","year":"2020","journal-title":"Microsoft SEAL (release 3 5)"},{"key":"ref25","year":"2020","journal-title":"PALISADE Lattice Cryptography Library (Release 1 7 4)"},{"key":"ref50","article-title":"Striving for simplicity: The all convolutional net","author":"tobias springenberg","year":"2014","journal-title":"arXiv 1412 6806"},{"key":"ref10","article-title":"MNIST handwritten digit database","volume":"2","author":"lecun","year":"2010","journal-title":"ATT Labs"},{"key":"ref11","article-title":"Batch normalization: Accelerating deep network training by reducing internal covariate shift","author":"ioffe","year":"2015","journal-title":"arXiv 1502 03167"},{"key":"ref40","author":"legendre","year":"1806","journal-title":"Nouvelles Méthodes pour la Détermination des Orbites des Comètes Avec un Supplément Contenan t Divers Perfectionnemens de ces Méthodes et Leur Application aux Deux Comètes de 1805"},{"key":"ref12","article-title":"Learning multiple layers of features from tiny images","author":"krizhevsky","year":"2009"},{"key":"ref13","article-title":"Fashion-MNIST: A novel image dataset for benchmarking machine learning algorithms","author":"xiao","year":"2017","journal-title":"ArXiv 1708 07747"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.21236\/ADA164453"},{"key":"ref15","first-page":"2483","article-title":"How does batch normalization help optimization?","author":"santurkar","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2018.2856205"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2019.07.017"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"key":"ref4","year":"2018","journal-title":"General Data Protection Regulation (GDPR)"},{"key":"ref3","year":"2019","journal-title":"Online Article"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3267973.3267974"},{"key":"ref5","first-page":"201","article-title":"Cryptonets: Applying neural networks to encrypted data with high throughput and accuracy","author":"gilad-bachrach","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref8","article-title":"CryptoDL: Deep neural networks over encrypted data","author":"hesamifard","year":"2017","journal-title":"arXiv 1711 05189"},{"key":"ref7","article-title":"Privacy-preserving classification on deep neural network","author":"chabanne","year":"2017"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ICCRE.2017.7935070"},{"key":"ref9","article-title":"Faster cryptonets: Leveraging sparsity for real-world encrypted inference","author":"chou","year":"2018","journal-title":"arXiv 1811 09953"},{"key":"ref46","article-title":"Searching for activation functions","author":"ramachandran","year":"2017","journal-title":"arXiv 1710 05941"},{"key":"ref45","article-title":"Gradient descent quantizes ReLU network features","author":"maennel","year":"2018","journal-title":"arXiv 1803 08367"},{"key":"ref48","article-title":"On centering neural network weight updates","author":"schraudolph","year":"1998","journal-title":"Tricks of the Trade"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.66.2396"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1001\/jama.2016.17216"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2882407"},{"key":"ref44","article-title":"Taming the waves: Sine as activation function in deep neural networks","author":"parascandolo","year":"2016"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/BF02551274"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09169889.pdf?arnumber=9169889","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:55:16Z","timestamp":1639770916000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9169889\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":50,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3017436","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}