{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T10:05:56Z","timestamp":1775469956003,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":58,"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.1536440","type":"proceedings-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T14:51:13Z","timestamp":1243954273000},"page":"169-178","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4487,"title":["Fully homomorphic encryption using ideal lattices"],"prefix":"10.1145","author":[{"given":"Craig","family":"Gentry","sequence":"first","affiliation":[{"name":"Stanford University, Palo Alto, USA"}]}],"member":"320","published-online":{"date-parts":[[2009,5,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237838"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258604"},{"key":"e_1_3_2_1_3_1","first-page":"83","article-title":"On the security of joint signature and encryption. Eurocrypt '02","volume":"2332","author":"An J.H.","journal-title":"LNCS"},{"key":"e_1_3_2_1_4_1","unstructured":"F. Armknecht and A.-R. Sadeghi.A new approach for algebraically homomorphic encryption. Eprint 2008\/422.  F. Armknecht and A.-R. Sadeghi.A new approach for algebraically homomorphic encryption. Eprint 2008\/422."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579403"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12131"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756169.1756201"},{"key":"e_1_3_2_1_8_1","volume-title":"Dept. of Comp. Sci.","author":"Benaloh J.","year":"1988"},{"key":"e_1_3_2_1_9_1","first-page":"62","article-title":"Encryption-scheme security in the presence of key-dependent messages. SAC '02","volume":"2595","author":"Black J.","journal-title":"LNCS"},{"key":"e_1_3_2_1_10_1","first-page":"127","article-title":"Divertible protocols and atomic proxy cryptography. Eurocrypt '98","volume":"1403","author":"Blaze M.","journal-title":"LNCS"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_7"},{"key":"e_1_3_2_1_13_1","first-page":"283","article-title":"Searching for Elements in Black-Box Fields and Applications. Crypto '96","volume":"1109","author":"Boneh D.","journal-title":"LNCS"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00182-6"},{"key":"e_1_3_2_1_15_1","unstructured":"R. Canetti. Personal communication 2008.  R. Canetti. Personal communication 2008."},{"key":"e_1_3_2_1_16_1","first-page":"565","volume-title":"Crypto '03","author":"Canetti R."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056861"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970343141X"},{"key":"e_1_3_2_1_19_1","first-page":"350","article-title":"A Length-Flexible Threshold Cryptosystem with Applications. ACISP '03","volume":"2727","author":"Damgard I.","journal-title":"LNCS"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057074"},{"key":"e_1_3_2_1_21_1","first-page":"51","article-title":"Combinatorial cryptosystems galore! Contemporary Mathematics,v. 168 of Finite Fields: Theory, Applications, and Algorithms","author":"Fellows M.","year":"1993","journal-title":"FQ2"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_29"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802212"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315303"},{"key":"e_1_3_2_1_25_1","first-page":"267","volume-title":"Proc. of ANTS '98","author":"Hoffstein J."},{"key":"e_1_3_2_1_26_1","volume-title":"Evaluating Branching Programs on Encrypted Data. TCC '07","author":"Ishai Y."},{"key":"e_1_3_2_1_27_1","first-page":"315","article-title":"Multi-bit cryptosystems based on lattice problems. PKC '07","volume":"4450","author":"Kawachi A.","journal-title":"LNCS"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"e_1_3_2_1_29_1","first-page":"177","article-title":"A Polly Cracker system based on satisfiability. In Coding, Crypt. and Comb","volume":"23","author":"Vehel F.","journal-title":"Prog. in Comp.Sci. and App. Logic"},{"key":"e_1_3_2_1_30_1","volume-title":"Ruhr-Universitat Bochum","author":"Ly L.","year":"2002"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"L. Ly. Polly two -- a new algebraic polynomial-based public-key scheme.AAECC 17(3-4) 2006.  L. Ly. Polly two -- a new algebraic polynomial-based public-key scheme.AAECC 17(3-4) 2006.","DOI":"10.1007\/s00200-006-0010-0"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_13"},{"key":"e_1_3_2_1_33_1","volume-title":"TCC '08","author":"Lyubashevky V."},{"key":"e_1_3_2_1_34_1","first-page":"497","article-title":"Speeding up secret computations with insecure auxiliary devices. Crypto '88","volume":"403","author":"Matsumoto T.","journal-title":"LNCS"},{"key":"e_1_3_2_1_35_1","first-page":"427","volume-title":"Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations. Asiacrypt '07","author":"Maurer U."},{"key":"e_1_3_2_1_36_1","first-page":"1858","volume-title":"ISIT '08","author":"Melchor C.A."},{"key":"e_1_3_2_1_37_1","unstructured":"C.A. Melchor P. Gaborit and J. Herranz. Additive Homomorphic Encryption with t-Operand Multiplications. Eprint 2008\/378.  C.A. Melchor P. Gaborit and J. Herranz. Additive Homomorphic Encryption with t-Operand Multiplications. Eprint 2008\/378."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/352600.352616"},{"key":"e_1_3_2_1_39_1","first-page":"126","volume-title":"Improving Lattice Based Cryptosystems Using the Hermite Normal Form. CaLC '01","author":"Micciancio D."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509995"},{"key":"e_1_3_2_1_41_1","first-page":"356","volume-title":"FOCS '02","author":"Micciancio D."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/288090.288106"},{"key":"e_1_3_2_1_43_1","first-page":"21","volume-title":"On the Insecurity of Some Server-Aided RSA Protocol. Asiacrypt '01","author":"Nguyen P.Q."},{"key":"e_1_3_2_1_44_1","first-page":"372","volume-title":"Asiacrypt '98","author":"Nguyen P.Q."},{"key":"e_1_3_2_1_45_1","first-page":"75","volume-title":"Proc. Sympos. Appl. Math.","volume":"42","author":"Odlyzko A.M.","year":"1990"},{"key":"e_1_3_2_1_46_1","first-page":"308","article-title":"A New Public-Key Cryptosystem as Secure as Factoring. Eurocrypt '98","volume":"1403","author":"Okamoto T.","journal-title":"LNCS"},{"key":"e_1_3_2_1_47_1","first-page":"223","volume-title":"Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. Eurocrypt '99","author":"Paillier P."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_8"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250860"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374406"},{"key":"e_1_3_2_1_51_1","first-page":"153","article-title":"Attacks on protocols for server-aided RSA computation. Eurocrypt '92","volume":"658","author":"Pfitzmann B.","journal-title":"LNCS"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_54"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060603"},{"key":"e_1_3_2_1_54_1","first-page":"169","volume-title":"Foundations of Secure Computation","author":"Rivest R.","year":"1978"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"e_1_3_2_1_56_1","first-page":"554","volume-title":"FOCS '99","author":"Sander T.","year":"1999"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.5555\/2796561.2796598"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-01-01310-2"}],"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.1536440","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1536414.1536440","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:38:50Z","timestamp":1750253930000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1536414.1536440"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,31]]},"references-count":58,"alternative-id":["10.1145\/1536414.1536440","10.1145\/1536414"],"URL":"https:\/\/doi.org\/10.1145\/1536414.1536440","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"}}]}}