{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T22:23:53Z","timestamp":1791066233491,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T00:00:00Z","timestamp":1181520000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,6,11]]},"DOI":"10.1145\/1250790.1250860","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T16:07:37Z","timestamp":1189786057000},"page":"478-487","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":46,"title":["Lattices that admit logarithmic worst-case to average-case connection factors"],"prefix":"10.1145","author":[{"given":"Chris","family":"Peikert","sequence":"first","affiliation":[{"name":"SRI International, Menlo Park, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alon","family":"Rosen","sequence":"additional","affiliation":[{"name":"Harvard CRCS, Cambridge, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2007,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1089023.1089025"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237838"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276705"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258604"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380857"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132614"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791260"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01445125"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574039"},{"key":"e_1_3_2_1_10_1","unstructured":"E. Bayer-Fluckiger. Personal communication.  E. Bayer-Fluckiger. Personal communication."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1017\/CBO9780511542961.012","volume-title":"A Panorama of Number Theory Or The View from Baker's Garden","author":"Bayer-Fluckiger E.","year":"2002","unstructured":"E. Bayer-Fluckiger . A Panorama of Number Theory Or The View from Baker's Garden , chapter 11, pages 168 -- 184 . Cambridge University Press , September 2002 . E. Bayer-Fluckiger. A Panorama of Number Theory Or The View from Baker's Garden, chapter 11, pages 168--184. Cambridge University Press, September 2002."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.52484"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00216-0"},{"key":"e_1_3_2_1_14_1","first-page":"468","volume-title":"FOCS","author":"Cai J.-Y.","year":"1997","unstructured":"J.-Y. Cai and A. Nerurkar . An improved worst-case to average-case connection for lattice problems . In FOCS , pages 468 -- 477 , 1997 . J.-Y. Cai and A. Nerurkar. An improved worst-case to average-case connection for lattice problems. In FOCS, pages 468--477, 1997."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1649"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/206777"},{"key":"e_1_3_2_1_17_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BFb0054877","volume-title":"ANTS","author":"Cohen H.","year":"1998","unstructured":"H. Cohen , F. D. y Diaz, and M. Olivier. A table of totally complex number fields of small discriminants . In ANTS , volume 1423 of Lecture Notes in Computer Science , pages 381 -- 391 . Springer , 1998 . H. Cohen, F.D. y Diaz, and M. Olivier. A table of totally complex number fields of small discriminants. In ANTS, volume 1423 of Lecture Notes in Computer Science, pages 381--391. Springer, 1998."},{"key":"e_1_3_2_1_18_1","volume-title":"a Sloane. Sphere Packings, Lattices and Groups","author":"Conway J.H.","year":"1998","unstructured":"J.H. Conway and N. J. a Sloane. Sphere Packings, Lattices and Groups . Springer , December 1998 . J.H. Conway and N.J. a Sloane. Sphere Packings, Lattices and Groups. Springer, December 1998."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.01.002"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1686"},{"key":"e_1_3_2_1_21_1","volume-title":"Collision-free hashing from lattice problems. Electronic Colloquium on Computational Complexity (ECCC), 3(42)","author":"Goldreich O.","year":"1996","unstructured":"O. Goldreich , S. Goldwasser , and S. Halevi . Collision-free hashing from lattice problems. Electronic Colloquium on Computational Complexity (ECCC), 3(42) , 1996 . O. Goldreich, S. Goldwasser, and S. Halevi. Collision-free hashing from lattice problems. Electronic Colloquium on Computational Complexity (ECCC), 3(42), 1996."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00083-6"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.808131"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-1992-00284-7"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060660"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250859"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1089023.1089027"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"e_1_3_2_1_30_1","first-page":"95","volume-title":"Mathematics and computer science II, Fundamental contributions in the Netherlands since","author":"Lenstra H.W.","year":"1945","unstructured":"H.W. Lenstra . Codes from algebraic number fields. In M. Hazewinkel, J.K. Lenstra, and L.G. L.T. Meertens, editors, Mathematics and computer science II, Fundamental contributions in the Netherlands since 1945 , CWI Monograph 4, pages 95 -- 104 . Elsevier , North-Holland, Amsterdam, 1986. H.W. Lenstra. Codes from algebraic number fields. In M. Hazewinkel, J.K. Lenstra, and L.G. L.T. Meertens, editors, Mathematics and computer science II, Fundamental contributions in the Netherlands since 1945, CWI Monograph 4, pages 95--104. Elsevier, North-Holland, Amsterdam, 1986."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_13"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700373039"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.915688"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652130"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703433511"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.72"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-88330-9"},{"key":"e_1_3_2_1_38_1","volume-title":"Algebraic Number Theory","author":"Mollin R.A.","year":"1999","unstructured":"R.A. Mollin . Algebraic Number Theory . CRC Press , 1999 . R.A. Mollin. Algebraic Number Theory. CRC Press, 1999."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_8"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039490"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060603"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132581"},{"key":"e_1_3_2_1_44_1","volume-title":"Academic Press","author":"Roquette P.","year":"1967","unstructured":"P. Roquette . On class field towers, chapter IX, pages 231--249 . Academic Press , 1967 . P. Roquette. On class field towers, chapter IX, pages 231--249. Academic Press, 1967."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90064-8"},{"key":"e_1_3_2_1_46_1","unstructured":"D. Simon. Personal communication.  D. Simon. Personal communication."}],"event":{"name":"STOC07: Symposium on Theory of Computing","location":"San Diego California USA","acronym":"STOC07","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the thirty-ninth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250790.1250860","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1250790.1250860","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:52:21Z","timestamp":1750258341000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250790.1250860"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,11]]},"references-count":44,"alternative-id":["10.1145\/1250790.1250860","10.1145\/1250790"],"URL":"https:\/\/doi.org\/10.1145\/1250790.1250860","relation":{},"subject":[],"published":{"date-parts":[[2007,6,11]]},"assertion":[{"value":"2007-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}