{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T21:53:14Z","timestamp":1773179594299,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642195709","type":"print"},{"value":"9783642195716","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19571-6_14","type":"book-chapter","created":{"date-parts":[[2011,3,22]],"date-time":"2011-03-22T12:04:42Z","timestamp":1300795482000},"page":"219-234","source":"Crossref","is-referenced-by-count":50,"title":["Homomorphic Encryption: From Private-Key to Public-Key"],"prefix":"10.1007","author":[{"given":"Ron","family":"Rothblum","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Barak, B.: Cryptography course - Lecture notes, COS 433. Princeton University, Computer Science Department (Spring (2010), \n                    \n                      http:\/\/www.cs.princeton.edu\/courses\/archive\/spring10\/cos433"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-45539-6_10","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"G. Crescenzo Di","year":"2000","unstructured":"Di Crescenzo, G., Malkin, T., Ostrovsky, R.: Single database private information retrieval implies oblivious transfer. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, p. 122. Springer, Heidelberg (2000)"},{"key":"14_CR3","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.\u00a06110, pp. 24\u201343. Springer, Heidelberg (2010), \n                    \n                      http:\/\/dx.doi.org\/10.1007\/978-3-642-13190-5"},{"issue":"3","key":"14_CR4","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1214\/aos\/1176345462","volume":"9","author":"B. Efron","year":"1981","unstructured":"Efron, B., Stein, C.: The jackknife estimate of variance. The Annals of Statistics\u00a09(3), 586\u2013596 (1981), \n                    \n                      http:\/\/www.jstor.org\/stable\/2240822","journal-title":"The Annals of Statistics"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-39568-7_2","volume-title":"Advances in Cryptology","author":"T. El Gamal","year":"1985","unstructured":"El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 10\u201318. Springer, Heidelberg (1985), \n                    \n                      http:\/\/dx.doi.org\/10.1007\/3-540-39568-7_2"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1145\/1536414.1536440","volume-title":"Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009","author":"C. Gentry","year":"2009","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, pp. 169\u2013178. ACM, New York (2009), \n                    \n                      http:\/\/doi.acm.org\/10.1145\/1536414.1536440"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/978-3-642-14623-7_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"C. Gentry","year":"2010","unstructured":"Gentry, C., Halevi, S., Vaikuntanathan, V.: i-hop homomorphic encryption and rerandomizable yao circuits. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 155\u2013172. Springer, Heidelberg (2010), \n                    \n                      http:\/\/dx.doi.org\/10.1007\/978-3-642-14623-7"},{"key":"14_CR8","series-title":"Basic Applications","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography. Basic Applications, vol.\u00a02. Cambridge University Press, Cambridge (2004)"},{"issue":"3","key":"14_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/1412700.1412710","volume":"39","author":"O. Goldreich","year":"2008","unstructured":"Goldreich, O.: Computational complexity: a conceptual perspective. SIGACT News\u00a039(3), 35\u201339 (2008)","journal-title":"SIGACT News"},{"issue":"2","key":"14_CR10","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"},{"key":"14_CR11","doi-asserted-by":"crossref","first-page":"12","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 Journal on Computing\u00a028, 12\u201324 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1109\/SFCS.1997.646125","volume-title":"Proceedings of the 38th Annual Symposium on Foundations of Computer Science, FOCS 1997","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: single database, computationally-private information retrieval. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, FOCS 1997, p. 364. IEEE Computer Society, Los Alamitos (1997)"},{"key":"14_CR13","first-page":"169","volume-title":"Foundations of Secure Computation","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. In: Foundations of Secure Computation, pp. 169\u2013180. Academic Press, London (1978)"},{"key":"14_CR14","first-page":"146","volume":"17","author":"R. Rothblum","year":"2010","unstructured":"Rothblum, R.: Homomorphic encryption: from private-key to public-key. Electronic Colloquium on Computational Complexity (ECCC)\u00a017, 146 (2010), \n                    \n                      http:\/\/eccc.hpi-web.de\/report\/2010\/146","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19571-6_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:48:18Z","timestamp":1606186098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19571-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642195709","9783642195716"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19571-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}