{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T11:57:35Z","timestamp":1726055855213},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030324292"},{"type":"electronic","value":"9783030324308"}],"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-32430-8_4","type":"book-chapter","created":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T11:11:01Z","timestamp":1572001861000},"page":"45-64","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["When Is a Semi-honest Secure Multiparty Computation Valuable?"],"prefix":"10.1007","author":[{"given":"Radhika","family":"Bhargava","sequence":"first","affiliation":[]},{"given":"Chris","family":"Clifton","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,23]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D., Gonen, R., Halpern, J.: Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, pp. 53\u201362. ACM (2006)","DOI":"10.1145\/1146381.1146393"},{"issue":"2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.ejor.2014.07.007","volume":"240","author":"A Arya","year":"2015","unstructured":"Arya, A., L\u00f6ffler, C., Mittendorf, B., Pfeiffer, T.: The middleman as a panacea for supply chain coordination problems. Eur. J. Oper. Res. 240(2), 393\u2013400 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR3","unstructured":"Atallah, M.J., Elmongui, H.G., Deshpande, V., Schwarz, L.B.: Secure supply-chain protocols. In: IEEE International Conference on E-Commerce, CEC 2003, pp. 293\u2013302. IEEE (2003)"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Gonen, R., Nisan, N.: Incentive compatible multi unit combinatorial auctions. In: Proceedings of the 9th Conference on Theoretical Aspects of Rationality and Knowledge, pp. 72\u201387. ACM (2003)","DOI":"10.1145\/846247.846250"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-03549-4_20","volume-title":"Financial Cryptography and Data Security","author":"P Bogetoft","year":"2009","unstructured":"Bogetoft, P., et al.: Secure multiparty computation goes live. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol. 5628, pp. 325\u2013343. Springer, Heidelberg (2009). \n                    https:\/\/doi.org\/10.1007\/978-3-642-03549-4_20"},{"key":"4_CR6","unstructured":"Brandt, F.: Secure and private auctions without auctioneers. Technical Report FKI-245-02. Institut fur Informatick, Technishce Universitat Munchen (2002)"},{"key":"4_CR7","series-title":"International Series in Operations Research and Management Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-1-4020-7953-5_2","volume-title":"Handbook of Quantitative Supply Chain Analysis","author":"GP Cachon","year":"2004","unstructured":"Cachon, G.P., Netessine, S.: Game theory in supply chain analysis. In: Simchi-Levi, D., Wu, S.D., Shen, Z.J. (eds.) Handbook of Quantitative Supply Chain Analysis. ISOR, vol. 74, pp. 13\u201365. Springer, Boston (2004). \n                    https:\/\/doi.org\/10.1007\/978-1-4020-7953-5_2"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pp. 136\u2013145. IEEE (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: Conference Proceedings of the Annual ACM Symposium on Theory of Computing (2003). \n                    https:\/\/doi.org\/10.1145\/509907.509980","DOI":"10.1145\/509907.509980"},{"key":"4_CR10","unstructured":"Cho, R., Clifton, C., Ilyer, A.V., Jiang, W., Kantarioglu, M.: An approach to identifying beneficial collaboration securely in decentralized logistics systems (2003)"},{"issue":"2","key":"4_CR11","doi-asserted-by":"publisher","first-page":"185","DOI":"10.2307\/2297045","volume":"46","author":"P Dasgupta","year":"1979","unstructured":"Dasgupta, P., Hammond, P., Maskin, E.: The implementation of social choice rules: some general results on incentive compatibility. Rev. Econ. Stud. 46(2), 185\u2013216 (1979)","journal-title":"Rev. Econ. Stud."},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-44598-6_7","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"Y Dodis","year":"2000","unstructured":"Dodis, Y., Halevi, S., Rabin, T.: A cryptographic solution to a game theoretic problem. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 112\u2013130. Springer, Heidelberg (2000). \n                    https:\/\/doi.org\/10.1007\/3-540-44598-6_7"},{"issue":"2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U Feige","year":"1988","unstructured":"Feige, U., Fiat, A., Shamir, A.: Zero-knowledge proofs of identity. J. Cryptol. 1(2), 77\u201394 (1988)","journal-title":"J. Cryptol."},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/11832072_16","volume-title":"Security and Cryptography for Networks","author":"SD Gordon","year":"2006","unstructured":"Gordon, S.D., Katz, J.: Rational secret sharing, revisited. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol. 4116, pp. 229\u2013241. Springer, Heidelberg (2006). \n                    https:\/\/doi.org\/10.1007\/11832072_16"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-29011-4_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Groce","year":"2012","unstructured":"Groce, A., Katz, J.: Fair computation with rational players. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 81\u201398. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-29011-4_7"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Halpern, J., Teague, V.: Rational secret sharing and multiparty computation. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, pp. 623\u2013632. ACM (2004)","DOI":"10.1145\/1007352.1007447"},{"issue":"3","key":"4_CR17","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/j.engappai.2007.10.003","volume":"21","author":"JC Hennet","year":"2008","unstructured":"Hennet, J.C., Arda, Y.: Supply chain coordination: a game-theory approach. Eng. Appl. Artif. Intell. 21(3), 399\u2013405 (2008)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-540-78524-8_16","volume-title":"Theory of Cryptography","author":"S Izmalkov","year":"2008","unstructured":"Izmalkov, S., Lepinski, M., Micali, S.: Verifiably secure devices. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 273\u2013301. Springer, Heidelberg (2008). \n                    https:\/\/doi.org\/10.1007\/978-3-540-78524-8_16"},{"key":"4_CR19","unstructured":"Izmalkov, S., Micali, S., Lepinski, M.: Rational secure computation and ideal mechanism design. In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), pp. 585\u2013594. IEEE (2005)"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Jha, S., Kruger, L., Shmatikov, V.: Towards practical privacy for genomic computation. In: 2008 IEEE Symposium on Security and Privacy (SP 2008), pp. 216\u2013230. IEEE (2008)","DOI":"10.1109\/SP.2008.34"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Jurca, R., Faltings, B.: An incentive compatible reputation mechanism. In: IEEE International Conference on E-Commerce, CEC 2003, pp. 285\u2013292. IEEE (2003)","DOI":"10.1145\/860722.860778"},{"issue":"1","key":"4_CR22","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0022-0531(79)90060-7","volume":"20","author":"E Kalai","year":"1979","unstructured":"Kalai, E., Postlewaite, A., Roberts, J., et al.: A group incentive compatible mechanism yielding core allocations. J. Econ. Theory 20(1), 13\u201322 (1979)","journal-title":"J. Econ. Theory"},{"issue":"2","key":"4_CR23","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.ijpe.2008.05.011","volume":"115","author":"A Kanda","year":"2008","unstructured":"Kanda, A., Deshmukh, S., et al.: Supply chain coordination: perspectives, empirical studies and research directions. Int. J. Prod. Econ. 115(2), 316\u2013335 (2008)","journal-title":"Int. J. Prod. Econ."},{"issue":"6","key":"4_CR24","doi-asserted-by":"publisher","first-page":"1323","DOI":"10.1109\/TKDE.2012.61","volume":"25","author":"M Kantarcioglu","year":"2013","unstructured":"Kantarcioglu, M., Jiang, W.: Incentive compatible privacy-preserving data analysis. IEEE Trans. Knowl. Data Eng. 25(6), 1323\u20131335 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Kantarcioglu, M., Nix, R.: Incentive compatible distributed data mining. In: 2010 IEEE Second International Conference on Social Computing, pp. 735\u2013742. IEEE (2010)","DOI":"10.1109\/SocialCom.2010.114"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-540-78524-8_15","volume-title":"Theory of Cryptography","author":"J Katz","year":"2008","unstructured":"Katz, J.: Bridging game theory and cryptography: recent results and future directions. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 251\u2013272. Springer, Heidelberg (2008). \n                    https:\/\/doi.org\/10.1007\/978-3-540-78524-8_15"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-540-78524-8_18","volume-title":"Theory of Cryptography","author":"G Kol","year":"2008","unstructured":"Kol, G., Naor, M.: Cryptography and game theory: designing protocols for exchanging information. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 320\u2013339. Springer, Heidelberg (2008). \n                    https:\/\/doi.org\/10.1007\/978-3-540-78524-8_18"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Lapets, A., Volgushev, N., Bestavros, A., Jansen, F., Varia, M.: Secure MPC for analytics as a web application. In: 2016 IEEE Cybersecurity Development (SecDev), pp. 73\u201374. IEEE (2016)","DOI":"10.1109\/SecDev.2016.027"},{"issue":"8","key":"4_CR29","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1287\/mnsc.1070.0851","volume":"54","author":"L Li","year":"2008","unstructured":"Li, L., Zhang, H.: Confidentiality and information sharing in supply chain coordination. Manag. Sci. 54(8), 1467\u20131481 (2008)","journal-title":"Manag. Sci."},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Lindell, Y.: Secure multiparty computation for privacy preserving data mining. In: Encyclopedia of Data Warehousing and Mining, pp. 1005\u20131009. IGI Global (2005)","DOI":"10.4018\/978-1-59140-557-3.ch189"},{"key":"4_CR31","series-title":"Information Security and Cryptography","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-319-57048-8_6","volume-title":"Tutorials on the Foundations of Cryptography","author":"Y Lindell","year":"2017","unstructured":"Lindell, Y.: How to simulate it \u2013 a tutorial on the simulation proof technique. In: Lindell, Y. (ed.) Tutorials on the Foundations of Cryptography. ISC, pp. 277\u2013346. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-57048-8_6"},{"key":"4_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/11818175_11","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"A Lysyanskaya","year":"2006","unstructured":"Lysyanskaya, A., Triandopoulos, N.: Rationality and adversarial behavior in multi-party computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 180\u2013197. Springer, Heidelberg (2006). \n                    https:\/\/doi.org\/10.1007\/11818175_11"},{"key":"4_CR33","unstructured":"Milosavljevic, N., Prakash, A.: Game Theory and Cryptography. University of California, Berkeley (2009)"},{"key":"4_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 99","author":"P Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). \n                    https:\/\/doi.org\/10.1007\/3-540-48910-X_16"},{"issue":"1\u20132","key":"4_CR35","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.tcs.2005.05.009","volume":"343","author":"Y Shoham","year":"2005","unstructured":"Shoham, Y., Tennenholtz, M.: Non-cooperative computation: boolean functions with correctness and exclusivity. Theor. Comput. Sci. 343(1\u20132), 97\u2013113 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR36","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1086\/256964","volume":"58","author":"JJ Spengler","year":"1950","unstructured":"Spengler, J.J.: Vertical integration and antitrust policy. J. Polit. Econ. 58, 347\u2013352 (1950)","journal-title":"J. Polit. Econ."},{"issue":"10","key":"4_CR37","doi-asserted-by":"publisher","first-page":"1339","DOI":"10.1287\/mnsc.45.10.1339","volume":"45","author":"AA Tsay","year":"1999","unstructured":"Tsay, A.A.: The quantity flexibility contract and supplier-customer incentives. Manag. Sci. 45(10), 1339\u20131358 (1999)","journal-title":"Manag. Sci."},{"key":"4_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-662-45472-5_26","volume-title":"Financial Cryptography and Data Security","author":"JR Wallrabenstein","year":"2014","unstructured":"Wallrabenstein, J.R., Clifton, C.: Privacy preserving t\u00e2tonnement. In: Christin, N., Safavi-Naini, R. (eds.) FC 2014. LNCS, vol. 8437, pp. 399\u2013416. Springer, Heidelberg (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-662-45472-5_26"},{"key":"4_CR39","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: 23rd Annual Symposium on Foundations of Computer Science, SFCS 2008, pp. 160\u2013164. IEEE (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Decision and Game Theory for Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-32430-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T11:15:23Z","timestamp":1572002123000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-32430-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030324292","9783030324308"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-32430-8_4","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":"23 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GameSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Decision and Game Theory for Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Stockholm","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","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":"30 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gamesec2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.gamesec-conf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","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":"21","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":"11","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":"45% - 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","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":"3.5","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)"}}]}}