{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:50:51Z","timestamp":1725807051592},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319122793"},{"type":"electronic","value":"9783319122809"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12280-9_16","type":"book-chapter","created":{"date-parts":[[2014,10,17]],"date-time":"2014-10-17T00:51:48Z","timestamp":1413507108000},"page":"240-255","source":"Crossref","is-referenced-by-count":0,"title":["Should Silence be Heard? Fair Rational Secret Sharing with Silent and Non-silent Players"],"prefix":"10.1007","author":[{"given":"Sourya Joyee","family":"De","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sushmita","family":"Ruj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asim K.","family":"Pal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"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: Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing, pp. 53\u201362. ACM (2006)","DOI":"10.1145\/1146381.1146393"},{"issue":"1","key":"16_CR2","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00145-010-9064-z","volume":"24","author":"G. Asharov","year":"2010","unstructured":"Asharov, G., Lindell, Y.: Utility Dependence in Correct and Fair Rational Secret Sharing. Journal of Cryptology\u00a024(1), 157\u2013202 (2010)","journal-title":"Journal of Cryptology"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Albanese, R., Van Fleet, D.D.: Rational behavior in groups: The free-riding tendency. Academy of Management Review 10(2), 244\u2013255 (1985)","DOI":"10.5465\/amr.1985.4278118"},{"key":"16_CR4","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)"},{"issue":"3859","key":"16_CR5","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1126\/science.162.3859.1243","volume":"162","author":"G. Harding","year":"1968","unstructured":"Harding, G.: The tragedy of the commons. Science\u00a0162(3859), 1243\u20131248 (1968)","journal-title":"Science"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Halpern, J., Teague, V.: Rational secret sharing and multiparty computation: extended abstract. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 623\u2013632. ACM (2004)","DOI":"10.1145\/1007352.1007447"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Halpern, J.Y., Pass, R.: Algorithmic rationality: Game theory with costly computation. Journal of Economic Theory (2014)","DOI":"10.1016\/j.jet.2014.04.007"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Kol, G., Naor, M.: Games for exchanging information. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 423\u2013432. ACM (2008)","DOI":"10.1145\/1374376.1374437"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Stroebe, W., Frey, B.S.: Self-interest and collective action:The economics and psychology of public goods. British Journal of Social Psychology 21(2), 121\u2013137 (1982)","DOI":"10.1111\/j.2044-8309.1982.tb00521.x"},{"issue":"11","key":"16_CR10","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":"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","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":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-00457-5_3","volume-title":"Theory of Cryptography","author":"S.J. Ong","year":"2009","unstructured":"Ong, S.J., Parkes, D.C., 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)"},{"key":"16_CR14","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":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-642-03356-8_32","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"P.B. Miltersen","year":"2009","unstructured":"Miltersen, P.B., Nielsen, J.B., Triandopoulos, N.: Privacy-enhancing auctions using rational cryptography. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 541\u2013558. Springer, Heidelberg (2009)"},{"key":"16_CR16","volume-title":"A Course in Game Theory","author":"M. Osborne","year":"2004","unstructured":"Osborne, M., Rubinstein, A.: A Course in Game Theory. MIT, Cambridge (2004)"},{"key":"16_CR17","unstructured":"Lysyanskaya, A., Segal, A.: Rational Secret Sharing with Side Information in Point-to-Point Networks via Time Delayed Encryption.IACR Cryptology ePrint Archive:Report2010\/540 (2010)"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-319-02937-5_8","volume-title":"Cryptology and Network Security","author":"S.J. De","year":"2013","unstructured":"De, S.J., Pal, A.K.: Achieving Correctness in Fair Rational Secret Sharing. In: Abdalla, M., Nita-Rotaru, C., Dahab, R. (eds.) CANS 2013. LNCS, vol.\u00a08257, pp. 139\u2013161. Springer, Heidelberg (2013)"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-45204-8_7","volume-title":"Information Systems Security","author":"S.J. De","year":"2013","unstructured":"De, S.J., Pal, A.K.: Auctions with Rational Adversary. In: Bagchi, A., Ray, I. (eds.) ICISS 2013. LNCS, vol.\u00a08303, pp. 91\u2013105. Springer, Heidelberg (2013)"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-642-31585-5_50","volume-title":"Automata, Languages, and Programming","author":"A. Groce","year":"2012","unstructured":"Groce, A., Katz, J., Thiruvengadam, A., Zikas, V.: Byzantine agreement with a rational adversary. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol.\u00a07392, pp. 561\u2013572. Springer, Heidelberg (2012)"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/11535218_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Gentry, C., Waters, B.: Collusion resistant broadcast encryption with short ciphertexts and private keys. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 258\u2013275. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12280-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T05:16:47Z","timestamp":1559020607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12280-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319122793","9783319122809"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12280-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}