{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T14:29:53Z","timestamp":1774448993075,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642146220","type":"print"},{"value":"9783642146237","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14623-7_7","type":"book-chapter","created":{"date-parts":[[2010,8,10]],"date-time":"2010-08-10T08:15:26Z","timestamp":1281428126000},"page":"116-137","source":"Crossref","is-referenced-by-count":83,"title":["Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness"],"prefix":"10.1007","author":[{"given":"Craig","family":"Gentry","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: STOC 1996, pp. 99\u2013108 (1996)","DOI":"10.1145\/237814.237838"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48523-6_1","volume-title":"Automata, Languages and Programming","author":"M. Ajtai","year":"1999","unstructured":"Ajtai, M.: Generating hard instances of the short basis problem. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 1\u20139. Springer, Heidelberg (1999)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Dwork, C.: A public key cryptosystem with worst-case \/ average-case equivalence. In: STOC 1997, pp. 284\u2013293 (1997)","DOI":"10.1145\/258533.258604"},{"key":"7_CR4","unstructured":"Alwen, J., Peikert, C.: Generating Shorter Bases for Hard Random Lattices. In: STACS 2009, pp. 75\u201386 (2009)"},{"key":"7_CR5","unstructured":"Bach, E., Shallit, J.: Algorithmic Number Theory, vol.\u00a01 (1996)"},{"issue":"4","key":"7_CR6","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/BF01445125","volume":"296","author":"W. Banaszczyk","year":"1993","unstructured":"Banaszczyk, W.: New bounds in some transference theorems in the geometry of numbers. Mathematische Annalen\u00a0296(4), 625\u2013635 (1993)","journal-title":"Mathematische Annalen"},{"key":"7_CR7","unstructured":"Boyen, X.: Of Lettuces of Lattices: a Framework for Short Signatures and IBE with Full Security. PKC 2010 (to appear 2010)"},{"key":"7_CR8","first-page":"468","volume-title":"FOCS 1997","author":"J.-Y. Cai","year":"1997","unstructured":"Cai, J.-Y., Nerurkar, A.P.: An Improved Worst-Case to Average-Case Connection for Lattice Problems (extended abstract). In: FOCS 1997, pp. 468\u2013477. IEEE, Los Alamitos (1997)"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-642-13190-5_27","volume-title":"EUROCRYPT 2010","author":"D. Cash","year":"2010","unstructured":"Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai Trees, or How to Delegate a Lattice Basis. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 523\u2013552. Springer, Heidelberg (2010)"},{"key":"7_CR10","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":"7_CR11","doi-asserted-by":"crossref","unstructured":"Gentry, C.: A Fully Homomorphic Encryption Scheme. Ph.D. thesis, Stanford University (2009), http:\/\/crypto.stanford.edu\/craig","DOI":"10.1145\/1536414.1536440"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for Hard Lattices and New Cryptographic Constructions. In: STOC 2008, pp. 197\u2013206 (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"#cr-split#-7_CR13.1","doi-asserted-by":"crossref","unstructured":"Kalai, A.: Generating Random Factored Numbers. Easily. J. Cryptology??16(4), 287???289 (2003);","DOI":"10.1007\/s00145-003-0051-5"},{"key":"#cr-split#-7_CR13.2","unstructured":"Preliminary version in SODA 2002 (2002)"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/225058.225166","volume-title":"STOC 1995","author":"E. Kaltofen","year":"1995","unstructured":"Kaltofen, E., Shoup, V.: Subquadratic-time factoring of polynomials over finite fields. In: STOC 1995, pp. 398\u2013406. ACM, New York (1995)"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Landau, E.: Neuer Beweis des Primzahlsatzes und Beweis des Primidealsatzes. Mathematische Annalen\u00a056, 645\u2013670","DOI":"10.1007\/BF01444310"},{"issue":"4","key":"7_CR16","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann.\u00a0261(4), 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/11787006_13","volume-title":"Automata, Languages and Programming","author":"V. Lyubashevsky","year":"2006","unstructured":"Lyubashevsky, V., Micciancio, D.: Generalized compact knapsacks are collision resistant. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 144\u2013155. Springer, Heidelberg (2006)"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-78524-8_3","volume-title":"Theory of Cryptography","author":"V. Lyubashevky","year":"2008","unstructured":"Lyubashevky, V., Micciancio, D.: Asymptotically efficient lattice-based digital signatures. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 37\u201354. Springer, Heidelberg (2008)"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-642-03356-8_34","volume-title":"CRYPTO 2009","author":"V. Lyubashevky","year":"2009","unstructured":"Lyubashevky, V., Micciancio, D.: On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 577\u2013594. Springer, Heidelberg (2009)"},{"key":"7_CR20","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":"EUROCRYPT 2010","author":"V. Lyubashevky","year":"2010","unstructured":"Lyubashevky, 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":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-44670-2_11","volume-title":"Cryptography and Lattices","author":"D. Micciancio","year":"2001","unstructured":"Micciancio, D.: Improving Lattice Based Cryptosystems Using the Hermite Normal Form. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, pp. 126\u2013145. Springer, Heidelberg (2001)"},{"issue":"1","key":"7_CR22","first-page":"609","volume":"34","author":"D. Micciancio","year":"2002","unstructured":"Micciancio, D.: Improved cryptographic hash functions with worst-case \/ average-case connection. In: STOC 2002, pp. 609\u2013618 (2002); Full version: Almost perfect lattices, the covering radius problem, and applications to Ajtai\u2019s connection factor. SIAM Journal on Computing, 34(1):118\u2013169 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions. In: FOCS 2002, pp. 356\u2013365 (2002)","DOI":"10.1109\/SFCS.2002.1181960"},{"key":"#cr-split#-7_CR24.1","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Regev, O.: Worst-Case to Average-Case Reductions Based on Gaussian Measures. In: FOCS 2004, pp. 372???381 (2004);","DOI":"10.1109\/FOCS.2004.72"},{"key":"#cr-split#-7_CR24.2","doi-asserted-by":"crossref","unstructured":"Full version: SIAM J. Comput., 37(1), 267???302 (2007)","DOI":"10.1137\/S0097539705447360"},{"key":"7_CR25","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)"},{"key":"7_CR26","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/1536414.1536461","volume-title":"STOC 2009","author":"C. Peikert","year":"2009","unstructured":"Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. In: STOC 2009, pp. 333\u2013342. ACM, New York (2009)"},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/11681878_8","volume-title":"Theory of Cryptography","author":"C. Peikert","year":"2006","unstructured":"Peikert, C., Rosen, A.: Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 145\u2013166. Springer, Heidelberg (2006)"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Peikert, C., Rosen, A.: Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors. In: Proc. of STOC 2007, pp. 478\u2013487 (2007)","DOI":"10.1145\/1250790.1250860"},{"issue":"6","key":"7_CR29","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1145\/1039488.1039490","volume":"51","author":"O. Regev","year":"2004","unstructured":"Regev, O.: New lattice-based cryptographic constructions. Journal of the ACM\u00a051(6), 899\u2013942 (2004); Extended abstract in STOC 2003 (2003)","journal-title":"Journal of the ACM"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Regev, O.: On Lattices, Learning with Errors, Random Linear Codes, and Cryptography. In: Proc. of STOC 2005, pp. 84\u201393 (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"7_CR31","unstructured":"Rivest, R., Adleman, L., Dertouzos, M.: On data banks and privacy homomorphisms. In: Foundations of Secure Computation, pp. 169\u2013180 (1978)"},{"issue":"5","key":"7_CR32","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing\u00a026(5), 1484\u20131509 (1997); Extended abstract in FOCS 1994 (1994)","journal-title":"SIAM Journal on Computing"},{"key":"#cr-split#-7_CR33.1","unstructured":"Stevenhagen, P.: The Arithmetic of Number Rings. In: Algorithmic Number Theory, vol.??44. MSRI Publications (2008);"},{"key":"#cr-split#-7_CR33.2","unstructured":"See also Stevenhagen???s course notes Number Rings"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14623-7_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:55:45Z","timestamp":1606186545000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14623-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642146220","9783642146237"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14623-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}