{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T01:53:40Z","timestamp":1772502820303,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,5,21]],"date-time":"2006-05-21T00:00:00Z","timestamp":1148169600000},"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":[[2006,5,21]]},"DOI":"10.1145\/1132516.1132581","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"447-456","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":35,"title":["Lattice problems and norm embeddings"],"prefix":"10.1145","author":[{"given":"Oded","family":"Regev","sequence":"first","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}]},{"given":"Ricky","family":"Rosen","sequence":"additional","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}]}],"member":"320","published-online":{"date-parts":[[2006,5,21]]},"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","first-page":"421","volume-title":"Proceedings of the International Congress of Mathematicians","author":"Ajtai M.","year":"1998","unstructured":"M. Ajtai . Worst-case complexity, average-case complexity and lattice problems . In Proceedings of the International Congress of Mathematicians , Vol. III (Berlin, 1998 ), pages 421 -- 428 , 1998. M. Ajtai. Worst-case complexity, average-case complexity and lattice problems. In Proceedings of the International Congress of Mathematicians, Vol. III (Berlin, 1998), pages 421--428, 1998."},{"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","volume-title":"Hardness of approximating the closest vector problem with pre-processing. submitted","author":"Alekhnovich M.","year":"2005","unstructured":"M. Alekhnovich , S. Khot , G. Kindler , and N. K. Vishnoi . Hardness of approximating the closest vector problem with pre-processing. submitted , 2005 . M. Alekhnovich, S. Khot, G. Kindler, and N. K. Vishnoi. Hardness of approximating the closest vector problem with pre-processing. submitted, 2005."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060673"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579403"},{"key":"e_1_3_2_1_9_1","series-title":"Math","first-page":"1","volume-title":"Flavors of geometry","author":"Ball K.","year":"1997","unstructured":"K. Ball . An elementary introduction to modern convex geometry . In Flavors of geometry , volume 31 of Math . Sci. Res. Inst. Publ., pages 1 -- 58 . Cambridge Univ. Press , Cambridge, 1997 . K. Ball. An elementary introduction to modern convex geometry. In Flavors of geometry, volume 31 of Math. Sci. Res. Inst. Publ., pages 1--58. Cambridge Univ. Press, Cambridge, 1997."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792240005"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301441"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1649"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00290-0"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-003-0019-y"},{"key":"e_1_3_2_1_15_1","first-page":"123","volume-title":"Proc. Internat. Sympos. Linear Spaces (Jerusalem","author":"Dvoretzky A.","year":"1960","unstructured":"A. Dvoretzky . Some results on convex bodies and Banach spaces . In Proc. Internat. Sympos. Linear Spaces (Jerusalem , 1960 ), pages 123 -- 160 . Jerusalem Academic Press , Jerusalem , 1961. A. Dvoretzky. Some results on convex bodies and Banach spaces. In Proc. Internat. Sympos. Linear Spaces (Jerusalem, 1960), pages 123--160. Jerusalem Academic Press, Jerusalem, 1961."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.01.002"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392234"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1686"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796606"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875596"},{"key":"e_1_3_2_1_21_1","first-page":"539","volume-title":"14th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Indyk P.","year":"2003","unstructured":"P. Indyk . Better algorithms for high-dimensional proximity problems via asymmetric embeddings . In 14th Annual ACM-SIAM Symposium on Discrete Algorithms , pages 539 -- 545 , 2003 . P. Indyk. Better algorithms for high-dimensional proximity problems via asymmetric embeddings. In 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 539--545, 2003."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1016\/S1874-5849(01)80021-8","volume-title":"Handbook of the geometry of Banach spaces","author":"Johnson W. B.","year":"2001","unstructured":"W. B. Johnson and G. Schechtman . Finite dimensional subspaces of Lp . In Handbook of the geometry of Banach spaces , Vol. I , pages 837 -- 870 . North-Holland , Amsterdam , 2001 . W. B. Johnson and G. Schechtman. Finite dimensional subspaces of Lp. In Handbook of the geometry of Banach spaces, Vol. I, pages 837--870. North-Holland, Amsterdam, 2001."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.12.3.415"},{"key":"e_1_3_2_1_24_1","volume-title":"FOCS: IEEE Symposium on Foundations of Computer Science (FOCS)","author":"Khot S.","year":"2003","unstructured":"S. Khot . Hardness of approximating the shortest vector problem in high Lp norms . In FOCS: IEEE Symposium on Foundations of Computer Science (FOCS) , 2003 . S. Khot. Hardness of approximating the shortest vector problem in high Lp norms. In FOCS: IEEE Symposium on Foundations of Computer Science (FOCS), 2003."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.31"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.2461"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.8.4.538"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/sfcs.1994.365733"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.915688"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700373039"},{"key":"e_1_3_2_1_32_1","series-title":"The Kluwer International Series in Engineering and Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0897-7","volume-title":"Complexity of Lattice Problems: A Cryptographic Perspective","author":"Micciancio D.","year":"2002","unstructured":"D. Micciancio and S. Goldwasser . Complexity of Lattice Problems: A Cryptographic Perspective , volume 671 of The Kluwer International Series in Engineering and Computer Science . Kluwer Academic Publishers , Boston, Massachusetts , Mar. 2002 . D. Micciancio and S. Goldwasser. Complexity of Lattice Problems: A Cryptographic Perspective, volume 671 of The Kluwer International Series in Engineering and Computer Science. Kluwer Academic Publishers, Boston, Massachusetts, Mar. 2002."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.833350"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039490"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1512\/iumj.1960.9.59013"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90064-8"}],"event":{"name":"STOC06: Symposium on Theory of Computing","location":"Seattle WA USA","acronym":"STOC06","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1132516.1132581","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1132516.1132581","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:12Z","timestamp":1750259172000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1132516.1132581"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5,21]]},"references-count":36,"alternative-id":["10.1145\/1132516.1132581","10.1145\/1132516"],"URL":"https:\/\/doi.org\/10.1145\/1132516.1132581","relation":{},"subject":[],"published":{"date-parts":[[2006,5,21]]},"assertion":[{"value":"2006-05-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}