{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T19:18:08Z","timestamp":1772911088894,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662467992","type":"print"},{"value":"9783662468005","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46800-5_21","type":"book-chapter","created":{"date-parts":[[2015,4,13]],"date-time":"2015-04-13T04:29:09Z","timestamp":1428899349000},"page":"537-555","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["(Batch) Fully Homomorphic Encryption over Integers for Non-Binary Message Spaces"],"prefix":"10.1007","author":[{"given":"Koji","family":"Nuida","sequence":"first","affiliation":[]},{"given":"Kaoru","family":"Kurosawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,14]]},"reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0304-3975(99)00182-6","volume":"235","author":"J Boyar","year":"2000","unstructured":"Boyar, J., Peralta, R., Pochuev, D.: On the Multiplicative Complexity of Boolean Functions over the Basis \n                      \n                        \n                      \n                      $$(\\wedge,\\oplus, 1)$$\n                    . Theor. Comput. Sci. 235(1), 43\u201357 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Buhler, J., Lenstra Jr., H.W., Pomerance, C.: Factoring integers with the number field sieve. In: Lenstra, A., Jr. Lenstra, H.W. (eds.) The Development of the Number Field Sieve. Lecture Notes in Mathematics, vol. 1554, pp. 50\u201394. Springer (1993)","DOI":"10.1007\/BFb0091539"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-642-38348-9_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"JH Cheon","year":"2013","unstructured":"Cheon, J.H., Coron, J.-S., Kim, J., Lee, M.S., Lepoint, T., Tibouchi, M., Yun, A.: Batch fully homomorphic encryption over the integers. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 315\u2013335. Springer, Heidelberg (2013)"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-642-29011-4_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"Y Chen","year":"2012","unstructured":"Chen, Y., Nguyen, P.Q.: Faster algorithms for approximate common divisors: breaking fully-homomorphic-encryption challenges over the integers. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 502\u2013519. Springer, Heidelberg (2012)"},{"key":"21_CR5","unstructured":"Cohn, H., Heninger, N.: Approximate Common Divisors via Lattices. IACR Cryptology ePrint Archive 2011\/437 (2011)"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-54631-0_18","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"J-S Coron","year":"2014","unstructured":"Coron, J.-S., Lepoint, T., Tibouchi, M.: Scale-invariant fully homomorphic encryption over the integers. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 311\u2013328. Springer, Heidelberg (2014)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-642-22792-9_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"J-S Coron","year":"2011","unstructured":"Coron, J.-S., Mandal, A., Naccache, D., Tibouchi, M.: Fully homomorphic encryption over the integers with shorter public keys. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 487\u2013504. Springer, Heidelberg (2011)"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"21_CR9","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC 2009, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-30057-8_1","volume-title":"Public Key Cryptography \u2013 PKC 2012","author":"C Gentry","year":"2012","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Better bootstrapping in fully homomorphic encryption. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 1\u201316. Springer, Heidelberg (2012)"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-44670-2_6","volume-title":"Cryptography and Lattices","author":"N Howgrave-Graham","year":"2001","unstructured":"Howgrave-Graham, N.: Approximate integer common divisors. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, pp. 51\u201366. Springer, Heidelberg (2001)"},{"issue":"1","key":"21_CR12","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0214016","volume":"14","author":"JC Lagarias","year":"1985","unstructured":"Lagarias, J.C.: The Computational Complexity of Simultaneous Diophantine Approximation Problems. SIAM J. Comput. 14(1), 196\u2013209 (1985)","journal-title":"SIAM J. Comput."},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Lenstra Jr., H.W.: Factoring Integers with Elliptic Curves. Annals of Math., Second Series 126(3), 649\u2013673 (1987)","DOI":"10.2307\/1971363"},{"issue":"3","key":"21_CR14","doi-asserted-by":"publisher","first-page":"197","DOI":"10.2307\/2369311","volume":"1","author":"E Lucas","year":"1878","unstructured":"Lucas, E.: Th\u00e9orie des fonctions num\u00e9riques simplement p\u00e9riodiques. Amer. J. Math. 1(3), 197\u2013240 (1878)","journal-title":"Amer. J. Math."},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J Schwartz","year":"1980","unstructured":"Schwartz, J.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27, 701\u2013717 (1980)","journal-title":"J. ACM"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-642-13013-7_25","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"NP Smart","year":"2010","unstructured":"Smart, N.P., Vercauteren, F.: Fully homomorphic encryption with relatively small key and ciphertext sizes. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 420\u2013443. Springer, Heidelberg (2010)"},{"issue":"1","key":"21_CR17","doi-asserted-by":"publisher","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 Cryptography 71(1), 57\u201381 (2014)","journal-title":"Des. Codes Cryptography"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Stanley, R. P.: Enumerative Combinatorics, 1st edn. vol. I. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511805967"},{"key":"21_CR19","unstructured":"Witt vector. \n                      http:\/\/en.wikipedia.org\/wiki\/Wittvector"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology -- EUROCRYPT 2015"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46800-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T23:44:30Z","timestamp":1558309470000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46800-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662467992","9783662468005"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46800-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"14 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}