{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:18:01Z","timestamp":1763468281255,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662490983"},{"type":"electronic","value":"9783662490990"}],"license":[{"start":{"date-parts":[[2015,12,24]],"date-time":"2015-12-24T00:00:00Z","timestamp":1450915200000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49099-0_12","type":"book-chapter","created":{"date-parts":[[2015,12,23]],"date-time":"2015-12-23T18:42:48Z","timestamp":1450896168000},"page":"319-351","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Rational Sumchecks"],"prefix":"10.1007","author":[{"given":"Siyao","family":"Guo","sequence":"first","affiliation":[]},{"given":"Pavel","family":"Hub\u00e1\u010dek","sequence":"additional","affiliation":[]},{"given":"Alon","family":"Rosen","sequence":"additional","affiliation":[]},{"given":"Margarita","family":"Vald","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,24]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/3-540-45022-X_39","volume-title":"Automata, Languages and Programming","author":"W Aiello","year":"2000","unstructured":"Aiello, W., Bhatt, S., Ostrovsky, R., Rajagopalan, S.R.: Fast verification of any remote procedure call: short witness-indistinguishable one-round proofs for NP. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 463\u2013474. Springer, Heidelberg (2000)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Azar, P.D., Micali, S.: Rational proofs. In: Karloff, H.J., Pitassi, T. (eds.) STOC, pp. 1017\u20131028. ACM (2012)","DOI":"10.1145\/2213977.2214069"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Azar, P.D., Micali, S.: Super-efficient rational proofs. In: Kearns, M., Preston McAfee, R., Tardos, \u00c9. (eds.) ACM Conference on Electronic Commerce, pp. 29\u201330. ACM (2013)","DOI":"10.1145\/2492002.2482561"},{"key":"12_CR4","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 ACM SIGCOMM 2008 Workshop on Economics of Networked Systems, NetEcon 2008, Seattle, WA, USA, 22 August 2008, pp. 85\u201390 (2008)","DOI":"10.1145\/1403027.1403046"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-642-36594-2_18","volume-title":"Theory of Cryptography","author":"N Bitansky","year":"2013","unstructured":"Bitansky, N., Chiesa, A., Ishai, Y., Ostrovsky, R., Paneth, O.: Succinct non-interactive arguments via linear interactive proofs. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 315\u2013333. Springer, Heidelberg (2013)"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/2641562","volume":"58","author":"AJ Blumberg","year":"2015","unstructured":"Blumberg, A.J., Walfish, M.: Verifying computations without reexecuting them. Commun. ACM 58(2), 74\u201384 (2015)","journal-title":"Commun. ACM"},{"issue":"1","key":"12_CR7","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":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-642-32928-9_16","volume-title":"Security and Cryptography for Networks","author":"R Canetti","year":"2012","unstructured":"Canetti, R., Vald, M.: Universally composable security with local adversaries. In: Visconti, I., De Prisco, R. (eds.) SCN 2012. LNCS, vol. 7485, pp. 281\u2013301. Springer, Heidelberg (2012)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Chen, J., McCauley, S., Singh, S.: Rational proofs with multiple provers. CoRR, abs\/1504.08361 (2015)","DOI":"10.1145\/2840728.2840744"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-28914-9_4","volume-title":"Theory of Cryptography","author":"I Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Faust, S., Hazay, C.: Secure two-party computation with low communication. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 54\u201374. Springer, Heidelberg (2012)"},{"key":"12_CR11","unstructured":"Dwork, C., Langberg, M., Naor, M., Nissim, K., Reingold, O.: Succinct NP proofs and spooky interactions (2004). www.openu.ac.il\/home\/mikel\/papers\/spooky.ps"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Garay, J.A., Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Rational protocol design: cryptography against incentive-driven adversaries. In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26\u201329 October 2013, Berkeley, CA, USA, pp. 648\u2013657. IEEE Computer Society (2013)","DOI":"10.1109\/FOCS.2013.75"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Gentry, C., Wichs, D.: Separating succinct non-interactive arguments from all falsifiable assumptions. In: Fortnow, L., Vadhan, S.P. (eds.) STOC, pp. 99\u2013108. ACM (2011)","DOI":"10.1145\/1993636.1993651"},{"issue":"4","key":"12_CR14","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"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Guo, S., Hub\u00e1\u010dek, P., Rosen, A., Vald, M.: Rational arguments: single round delegation with sublinear verification. In: Naor, M. (ed.) Innovations in Theoretical Computer Science, ITCS 2014, Princeton, NJ, USA, 12\u201314 January 2014, pp. 523\u2013540. ACM (2014)","DOI":"10.1145\/2554797.2554845"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Gur, T., Rothblum, R.D.: Non-interactive proofs of proximity. In: Roughgarden, T. (ed.) Innovations in Theoretical Computer Science, ITCS 2015, Rehovot, Israel, 11\u201313 January 2015, pp. 133\u2013142. ACM (2015)","DOI":"10.1145\/2688073.2688079"},{"key":"12_CR17","unstructured":"Kalai, Y.T., Raz, R., Rothblum, R.D.: Delegation for bounded space. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) Symposium on Theory of Computing Conference, STOC 2013, Palo Alto, CA, USA, 1\u20134 June 2013, pp. 565\u2013574. ACM (2013)"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Kalai, Y.T., Raz, R., Rothblum, R.D.: How to delegate computations: the power of no-signaling proofs. In: Shmoys, D.B. (ed.) Symposium on Theory of Computing, STOC 2014, New York, NY, USA, 31 May\u201303 June 2014, pp. 485\u2013494. ACM (2014)","DOI":"10.1145\/2591796.2591809"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-662-48000-7_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"YT Kalai","year":"2015","unstructured":"Kalai, Y.T., Rothblum, R.D.: Arguments of proximity. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 422\u2013442. Springer, Heidelberg (2015)"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: Rao Kosaraju, S., Fellows, M., Wigderson, A., Ellis, J.A. (eds.) STOC, pp. 723\u2013732. ACM (1992)","DOI":"10.1145\/129712.129782"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Kumaresan, R., Bentov, I.: How to use bitcoin to incentivize correct computations. In: Ahn, G.-J., Yung, M., Li, N. (eds.) Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, Scottsdale, AZ, USA, 3\u20137 November 2014, pp. 30\u201341. ACM (2014)","DOI":"10.1145\/2660267.2660380"},{"issue":"4","key":"12_CR22","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.J., Nisan, N.: Algebraic methods for interactive proof systems. J. ACM 39(4), 859\u2013868 (1992)","journal-title":"J. ACM"},{"issue":"4","key":"12_CR23","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539795284959","volume":"30","author":"S Micali","year":"2000","unstructured":"Micali, S.: Computationally sound proofs. SIAM J. Comput. 30(4), 1253\u20131298 (2000)","journal-title":"SIAM J. Comput."},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-540-45146-4_6","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"M Naor","year":"2003","unstructured":"Naor, M.: On cryptographic assumptions and challenges. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 96\u2013109. Springer, Heidelberg (2003)"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/978-3-319-12601-2_5","volume-title":"Decision and Game Theory for Security","author":"V Pham","year":"2014","unstructured":"Pham, V., Khouzani, M.H.R., Cid, C.: Optimal contracts for outsourced computation. In: Poovendran, R., Saad, W. (eds.) GameSec 2014. LNCS, vol. 8840, pp. 79\u201398. Springer, Heidelberg (2014)"},{"key":"12_CR26","unstructured":"Rothblum, G.N.: Delegating computation reliably: paradigms and constructions. Ph.D. thesis, Massachusetts Institute of Technology (2009)"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Rothblum, G.N., Vadhan, S.P., Wigderson, A.: Interactive proofs of proximity: delegating computation in sublinear time. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) Symposium on Theory of Computing Conference, STOC 2013, Palo Alto, CA, USA, 1\u20134 June 2013, pp. 793\u2013802. ACM (2013)","DOI":"10.1145\/2488608.2488709"},{"issue":"4","key":"12_CR28","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 39(4), 869\u2013877 (1992)","journal-title":"J. ACM"},{"key":"12_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/978-3-319-13257-0_10","volume-title":"Information Security","author":"Y Zhang","year":"2014","unstructured":"Zhang, Y., Blanton, M.: Efficient secure and verifiable outsourcing of matrix multiplications. In: Chow, S.S.M., Camenisch, J., Hui, L.C.K., Yiu, S.M. (eds.) ISC 2014. LNCS, vol. 8783, pp. 158\u2013178. Springer, Heidelberg (2014)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49099-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T08:16:09Z","timestamp":1692173769000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49099-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,24]]},"ISBN":["9783662490983","9783662490990"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49099-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015,12,24]]},"assertion":[{"value":"24 December 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}