{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T18:05:13Z","timestamp":1775585113580,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,1,12]],"date-time":"2014-01-12T00:00:00Z","timestamp":1389484800000},"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":[[2014,1,12]]},"DOI":"10.1145\/2554797.2554799","type":"proceedings-article","created":{"date-parts":[[2014,1,14]],"date-time":"2014-01-14T13:40:06Z","timestamp":1389706806000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":186,"title":["Lattice-based FHE as secure as PKE"],"prefix":"10.1145","author":[{"given":"Zvika","family":"Brakerski","sequence":"first","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}]},{"given":"Vinod","family":"Vaikuntanathan","sequence":"additional","affiliation":[{"name":"University of Toronto and MIT, Cambridge, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2014,1,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258604"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(89)90037-8"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215040"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Z.\n      Brakerski\n    .\n  Fully homomorphic encryption without modulus switching from classical GapSVP\n  . In R. Safavi-Naini and R. Canetti editors CRYPTO volume \n  7417\n   of \n  Lecture Notes in Computer Science pages \n  868\n  --\n  886\n  . \n  Springer 2012\n  .  Z. Brakerski. Fully homomorphic encryption without modulus switching from classical GapSVP. In R. Safavi-Naini and R. Canetti editors CRYPTO volume 7417 of Lecture Notes in Computer Science pages 868--886. Springer 2012.","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488680"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.12"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881422"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374407"},{"key":"e_1_3_2_1_12_1","volume-title":"Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. IACR Cryptology ePrint Archive","author":"Gentry C.","year":"2013"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Y.\n      Ishai\n     and \n      A.\n      Paskin\n  . \n  Evaluating branching programs on encrypted data\n  . In S. P. Vadhan editor TCC volume \n  4392\n   of \n  Lecture Notes in Computer Science pages \n  575\n  --\n  594\n  . \n  Springer 2007\n  .   Y. Ishai and A. Paskin. Evaluating branching programs on encrypted data. In S. P. Vadhan editor TCC volume 4392 of Lecture Notes in Computer Science pages 575--594. Springer 2007.","DOI":"10.1007\/978-3-540-70936-7_31"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"D.\n      Micciancio\n     and \n      P.\n      Mol\n  . \n  Pseudorandom knapsacks and the sample complexity of lwe search-to-decision reductions\n  . In P. Rogaway editor CRYPTO volume \n  6841\n   of \n  Lecture Notes in Computer Science pages \n  465\n  --\n  484\n  . \n  Springer 2011\n  .   D. Micciancio and P. Mol. Pseudorandom knapsacks and the sample complexity of lwe search-to-decision reductions. In P. Rogaway editor CRYPTO volume 6841 of Lecture Notes in Computer Science pages 465--484. Springer 2011.","DOI":"10.1007\/978-3-642-22792-9_26"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536461"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039490"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060603"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568324"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90064-8"}],"event":{"name":"ITCS'14: Innovations in Theoretical Computer Science","location":"Princeton New Jersey USA","acronym":"ITCS'14","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 5th conference on Innovations in theoretical computer science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2554797.2554799","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2554797.2554799","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:21Z","timestamp":1750232061000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2554797.2554799"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,12]]},"references-count":19,"alternative-id":["10.1145\/2554797.2554799","10.1145\/2554797"],"URL":"https:\/\/doi.org\/10.1145\/2554797.2554799","relation":{},"subject":[],"published":{"date-parts":[[2014,1,12]]},"assertion":[{"value":"2014-01-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}