{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T23:22:26Z","timestamp":1725837746213},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319255934"},{"type":"electronic","value":"9783319255941"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-25594-1_15","type":"book-chapter","created":{"date-parts":[[2015,11,10]],"date-time":"2015-11-10T21:03:13Z","timestamp":1447189393000},"page":"270-288","source":"Crossref","is-referenced-by-count":9,"title":["Sequentially Composable Rational Proofs"],"prefix":"10.1007","author":[{"given":"Matteo","family":"Campanelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rosario","family":"Gennaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Azar, P.D., Micali, S.: Rational proofs. In: 2012 ACM Symposium on Theory of Computing, pp. 1017\u20131028 (2012)","DOI":"10.1145\/2213977.2214069"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Azar, P.D., Micali, S.: Super-efficient rational proofs. In: 2013 ACM Conference on Electronic Commerce, pp. 29\u201330 (2013)","DOI":"10.1145\/2492002.2482561"},{"key":"15_CR3","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: NetEcon 2008, pp. 85\u201390 (2008)","DOI":"10.1145\/1403027.1403046"},{"key":"15_CR4","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms. MIT Press (2001)"},{"issue":"6","key":"15_CR5","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1145\/1039488.1039489","volume":"51","author":"C Dwork","year":"2004","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. J. ACM 51(6), 851\u2013898 (2004)","journal-title":"J. ACM"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Guo, S., Hubacek, P., Rosen, A., Vald, M.: Rational arguments: single round delegation with sublinear verification. In: 2014 Innovations in Theoretical Computer Science Conference (2014)","DOI":"10.1145\/2554797.2554845"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. In: Proceedings of the seventeenth Annual ACM Symposium on Theory of computing. ACM (1985)","DOI":"10.1145\/22145.22178"},{"issue":"2","key":"15_CR8","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/2641562","volume":"58","author":"M Walfish","year":"2015","unstructured":"Walfish, M., Blumberg, A.J.: Verifying computations without reexecuting them. Commun. ACM 58(2), 74\u201384 (2015)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Decision and Game Theory for Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25594-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T10:07:13Z","timestamp":1559297233000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25594-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319255934","9783319255941"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25594-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}