{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T20:22:18Z","timestamp":1793132538035,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,5,31]],"date-time":"2009-05-31T00:00:00Z","timestamp":1243728000000},"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":[[2009,5,31]]},"DOI":"10.1145\/1536414.1536461","type":"proceedings-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T10:51:13Z","timestamp":1243939873000},"page":"333-342","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":596,"title":["Public-key cryptosystems from the worst-case shortest vector problem"],"prefix":"10.1145","author":[{"given":"Chris","family":"Peikert","sequence":"first","affiliation":[{"name":"SRI International, Menlo Park, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2009,5,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/646229.681554"},{"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\/258533.258604"},{"key":"e_1_3_2_1_4_1","volume-title":"The first and fourth public-key cryptosystems with worst-case\/average-case equivalence. Electronic Colloquium on Computational Complexity (ECCC), 14(97)","author":"Ajtai M.","year":"2007","unstructured":"M. Ajtai and C. Dwork . The first and fourth public-key cryptosystems with worst-case\/average-case equivalence. Electronic Colloquium on Computational Complexity (ECCC), 14(97) , 2007 . M. Ajtai and C. Dwork. The first and fourth public-key cryptosystems with worst-case\/average-case equivalence. Electronic Colloquium on Computational Complexity (ECCC), 14(97), 2007."},{"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.1007\/978-3-642-00457-5_28"},{"key":"e_1_3_2_1_7_1","first-page":"75","volume-title":"STACS","author":"Alwen J.","year":"2009","unstructured":"J. Alwen and C. Peikert . Generating shorter bases for hard random lattices . In STACS , pages 75 -- 86 , 2009 . J. Alwen and C. Peikert. Generating shorter bases for hard random lattices. In STACS, pages 75--86, 2009."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579403"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00058-9"},{"key":"e_1_3_2_1_10_1","volume-title":"Manuscript","author":"Cash D.","year":"2009","unstructured":"D. Cash , C. Peikert , and A. Sahai . Efficient circular-secure encryption from hard learning problems . Manuscript , 2009 . D. Cash, C. Peikert, and A. Sahai. Efficient circular-secure encryption from hard learning problems. Manuscript, 2009."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1788414.1788417"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374407"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1686"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/646762.706185"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73010"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/829497.829786"},{"key":"e_1_3_2_1_18_1","first-page":"315","volume-title":"Public Key Cryptography","author":"Kawachi A.","year":"2007","unstructured":"A. Kawachi , K. Tanaka , and K. Xagawa . Multi-bit cryptosystems based on lattice problems . In Public Key Cryptography , pages 315 -- 329 , 2007 . A. Kawachi, K. Tanaka, and K. Xagawa. Multi-bit cryptosystems based on lattice problems. In Public Key Cryptography, pages 315--329, 2007."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.24"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"e_1_3_2_1_21_1","volume-title":"Manuscript","author":"Lyubashevsky V.","year":"2009","unstructured":"V. Lyubashevsky and D. Micciancio . On bounded distance decoding, unique shortest vectors, and the minimum distance problem . Manuscript , 2009 . V. Lyubashevsky and D. Micciancio. On bounded distance decoding, unique shortest vectors, and the minimum distance problem. Manuscript, 2009."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447360"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-008-0251-3"},{"key":"e_1_3_2_1_24_1","volume-title":"Public-key cryptosystems from the worst-case shortest vector problem. Electronic Colloquium on Computational Complexity (ECCC), 15(100)","author":"Peikert C.","year":"2008","unstructured":"C. Peikert . Public-key cryptosystems from the worst-case shortest vector problem. Electronic Colloquium on Computational Complexity (ECCC), 15(100) , 2008 . C. Peikert. Public-key cryptosystems from the worst-case shortest vector problem. Electronic Colloquium on Computational Complexity (ECCC), 15(100), 2008."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_31"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374406"},{"key":"e_1_3_2_1_27_1","volume-title":"Lecture notes on lattices in computer science","author":"Regev O.","year":"2004","unstructured":"O. Regev . Lecture notes on lattices in computer science , 2004 . Available at http:\/\/www.cs.tau.ac.il\/odedr\/teaching\/lattices_fall_2004\/index.html, last accessed 28 Feb 2008. O. Regev. Lecture notes on lattices in computer science, 2004. Available at http:\/\/www.cs.tau.ac.il\/odedr\/teaching\/lattices_fall_2004\/index.html, last accessed 28 Feb 2008."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039490"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060603"},{"key":"e_1_3_2_1_30_1","unstructured":"O. Regev December 2008. Personal communication.  O. Regev December 2008. Personal communication."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_25"}],"event":{"name":"STOC '09: Symposium on Theory of Computing","location":"Bethesda MD USA","acronym":"STOC '09","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-first annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1536414.1536461","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1536414.1536461","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:38:51Z","timestamp":1750239531000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1536414.1536461"}},"subtitle":["extended abstract"],"short-title":[],"issued":{"date-parts":[[2009,5,31]]},"references-count":31,"alternative-id":["10.1145\/1536414.1536461","10.1145\/1536414"],"URL":"https:\/\/doi.org\/10.1145\/1536414.1536461","relation":{},"subject":[],"published":{"date-parts":[[2009,5,31]]},"assertion":[{"value":"2009-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}