{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T04:10:17Z","timestamp":1749615017105,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662533567"},{"type":"electronic","value":"9783662533574"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53357-4_19","type":"book-chapter","created":{"date-parts":[[2016,8,30]],"date-time":"2016-08-30T13:22:01Z","timestamp":1472563321000},"page":"288-301","source":"Crossref","is-referenced-by-count":2,"title":["On-the-fly Homomorphic Batching\/Unbatching"],"prefix":"10.1007","author":[{"given":"Yark\u0131n","family":"Dor\u00f6z","sequence":"first","affiliation":[]},{"given":"Gizem S.","family":"\u00c7etin","sequence":"additional","affiliation":[]},{"given":"Berk","family":"Sunar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,31]]},"reference":[{"key":"19_CR1","unstructured":"Bos, J.W., Lauter, K., Naehrig, M.: Private predictive analysis on encrypted medical data. Technical report MSR-TR-2013-81 (2013). http:\/\/research.microsoft.com\/apps\/pubs\/default.aspx?id=200652"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical gapSVP. IACR Cryptology ePrint Archive 2012\/78 (2012)","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: Proceedings of the 3rd Innovations inTheoretical Computer Science Conference, pp. 309\u2013325. ACM (2012)","DOI":"10.1145\/2090236.2090262"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/978-3-642-22792-9_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"Z Brakerski","year":"2011","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 505\u2013524. Springer, Heidelberg (2011)"},{"issue":"2","key":"19_CR5","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1137\/120868669","volume":"43","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. SIAM J. Comput. 43(2), 831\u2013871 (2014)","journal-title":"SIAM J. Comput."},{"key":"19_CR6","unstructured":"Cheon Jung, H., Miran, K., Kristin, L.: Secure DNA-sequence analysis on encrypted DNA nucleotides (2014). http:\/\/media.eurekalert.org\/aaasnewsroom\/MCM\/-FIL_000000001439\/EncryptedSW.pdf"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Dai, W., Dor\u00f6z, Y., Sunar, B.: Accelerating NTRU based homomorphic encryption using GPUs. In: 2014 IEEE High Performance Extreme Computing Conference (HPEC), pp. 1\u20136 (2014)","DOI":"10.1109\/HPEC.2014.7041001"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-319-29172-7_11","volume-title":"Cryptography and Information Security in the Balkans","author":"W Dai","year":"2016","unstructured":"Dai, W., Sunar, B.: cuHE: a homomorphic encryption accelerator library. In: Pasalic, E., et al. (eds.) BalkanCryptSec 2015. LNCS, vol. 9540, pp. 169\u2013186. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-29172-7_11"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/978-3-642-13190-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"M Dijk van","year":"2010","unstructured":"van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 24\u201343. Springer, Heidelberg (2010)"},{"key":"19_CR10","first-page":"1","volume":"80","author":"Y Dor\u00f6z","year":"2015","unstructured":"Dor\u00f6z, Y., Hu, Y., Sunar, B.: Homomorphic AES evaluation using the modified LTV scheme. Des. Codes Cryptogr. 80, 1\u201326 (2015)","journal-title":"Des. Codes Cryptogr."},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/978-3-662-44774-1_17","volume-title":"Financial Cryptography and Data Security","author":"Y Dor\u00f6z","year":"2014","unstructured":"Dor\u00f6z, Y., Shahverdi, A., Eisenbarth, T., Sunar, B.: Toward practical homomorphic evaluation of block ciphers using prince. In: B\u00f6hme, R., Brenner, M., Moore, T., Smith, M. (eds.) FC 2014 Workshops. LNCS, vol. 8438, pp. 208\u2013220. Springer, Heidelberg (2014)"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Gentry, C.: A Fully Homomorphic Encryption Scheme. Ph.D. thesis, Stanford University (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, STOC 2009, pp. 169\u2013178. ACM (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Gentry, C., Halevi, S.: Fully homomorphic encryption without squashing using depth-3 arithmetic circuits. IACR Cryptology ePrint Archive 2011\/279 (2011)","DOI":"10.1109\/FOCS.2011.94"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-642-20465-4_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"C Gentry","year":"2011","unstructured":"Gentry, C., Halevi, S.: Implementing Gentry\u2019s fully-homomorphic encryption scheme. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 129\u2013148. Springer, Heidelberg (2011)"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Homomorphic evaluation of the AES circuit. IACR Cryptology ePrint Archive 2012 (2012)","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-319-29172-7_11","volume-title":"Cryptography and Information Security in the Balkans","author":"W Dai","year":"2016","unstructured":"Dai, W., Sunar, B.: cuHE: a homomorphic encryption accelerator library. In: Pasalic, E., et al. (eds.) BalkanCryptSec 2015. LNCS, vol. 9540, pp. 169\u2013186. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-29172-7_11"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-37682-5_1","volume-title":"Information Security and Cryptology \u2013 ICISC 2012","author":"T Graepel","year":"2013","unstructured":"Graepel, T., Lauter, K., Naehrig, M.: ML confidential: machine learning on encrypted data. In: Lee, M.-K., Kwon, D., Kwon, T. (eds.) ICISC 2012. LNCS, vol. 7839, pp. 1\u201321. Springer, Heidelberg (2013)"},{"key":"19_CR19","unstructured":"Halevi, S., Shoup, V.: HElib, homomorphic encryption library. Internet Source (2012)"},{"issue":"1","key":"19_CR20","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/MSP.2012.2219653","volume":"30","author":"R Lagendijk","year":"2013","unstructured":"Lagendijk, R., Erkin, Z., Barni, M.: Encrypted signal processing for privacy protection: conveying the utility of homomorphic encryption and multiparty computation. IEEE Signal Process. Mag. 30(1), 82\u2013105 (2013)","journal-title":"IEEE Signal Process. Mag."},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-319-16295-9_1","volume-title":"Progress in Cryptology - LATINCRYPT 2014","author":"K Lauter","year":"2015","unstructured":"Lauter, K., L\u00f3pez-Alt, A., Naehrig, M.: Private computation on encrypted genomic data. In: Aranha, D.F., Menezes, A. (eds.) LATINCRYPT 2014. LNCS, vol. 8895, pp. 3\u201327. Springer, Heidelberg (2015)"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/978-3-642-19074-2_21","volume-title":"Topics in Cryptology \u2013 CT-RSA 2011","author":"R Lindner","year":"2011","unstructured":"Lindner, R., Peikert, C.: Better key sizes (and attacks) for LWE-based encryption. In: Kiayias, A. (ed.) CT-RSA 2011. LNCS, vol. 6558, pp. 319\u2013339. Springer, Heidelberg (2011)"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Alt, A., Tromer, E., Vaikuntanathan, V.: On-the-flymultiparty computation on the cloud via multikey fully homomorphic encryption. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing STOC 2012, pp. 1219\u20131234. ACM (2012)","DOI":"10.1145\/2213977.2214086"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Naehrig, M., Lauter, K., Vaikuntanathan, V.: Can homomorphic encryption bepractical? In: Proceedings of the 3rd ACM Workshop on Cloud ComputingSecurity Workshop, CCSW 2011, pp. 113\u2013124. ACM (2011)","DOI":"10.1145\/2046660.2046682"},{"key":"19_CR25","unstructured":"Shoup, V.: NTL: A library for doing number theory (2001). http:\/\/www.shoup.net\/ntl\/"},{"issue":"1","key":"19_CR26","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10623-012-9720-4","volume":"71","author":"NP Smart","year":"2014","unstructured":"Smart, N.P., Vercauteren, F.: Fully homomorphic SIMD operations. Des. Codes Cryptogr. 71(1), 57\u201381 (2014)","journal-title":"Des. Codes Cryptogr."},{"key":"19_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/978-3-642-20465-4_4","volume-title":"Advances in Cryptology EUROCRYPT 2011","author":"D Stehl\u00e9","year":"2011","unstructured":"Stehl\u00e9, D., Steinfeld, R.: Making NTRU as secure as worst-case problems over ideal lattices. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 27\u201347. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53357-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T15:31:22Z","timestamp":1749569482000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53357-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662533567","9783662533574"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53357-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}