{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:17:32Z","timestamp":1725603452042},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642242083"},{"type":"electronic","value":"9783642242090"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24209-0_24","type":"book-chapter","created":{"date-parts":[[2011,8,29]],"date-time":"2011-08-29T00:37:43Z","timestamp":1314578263000},"page":"355-369","source":"Crossref","is-referenced-by-count":10,"title":["Unconditionally Secure Rational Secret Sharing in Standard Communication Networks"],"prefix":"10.1007","author":[{"given":"Zhifang","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Mulan","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_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":"24_CR2","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the National Computer Conference, American Federation of Information Processing Societies Proceedings, vol.\u00a048, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"24_CR3","first-page":"71","volume-title":"Proc. STOC 2006","author":"C. Daskalakis","year":"2006","unstructured":"Daskalakis, C., Goldberg, P., Papadimitriou, C.: The complexity of computing a Nash equilibrium. In: Proc. STOC 2006, pp. 71\u201378. ACM Press, New York (2006)"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Mehta, A., Papadimitriou, C.: A note on approximate Nash equilibria. In: International Workshop on Internet and Network Economics, pp. 297\u2013306 (2006)","DOI":"10.1007\/11944874_27"},{"key":"24_CR5","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":"24_CR6","first-page":"413","volume-title":"Proc. STOC 2008","author":"S.D. Gordon","year":"2008","unstructured":"Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation. In: Proc. STOC 2008, pp. 413\u2013422. ACM Press, New York (2008)"},{"key":"24_CR7","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":"24_CR8","first-page":"623","volume-title":"Proc. of 36th STOC","author":"J. Halpern","year":"2004","unstructured":"Halpern, J., Teague, V.: Rational secret sharing and multiparty computation. In: Proc. of 36th STOC, pp. 623\u2013632. ACM Press, New York (2004)"},{"key":"24_CR9","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":"24_CR10","first-page":"423","volume-title":"STOC 2008","author":"G. Kol","year":"2008","unstructured":"Kol, G., Naor, M.: Games for exchanging information. In: STOC 2008, pp. 423\u2013432. ACM, New York (2008)"},{"key":"24_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.\u00a04948, pp. 320\u2013339. Springer, Heidelberg (2008)"},{"key":"24_CR12","first-page":"1","volume-title":"23rd ACM Symposium Annual on Principles of Distributed Computing","author":"M. Lepinski","year":"2004","unstructured":"Lepinski, M., Micali, S., Peikert, C., Shelat, A.: Completely fair SFE and coalitionsafe cheap talk. In: 23rd ACM Symposium Annual on Principles of Distributed Computing, pp. 1\u201310. ACM Press, New York (2004)"},{"key":"24_CR13","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":"24_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 multi-party computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 180\u2013197. Springer, Heidelberg (2006)"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Maleka, S., Shareef, A., Rangan, C.P.: The deterministic protocol for rational secret sharing. In: IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2008, pp. 1\u20137 (2008)","DOI":"10.1109\/IPDPS.2008.4536558"},{"key":"24_CR16","volume-title":"A Course in Game Theory","author":"M. Osborne","year":"2004","unstructured":"Osborne, M., Rubinstein, A.: A Course in Game Theory. MIT Press, Cambridge (2004)"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In: Proceedings of the 21th Annual ACM Symposium on Theory of Computing (STOC), pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"issue":"11","key":"24_CR18","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":"24_CR19","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M. Wegman","year":"1981","unstructured":"Wegman, M., Carter, L.: New hash functions and their use in authentication and set equality. Journal of Computer and System Sciences\u00a022, 265\u2013279 (1981)","journal-title":"Journal of Computer and System Sciences"},{"key":"24_CR20","unstructured":"Zhang, Z.: Rational secret sharing as extensive games, http:\/\/eprint.iacr.org\/2010\/184"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology - ICISC 2010"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24209-0_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T23:12:23Z","timestamp":1638400343000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24209-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642242083","9783642242090"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24209-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}