{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T16:54:54Z","timestamp":1778345694094,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"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":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214086","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"1219-1234","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":625,"title":["On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption"],"prefix":"10.1145","author":[{"given":"Adriana","family":"L\u00f3pez-Alt","sequence":"first","affiliation":[{"name":"New York University, New York, NY, USA"}]},{"given":"Eran","family":"Tromer","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}]},{"given":"Vinod","family":"Vaikuntanathan","sequence":"additional","affiliation":[{"name":"University of Toronto, Toronto, ON, Canada"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258604"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_35"},{"key":"e_1_3_2_2_3_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/978-3-642-14165-2_14","volume-title":"S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P","author":"Applebaum B.","year":"2010","unstructured":"B. Applebaum , Y. Ishai , and E. Kushilevitz . From secrecy to soundness: Efficient verification via secure computation . In S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P . G. Spirakis, editors, ICALP (1), volume 6198 of Lecture Notes in Computer Science , pages 152 -- 163 . Springer , 2010 . B. Applebaum, Y. Ishai, and E. Kushilevitz. From secrecy to soundness: Efficient verification via secure computation. In S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis, editors, ICALP (1), volume 6198 of Lecture Notes in Computer Science, pages 152--163. Springer, 2010."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090263"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"A.\n      Blum M. L.\n      Furst M. J.\n      Kearns and \n      R. J.\n      Lipton\n  . \n  Cryptographic primitives based on hard learning problems\n  . In D. R. Stinson editor CRYPTO volume \n  773\n   of \n  Lecture Notes in Computer Science pages \n  278\n  --\n  291\n  . \n  Springer 1993\n  .   A. Blum M. L. Furst M. J. Kearns and R. J. Lipton. Cryptographic primitives based on hard learning problems. In D. R. Stinson editor CRYPTO volume 773 of Lecture Notes in Computer Science pages 278--291. Springer 1993.","DOI":"10.1007\/3-540-48329-2_24"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.12"},{"key":"e_1_3_2_2_12_1","first-page":"505","volume-title":"Rogaway CRYPTO2011","author":"Brakerski Z.","unstructured":"Z. Brakerski and V. Vaikuntanathan . Fully homomorphic encryption from ring-lwe and security for key dependent messages . In Rogaway CRYPTO2011 , pages 505 -- 524 . Z. Brakerski and V. Vaikuntanathan. Fully homomorphic encryption from ring-lwe and security for key dependent messages. In Rogaway CRYPTO2011, pages 505--524."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62214"},{"key":"e_1_3_2_2_14_1","first-page":"483","volume-title":"Rabin CRYPTO2010","author":"Chung K.-M.","unstructured":"K.-M. Chung , Y. T. Kalai , and S. P. Vadhan . Improved delegation of computation using fully homomorphic encryption . In Rabin CRYPTO2010 , pages 483 -- 501 . K.-M. Chung, Y. T. Kalai, and S. P. Vadhan. Improved delegation of computation using fully homomorphic encryption. In Rabin CRYPTO2010, pages 483--501."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/647086.715687"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_23"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_14"},{"key":"e_1_3_2_2_18_1","first-page":"465","volume-title":"Rabin CRYPTO2010","author":"Gennaro R.","unstructured":"R. Gennaro , C. Gentry , and B. Parno . Non-interactive verifiable computing: Outsourcing computation to untrusted workers . In Rabin CRYPTO2010 , pages 465 -- 482 . R. Gennaro, C. Gentry, and B. Parno. Non-interactive verifiable computing: Outsourcing computation to untrusted workers. In Rabin CRYPTO2010, pages 465--482."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.94"},{"key":"e_1_3_2_2_22_1","volume-title":"Personal communication","author":"Gentry C.","year":"2011","unstructured":"C. Gentry , S. Halevi , V. Lyubashevsky , C. Peikert , J. Silverman , and N. Smart . Personal communication , 2011 . C. Gentry, S. Halevi, V. Lyubashevsky, C. Peikert, J. Silverman, and N. Smart. Personal communication, 2011."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993651"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/2163822"},{"key":"e_1_3_2_2_25_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/BFb0052231","volume-title":"B. S. K. Jr.","author":"Goldreich O.","year":"1997","unstructured":"O. Goldreich , S. Goldwasser , and S. Halevi . Public-key cryptosystems from lattice reduction problems . In B. S. K. Jr. , editor, CRYPTO, volume 1294 of Lecture Notes in Computer Science , pages 112 -- 131 . Springer , 1997 . O. Goldreich, S. Goldwasser, and S. Halevi. Public-key cryptosystems from lattice reduction problems. In B. S. K. Jr., editor, CRYPTO, volume 1294 of Lecture Notes in Computer Science, pages 112--131. Springer, 1997."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374396"},{"key":"e_1_3_2_2_29_1","first-page":"132","volume-title":"Rogaway CRYPTO2011","author":"Halevi S.","unstructured":"S. Halevi , Y. Lindell , and B. Pinkas . Secure computation on the web: Computing without simultaneous interaction . In Rogaway CRYPTO2011 , pages 132 -- 150 . S. Halevi, Y. Lindell, and B. Pinkas. Secure computation on the web: Computing without simultaneous interaction. In Rogaway CRYPTO2011, pages 132--150."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"J.\n      Hoffstein J.\n      Pipher and \n      J. H.\n      Silverman\n  . \n  Ntru: A ring-based public key cryptosystem\n  . In J. Buhler editor ANTS volume \n  1423\n   of \n  Lecture Notes in Computer Science pages \n  267\n  --\n  288\n  . \n  Springer 1998\n  .   J. Hoffstein J. Pipher and J. H. Silverman. Ntru: A ring-based public key cryptosystem. In J. Buhler editor ANTS volume 1423 of Lecture Notes in Computer Science pages 267--288. Springer 1998.","DOI":"10.1007\/BFb0054868"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129782"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"crossref","unstructured":"J.\n      Kilian\n    .\n  Improved efficient arguments (preliminary version)\n  . In D. Coppersmith editor CRYPTO volume \n  963\n   of \n  Lecture Notes in Computer Science pages \n  311\n  --\n  324\n  . \n  Springer 1995\n  .   J. Kilian. Improved efficient arguments (preliminary version). In D. Coppersmith editor CRYPTO volume 963 of Lecture Notes in Computer Science pages 311--324. Springer 1995.","DOI":"10.1007\/3-540-44750-4_25"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_13"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365746"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447360"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"crossref","unstructured":"M.\n      Naor\n    .\n  On cryptographic assumptions and challenges\n  . In D. Boneh editor CRYPTO volume \n  2729\n   of \n  Lecture Notes in Computer Science pages \n  96\n  --\n  109\n  . \n  Springer 2003\n  .  M. Naor. On cryptographic assumptions and challenges. In D. Boneh editor CRYPTO volume 2729 of Lecture Notes in Computer Science pages 96--109. Springer 2003.","DOI":"10.1007\/978-3-540-45146-4_6"},{"key":"e_1_3_2_2_39_1","volume-title":"IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011","author":"Ostrovsky R.","year":"2011","unstructured":"R. Ostrovsky , editor. IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011 , Palm Springs, CA, USA, October 22--25 , 2011 . IEEE, 2011. R. Ostrovsky, editor. IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22--25, 2011. IEEE, 2011."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060603"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568324"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653687"},{"key":"e_1_3_2_2_44_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-22792-9","volume-title":"Advances in Cryptology - CRYPTO 2011 - 31st Annual Cryptology Conference","author":"Rogaway P.","year":"2011","unstructured":"P. Rogaway , editor. Advances in Cryptology - CRYPTO 2011 - 31st Annual Cryptology Conference , Santa Barbara, CA, USA , August 14--18, 2011 . Proceedings, volume 6841 of Lecture Notes in Computer Science . Springer , 2011. P. Rogaway, editor. Advances in Cryptology - CRYPTO 2011 - 31st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14--18, 2011. Proceedings, volume 6841 of Lecture Notes in Computer Science. Springer, 2011."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13013-7_25"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"crossref","unstructured":"D.\n      Stehl\u00e9\n     and \n      R.\n      Steinfeld\n  . \n  Making ntru as secure as worst-case problems over ideal lattices\n  . In K. G. Paterson editor EUROCRYPT volume \n  6632\n   of \n  Lecture Notes in Computer Science pages \n  27\n  --\n  47\n  . \n  Springer 2011\n  .   D. Stehl\u00e9 and R. Steinfeld. Making ntru as secure as worst-case problems over ideal lattices. In K. G. Paterson editor EUROCRYPT volume 6632 of Lecture Notes in Computer Science pages 27--47. Springer 2011.","DOI":"10.1007\/978-3-642-20465-4_4"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"crossref","unstructured":"P.\n      Valiant\n    .\n  Incrementally verifiable computation or proofs of knowledge imply time\/space efficiency\n  . In R. Canetti editor TCC volume \n  4948\n   of \n  Lecture Notes in Computer Science pages \n  1\n  --\n  18\n  . \n  Springer 2008\n  .   P. Valiant. Incrementally verifiable computation or proofs of knowledge imply time\/space efficiency. In R. Canetti editor TCC volume 4948 of Lecture Notes in Computer Science pages 1--18. Springer 2008.","DOI":"10.1007\/978-3-540-78524-8_1"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.5555\/1382436.1382751"}],"event":{"name":"STOC'12: Symposium on Theory of Computing","location":"New York New York USA","acronym":"STOC'12","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214086","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214086","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:57Z","timestamp":1750238457000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214086"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":44,"alternative-id":["10.1145\/2213977.2214086","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214086","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}