{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:13:20Z","timestamp":1764173600835,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642117985"},{"type":"electronic","value":"9783642117992"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-11799-2_25","type":"book-chapter","created":{"date-parts":[[2010,2,2]],"date-time":"2010-02-02T13:55:48Z","timestamp":1265118948000},"page":"419-436","source":"Crossref","is-referenced-by-count":69,"title":["Efficient Rational Secret Sharing in Standard Communication Networks"],"prefix":"10.1007","author":[{"given":"Georg","family":"Fuchsbauer","sequence":"first","affiliation":[]},{"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[]},{"given":"David","family":"Naccache","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1145\/1146381.1146393","volume-title":"25th ACM Symposium Annual on Principles of Distributed Computing","author":"I. Abraham","year":"2006","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 Annual on Principles of Distributed Computing, pp. 53\u201362. ACM Press, New York (2006)"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/978-3-642-03356-8_31","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"J. Alwen","year":"2009","unstructured":"Alwen, J., Katz, J., Lindell, Y., Persiano, G., Shelat, A., Visconti, I.: Collusion-free multiparty computation in the mediated model. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 524\u2013540. Springer, Heidelberg (2009)"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-540-85174-5_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"J. Alwen","year":"2008","unstructured":"Alwen, J., Shelat, A., Visconti, I.: Collusion-free protocols in the mediated model. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 497\u2013514. Springer, Heidelberg (2008)"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/978-3-642-03356-8_33","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"G. Asharov","year":"2009","unstructured":"Asharov, G., Lindell, Y.: Utility dependence in correct and fair rational secret sharing. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 559\u2013576. Springer, Heidelberg (2009), A full version, containing additional results: http:\/\/eprint.iacr.org\/209\/373"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Blakley, G.: Safeguarding cryptographic keys. In: Proc. AFIPS National Computer Conference, vol.\u00a048, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Public Key Cryptography - PKC 2003","author":"Y. Dodis","year":"2002","unstructured":"Dodis, Y.: Efficient construction of (distributed) verifiable random functions. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 1\u201317. Springer, Heidelberg (2002)"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1017\/CBO9780511800481.010","volume-title":"Algorithmic Game Theory","author":"Y. Dodis","year":"2007","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, Cambridge (2007)"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-30580-4_28","volume-title":"Public Key Cryptography - PKC 2005","author":"Y. Dodis","year":"2005","unstructured":"Dodis, Y., Yampolskiy, A.: A verifiable random function with short proofs and keys. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol.\u00a03386, pp. 416\u2013431. Springer, Heidelberg (2005)"},{"key":"25_CR9","unstructured":"Fuchsbauer, G., Katz, J., Naccache, D.: Efficient rational secret sharing in standard communication networks, http:\/\/eprint.iacr.org\/2008\/488"},{"key":"25_CR10","first-page":"413","volume-title":"40th Annual ACM Symposium on Theory of Computing (STOC)","author":"S.D. Gordon","year":"2008","unstructured":"Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation. In: 40th Annual ACM Symposium on Theory of Computing (STOC), pp. 413\u2013422. ACM Press, New York (2008)"},{"key":"25_CR11","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":"25_CR12","unstructured":"Gordon, S.D., Katz, J.: Partial fairness in secure two-party computation (2008), http:\/\/eprint.iacr.org\/2008\/206"},{"key":"25_CR13","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1145\/1007352.1007447","volume-title":"36th Annual ACM Symposium on Theory of Computing (STOC)","author":"J. Halpern","year":"2004","unstructured":"Halpern, J., Teague, V.: Rational secret sharing and multiparty computation: Extended abstract. In: 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 623\u2013632. ACM Press, New York (2004)"},{"key":"25_CR14","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)"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1109\/SFCS.2005.64","volume-title":"46th Annual Symposium on Foundations of Computer Science (FOCS)","author":"S. Izmalkov","year":"2005","unstructured":"Izmalkov, S., Micali, S., Lepinski, M.: Rational secure computation and ideal mechanism design. In: 46th Annual Symposium on Foundations of Computer Science (FOCS), pp. 585\u2013595. IEEE, Los Alamitos (2005)"},{"key":"25_CR16","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":"25_CR17","unstructured":"Katz, J.: Ruminations on defining rational MPC. Talk given at SSoRC, Bertinoro, Italy (2008), http:\/\/www.daimi.au.dk\/~jbn\/SSoRC2008\/program"},{"key":"25_CR18","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":"25_CR19","first-page":"423","volume-title":"40th Annual ACM Symposium on Theory of Computing (STOC)","author":"G. Kol","year":"2008","unstructured":"Kol, G., Naor, M.: Games for exchanging information. In: 40th Annual ACM Symposium on Theory of Computing (STOC), pp. 423\u2013432. ACM Press, New York (2008)"},{"key":"25_CR20","first-page":"1","volume-title":"23rd ACM Symposium Annual on Principles of Dis- tributed Computing","author":"M. Lepinski","year":"2004","unstructured":"Lepinski, M., Micali, S., Peikert, C., Shelat, A.: Completely fair SFE and coalition-safe cheap talk. In: 23rd ACM Symposium Annual on Principles of Dis- tributed Computing, pp. 1\u201310. ACM Press, New York (2004)"},{"key":"25_CR21","first-page":"543","volume-title":"37th Annual ACM Symposium on Theory of Computing (STOC)","author":"M. Lepinski","year":"2005","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, New York (2005)"},{"key":"25_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-540-30576-7_14","volume-title":"Theory of Cryptography","author":"M. Lepinski","year":"2005","unstructured":"Lepinski, M., Micali, S., Shelat, A.: Fair-zero knowledge. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 245\u2013263. Springer, Heidelberg (2005)"},{"key":"25_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/3-540-45708-9_38","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"A. Lysyanskaya","year":"2002","unstructured":"Lysyanskaya, A.: Unique signatures and verifiable random functions from the DH-DDH separation. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 597\u2013612. Springer, Heidelberg (2002)"},{"key":"25_CR24","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":"25_CR25","first-page":"120","volume-title":"40th Annual Symposium on Foundations of Computer Science (FOCS)","author":"S. Micali","year":"1999","unstructured":"Micali, S., Rabin, M.O., Vadhan, S.P.: Verifiable random functions. In: 40th Annual Symposium on Foundations of Computer Science (FOCS), pp. 120\u2013130. IEEE, Los Alamitos (1999)"},{"key":"25_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/978-3-642-00457-5_4","volume-title":"TCC 2009","author":"S. Miclai","year":"2009","unstructured":"Miclai, S., Shelat, A.: Truly rational secret sharing. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 54\u201371. Springer, Heidelberg (2009)"},{"key":"25_CR27","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":"TCC 2009","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: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 36\u201353. Springer, Heidelberg (2009)"},{"issue":"11","key":"25_CR28","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"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11799-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T11:06:25Z","timestamp":1634814385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11799-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642117985","9783642117992"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11799-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}