{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,24]],"date-time":"2026-10-24T19:31:28Z","timestamp":1792870288349,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,11,3]],"date-time":"2014-11-03T00:00:00Z","timestamp":1414972800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["AMAROUT II (grant n. 291803)"],"award-info":[{"award-number":["AMAROUT II (grant n. 291803)"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Madrid Regional Government","award":["PROMETIDOS-CM (S2009\/TIC1465)"],"award-info":[{"award-number":["PROMETIDOS-CM (S2009\/TIC1465)"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1017660"],"award-info":[{"award-number":["1017660"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006754","name":"U.S. Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF-06-3-0001"],"award-info":[{"award-number":["W911NF-06-3-0001"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]},{"name":"U.S. Army Research Laboratory and U.K. Ministry of Defense","award":["W911NF-06-3-0001"],"award-info":[{"award-number":["W911NF-06-3-0001"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,11,3]]},"DOI":"10.1145\/2660267.2660366","type":"proceedings-article","created":{"date-parts":[[2014,11,11]],"date-time":"2014-11-11T13:40:05Z","timestamp":1415713205000},"page":"844-855","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":197,"title":["Efficiently Verifiable Computation on Encrypted Data"],"prefix":"10.1145","author":[{"given":"Dario","family":"Fiore","sequence":"first","affiliation":[{"name":"IMDEA Software Institute, Madrid, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rosario","family":"Gennaro","sequence":"additional","affiliation":[{"name":"City University of New York, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Valerio","family":"Pastro","sequence":"additional","affiliation":[{"name":"City University of New York, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,11,3]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"152","volume-title":"ICALP (1)","author":"Applebaum B.","year":"2010","unstructured":"B. Applebaum , Y. Ishai , and E. Kushilevitz . From secrecy to soundness: Effcient verification via secure computation . In ICALP (1) , pages 152 -- 163 , 2010 . B. Applebaum, Y. Ishai, and E. Kushilevitz. From secrecy to soundness: Effcient verification via secure computation. In ICALP (1), pages 152--163, 2010."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267824"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22192"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103428"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89520"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516681"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382279"},{"key":"e_1_3_2_1_8_1","series-title":"LNCS","first-page":"90","volume-title":"CRYPTO","author":"Ben-Sasson E.","year":"2013","unstructured":"E. Ben-Sasson , A. Chiesa , D. Genkin , E. Tromer , and M. Virza . Snarks for c: Verifying program executions succinctly and in zero knowledge . In CRYPTO , volume 8043 of LNCS , pages 90 -- 108 . Springer , 2013 . E. Ben-Sasson, A. Chiesa, D. Genkin, E. Tromer, and M. Virza. Snarks for c: Verifying program executions succinctly and in zero knowledge. In CRYPTO, volume 8043 of LNCS, pages 90--108. Springer, 2013."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"S.\n      Benabbas R.\n      Gennaro and \n      Y.\n      Vahlis\n  . \n  Verifiable delegation of computation over large datasets\n  . In P. Rogaway editor CRYPTO volume \n  6841\n   of \n  Lecture Notes in Computer Science pages \n  111\n  --\n  131\n  . \n  Springer 2011\n  .   S. Benabbas R. Gennaro and Y. Vahlis. Verifiable delegation of computation over large datasets. In P. Rogaway editor CRYPTO volume 6841 of Lecture Notes in Computer Science pages 111--131. Springer 2011.","DOI":"10.1007\/978-3-642-22792-9_7"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090263"},{"key":"e_1_3_2_1_11_1","volume-title":"Recursive composition and bootstrapping for snarks and proof-carrying data. IACR Cryptology ePrint Archive","author":"Bitansky N.","year":"2012","unstructured":"N. Bitansky , R. Canetti , A. Chiesa , and E. Tromer . Recursive composition and bootstrapping for snarks and proof-carrying data. IACR Cryptology ePrint Archive , 2012 . http:\/\/eprint.iacr.org\/2012\/095. N. Bitansky, R. Canetti, A. Chiesa, and E. Tromer. Recursive composition and bootstrapping for snarks and proof-carrying data. IACR Cryptology ePrint Archive, 2012. http:\/\/eprint.iacr.org\/2012\/095."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_26"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"D.\n      Boneh X.\n      Boyen and \n      H.\n      Shacham\n  . \n  Short group signatures\n  . In M. K. Franklin editor CRYPTO volume \n  3152\n   of \n  LNCS pages \n  41\n  --\n  55\n  . \n  Springer 2004\n  .  D. Boneh X. Boyen and H. Shacham. Short group signatures. In M. K. Franklin editor CRYPTO volume 3152 of LNCS pages 41--55. Springer 2004.","DOI":"10.1007\/978-3-540-28628-8_3"},{"key":"e_1_3_2_1_14_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  LNCS pages 868{\n  886\n  . Springer 2012.  Z. Brakerski. Fully homomorphic encryption without modulus switching from classical gapsvp. In R. Safavi-Naini and R. Canetti editors CRYPTO volume 7417 of LNCS pages 868{886. Springer 2012.","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Z.\n      Brakerski\n     and \n      V.\n      Vaikuntanathan\n  . \n  Fully homomorphic encryption from ring-lwe and security for key dependent messages\n  . In P. Rogaway editor CRYPTO volume \n  6841\n   of \n  Lecture Notes in Computer Science pages \n  505\n  --\n  524\n  . \n  Springer 2011\n  .   Z. Brakerski and V. Vaikuntanathan. Fully homomorphic encryption from ring-lwe and security for key dependent messages. In P. Rogaway editor CRYPTO volume 6841 of Lecture Notes in Computer Science pages 505--524. Springer 2011.","DOI":"10.1007\/978-3-642-22792-9_29"},{"key":"e_1_3_2_1_17_1","series-title":"LNCS","first-page":"483","volume-title":"CRYPTO","author":"Chung K.-M.","year":"2010","unstructured":"K.-M. Chung , Y. T. Kalai , and S. P. Vadhan . Improved delegation of computation using fully homomorphic encryption . In CRYPTO , volume 6223 of LNCS , pages 483 -- 501 . Springer , 2010 . K.-M. Chung, Y. T. Kalai, and S. P. Vadhan. Improved delegation of computation using fully homomorphic encryption. In CRYPTO, volume 6223 of LNCS, pages 483--501. Springer, 2010."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090245"},{"key":"e_1_3_2_1_19_1","volume-title":"Effciently verifiable computation on encrypted data. IACR Cryptology ePrint Archive","author":"Fiore D.","year":"2014","unstructured":"D. Fiore , R. Gennaro , and V. Pastro . Effciently verifiable computation on encrypted data. IACR Cryptology ePrint Archive , 2014 : 202, 2014. D. Fiore, R. Gennaro, and V. Pastro. Effciently verifiable computation on encrypted data. IACR Cryptology ePrint Archive, 2014:202, 2014."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"R.\n      Gennaro C.\n      Gentry and \n      B.\n      Parno\n  . \n  Non-interactive verifiable computing: Outsourcing computation to untrusted workers\n  . In T. Rabin editor CRYPTO volume \n  6223\n   of \n  Lecture Notes in Computer Science pages \n  465\n  --\n  482\n  . \n  Springer 2010\n  .   R. Gennaro C. Gentry and B. Parno. Non-interactive verifiable computing: Outsourcing computation to untrusted workers. In T. Rabin editor CRYPTO volume 6223 of Lecture Notes in Computer Science pages 465--482. Springer 2010.","DOI":"10.1007\/978-3-642-14623-7_25"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"R.\n      Gennaro C.\n      Gentry B.\n      Parno and \n      M.\n      Raykova\n  . \n  Quadratic span programs and succinct nizks without pcps\n  . In T. Johansson and P. Q. Nguyen editors EUROCRYPT volume \n  7881\n   of \n  LNCS pages \n  626\n  --\n  645\n  . \n  Springer 2013\n  .  R. Gennaro C. Gentry B. Parno and M. Raykova. Quadratic span programs and succinct nizks without pcps. In T. Johansson and P. Q. Nguyen editors EUROCRYPT volume 7881 of LNCS pages 626--645. Springer 2013.","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"e_1_3_2_1_22_1","series-title":"LNCS","first-page":"301","volume-title":"ASIACRYPT (2)","author":"Gennaro R.","year":"2013","unstructured":"R. Gennaro and D. Wichs . Fully homomorphic message authenticators . In ASIACRYPT (2) , volume 8270 of LNCS , pages 301 -- 320 . Springer , 2013 . R. Gennaro and D. Wichs. Fully homomorphic message authenticators. In ASIACRYPT (2), volume 8270 of LNCS, pages 301--320. Springer, 2013."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"C.\n      Gentry\n    .\n  Toward basing fully homomorphic encryption on worst-case hardness\n  . In T. Rabin editor CRYPTO volume \n  6223\n   of \n  Lecture Notes in Computer Science pages 116{\n  137\n  . Springer 2010.   C. Gentry. Toward basing fully homomorphic encryption on worst-case hardness. In T. Rabin editor CRYPTO volume 6223 of Lecture Notes in Computer Science pages 116{137. Springer 2010.","DOI":"10.1007\/978-3-642-14623-7_7"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"C.\n      Gentry\n     and \n      S.\n      Halevi\n  . \n  Implementing gentry's fully-homomorphic encryption scheme\n  . In K. G. Paterson editor EUROCRYPT volume \n  6632\n   of \n  LNCS pages 129{\n  148\n  . Springer 2011.   C. Gentry and S. Halevi. Implementing gentry's fully-homomorphic encryption scheme. In K. G. Paterson editor EUROCRYPT volume 6632 of LNCS pages 129{148. Springer 2011.","DOI":"10.1007\/978-3-642-20465-4_9"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_28"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488678"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374396"},{"key":"e_1_3_2_1_29_1","first-page":"456","volume":"2011","author":"Goldwasser S.","year":"2011","unstructured":"S. Goldwasser , H. Lin , and A. Rubinstein . Delegation of computation without rejection problem from designated verifier CS-proofs. IACR Cryptology ePrint Archive , 2011 : 456 , 2011 . S. Goldwasser, H. Lin, and A. Rubinstein. Delegation of computation without rejection problem from designated verifier CS-proofs. IACR Cryptology ePrint Archive, 2011:456, 2011.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_19"},{"key":"e_1_3_2_1_32_1","unstructured":"S. Halevi and V. Shoup. Helib. https:\/\/github.com\/shaih\/HElib. Accessed: 2014-05--14.  S. Halevi and V. Shoup. Helib. https:\/\/github.com\/shaih\/HElib. Accessed: 2014-05--14."},{"key":"e_1_3_2_1_33_1","first-page":"95","volume":"2013","author":"Joux A.","year":"2013","unstructured":"A. Joux . A new index calculus algorithm with complexity l(1\/4+o(1)) in very small characteristic. IACR Cryptology e Print Archive , 2013 : 95 , 2013 . A. Joux. A new index calculus algorithm with complexity l(1\/4+o(1)) in very small characteristic. IACR Cryptology ePrint Archive, 2013:95, 2013.","journal-title":"Print Archive"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129782"},{"key":"e_1_3_2_1_35_1","series-title":"LNCS","first-page":"324","volume-title":"CRYPTO","author":"Kilian J.","unstructured":"J. Kilian . Improved effcient arguments (preliminary version). In D. Coppersmith, editor, CRYPTO , volume 963 of LNCS , pages 311{ 324 . Springer, 1995. J. Kilian. Improved effcient arguments (preliminary version). In D. Coppersmith, editor, CRYPTO, volume 963 of LNCS, pages 311{324. Springer, 1995."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"B.\n      Libert T.\n      Peters M.\n      Joye and \n      M.\n      Yung\n  . \n  Linearly homomorphic structure-preserving signatures and their applications\n  . In R. Canetti and J. A. Garay editors CRYPTO (2) volume \n  8043\n   of \n  LNCS pages \n  289\n  --\n  307\n  . \n  Springer 2013\n  .  B. Libert T. Peters M. Joye and M. Yung. Linearly homomorphic structure-preserving signatures and their applications. In R. Canetti and J. A. Garay editors CRYPTO (2) volume 8043 of LNCS pages 289--307. Springer 2013.","DOI":"10.1007\/978-3-642-40084-1_17"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_10"},{"key":"e_1_3_2_1_38_1","unstructured":"B. Lynn. Pbc library. http:\/\/crypto.stanford.edu\/pbc\/. Accessed:2014-05--14.  B. Lynn. Pbc library. http:\/\/crypto.stanford.edu\/pbc\/. Accessed:2014-05--14."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365746"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_13"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.47"},{"key":"e_1_3_2_1_42_1","first-page":"169","volume-title":"On data banks and privacy homomorphisms","author":"Rivest R.","year":"1978","unstructured":"R. Rivest , L. Adleman , and M. Dertouzos . On data banks and privacy homomorphisms . pages 169 -- 177 . Academic Press , 1978 . R. Rivest, L. Adleman, and M. Dertouzos. On data banks and privacy homomorphisms. pages 169--177. Academic Press, 1978."},{"key":"e_1_3_2_1_43_1","volume-title":"NDSS","author":"Setty S. T. V.","year":"2012","unstructured":"S. T. V. Setty , R. McPherson , A. J. Blumberg , and M. Walfish . Making argument systems for outsourced computation practical (sometimes) . In NDSS , 2012 . S. T. V. Setty, R. McPherson, A. J. Blumberg, and M. Walfish. Making argument systems for outsourced computation practical (sometimes). In NDSS, 2012."},{"key":"e_1_3_2_1_44_1","first-page":"253","volume-title":"USENIX Security Symposium","author":"Setty S. T. V.","year":"2012","unstructured":"S. T. V. Setty , V. Vu , N. Panpalia , B. Braun , A. J. Blumberg , and M. Walfish . Taking proof-based verified computation a few steps closer to practicality . In USENIX Security Symposium , pages 253 -- 268 , 2012 . S. T. V. Setty, V. Vu, N. Panpalia, B. Braun, A. J. Blumberg, and M. Walfish. Taking proof-based verified computation a few steps closer to practicality. In USENIX Security Symposium, pages 253--268, 2012."},{"key":"e_1_3_2_1_45_1","unstructured":"V. Shoup. Ntl library. http:\/\/www.shoup.net\/ntl\/. Accessed: 2014-05--14.  V. Shoup. Ntl library. http:\/\/www.shoup.net\/ntl\/. Accessed: 2014-05--14."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13013-7_25"},{"key":"e_1_3_2_1_47_1","first-page":"133","volume":"2011","author":"Smart N. P.","year":"2011","unstructured":"N. P. Smart and F. Vercauteren . Fully homomorphic simd operations. IACR Cryptology ePrint Archive , 2011 : 133 , 2011 . N. P. Smart and F. Vercauteren. Fully homomorphic simd operations. IACR Cryptology ePrint Archive, 2011:133, 2011.","journal-title":"Fully homomorphic simd operations. IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_48_1","series-title":"LNCS","first-page":"71","volume-title":"CRYPTO","author":"Thaler J.","year":"2013","unstructured":"J. Thaler . Time-optimal interactive proofs for circuit evaluation . In CRYPTO , volume 8043 of LNCS , pages 71 -- 89 . Springer , 2013 . J. Thaler. Time-optimal interactive proofs for circuit evaluation. In CRYPTO, volume 8043 of LNCS, pages 71--89. Springer, 2013."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.48"}],"event":{"name":"CCS'14: 2014 ACM SIGSAC Conference on Computer and Communications Security","location":"Scottsdale Arizona USA","acronym":"CCS'14","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2660267.2660366","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2660267.2660366","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:13:40Z","timestamp":1750227220000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2660267.2660366"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,3]]},"references-count":49,"alternative-id":["10.1145\/2660267.2660366","10.1145\/2660267"],"URL":"https:\/\/doi.org\/10.1145\/2660267.2660366","relation":{},"subject":[],"published":{"date-parts":[[2014,11,3]]},"assertion":[{"value":"2014-11-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}