{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T23:22:58Z","timestamp":1777591378780,"version":"3.51.4"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030437244","type":"print"},{"value":"9783030437251","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-43725-1_5","type":"book-chapter","created":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T19:04:35Z","timestamp":1584039875000},"page":"50-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Game-Theoretic Analysis of an Incentivized Verifiable Computation System"],"prefix":"10.1007","author":[{"given":"Mahmudun","family":"Nabi","sequence":"first","affiliation":[]},{"given":"Sepideh","family":"Avizheh","sequence":"additional","affiliation":[]},{"given":"Muni Venkateswarlu","family":"Kumaramangalam","sequence":"additional","affiliation":[]},{"given":"Reihaneh","family":"Safavi-Naini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,13]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, L.: Secure multiparty computations on bitcoin. In: IEEE Symposium on Security and Privacy, pp. 443\u2013458 (2014)","DOI":"10.1109\/SP.2014.35"},{"key":"5_CR2","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 International workshop on Economics of networked systems, pp. 85\u201390. ACM (2008)","DOI":"10.1145\/1403027.1403046"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Dong, C., Wang, Y., Aldweesh, A., McCorry, P., van Moorsel, A.: Betrayal, distrust, and rationality. In: Proceedings of ACM SIGSAC Conference on Computer and Communications Security, pp. 211\u2013227 (2017)","DOI":"10.1145\/3133956.3134032"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Eberhardt, J., Tai, S.: ZoKrates-scalable privacy-preserving off-chain computations. In: IEEE International Conference on Blockchain (2018)","DOI":"10.1109\/Cybermatics_2018.2018.00199"},{"key":"5_CR5","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"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-662-58820-8_19","volume-title":"Financial Cryptography and Data Security","author":"D Harz","year":"2019","unstructured":"Harz, D., Boman, M.: The scalability of trustless trust. In: Zohar, A., et al. (eds.) FC 2018. LNCS, vol. 10958, pp. 279\u2013293. Springer, Heidelberg (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-662-58820-8_19"},{"key":"5_CR7","unstructured":"Khouzani, M., Pham, V., Cid, C.: Incentive engineering for outsourced computation in the face of collusion. In: Proceedings of WEIS (2014)"},{"key":"5_CR8","unstructured":"Koch, J., Reitwiessner, C.: A predictable incentive mechanism for TrueBit. arXiv preprint \narXiv:1806.11476\n\n (2018)"},{"issue":"6","key":"5_CR9","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1109\/TDSC.2015.2499738","volume":"14","author":"A K\u00fcp\u00e7\u00fc","year":"2017","unstructured":"K\u00fcp\u00e7\u00fc, A.: Incentivized outsourced computation resistant to malicious contractors. IEEE Trans. Dependable Secure Comput. 14(6), 633\u2013649 (2017)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-642-28914-9_24","volume-title":"Theory of Cryptography","author":"B Parno","year":"2012","unstructured":"Parno, B., Raykova, M., Vaikuntanathan, V.: How to delegate and verify in public: verifiable computation from attribute-based encryption. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 422\u2013439. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-28914-9_24"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-319-93638-3_8","volume-title":"Information Security and Privacy","author":"S Paul","year":"2018","unstructured":"Paul, S., Shrivastava, A.: Robust multiparty computation with faster verification time. In: Susilo, W., Yang, G. (eds.) ACISP 2018. LNCS, vol. 10946, pp. 114\u2013131. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-93638-3_8"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-12601-2_5"},{"key":"5_CR13","unstructured":"Setty, S.T., McPherson, R., Blumberg, A.J., Walfish, M.: Making argument systems for outsourced computation practical (sometimes). In: NDSS, vol. 1, p. 17 (2012)"},{"key":"5_CR14","unstructured":"Teutsch, J., Reitwie\u00dfner, C.: A scalable verification solution for blockchains (2017). \nhttps:\/\/people.cs.uchicago.edu\/teutsch\/papers\/truebitpdf"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43725-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,13]],"date-time":"2020-03-13T06:43:03Z","timestamp":1584081783000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43725-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030437244","9783030437251"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43725-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"13 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Financial Cryptography and Data Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. Kitts","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Saint Kitts and Nevis","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":"18 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 February 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc19.ifca.ai\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"178","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,08","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7,6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}