{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:46:34Z","timestamp":1767339994605},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540380801"},{"type":"electronic","value":"9783540380818"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11832072_16","type":"book-chapter","created":{"date-parts":[[2006,8,30]],"date-time":"2006-08-30T04:43:49Z","timestamp":1156913029000},"page":"229-241","source":"Crossref","is-referenced-by-count":93,"title":["Rational Secret Sharing, Revisited"],"prefix":"10.1007","author":[{"given":"S. Dov","family":"Gordon","sequence":"first","affiliation":[]},{"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_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 ACM Symposium on Principles of Distributed Computing (PODC 2006) (to appear, 2006)","DOI":"10.1145\/1146381.1146393"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding Cryptographic Keys. In: National Computer Conference, vol.\u00a048, pp. 313\u2013317. AFIPS Press (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"16_CR3","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 1986 (1986)","DOI":"10.1145\/12130.12168"},{"key":"16_CR4","volume-title":"Game Theory","author":"D. Fudenberg","year":"1991","unstructured":"Fudenberg, D., Tirole, J.: Game Theory. MIT Press, Cambridge (1991)"},{"key":"16_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography. Basic Applications","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography. Basic Applications, vol.\u00a02. Cambridge University Press, Cambridge (2004)"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In: 19th Annual ACM Symposium on Theory of Computing, STOC 1987 (1987)","DOI":"10.1145\/28395.28420"},{"key":"16_CR7","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 2004 (2004)","DOI":"10.1145\/1007352.1007447"},{"key":"16_CR8","unstructured":"Izmalkov, S., Micali, S., Lepinski, M.: Rational Secure Function Evaluation and Ideal Mechanism Design. In: 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005 (2005)"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Lepinski, M., Micali, S., Peikert, C., Shelat, A.: Completely Fair SFE and Coalition-Safe Cheap Talk. In: 23rd ACM Symposium on Principles of Distributed Computing, PODC 2004 (2004)","DOI":"10.1145\/1011767.1011769"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Lepinski, M., Micali, S., Shelat, A.: Collusion-Free Protocols. In: 37th Annual ACM Symposium on Theory of Computing (STOC 2005) (2005)","DOI":"10.1145\/1060590.1060671"},{"key":"16_CR11","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":"16_CR12","volume-title":"A Course in Game Theory","author":"M.J. Osborne","year":"1994","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. MIT Press, Cambridge (1994)"},{"issue":"11","key":"16_CR13","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. Comm. ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Comm. ACM"},{"issue":"1-2","key":"16_CR14","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 Computing: Boolean Functions with Correctness and Exclusivity. Theoretical Computer Science\u00a0343(1-2), 97\u2013113 (2005)","journal-title":"Theoretical Computer Science"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: How to Generate and Exchange Secrets. In: 27th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1986) (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11832072_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,18]],"date-time":"2020-04-18T02:53:30Z","timestamp":1587178410000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11832072_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540380801","9783540380818"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11832072_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}