{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:03:16Z","timestamp":1743116596638,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030353889"},{"type":"electronic","value":"9783030353896"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-35389-6_19","type":"book-chapter","created":{"date-parts":[[2019,11,21]],"date-time":"2019-11-21T01:06:49Z","timestamp":1574298409000},"page":"256-270","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Outsourcing Computation: The Minimal Refereed Mechanism"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5901-3004","authenticated-orcid":false,"given":"Yuqing","family":"Kong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0419-7501","authenticated-orcid":false,"given":"Chris","family":"Peikert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6878-0670","authenticated-orcid":false,"given":"Grant","family":"Schoenebeck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4098-844X","authenticated-orcid":false,"given":"Biaoshuai","family":"Tao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,3]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Azar, P.D., Micali, S.: Rational proofs. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, pp. 1017\u20131028. ACM (2012)","DOI":"10.1145\/2213977.2214069"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Azar, P.D., Micali, S.: Super-efficient rational proofs. In: Proceedings of the Fourteenth ACM Conference on Electronic Commerce, pp. 29\u201330. ACM (2013)","DOI":"10.1145\/2492002.2482561"},{"issue":"2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/0022-0000(88)90028-1","volume":"36","author":"L Babai","year":"1988","unstructured":"Babai, L., Moran, S.: Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes. J. Comput. Syst. Sci. 36(2), 254\u2013276 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR4","doi-asserted-by":"publisher","unstructured":"Badrinarayanan, S., Kalai, Y.T., Khurana, D., Sahai, A., Wichs, D.: Succinct delegation for low-space non-deterministic computation. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, pp. 709\u2013721. ACM, New York (2018). \nhttps:\/\/doi.org\/10.1145\/3188745.3188924","DOI":"10.1145\/3188745.3188924"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Belenkiy, M., Chase, M., Erway, C.C., Jannotti, J., K\u00fcp\u00e7\u00fc, A., Lysyanskaya, A.: Incentivizing outsourced computation. In: Proceedings of the 3rd International Workshop on Economics of Networked Systems, pp. 85\u201390. ACM (2008)","DOI":"10.1145\/1403027.1403046"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 62\u201373. ACM (1993)","DOI":"10.1145\/168588.168596"},{"key":"19_CR7","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: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp. 326\u2013349. ACM (2012)","DOI":"10.1145\/2090236.2090263"},{"issue":"1","key":"19_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1175\/1520-0493(1950)078<0001:VOFEIT>2.0.CO;2","volume":"78","author":"GW Brier","year":"1950","unstructured":"Brier, G.W.: Verification of forecasts expressed in terms of probability. Mon. Weather Rev. 78(1), 1\u20133 (1950)","journal-title":"Mon. Weather Rev."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Canetti, R., Riva, B., Rothblum, G.N.: Practical delegation of computation using multiple servers. In: Proceedings of the 18th ACM Conference on Computer and Communications Security, pp. 445\u2013454. ACM (2011)","DOI":"10.1145\/2046707.2046759"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.ic.2013.03.003","volume":"226","author":"R Canetti","year":"2013","unstructured":"Canetti, R., Riva, B., Rothblum, G.N.: Refereed delegation of computation. Inf. Comput. 226, 16\u201336 (2013)","journal-title":"Inf. Comput."},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Dong, C., Wang, Y., Aldweesh, A., McCorry, P., van Moorsel, A.: Betrayal, distrust, and rationality: smart counter-collusion contracts for verifiable cloud computing. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 211\u2013227. ACM (2017)","DOI":"10.1145\/3133956.3134032"},{"key":"19_CR12","unstructured":"Feige, U., Kilian, J.: Making games short. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 506\u2013516. ACM (1997)"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-14623-7_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"R Gennaro","year":"2010","unstructured":"Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: outsourcing computation to untrusted workers. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 465\u2013482. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-14623-7_25"},{"issue":"477","key":"19_CR14","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1198\/016214506000001437","volume":"102","author":"T Gneiting","year":"2007","unstructured":"Gneiting, T., Raftery, A.E.: Strictly proper scoring rules, prediction, and estimation. J. Am. Stat. Assoc. 102(477), 359\u2013378 (2007)","journal-title":"J. Am. Stat. Assoc."},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pp. 113\u2013122. ACM (2008)","DOI":"10.1145\/1374376.1374396"},{"issue":"4","key":"19_CR16","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/2699436","volume":"62","author":"S Goldwasser","year":"2015","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. J. ACM 62(4), 27 (2015)","journal-title":"J. ACM"},{"issue":"1","key":"19_CR17","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Guo, S., Hub\u00e1\u010dek, P., Rosen, A., Vald, M.: Rational arguments: single round delegation with sublinear verification. In: Proceedings of the 5th Conference on Innovations in Theoretical Computer Science, pp. 523\u2013540. ACM (2014)","DOI":"10.1145\/2554797.2554845"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-662-49099-0_12","volume-title":"Theory of Cryptography","author":"S Guo","year":"2016","unstructured":"Guo, S., Hub\u00e1\u010dek, P., Rosen, A., Vald, M.: Rational sumchecks. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9563, pp. 319\u2013351. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-49099-0_12"},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.jet.2014.04.007","volume":"156","author":"JY Halpern","year":"2015","unstructured":"Halpern, J.Y., Pass, R.: Algorithmic rationality: game theory with costly computation. J. Econ. Theor. 156, 246\u2013268 (2015)","journal-title":"J. Econ. Theor."},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Halpern, J.Y., Pass, R., Seeman, L.: Computational extensive-form games. In: Proceedings of the 2016 ACM Conference on Economics and Computation, pp. 681\u2013698. ACM (2016)","DOI":"10.1145\/2940716.2940733"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Kalai, Y.T., P.O., Yang, L.: How to delegate computations publicly. In: STOC 2019: Proceedings of the 51th Annual ACM SIGACT Symposium on Theory of Computing. ACM (2019)","DOI":"10.1145\/3313276.3316411"},{"key":"19_CR23","volume-title":"Introduction to Modern Cryptography","author":"Y Lindell","year":"2014","unstructured":"Lindell, Y., Katz, J.: Introduction to Modern Cryptography. Chapman and Hall\/CRC, Boca Raton (2014)"},{"issue":"4","key":"19_CR24","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1145\/146585.146605","volume":"39","author":"C Lund","year":"1992","unstructured":"Lund, C., Fortnow, L., Karloff, H., Nisan, N.: Algebraic methods for interactive proof systems. J. ACM (JACM) 39(4), 859\u2013868 (1992)","journal-title":"J. ACM (JACM)"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Reingold, O., Rothblum, G.N., Rothblum, R.D.: Constant-round interactive proofs for delegating computation. In: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, pp. 49\u201362. ACM (2016)","DOI":"10.1145\/2897518.2897652"},{"issue":"4","key":"19_CR26","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1145\/146585.146609","volume":"39","author":"A Shamir","year":"1992","unstructured":"Shamir, A.: IP = PSPACE. J. ACM (JACM) 39(4), 869\u2013877 (1992)","journal-title":"J. ACM (JACM)"},{"key":"19_CR27","unstructured":"Teutsch, J., Reitwie\u00dfner, C.: A scalable verification solution for blockchains. \nhttps:\/\/people.cs.uchicago.edu\/teutsch\/papers\/truebit pdf\n\n (2017)"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35389-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T19:05:08Z","timestamp":1575313508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-35389-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030353889","9783030353896"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35389-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New York City, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wine2019.cs.columbia.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}