{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:08:18Z","timestamp":1743116898978,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030304720"},{"type":"electronic","value":"9783030304737"}],"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-30473-7_3","type":"book-chapter","created":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T23:02:36Z","timestamp":1568588556000},"page":"34-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Sharing Information with Competitors"],"prefix":"10.1007","author":[{"given":"Simina","family":"Br\u00e2nzei","sequence":"first","affiliation":[]},{"given":"Claudio","family":"Orlandi","sequence":"additional","affiliation":[]},{"given":"Guang","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,16]]},"reference":[{"issue":"12","key":"3_CR1","first-page":"1749","volume":"61","author":"DW Archer","year":"2018","unstructured":"Archer, D.W., et al.: From keys to databases - real-world applications of secure multi-party computation. Comput. J. 61(12), 1749\u20131771 (2018)","journal-title":"Comput. J."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Aumann, R.J.: Game theory. In: Game Theory, pp. 1\u201353. Springer (1989)","DOI":"10.1007\/978-1-349-20181-5_1"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Azar, P.D., Goldwasser, S., Park, S.: How to incentivize data-driven collaboration among competing parties. In: ITCS, pp. 213\u2013225 (2016)","DOI":"10.1145\/2840728.2840758"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-319-70697-9_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"A Ben-Efraim","year":"2017","unstructured":"Ben-Efraim, A., Lindell, Y., Omri, E.: Efficient scalable constant-round MPC via garbled circuits. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 471\u2013498. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_17"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Chen, Y., Nissim, K., Waggoner, B.: Fair information sharing for treasure hunting. In: AAAI, pp. 851\u2013857 (2015)","DOI":"10.1609\/aaai.v29i1.9316"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Chen, Y., Waggoner, B.: Informational substitutes. In: FOCS, pp. 239\u2013247 (2016)","DOI":"10.1109\/FOCS.2016.33"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"I Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643\u2013662. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Halpern, J., Teague, V.: Rational secret sharing and multiparty computation. In: STOC, pp. 623\u2013632. ACM (2004)","DOI":"10.1145\/1007352.1007447"},{"key":"3_CR9","unstructured":"Izmalkov, S., Micali, S., Lepinski, M.: Rational secure computation and ideal mechanism design. In: FOCS, pp. 585\u2013594 (2005)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Keller, M., Orsini, E., Scholl, P.: MASCOT: faster malicious arithmetic secure computation with oblivious transfer. In: ACM SIGSAC, pp. 830\u2013842 (2016)","DOI":"10.1145\/2976749.2978357"},{"key":"3_CR11","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). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_18"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-662-48000-7_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"Y Lindell","year":"2015","unstructured":"Lindell, Y., Pinkas, B., Smart, N.P., Yanai, A.: Efficient constant round multi-party computation combining BMR and SPDZ. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 319\u2013338. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_16"},{"issue":"1","key":"3_CR13","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.dss.2010.07.004","volume":"50","author":"R Mantena","year":"2010","unstructured":"Mantena, R., Sankaranarayanan, R., Viswanathan, S.: Platform-based information goods: the economics of exclusivity. Decis. Support Syst. 50(1), 79\u201392 (2010)","journal-title":"Decis. Support Syst."},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"McGrew, R., Porter, R., Shoham, Y.: Towards a general theory of non-cooperative computation. In: TARK, pp. 59\u201371. ACM (2003)","DOI":"10.1145\/846241.846249"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-642-03356-8_32","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"PB Miltersen","year":"2009","unstructured":"Miltersen, P.B., Nielsen, J.B., Triandopoulos, N.: Privacy-enhancing auctions using rational cryptography. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 541\u2013558. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_32"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-642-32009-5_40","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"JB Nielsen","year":"2012","unstructured":"Nielsen, J.B., Nordholt, P.S., Orlandi, C., Burra, S.S.: A new approach to practical active-secure two-party computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 681\u2013700. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_40"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Nissim, K., Orlandi, C., Smorodinsky, R.: Privacy-aware mechanism design. In: ACM EC, pp. 774\u2013789. ACM (2012)","DOI":"10.1145\/2229012.2229073"},{"issue":"2","key":"3_CR18","doi-asserted-by":"publisher","first-page":"7:1","DOI":"10.1145\/3154794","volume":"21","author":"B Pinkas","year":"2018","unstructured":"Pinkas, B., Schneider, T., Zohner, M.: Scalable private set intersection based on OT extension. ACM Trans. Priv. Secur. 21(2), 7:1\u20137:35 (2018)","journal-title":"ACM Trans. Priv. Secur."},{"key":"3_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511528446","volume-title":"The Shapley Value: Essays in Honor of Lloyd S. Shapley","author":"A Roth","year":"1988","unstructured":"Roth, A.: The Shapley Value: Essays in Honor of Lloyd S. Shapley. Cambridge University Press, Cambridge (1988)"},{"issue":"4","key":"3_CR20","doi-asserted-by":"publisher","first-page":"603","DOI":"10.2307\/2696351","volume":"31","author":"I Segal","year":"2000","unstructured":"Segal, I., Whinston, M.: Exclusive contracts and protection of investments. RAND J. Econ. 31(4), 603\u2013633 (2000)","journal-title":"RAND J. Econ."},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1017\/CBO9780511528446.003","volume-title":"The Shapley Value","author":"Lloyd S. Shapley","year":"1988","unstructured":"Shapley, L.S.: A value for n-person games. The Shapley value, pp. 31\u201340 (1988)"},{"issue":"1","key":"3_CR22","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), 97\u2013113 (2005)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30473-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:32:34Z","timestamp":1709811154000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-30473-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030304720","9783030304737"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30473-7_3","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":"16 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/corelab.ntua.gr\/sagt2019\/","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":"55","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":"26","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":"0","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":"47% - 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":"7","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)"}}]}}