{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T04:21:51Z","timestamp":1775794911893,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":56,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,5,17]],"date-time":"2008-05-17T00:00:00Z","timestamp":1210982400000},"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":[[2008,5,17]]},"DOI":"10.1145\/1374376.1374407","type":"proceedings-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T16:50:20Z","timestamp":1211993420000},"page":"197-206","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1622,"title":["Trapdoors for hard lattices and new cryptographic constructions"],"prefix":"10.1145","author":[{"given":"Craig","family":"Gentry","sequence":"first","affiliation":[{"name":"Stanford University, Palo Alto, CA, USA"}]},{"given":"Chris","family":"Peikert","sequence":"additional","affiliation":[{"name":"SRI International, Menlo Park, CA, USA"}]},{"given":"Vinod","family":"Vaikuntanathan","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2008,5,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946330"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1089023.1089025"},{"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.5555\/646229.681554"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258604"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380857"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579403"},{"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","doi-asserted-by":"publisher","DOI":"10.1145\/147508.147537"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/168588.168596"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1754495.1754541"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1788414.1788419"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398521"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.64"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00058-9"},{"key":"e_1_3_2_1_17_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_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/647995.742435"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/646765.704121"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/647087.715827"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/357830.357847"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"e_1_3_2_1_23_1","first-page":"55","volume-title":"SCN","author":"Dodis Y.","year":"2002","unstructured":"Y. Dodis and L. Reyzin . On the power of claw-free permutations . In SCN , pages 55 - 73 , 2002 . Y. Dodis and L. Reyzin. On the power of claw-free permutations. In SCN, pages 55-73, 2002."},{"key":"e_1_3_2_1_24_1","first-page":"186","volume-title":"CRYPTO","author":"Fiat A.","year":"1986","unstructured":"A. Fiat and A. Shamir . How to prove yourself: Practical solutions to identification and signature problems . In CRYPTO , pages 186 - 194 , 1986 . A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In CRYPTO, pages 186-194, 1986."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756123.1756136"},{"key":"e_1_3_2_1_26_1","volume-title":"STOC, 2008","author":"Gentry C.","year":"2007","unstructured":"C. Gentry , C. Peikert , and V. Vaikuntanathan . Trapdoors for hard lattices and new cryptographic constructions . In STOC, 2008 . Full version available at http:\/\/eprint.iacr.org\/ 2007 \/432. C. Gentry, C. Peikert, and V. Vaikuntanathan. Trapdoors for hard lattices and new cryptographic constructions. In STOC, 2008. Full version available at http:\/\/eprint.iacr.org\/2007\/432."},{"key":"e_1_3_2_1_27_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_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/646762.706185"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217017"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1767011.1767025"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/948109.948132"},{"key":"e_1_3_2_1_32_1","first-page":"937","volume-title":"SODA","author":"Klein P. N.","year":"2000","unstructured":"P. N. Klein . Finding the closest lattice vector when it's unusually close . In SODA , pages 937 - 941 , 2000 . P. N. Klein. Finding the closest lattice vector when it's unusually close. In SODA, pages 937-941, 2000."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/11830924_41"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_13"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/1802614.1802619"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703433511"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-007-0234-9"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0897-7"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447360"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_17"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73011"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_17"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1515\/JMC.2008.009"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2007.12"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_8"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250860"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374406"},{"key":"e_1_3_2_1_50_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_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039490"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060603"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100269"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90064-8"},{"key":"e_1_3_2_1_56_1","first-page":"47","volume-title":"CRYPTO","author":"Shamir A.","year":"1984","unstructured":"A. Shamir . Identity-based cryptosystems and signature schemes . In CRYPTO , pages 47 - 53 , 1984 . A. Shamir. Identity-based cryptosystems and signature schemes. In CRYPTO, pages 47-53, 1984."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_7"}],"event":{"name":"STOC '08: Symposium on Theory of Computing","location":"Victoria British Columbia Canada","acronym":"STOC '08","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the fortieth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374407","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1374376.1374407","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:32Z","timestamp":1750278152000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374407"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,17]]},"references-count":56,"alternative-id":["10.1145\/1374376.1374407","10.1145\/1374376"],"URL":"https:\/\/doi.org\/10.1145\/1374376.1374407","relation":{},"subject":[],"published":{"date-parts":[[2008,5,17]]},"assertion":[{"value":"2008-05-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}