{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:51:07Z","timestamp":1764132667637},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642290107"},{"type":"electronic","value":"9783642290114"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29011-4_7","type":"book-chapter","created":{"date-parts":[[2012,4,5]],"date-time":"2012-04-05T03:05:53Z","timestamp":1333595153000},"page":"81-98","source":"Crossref","is-referenced-by-count":50,"title":["Fair Computation with Rational Players"],"prefix":"10.1007","author":[{"given":"Adam","family":"Groce","sequence":"first","affiliation":[]},{"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_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: 25th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 53\u201362. ACM Press (2006)","DOI":"10.1145\/1146381.1146393"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-642-20465-4_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"G. Asharov","year":"2011","unstructured":"Asharov, G., Canetti, R., Hazay, C.: Towards a Game Theoretic View of Secure Computation. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 426\u2013445. Springer, Heidelberg (2011), Full version available at, \n                    \n                      http:\/\/eprint.iacr.org\/2011\/137"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00145-010-9064-z","volume":"24","author":"G. Asharov","year":"2011","unstructured":"Asharov, G., Lindell, Y.: Utility dependence in correct and fair rational secret sharing. Journal of Cryptology\u00a024(1), 157\u2013202 (2011)","journal-title":"Journal of Cryptology"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1287\/moor.17.2.327","volume":"17","author":"I. Barany","year":"1992","unstructured":"Barany, I.: Fair distribution protocols, or how the players replace fortune. Mathematics of Operations Research\u00a017, 327\u2013340 (1992)","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"7_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology\u00a013(1), 143\u2013202 (2000)","journal-title":"Journal of Cryptology"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty. In: 18th Annual ACM Symposium on Theory of Computing (STOC), pp. 364\u2013369. ACM Press (1986)","DOI":"10.1145\/12130.12168"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"1431","DOI":"10.2307\/1913390","volume":"50","author":"V. Crawford","year":"1982","unstructured":"Crawford, V., Sobel, J.: Strategic information transmission. Econometrica\u00a050, 1431\u20131451 (1982)","journal-title":"Econometrica"},{"key":"7_CR8","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 - 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.\u00a01880, pp. 112\u2013130. Springer, Heidelberg (2000)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Rabin, T.: Cryptography and game theory. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. (eds.) Algorithmic Game Theory, pp. 181\u2013207. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481.010"},{"key":"7_CR10","first-page":"1342","volume":"58","author":"F. Forges","year":"1990","unstructured":"Forges, F.: Universal mechanisms. Econometrica\u00a058, 1342\u20131364 (1990)","journal-title":"Econometrica"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-11799-2_25","volume-title":"Theory of Cryptography","author":"G. Fuchsbauer","year":"2010","unstructured":"Fuchsbauer, G., Katz, J., Naccache, D.: Efficient Rational Secret Sharing in Standard Communication Networks. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 419\u2013436. Springer, Heidelberg (2010)"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation. J. ACM\u00a058(6) (2011)","DOI":"10.1145\/2049697.2049698"},{"key":"7_CR13","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":"S.D. Gordon","year":"2006","unstructured":"Gordon, S.D., Katz, J.: Rational Secret Sharing, Revisited. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol.\u00a04116, pp. 229\u2013241. Springer, Heidelberg (2006)"},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/s00145-010-9079-5","volume":"25","author":"S.D. Gordon","year":"2012","unstructured":"Gordon, S.D., Katz, J.: Partial fairness in secure two-party computation. Journal of Cryptology\u00a025(1), 14\u201340 (2012)","journal-title":"Journal of Cryptology"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-642-11799-2_24","volume-title":"Theory of Cryptography","author":"R. Gradwohl","year":"2010","unstructured":"Gradwohl, R.: Rationality in the Full-Information Model. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 401\u2013418. Springer, Heidelberg (2010)"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Gradwohl, R., Livne, N., Rosen, A.: Sequential rationality in cryptographic protocols. In: 51st FOCS Annual Symposium on Foundations of Computer Science (FOCS), pp. 623\u2013632. IEEE (2010)","DOI":"10.1109\/FOCS.2010.65"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Halpern, J., Teague, V.: Rational secret sharing and multiparty computation. In: 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 623\u2013632. ACM Press (2004)","DOI":"10.1145\/1007352.1007447"},{"key":"7_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.\u00a04948, pp. 273\u2013301. Springer, Heidelberg (2008)"},{"issue":"1","key":"7_CR19","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.geb.2010.05.003","volume":"71","author":"S. Izmalkov","year":"2011","unstructured":"Izmalkov, S., Lepinski, M., Micali, S.: Perfect implementation. Games and Economic Behavior\u00a071(1), 121\u2013140 (2011), \n                    \n                      http:\/\/hdl.handle.net\/1721.1\/50634","journal-title":"Games and Economic Behavior"},{"key":"7_CR20","unstructured":"Izmalkov, S., Micali, S., Lepinski, M.: Rational secure computation and ideal mechanism design. In: 46th FOCSAnnual Symposium on Foundations of Computer Science (FOCS), pp. 585\u2013595. IEEE (2005), Full version available at, \n                    \n                      http:\/\/dspace.mit.edu\/handle\/1721.1\/38208"},{"key":"7_CR21","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.\u00a04948, pp. 251\u2013272. Springer, Heidelberg (2008)"},{"key":"7_CR22","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.\u00a04948, pp. 320\u2013339. Springer, Heidelberg (2008)"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Kol, G., Naor, M.: Games for exchanging information. In: 40th Annual ACM Symposium on Theory of Computing (STOC), pp. 423\u2013432. ACM Press (2008)","DOI":"10.1145\/1374376.1374437"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Lepinski, M., Micali, S., Peikert, C., Shelat, A.: Completely fair SFE and coalition-safe cheap talk. In: 23rd ACM PODCAnnual ACM Symposium on Principles of Distributed Computing (PODC), pp. 1\u201310. ACM Press (2004)","DOI":"10.1145\/1011767.1011769"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Lepinski, M., Micali, S., Shelat, A.: Collusion-free protocols. In: 37th Annual ACM Symposium on Theory of Computing (STOC), pp. 543\u2013552. ACM Press (2005)","DOI":"10.1145\/1060590.1060671"},{"key":"7_CR26","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.\u00a04117, pp. 180\u2013197. Springer, Heidelberg (2006)"},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-00457-5_4","volume-title":"Theory of Cryptography","author":"S. Micali","year":"2009","unstructured":"Micali, S., Shelat, A.: Purely Rational Secret Sharing (Extended Abstract). In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 54\u201371. Springer, Heidelberg (2009)"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-00457-5_1","volume-title":"Theory of Cryptography","author":"T. Moran","year":"2009","unstructured":"Moran, T., Naor, M., Segev, G.: An Optimally Fair Coin Toss. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 1\u201318. Springer, Heidelberg (2009)"},{"key":"7_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-00457-5_3","volume-title":"Theory of Cryptography","author":"S.J. Ong","year":"2009","unstructured":"Ong, S.J., Parkes, D.C., Rosen, A., Vadhan, S.: Fairness with an Honest Minority and a Rational Majority. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 36\u201353. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29011-4_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:18:48Z","timestamp":1620112728000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29011-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642290107","9783642290114"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29011-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}