{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T04:04:48Z","timestamp":1745208288993,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642342653"},{"type":"electronic","value":"9783642342660"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34266-0_2","type":"book-chapter","created":{"date-parts":[[2012,11,4]],"date-time":"2012-11-04T23:49:04Z","timestamp":1352072944000},"page":"18-37","source":"Crossref","is-referenced-by-count":20,"title":["Socio-Rational Secret Sharing as a New Direction in Rational Cryptography"],"prefix":"10.1007","author":[{"given":"Mehrdad","family":"Nojoumian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas R.","family":"Stinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_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: 25th Annual ACM Symposium on Principles of Distributed Computing PODC, pp. 53\u201362 (2006)","DOI":"10.1145\/1146381.1146393"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: 20th Annual ACM Symposium on Theory of Computing, STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Blakley, G.: Safeguarding cryptographic keys. In: Proc. NCC, vol.\u00a048, pp. 313\u2013317. AFIPS Press (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: 20th Annual ACM Symposium on Theory of Computing, STOC, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"2_CR5","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":"2_CR6","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":"2_CR7","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, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Halpern, J.Y., Teague, V.: Rational secret sharing and multiparty computation: extended abstract. In: 36th Annual ACM Symposium on Theory of Computing, STOC, pp. 623\u2013632 (2004)","DOI":"10.1145\/1007352.1007447"},{"key":"2_CR9","unstructured":"Harkavy, M., Tygar, J.D., Kikuchi, H.: Electronic auctions with private bids. In: 3rd Conference on USENIX Workshop on Electronic Commerce, WOEC, pp. 61\u201374. USENIX Association (1998)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Izmalkov, S., Micali, S., Lepinski, M.: Rational secure computation and ideal mechanism design. In: 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS, pp. 585\u2013595 (2005)","DOI":"10.1109\/SFCS.2005.64"},{"key":"2_CR11","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":"2_CR12","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":"2_CR13","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 (2008)","DOI":"10.1145\/1374376.1374437"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Lepinski, M., Micali, S., Peikert, C., Shelat, A.: Completely fair SFE and coalition-safe cheap talk. In: 23th Annual ACM Symposium on Principles of Distributed Computing, PODC, pp. 1\u201310 (2004)","DOI":"10.1145\/1011767.1011769"},{"key":"2_CR15","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 (2005)","DOI":"10.1145\/1060590.1060671"},{"key":"2_CR16","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":"2_CR17","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780195300796.001.0001","volume-title":"Repeated games and reputations: long-run relationships","author":"G. Mailath","year":"2006","unstructured":"Mailath, G., Samuelson, L.: Repeated games and reputations: long-run relationships. Oxford University Press, USA (2006)"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-540-79104-1_24","volume-title":"Information Security Practice and Experience","author":"S. Maleka","year":"2008","unstructured":"Maleka, S., Shareef, A., Rangan, C.P.: Rational Secret Sharing with Repeated Games. In: Chen, L., Mu, Y., Susilo, W. (eds.) ISPEC 2008. LNCS, vol.\u00a04991, pp. 334\u2013346. Springer, Heidelberg (2008)"},{"key":"2_CR19","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":"2_CR20","doi-asserted-by":"crossref","unstructured":"Nojoumian, M., Lethbridge, T.: A New Approach for the Trust Calculation in Social Networks. In: E-business and Telecommunication Networks: 3rd Int. Conf. on E-Business, ICE-B 2006, Best Papers, vol.\u00a09, pp. 64\u201377. Springer (2008)","DOI":"10.1007\/978-3-540-70760-8_6"},{"issue":"4","key":"2_CR21","first-page":"202","volume":"4","author":"M. Nojoumian","year":"2010","unstructured":"Nojoumian, M., Stinson, D., Grainger, M.: Unconditionally secure social secret sharing scheme. IET Information Security, Special Issue on Multi-Agent and Distributed Information Security\u00a04(4), 202\u2013211 (2010)","journal-title":"IET Information Security, Special Issue on Multi-Agent and Distributed Information Security"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Nojoumian, M., Stinson, D.R.: Brief announcement: secret sharing based on the social behaviors of players. In: 29th ACM Symposium on Principles of Distributed Computing, PODC, pp. 239\u2013240 (2010)","DOI":"10.1145\/1835698.1835754"},{"key":"2_CR23","unstructured":"Osborne, M.J., Rubinstein, A.: A course in game theory. MIT Press (1994)"},{"issue":"11","key":"2_CR24","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","Decision and Game Theory for Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34266-0_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,20]],"date-time":"2025-04-20T06:11:18Z","timestamp":1745129478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34266-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642342653","9783642342660"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34266-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}