{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T16:03:26Z","timestamp":1757779406373},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2015,5,29]],"date-time":"2015-05-29T00:00:00Z","timestamp":1432857600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10623-015-0092-4","type":"journal-article","created":{"date-parts":[[2015,5,27]],"date-time":"2015-05-27T23:51:38Z","timestamp":1432770698000},"page":"563-585","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Batch verifiable computation of outsourced functions"],"prefix":"10.1007","volume":"77","author":[{"given":"Liang Feng","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Reihaneh","family":"Safavi-Naini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,29]]},"reference":[{"key":"92_CR1","doi-asserted-by":"crossref","unstructured":"Applebaum B., Ishai Y., Kushilevitz E.: From secrecy to soundness: efficient verification via secure computation. ICALP 1, 152\u2013163 (2010).","DOI":"10.1007\/978-3-642-14165-2_14"},{"key":"92_CR2","doi-asserted-by":"crossref","unstructured":"Backes M., Fiore D., Reischuk R.M.: Verifiable delegation of computation on outsourced data. In: 2013 ACM SIGSAC Conference on Computer and Communications Security, CCS\u201913, Berlin, Germany, November 4\u20138, 2013, pp. 863\u2013874 (2013).","DOI":"10.1145\/2508859.2516681"},{"key":"92_CR3","doi-asserted-by":"crossref","unstructured":"Benabbas S., Gennaro R., Vahlis Y.: Verifiable delegation of computation over large datasets. In: CRYPTO, pp. 111\u2013131 (2011).","DOI":"10.1007\/978-3-642-22792-9_7"},{"key":"92_CR4","doi-asserted-by":"crossref","unstructured":"Bitansky N., Canetti R., Chiesa A., Tromer E.: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In: ITCS, pp. 326\u2013349 (2012).","DOI":"10.1145\/2090236.2090263"},{"key":"92_CR5","doi-asserted-by":"crossref","unstructured":"Boneh D., Freeman D.M.: Homomorphic signatures for polynomial functions. In: EUROCRYPT, pp. 149\u2013168 (2011).","DOI":"10.1007\/978-3-642-20465-4_10"},{"key":"92_CR6","unstructured":"Boyen X., Fan X., Shi E.: Adaptively secure fully homomorphic signatures based on lattices. IACR Cryptol. ePrint Archive 2014, 916 (2014)."},{"key":"92_CR7","doi-asserted-by":"crossref","unstructured":"Catalano D., Fiore D., Warinschi B.: Homomorphic signatures with efficient verification for polynomial functions. In: Advances in Cryptology\u2014CRYPTO 2014\u201434th Annual Cryptology Conference, Santa Barbara, CA, Proceedings of August 17\u201321, 2014, Part I, pp. 371\u2013389 (2014).","DOI":"10.1007\/978-3-662-44371-2_21"},{"key":"92_CR8","doi-asserted-by":"crossref","unstructured":"Chung K.-M., Kalai Y.T., Vadhan S.P.: Improved delegation of computation using fully homomorphic encryption. In: CRYPTO, pp. 483\u2013501 (2010).","DOI":"10.1007\/978-3-642-14623-7_26"},{"key":"92_CR9","doi-asserted-by":"crossref","unstructured":"Chung K.-M., Kalai Y.T., Liu F.-H., Raz R.: Memory delegation. In: CRYPTO, pp. 151\u2013168 (2011).","DOI":"10.1007\/978-3-642-22792-9_9"},{"key":"92_CR10","doi-asserted-by":"crossref","unstructured":"Fiore D., Gennaro R.: Publicly verifiable delegation of large polynomials and matrix computations, with applications. In: CCS, pp. 501\u2013512 (2012).","DOI":"10.1145\/2382196.2382250"},{"key":"92_CR11","doi-asserted-by":"crossref","unstructured":"Gennaro R., Wichs D.: Fully homomorphic message authenticators. ASIACRYPT 2, 301\u2013320 (2013).","DOI":"10.1007\/978-3-642-42045-0_16"},{"key":"92_CR12","doi-asserted-by":"crossref","unstructured":"Gennaro R., Gentry C., Parno B.: Non-interactive verifiable computing: outsourcing computation to untrusted workers. In: CRYPTO, pp. 465\u2013482 (2010).","DOI":"10.1007\/978-3-642-14623-7_25"},{"key":"92_CR13","doi-asserted-by":"crossref","unstructured":"Gennaro R., Gentry C., Parno B., Raykova M.: Quadratic span programs and succinct nizks without pcps. In: EUROCRYPT, pp. 626\u2013645 (2013).","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"92_CR14","doi-asserted-by":"crossref","unstructured":"Gentry C., Wichs D.: Separating succinct non-interactive arguments from all falsifiable assumptions. In: STOC, pp. 99\u2013108 (2011).","DOI":"10.1145\/1993636.1993651"},{"key":"92_CR15","doi-asserted-by":"crossref","unstructured":"Goldwasser S., Kalai Y.T., Rothblum G.N.: Delegating computation: interactive proofs for muggles. In: STOC, pp. 113\u2013122 (2008).","DOI":"10.1145\/1374376.1374396"},{"key":"92_CR16","doi-asserted-by":"crossref","unstructured":"Gorbunov S., Vaikuntanathan V., Wichs D.: Leveled fully homomorphic signatures from standard lattices. IACR Cryptol. ePrint Archive 2014, 897 (2014).","DOI":"10.1145\/2746539.2746576"},{"key":"92_CR17","doi-asserted-by":"crossref","unstructured":"Naor M., Reingold O.: Number-theoretic constructions of efficient pseudo-random functions. J. ACM 51(2), 231\u2013262 (2004).","DOI":"10.1145\/972639.972643"},{"key":"92_CR18","doi-asserted-by":"crossref","unstructured":"Papamanthou C., Shi E., Tamassia R.: Signatures of correct computation. In: TCC, pp. 222\u2013242 (2013).","DOI":"10.1007\/978-3-642-36594-2_13"},{"key":"92_CR19","doi-asserted-by":"crossref","unstructured":"Parno B., Raykova M., Vaikuntanathan V.: How to delegate and verify in public: verifiable computation from attribute-based encryption. In: TCC, pp. 422\u2013439 (2012).","DOI":"10.1007\/978-3-642-28914-9_24"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0092-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-015-0092-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0092-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,25]],"date-time":"2019-08-25T13:47:38Z","timestamp":1566740858000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-015-0092-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,29]]},"references-count":19,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["92"],"URL":"https:\/\/doi.org\/10.1007\/s10623-015-0092-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,29]]}}}