{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T16:09:27Z","timestamp":1768925367380,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642420320","type":"print"},{"value":"9783642420337","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-42033-7_6","type":"book-chapter","created":{"date-parts":[[2013,11,23]],"date-time":"2013-11-23T03:07:02Z","timestamp":1385176022000},"page":"97-116","source":"Crossref","is-referenced-by-count":27,"title":["Discrete Gaussian Leftover Hash Lemma over Infinite Domains"],"prefix":"10.1007","author":[{"given":"Shweta","family":"Agrawal","sequence":"first","affiliation":[]},{"given":"Craig","family":"Gentry","sequence":"additional","affiliation":[]},{"given":"Shai","family":"Halevi","sequence":"additional","affiliation":[]},{"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Agrawal, S., Gentry, C., Halevi, S., Sahai, A.: Discrete gaussian leftover hash lemma over infinite domains (2012), \n                    \n                      http:\/\/eprint.iacr.org\/2012\/714"},{"issue":"4","key":"6_CR2","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":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-20465-4_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"D. Boneh","year":"2011","unstructured":"Boneh, D., Freeman, D.M.: Homomorphic signatures for polynomial functions. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 149\u2013168. Springer, Heidelberg (2011)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-642-34961-4_27","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"L. Ducas","year":"2012","unstructured":"Ducas, L., Nguyen, P.Q.: Learning a zonotope and more: Cryptanalysis of ntrusign countermeasures. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol.\u00a07658, pp. 433\u2013450. Springer, Heidelberg (2012)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-38348-9_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"S. Garg","year":"2013","unstructured":"Garg, S., Gentry, C., Halevi, S.: Candidate multilinear maps from ideal lattices and applications. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol.\u00a07881, pp. 1\u201317. Springer, Heidelberg (2013), \n                    \n                      http:\/\/eprint.iacr.org\/2013\/610"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Dwork, C. (ed.) STOC, pp. 197\u2013206. ACM (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"6_CR7","unstructured":"Klein, P.: Finding the closest lattice vector when it\u2019s unusually close. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2000, pp. 937\u2013941 (2000)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Litvak, A.E., Pajor, A., Rudelson, M., Tomczak-Jaegermann, N.: Smallest singular value of random matrices and geometry of random polytopes. Advances in Mathematics\u00a0195(2) (2005)","DOI":"10.1016\/j.aim.2004.08.004"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-642-29011-4_43","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"V. Lyubashevsky","year":"2012","unstructured":"Lyubashevsky, V.: Lattice signatures without trapdoors. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 738\u2013755. Springer, Heidelberg (2012)"},{"issue":"1","key":"6_CR10","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D. Micciancio","year":"2007","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on gaussian measures. SIAM J. Computing\u00a037(1), 267\u2013302 (2007)","journal-title":"SIAM J. Computing"},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s00145-008-9031-0","volume":"22","author":"P.Q. Nguyen","year":"2009","unstructured":"Nguyen, P.Q., Regev, O.: Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures. J. Cryptol.\u00a022(2), 139\u2013160 (2009)","journal-title":"J. Cryptol."},{"issue":"2","key":"6_CR12","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/s00037-008-0251-3","volume":"17","author":"C. Peikert","year":"2008","unstructured":"Peikert, C.: Limits on the hardness of lattice problems in l\n                           \n                    p\n                   norms. Computational Complexity\u00a017(2), 300\u2013351 (2008)","journal-title":"Computational Complexity"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-14623-7_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"C. Peikert","year":"2010","unstructured":"Peikert, C.: An efficient and parallel gaussian sampler for lattices. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 80\u201397. Springer, Heidelberg (2010)"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. JACM\u00a056(6) (2009)","DOI":"10.1145\/1568318.1568324"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-19571-6_14","volume-title":"Theory of Cryptography","author":"R. Rothblum","year":"2011","unstructured":"Rothblum, R.: Homomorphic encryption: From private-key to public-key. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol.\u00a06597, pp. 219\u2013234. Springer, Heidelberg (2011)"},{"key":"6_CR16","unstructured":"Rudelson, M., Vershynin, R.: Non-asymptotic theory of random matrices: extreme singular values. In: International Congress of Mathematicans (2010)"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Tao, T.: Topics in random matrix theory. Graduate Studies in Mathematics, vol.\u00a0132. American Mathematical Society (2012)","DOI":"10.1090\/gsm\/132"},{"key":"6_CR18","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)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-42033-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T13:42:36Z","timestamp":1558705356000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-42033-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642420320","9783642420337"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-42033-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}