{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T11:59:46Z","timestamp":1793102386122,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"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":[[2013,6]]},"DOI":"10.1145\/2488608.2488680","type":"proceedings-article","created":{"date-parts":[[2013,5,28]],"date-time":"2013-05-28T12:35:41Z","timestamp":1369744541000},"page":"575-584","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":500,"title":["Classical hardness of learning with errors"],"prefix":"10.1145","author":[{"given":"Zvika","family":"Brakerski","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adeline","family":"Langlois","sequence":"additional","affiliation":[{"name":"LIP, ENS Lyon, Lyon, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chris","family":"Peikert","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oded","family":"Regev","sequence":"additional","affiliation":[{"name":"Courant Institute, New York University, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Damien","family":"Stehl\u00e9","sequence":"additional","affiliation":[{"name":"LIP, ENS Lyon, Lyon, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881420"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237838"},{"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.1007\/978-3-642-00457-5_28"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(87)90006-6"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30057-8_20"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_35"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01445125"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"D.\n      Boneh\n     and \n      R.\n      Venkatesan\n  . \n  Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes\n  . In N. Koblitz editor CRYPTO volume \n  1109\n   of \n  Lecture Notes in Computer Science pages \n  129\n  --\n  142\n  . \n  Springer 1996\n  .   D. Boneh and R. Venkatesan. Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes. In N. Koblitz editor CRYPTO volume 1109 of Lecture Notes in Computer Science pages 129--142. Springer 1996.","DOI":"10.1007\/3-540-68697-5_11"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13013-7_29"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.12"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_27"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32928-9_2"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374407"},{"key":"e_1_3_2_1_19_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_20_1","first-page":"230","volume-title":"ICS","author":"Goldwasser S.","year":"2010","unstructured":"S. Goldwasser , Y. T. Kalai , C. Peikert , and V. Vaikuntanathan . Robustness of the learning with errors assumption . In ICS , pages 230 -- 240 , 2010 . S. Goldwasser, Y. T. Kalai, C. Peikert, and V. Vaikuntanathan. Robustness of the learning with errors assumption. In ICS, pages 230--240, 2010."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89255-7_23"},{"key":"e_1_3_2_1_23_1","volume-title":"The LLL Algorithm: Survey and Applications","author":"Khot S.","year":"2010","unstructured":"S. Khot . Inapproximability results for computational problems on lattices . In P. Nguyen and B. Vall\u00e9e, editors, The LLL Algorithm: Survey and Applications . Springer-Verlag , New York , 2010 . S. Khot. Inapproximability results for computational problems on lattices. In P. Nguyen and B. Vall\u00e9e, editors, The LLL Algorithm: Survey and Applications. Springer-Verlag, New York, 2010."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.24"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703436345"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1964621.1964651"},{"key":"e_1_3_2_1_27_1","first-page":"162","volume-title":"Public Key Cryptography","author":"Lyubashevsky V.","year":"2008","unstructured":"V. Lyubashevsky . Lattice-based identification schemes secure under active attacks . In Public Key Cryptography , pages 162 -- 179 , 2008 . V. Lyubashevsky. Lattice-based identification schemes secure under active attacks. In Public Key Cryptography, pages 162--179, 2008."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_43"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_13"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_34"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/2033036.2033070"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447360"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_17"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/2033036.2033076"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536461"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881419"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_8"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_31"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374406"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039490"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703440678"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568324"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2010.26"},{"key":"e_1_3_2_1_46_1","volume-title":"The LLL Algorithm: Survey and Applications","author":"Regev O.","year":"2010","unstructured":"O. Regev . On the complexity of lattice problems with polynomial approximation factors . In P. Nguyen and B. Vall\u00e9e, editors, The LLL Algorithm: Survey and Applications . Springer-Verlag , New York , 2010 . O. Regev. On the complexity of lattice problems with polynomial approximation factors. In P. Nguyen and B. Vall\u00e9e, editors, The LLL Algorithm: Survey and Applications. Springer-Verlag, New York, 2010."}],"event":{"name":"STOC'13: Symposium on Theory of Computing","location":"Palo Alto California USA","acronym":"STOC'13","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-fifth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488680","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2488608.2488680","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:39:20Z","timestamp":1750221560000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488680"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":46,"alternative-id":["10.1145\/2488608.2488680","10.1145\/2488608"],"URL":"https:\/\/doi.org\/10.1145\/2488608.2488680","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]},"assertion":[{"value":"2013-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}