{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T17:44:03Z","timestamp":1784137443019,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642131899","type":"print"},{"value":"9783642131905","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13190-5_2","type":"book-chapter","created":{"date-parts":[[2010,5,19]],"date-time":"2010-05-19T09:16:46Z","timestamp":1274260606000},"page":"24-43","source":"Crossref","is-referenced-by-count":960,"title":["Fully Homomorphic Encryption over the Integers"],"prefix":"10.1007","author":[{"given":"Marten","family":"van Dijk","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Craig","family":"Gentry","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shai","family":"Halevi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vinod","family":"Vaikuntanathan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"2_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"Alexi, W., Chor, B., Goldreich, O., Schnorr, C.-P.: Rsa and rabin functions: Certain parts are as hard as the whole. SIAM J. Comput.\u00a017(2), 194\u2013209 (1988)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"2_CR2","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 (\u2009\u2227\u2009,\u2009\u2295\u2009,1). Theor. Comput. Sci.\u00a0235(1), 43\u201357 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/3-540-48910-X_28","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"C. Cachin","year":"1999","unstructured":"Cachin, C., Micali, S., Stadler, M.: Computationally private information retrieval with polylogarithmic communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 402\u2013414. Springer, Heidelberg (1999)"},{"issue":"4","key":"2_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D. Coppersmith","year":"1997","unstructured":"Coppersmith, D.: Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. Cryptology\u00a010(4), 233\u2013260 (1997)","journal-title":"J. Cryptology"},{"key":"2_CR5","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":"2_CR6","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1145\/1536414.1536440","volume-title":"STOC 2009","author":"C. Gentry","year":"2009","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC 2009, pp. 169\u2013178. ACM, New York (2009)"},{"issue":"2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System Sciences\u00a028(2), 270\u2013299 (1984)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"2_CR8","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput.\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"2_CR9","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.\u00a02146, pp. 51\u201366. Springer, Heidelberg (2001)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-3-540-70936-7_31","volume-title":"Theory of Cryptography","author":"Y. Ishai","year":"2007","unstructured":"Ishai, Y., Paskin, A.: Evaluating branching programs on encrypted data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 575\u2013594. Springer, Heidelberg (2007)"},{"key":"2_CR11","unstructured":"Karp, R.M., Ramachandran, V.: A Survey of Parallel Algorithms for Shared-Memory Machines. Technical Report CSD-88-408, UC Berkeley (1988)"},{"key":"2_CR12","series-title":"The Art of Computer Programming","volume-title":"Seminumerical Algorithms","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: Seminumerical Algorithms, 3rd edn. The Art of Computer Programming, vol.\u00a02. Addison-Wesley, Reading (1997)","edition":"3"},{"issue":"1","key":"2_CR13","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0214016","volume":"14","author":"J.C. Lagarias","year":"1985","unstructured":"Lagarias, J.C.: The computational complexity of simultaneous diophantine approximation problems. SIAM J. Comput.\u00a014(1), 196\u2013209 (1985)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"2_CR14","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1137\/0216040","volume":"16","author":"A.K. Lenstra","year":"1987","unstructured":"Lenstra, A.K.: Factoring multivariate polynomials over algebraic number fields. SIAM J. Comput.\u00a016(3), 591\u2013598 (1987)","journal-title":"SIAM J. Comput."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Pinkas, B.: A proof of security of yao\u2019s protocol for two-party computation. J. Cryptology\u00a022(2) (2009)","DOI":"10.1007\/s00145-008-9036-8"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/3-540-45682-1_2","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"P.Q. Nguyen","year":"2001","unstructured":"Nguyen, P.Q., Shparlinski, I.: On the insecurity of a server-aided RSA protocol. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 21\u201335. Springer, Heidelberg (2001)"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-44670-2_12","volume-title":"Cryptography and Lattices","author":"P.Q. Nguyen","year":"2001","unstructured":"Nguyen, P.Q., Stern, J.: The two faces of lattices in cryptology. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, pp. 146\u2013180. Springer, Heidelberg (2001)"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11593447_3","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"P.Q. Nguyen","year":"2005","unstructured":"Nguyen, P.Q., Stern, J.: Adapting density attacks to low-weight knapsacks. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 41\u201358. Springer, Heidelberg (2005)"},{"issue":"6","key":"2_CR19","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1145\/1039488.1039490","volume":"51","author":"O. Regev","year":"2004","unstructured":"Regev, O.: New lattice-based cryptographic constructions. JACM\u00a051(6), 899\u2013942 (2004)","journal-title":"JACM"},{"key":"2_CR20","first-page":"169","volume-title":"Foundations of Secure Computation","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Adleman, L., Dertouzos, M.: On data banks and privacy homomorphisms. In: Foundations of Secure Computation, pp. 169\u2013177. Academic Press, London (1978)"},{"key":"2_CR21","unstructured":"van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. Cryptology ePrint Archive, Report 2009\/616 (2009), \n                    \n                      http:\/\/eprint.iacr.org\/2009\/616"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1109\/SFCS.1982.38","volume-title":"23rd Annual Symposium on Foundations of Computer Science \u2013 FOCS 1982","author":"A.C. Yao","year":"1982","unstructured":"Yao, A.C.: Protocols for secure computations. In: 23rd Annual Symposium on Foundations of Computer Science \u2013 FOCS 1982, pp. 160\u2013164. IEEE, Los Alamitos (1982)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2010"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13190-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:47:17Z","timestamp":1558277237000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13190-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131899","9783642131905"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13190-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}