{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T13:36:27Z","timestamp":1784036187138,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642290107","type":"print"},{"value":"9783642290114","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29011-4_28","type":"book-chapter","created":{"date-parts":[[2012,4,5]],"date-time":"2012-04-05T07:05:53Z","timestamp":1333609553000},"page":"465-482","source":"Crossref","is-referenced-by-count":276,"title":["Fully Homomorphic Encryption with Polylog Overhead"],"prefix":"10.1007","author":[{"given":"Craig","family":"Gentry","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shai","family":"Halevi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nigel P.","family":"Smart","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"Rivest, R., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. In: Foundations of Secure Computation, pp. 169\u2013180 (1978)"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher, M. (ed.) STOC, pp. 169\u2013178. ACM (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Gentry, C.: A fully homomorphic encryption scheme. PhD thesis, Stanford University (2009), \n                    \n                      http:\/\/crypto.stanford.edu\/craig","DOI":"10.1145\/1536414.1536440"},{"key":"28_CR4","unstructured":"Smart, N.P., Vercauteren, F.: Fully homomorphic SIMD operations (2011) (manuscript), \n                    \n                      http:\/\/eprint.iacr.org\/2011\/133"},{"key":"28_CR5","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: Fully homomorphic encryption without bootstrapping. In: The 3rd Innovations in Theoretical Computer Science Conference, ITCS (2012), Full version at, \n                    \n                      http:\/\/eprint.iacr.org\/2011\/277"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"V. Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On Ideal Lattices and Learning with Errors over Rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 1\u201323. Springer, Heidelberg (2010)"},{"key":"28_CR7","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.\u00a06841, pp. 505\u2013524. Springer, Heidelberg (2011)"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: FOCS. IEEE Computer Society (2011)","DOI":"10.1109\/FOCS.2011.12"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Lauter, K., Naehrig, M., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: ACM Workshop on Cloud Computing Security, pp. 113\u2013124 (2011)","DOI":"10.1145\/2046660.2046682"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-642-17373-8_22","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"D. Stehl\u00e9","year":"2010","unstructured":"Stehl\u00e9, D., Steinfeld, R.: Faster Fully Homomorphic Encryption. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 377\u2013394. Springer, Heidelberg (2010)"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a06632, pp. 129\u2013148. Springer, Heidelberg (2011)"},{"key":"28_CR12","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Fully homomorphic encryption with polylog overhead (2011), Full version at \n                    \n                      http:\/\/eprint.iacr.org\/2011\/566"},{"key":"28_CR13","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":"N.P. 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.\u00a06056, pp. 420\u2013443. Springer, Heidelberg (2010)"},{"key":"28_CR14","unstructured":"Hennessy, J.L., Patterson, D.A.: Computer Architecture: A Quantitative Approach, 4th edn. Morgan Kaufmann (2006)"},{"key":"28_CR15","doi-asserted-by":"crossref","first-page":"1641","DOI":"10.1002\/j.1538-7305.1964.tb04103.x","volume":"43","author":"V.E. Bene\u0161","year":"1964","unstructured":"Bene\u0161, V.E.: Optimal rearrangeable multistage connecting networks. Bell System Technical Journal\u00a043, 1641\u20131656 (1964)","journal-title":"Bell System Technical Journal"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1145\/321439.321449","volume":"15","author":"A. Waksman","year":"1968","unstructured":"Waksman, A.: A permutation network. J. ACM\u00a015, 159\u2013163 (1968)","journal-title":"J. ACM"},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-642-13190-5_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"I. Damg\u00e5rd","year":"2010","unstructured":"Damg\u00e5rd, I., Ishai, Y., Kr\u00f8igaard, M.: Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 445\u2013465. Springer, Heidelberg (2010)"},{"key":"28_CR18","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TC.1981.6312171","volume":"C-30","author":"G. Lev","year":"1981","unstructured":"Lev, G., Pippenger, N., Valiant, L.: A fast parallel algorithm for routing in permutation networks. IEEE Transactions on Computers\u00a0C-30, 93\u2013100 (1981)","journal-title":"IEEE Transactions on Computers"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Leighton, F.T.: Introduction to parallel algorithms and architectures: arrays, trees, hypercubes, 2nd edn. M. Kaufmann Publishers (1992)","DOI":"10.1016\/B978-1-4832-0772-8.50005-4"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29011-4_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:18:40Z","timestamp":1620127120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29011-4_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642290107","9783642290114"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29011-4_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}