{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T08:04:14Z","timestamp":1771661054764,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030801281","type":"print"},{"value":"9783030801298","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-80129-8_49","type":"book-chapter","created":{"date-parts":[[2021,7,24]],"date-time":"2021-07-24T07:02:48Z","timestamp":1627110168000},"page":"702-721","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["TFHE Parameter Setup for Effective and Error-Free Neural Network Prediction on Encrypted Data"],"prefix":"10.1007","author":[{"given":"Jakub","family":"Klemsa","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"publisher","unstructured":"Bourse, F., Minelli, M., Minihold, M., Paillier, P.: Fast homomorphic evaluation of deep discretized neural networks. In: Annual International Cryptology Conference, pp. 483\u2013512. Springer, New York (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_17","DOI":"10.1007\/978-3-319-96878-0_17"},{"key":"49_CR2","doi-asserted-by":"publisher","unstructured":"Carpov, S., Izabach\u00e8ne, M., Mollimard, V.: New techniques for multi-value input homomorphic evaluation and applications. In: Matsui, M. (eds.) Topics in Cryptology \u2013 CT-RSA 2019. CT-RSA 2019. Lecture Notes in Computer Science, vol. 11405. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12612-4_6","DOI":"10.1007\/978-3-030-12612-4_6"},{"issue":"1","key":"49_CR3","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","volume":"33","author":"I Chillotti","year":"2020","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: TFHE: fast fully homomorphic encryption over the torus. J. Cryptol. 33(1), 34\u201391 (2020)","journal-title":"J. Cryptol."},{"key":"49_CR4","unstructured":"Google Cloud. AI Platform. https:\/\/cloud.google.com\/ai-platform"},{"key":"49_CR5","unstructured":"European Commission: General Data Protection Regulation. https:\/\/eur-lex.europa.eu\/eli\/reg\/2016\/679"},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"Dwork, C., Roth, A., et al.: The algorithmic foundations of differential privacy. Found. Trends\u00ae Theor. Comput. Sci. 9(3\u20134), 211\u2013407 (2014)","DOI":"10.1561\/0400000042"},{"key":"49_CR7","unstructured":"Ersatzlabs. AI & Deep Learning. http:\/\/www.ersatzlabs.com\/"},{"key":"49_CR8","unstructured":"Gentry, C., Boneh, D.: A Fully Homomorphic Encryption Scheme, vol. 20. Stanford University (2009)"},{"key":"49_CR9","doi-asserted-by":"publisher","unstructured":"Graepel, T., Lauter, K., Naehrig, M.: ML confidential: machine learning on encrypted data. In: Kwon, T., Lee, M.K., Kwon, D. (eds.) Information Security and Cryptology \u2013 ICISC 2012. ICISC 2012. Lecture Notes in Computer Science, vol. 7839. Springer, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-37682-5_1","DOI":"10.1007\/978-3-642-37682-5_1"},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"Klemsa, J., Novotn\u00fd, M.: WTFHE: neural-netWork-ready Torus Fully Homomorphic Encryption. In: 2020 9th Mediterranean Conference on Embedded Computing (MECO). IEEE (2020)","DOI":"10.1109\/MECO49872.2020.9134331"},{"key":"49_CR11","unstructured":"Microsoft. Azure Machine Learning. http:\/\/azure.microsoft.com\/en-us\/services\/machine-learning\/"},{"issue":"6","key":"49_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM (JACM) 56(6), 1\u201340 (2009)","journal-title":"J. ACM (JACM)"},{"key":"49_CR13","doi-asserted-by":"publisher","unstructured":"Rothblum, R.D.: On the circular security of bit-encryption. In: Sahai, A. (eds.) Theory of Cryptography. TCC 2013. Lecture Notes in Computer Science, vol. 7785. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_32","DOI":"10.1007\/978-3-642-36594-2_32"},{"key":"49_CR14","doi-asserted-by":"crossref","unstructured":"Rumelhart, D.E., Hinton, G.E., Williams, R.J.: Learning representations by back-propagating errors. Nature 323(6088), 533\u2013536 (1986)","DOI":"10.1038\/323533a0"},{"key":"49_CR15","doi-asserted-by":"crossref","unstructured":"Tillem, G., Bozdemir, B., \u00d6nen, M.: Switching among cryptographic tools for privacy-preserving neural network predictions. Preprint, Swann (2020)","DOI":"10.5220\/0009890704970504"},{"key":"49_CR16","unstructured":"Turi. Graphlab Create\u2122. https:\/\/turi.com\/"},{"key":"49_CR17","unstructured":"Xie, P., Bilenko, M., Finley, T., Gilad-Bachrach, R., Lauter, K., Naehrig, M.: Crypto-nets: neural networks over encrypted data. arXiv:1412.6181 (2014)"},{"key":"49_CR18","doi-asserted-by":"publisher","first-page":"49868","DOI":"10.1109\/ACCESS.2018.2867655","volume":"6","author":"T Zhou","year":"2018","unstructured":"Zhou, T., Yang, X., Liu, L., Zhang, W., Li, N.: Faster bootstrapping with multiple addends. IEEE Access 6, 49868\u201349876 (2018)","journal-title":"IEEE Access"}],"container-title":["Lecture Notes in Networks and Systems","Intelligent Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-80129-8_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T07:13:20Z","timestamp":1771658000000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80129-8_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030801281","9783030801298"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80129-8_49","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"value":"2367-3370","type":"print"},{"value":"2367-3389","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"6 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}