{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T15:57:52Z","timestamp":1783007872705,"version":"3.54.5"},"reference-count":38,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:00:00Z","timestamp":1367366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,5,1]],"date-time":"2017-05-01T00:00:00Z","timestamp":1493596800000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1016\/j.ic.2013.03.003","type":"journal-article","created":{"date-parts":[[2013,3,7]],"date-time":"2013-03-07T21:21:55Z","timestamp":1362691315000},"page":"16-36","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":25,"special_numbering":"C","title":["Refereed delegation of computation"],"prefix":"10.1016","volume":"226","author":[{"given":"Ran","family":"Canetti","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ben","family":"Riva","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guy N.","family":"Rothblum","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ic.2013.03.003_br0050","series-title":"Proceedings of the 37th International Colloquium Conference on Automata, Languages and Programming","first-page":"152","article-title":"From secrecy to soundness: efficient verification via secure computation","author":"Applebaum","year":"2010"},{"key":"10.1016\/j.ic.2013.03.003_br0060","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","article-title":"Probabilistic checking of proofs: a new characterization of NP","volume":"45","author":"Arora","year":"1998","journal-title":"J. ACM"},{"key":"10.1016\/j.ic.2013.03.003_br0070","series-title":"Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing","first-page":"21","article-title":"Checking computations in polylogarithmic time","author":"Babai","year":"1991"},{"key":"10.1016\/j.ic.2013.03.003_br0080","doi-asserted-by":"publisher","first-page":"1661","DOI":"10.1137\/070709244","article-title":"Universal arguments and their applications","volume":"38","author":"Barak","year":"2008","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.ic.2013.03.003_br0090","series-title":"Proceedings of the 38th Annual Symposium on Foundations of Computer Science","first-page":"374","article-title":"Does parallel repetition lower the error in computationally sound protocols?","author":"Bellare","year":"1997"},{"key":"10.1016\/j.ic.2013.03.003_br0100","series-title":"Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing","first-page":"113","article-title":"Multi-prover interactive proofs: how to remove intractability assumptions","author":"Ben-Or","year":"1988"},{"key":"10.1016\/j.ic.2013.03.003_br0110","series-title":"Proceedings of the 31st Annual Conference on Advances in Cryptology","first-page":"111","article-title":"Verifiable delegation of computation over large datasets","author":"Benabbas","year":"2011"},{"key":"10.1016\/j.ic.2013.03.003_br0120","series-title":"Proceedings of the 3rd Innovations in Theoretical Computer Science Conference","first-page":"326","article-title":"From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again","author":"Bitansky","year":"2012"},{"key":"10.1016\/j.ic.2013.03.003_br0010","author":"BOINC"},{"key":"10.1016\/j.ic.2013.03.003_br0130","series-title":"Proceedings of the Second Theory of Cryptography Conference","first-page":"17","article-title":"Hardness amplification of weakly verifiable puzzles","author":"Canetti","year":"2005"},{"key":"10.1016\/j.ic.2013.03.003_br0140","series-title":"Proceedings of the 18th ACM Conference on Computer and Communications Security","first-page":"445","article-title":"Practical delegation of computation using multiple servers","author":"Canetti","year":"2011"},{"key":"10.1016\/j.ic.2013.03.003_br0150","author":"Canetti"},{"key":"10.1016\/j.ic.2013.03.003_br0160","author":"Canetti"},{"key":"10.1016\/j.ic.2013.03.003_br0170","series-title":"Proceedings of the 6th International Conference on Information Theoretic Security","first-page":"37","article-title":"Two protocols for delegation of computation","author":"Canetti","year":"2012"},{"key":"10.1016\/j.ic.2013.03.003_br0180","series-title":"Proceedings of the 30th Annual Conference on Advances in Cryptology","first-page":"483","article-title":"Improved delegation of computation using fully homomorphic encryption","author":"Chung","year":"2010"},{"key":"10.1016\/j.ic.2013.03.003_br0190","series-title":"Proceedings of the 31st Annual Conference on Advances in Cryptology","first-page":"151","article-title":"Memory delegation","author":"Chung","year":"2011"},{"key":"10.1016\/j.ic.2013.03.003_br0200","series-title":"Proceedings of the 3rd Innovations in Theoretical Computer Science Conference","first-page":"90","article-title":"Practical verified computation with streaming interactive proofs","author":"Cormode","year":"2012"},{"key":"10.1016\/j.ic.2013.03.003_br0210","series-title":"Proceedings of the 4th Conference on Computability in Europe: Logic and Theory of Algorithms","first-page":"175","article-title":"Succinct NP proofs from an extractability assumption","author":"Crescenzo","year":"2008"},{"key":"10.1016\/j.ic.2013.03.003_br0220","series-title":"Proceedings of the 9th Theory of Cryptography Conference","first-page":"54","article-title":"Secure two-party computation with low communication","author":"Damg\u00e5rd","year":"2012"},{"key":"10.1016\/j.ic.2013.03.003_br0230","series-title":"Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing","first-page":"506","article-title":"Making games short (extended abstract)","author":"Feige","year":"1997"},{"key":"10.1016\/j.ic.2013.03.003_br0240","series-title":"Proceedings of the 30th Annual Conference on Advances in Cryptology","first-page":"465","article-title":"Non-interactive verifiable computing: outsourcing computation to untrusted workers","author":"Gennaro","year":"2010"},{"key":"10.1016\/j.ic.2013.03.003_br0250","series-title":"Proceedings of the 40th Annual ACM Symposium on Theory of Computing","first-page":"113","article-title":"Delegating computation: interactive proofs for muggles","author":"Goldwasser","year":"2008"},{"key":"10.1016\/j.ic.2013.03.003_br0260","series-title":"Delegation of computation without rejection problem from designated verifier cs-proofs","author":"Goldwasser","year":"2011"},{"key":"10.1016\/j.ic.2013.03.003_br0270","series-title":"Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer\u02bcs Track at RSA","first-page":"425","article-title":"Uncheatable distributed computations","author":"Golle","year":"2001"},{"key":"10.1016\/j.ic.2013.03.003_br0280","series-title":"Advances in Cryptology \u2013 ASIACRYPT 2010 \u2013 16th International Conference on the Theory and Application of Cryptology and Information Security","first-page":"321","article-title":"Short pairing-based non-interactive zero-knowledge arguments","author":"Groth","year":"2010"},{"key":"10.1016\/j.ic.2013.03.003_br0290","series-title":"Proceedings of the 21st ACM Symposium on Operating Systems Principles","first-page":"175","article-title":"PeerReview: Practical accountability for distributed systems","author":"Haeberlen","year":"2007"},{"key":"10.1016\/j.ic.2013.03.003_br0300","series-title":"Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology","first-page":"143","article-title":"Probabilistically checkable arguments","author":"Kalai","year":"2009"},{"key":"10.1016\/j.ic.2013.03.003_br0310","series-title":"Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing","first-page":"723","article-title":"A note on efficient zero-knowledge proofs and arguments (extended abstract)","author":"Kilian","year":"1992"},{"key":"10.1016\/j.ic.2013.03.003_br0320","series-title":"Competing provers protocols for circuit evaluation","author":"Kol","year":"2011"},{"key":"10.1016\/j.ic.2013.03.003_br0330","doi-asserted-by":"crossref","unstructured":"M. Laurenzano, M.M. Tikir, L. Carrington, A. Snavely, PEBIL: Efficient static binary instrumentation for linux, in: ISPASS, pp. 175\u2013183.","DOI":"10.1109\/ISPASS.2010.5452024"},{"key":"10.1016\/j.ic.2013.03.003_br0340","series-title":"Proceedings of the 2005 ACM SIGPLAN Conference on Programming Language Design and Implementation","first-page":"190","article-title":"Pin: building customized program analysis tools with dynamic instrumentation","author":"Luk","year":"2005"},{"key":"10.1016\/j.ic.2013.03.003_br0350","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1145\/146585.146605","article-title":"Algebraic methods for interactive proof systems","volume":"39","author":"Lund","year":"1992","journal-title":"J. ACM"},{"key":"10.1016\/j.ic.2013.03.003_br0360","series-title":"Proceedings of the 3rd ACM SIGOPS\/EuroSys European Conference on Computer Systems 2008","first-page":"315","article-title":"Flicker: an execution infrastructure for tcb minimization","author":"McCune","year":"2008"},{"key":"10.1016\/j.ic.2013.03.003_br0370","series-title":"A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology","first-page":"369","article-title":"A digital signature based on a conventional encryption function","author":"Merkle","year":"1988"},{"key":"10.1016\/j.ic.2013.03.003_br0380","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539795284959","article-title":"Computationally sound proofs","volume":"30","author":"Micali","year":"2000","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.ic.2013.03.003_br0390","series-title":"Proceedings of the 1999 ISOC Network and Distributed System Security Symposium","first-page":"103","article-title":"Distributed execution with remote audit","author":"Monrose","year":"1999"},{"key":"10.1016\/j.ic.2013.03.003_br0400","series-title":"Delegating computation reliably: paradigms and constructions","author":"Rothblum","year":"2009"},{"key":"10.1016\/j.ic.2013.03.003_br0410","series-title":"Proceedings of the 2005 IEEE Symposium on Security and Privacy","first-page":"154","article-title":"A fine-grained attestation service for secure distributed systems","author":"Shi","year":"2005"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540113000217?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540113000217?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T23:31:22Z","timestamp":1745969482000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540113000217"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":38,"alternative-id":["S0890540113000217"],"URL":"https:\/\/doi.org\/10.1016\/j.ic.2013.03.003","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2013,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Refereed delegation of computation","name":"articletitle","label":"Article Title"},{"value":"Information and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ic.2013.03.003","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}