{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T22:56:09Z","timestamp":1762210569921},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033551"},{"type":"electronic","value":"9783642033568"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03356-8_33","type":"book-chapter","created":{"date-parts":[[2009,8,18]],"date-time":"2009-08-18T10:00:39Z","timestamp":1250589639000},"page":"559-576","source":"Crossref","is-referenced-by-count":22,"title":["Utility Dependence in Correct and Fair Rational Secret Sharing"],"prefix":"10.1007","author":[{"given":"Gilad","family":"Asharov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yehuda","family":"Lindell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D., Gonen, R., Halpern, J.Y.: Distributed Computing Meets Game Theory: Robust Mechanisms for Rational Secret Sharing and Multiparty Computation. In: The 25th PODC, pp. 53\u201362 (2006)","DOI":"10.1145\/1146381.1146393"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the Security of Coin Flips when Half the Processors are Faulty. In: 18th STOC, pp. 364\u2013369 (1986)","DOI":"10.1145\/12130.12168"},{"key":"33_CR3","volume-title":"Algorithmic Game Theory","author":"Y. Dodis","year":"2007","unstructured":"Dodis, Y., Rabin, T.: Cryptography and Game Theory. In: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"key":"33_CR4","series-title":"Basic Applications","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography. Basic Applications, vol.\u00a02. Cambridge University Press, Cambridge (2004)"},{"key":"33_CR5","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)"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Halpern, J., Teague, V.: Rational Secret Sharing and Multiparty Computation. In: The 36th STOC, pp. 623\u2013632 (2004)","DOI":"10.1145\/1007352.1007447"},{"key":"33_CR7","unstructured":"Fuchsbauer, G., Katz, J., Levieil, E., Naccache, D.: Efficient Rational Secret Sharing in the Standard Communication Model. Cryptology ePrint Archive, Report #2008\/488 (2008)"},{"key":"33_CR8","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":"33_CR9","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":"33_CR10","doi-asserted-by":"crossref","unstructured":"Kol, G., Naor, M.: Games for Exchanging Information. In: The 40th STOC, pp. 423\u2013432 (2008)","DOI":"10.1145\/1374376.1374437"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Izmalkov, S., Micali, S., Lepinski, M.: Rational Secure Computation and Ideal Mechanism Design. In: The 46th FOCS, pp. 585\u2013595 (2005)","DOI":"10.1109\/SFCS.2005.64"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"Lepinski, M., Micali, S., Peikert, C., Shelat, A.: Completely Fair SFE and Coalition-Safe Cheap Talk. In: The 23rd PODC, pp. 1\u201310 (2004)","DOI":"10.1145\/1011767.1011769"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Lepinski, M., Micali, S., Shelat, A.: Collusion-Free Protocols. In: The 37th STOC, pp. 543\u2013552 (2005)","DOI":"10.1145\/1060590.1060671"},{"key":"33_CR14","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 Multiparty Computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 180\u2013197. Springer, Heidelberg (2006)"},{"issue":"11","key":"33_CR15","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to Share a Secret. Communications of the ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"33_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/978-3-642-00457-5_3","volume-title":"The 6th TCC","author":"S.J. Ong","year":"2009","unstructured":"Ong, S.J., Parkes, D., Rosen, A., Vadhan, S.: Fairness with an Honest Minority and a Rational Majority. In: The 6th TCC. LNCS, vol.\u00a05444, pp. 36\u201353. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03356-8_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:10:05Z","timestamp":1558476605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03356-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033551","9783642033568"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03356-8_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}