{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:34:09Z","timestamp":1760243649467,"version":"build-2065373602"},"reference-count":27,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Engineering Research and Development for Technology (ERDT) program of the Department of Science and Technology (DOST)"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>We propose cryptographic rational secret sharing protocols over general networks. In a general network, the dealer may not have direct connections to each player, and players may not have direct connections to each of the other players. We present conditions on the network topology for which our proposed protocols are computational strict Nash equilibria and (k\u22121)-resilient, along with analysis on their round and communication complexity. We also present new notions of equilibria such as \u03a6-resilient computational Nash equilibria, whereby a protocol is resilient to coalitions that satisfy conditions in \u03a6, regardless of the coalition\u2019s size. We also propose (n\u22121)-key leakage-tolerant equilibria applicable to cryptographic protocols involving secret keys, whereby the equilibrium holds even if some players acquire (n\u22121) tuples of secret keys.<\/jats:p>","DOI":"10.3390\/cryptography6040050","type":"journal-article","created":{"date-parts":[[2022,10,8]],"date-time":"2022-10-08T01:52:21Z","timestamp":1665193941000},"page":"50","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cryptographic Rational Secret Sharing Schemes over General Networks"],"prefix":"10.3390","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5321-377X","authenticated-orcid":false,"given":"Alfonso","family":"Labao","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of the Philippines Diliman, Quezon City 1101, Philippines"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5513-4039","authenticated-orcid":false,"given":"Henry","family":"Adorna","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of the Philippines Diliman, Quezon City 1101, Philippines"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,10,1]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","author":"Shamir","year":"1979","journal-title":"Commun. ACM"},{"key":"ref_2","unstructured":"Boneh, D., and Shoup, V. (2022, June 18). A Graduate Course in Applied Cryptography. Available online: https:\/\/crypto.stanford.edu\/~dabo\/cryptobook\/BonehShoup_0_4.pdf."},{"key":"ref_3","unstructured":"Beimel, A. (June, January 30). Secret-sharing schemes: A survey. Proceedings of the International Conference on Coding and Cryptology, Qingdao, China."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Iwamura, K., and Kamal, A.A.A.M. (2021). Secure computation by secret sharing using input encrypted with random number (full paper). Cryptol. ePrint Arch.","DOI":"10.5220\/0010552300002998"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Cramer, R., and Damg\u00e5rd, I.B. (2015). Secure Multiparty Computation, Cambridge University Press.","DOI":"10.1017\/CBO9781107337756"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., and Maurer, U. (2000, January 14\u201318). General secure multi-party computation from any linear secret-sharing scheme. Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques, Bruges, Belgium.","DOI":"10.1007\/3-540-45539-6_22"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1016\/j.dam.2005.03.020","article-title":"Secure multi-party computation made simple","volume":"154","author":"Maurer","year":"2006","journal-title":"Discret. Appl. Math."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Fuchsbauer, G., Katz, J., and Naccache, D. (2010, January 9\u201311). Efficient rational secret sharing in standard communication networks. Proceedings of the Theory of Cryptography Conference, Zurich, Switzerland.","DOI":"10.1007\/978-3-642-11799-2_25"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Halpern, J., and Teague, V. (2004, January 13\u201315). Rational secret sharing and multiparty computation. Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, Chicago, IL, USA.","DOI":"10.1145\/1007352.1007447"},{"key":"ref_10","unstructured":"Fudenberg, D., and Tirole, J. (1991). Game Theory, MIT Press."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Maschler, M., Solan, E., and Shmuel, Z. (2013). Game Theory, Cambridge University Press.","DOI":"10.1017\/CBO9780511794216"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Gordon, S.D., and Katz, J. (2006, January 14\u201316). Rational secret sharing, revisited. Proceedings of the International Conference on Security and Cryptography for Networks, Amalfi, Italy.","DOI":"10.1007\/11832072_16"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s00145-010-9064-z","article-title":"Utility dependence in correct and fair rational secret sharing","volume":"24","author":"Asharov","year":"2011","journal-title":"J. Cryptol."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Dodis, Y., and Rabin, T. (2007). Cryptography and game theory. Algorithmic Game Theory, Cambridge University Press.","DOI":"10.1017\/CBO9780511800481.010"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D., Gonen, R., and Halpern, J. (2006, January 23\u201326). Distributed computing meets game theory: Robust mechanisms for rational secret sharing and multiparty computation. Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, Denver, CO, USA.","DOI":"10.1145\/1146381.1146393"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"022305","DOI":"10.1103\/PhysRevA.92.022305","article-title":"Proposal for quantum rational secret sharing","volume":"92","author":"Maitra","year":"2015","journal-title":"Phys. Rev. A"},{"key":"ref_17","unstructured":"Maleka, S., Shareef, A., and Rangan, C.P. (2008, January 21\u201323). Rational secret sharing with repeated games. Proceedings of the International Conference on Information Security Practice and Experience, Sydney, Australia."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Dani, V., Movahedi, M., Rodriguez, Y., and Saia, J. (2011, January 6\u20138). Scalable rational secret sharing. Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, San Jose, CA, USA.","DOI":"10.1145\/1993806.1993833"},{"key":"ref_19","unstructured":"Nojoumian, M., and Stinson, D.R. (2022, January 26\u201328). Socio-rational secret sharing as a new direction in rational cryptography. Proceedings of the International Conference on Decision and Game Theory for Security, Pittsburgh, PA, USA."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Kol, G., and Naor, M. (2008, January 17\u201320). Games for exchanging information. Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, Victoria, BC, Canada.","DOI":"10.1145\/1374376.1374437"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Lehtinen, K., and Zimmermann, M. (2020, January 8\u201311). Good-for-games \u03c9-pushdown automata. Proceedings of the 35th Annual ACM\/IEEE Symposium on Logic in Computer Science, Saarbrucken, Germany.","DOI":"10.1145\/3373718.3394737"},{"key":"ref_22","unstructured":"Micali, S., Rabin, M., and Vadhan, S. (1999, January 17\u201319). Verifiable random functions. Proceedings of the 40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039), New York, NY, USA."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Dodis, Y. (2003). Efficient construction of (distributed) verifiable random functions. International Workshop on Public Key Cryptography, Springer.","DOI":"10.1007\/3-540-36288-6_1"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/138027.138036","article-title":"Perfectly secure message transmission","volume":"40","author":"Dolev","year":"1993","journal-title":"J. ACM"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Shah, N.B., Rashmi, K., and Ramchandran, K. (2013, January 7\u201312). Secure network coding for distributed secret sharing with low communication cost. Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey.","DOI":"10.1109\/ISIT.2013.6620657"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1206","DOI":"10.1109\/JSTSP.2015.2422682","article-title":"Distributed secret dissemination across a network","volume":"9","author":"Shah","year":"2015","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"van Leeuwen, J., and Wiedermann, J. (2001). The Turing machine paradigm in contemporary computing. Mathematics Unlimited\u20142001 and Beyond, Springer.","DOI":"10.1007\/978-3-642-56478-9_59"}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/6\/4\/50\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:45:21Z","timestamp":1760143521000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/6\/4\/50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,1]]},"references-count":27,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2022,12]]}},"alternative-id":["cryptography6040050"],"URL":"https:\/\/doi.org\/10.3390\/cryptography6040050","relation":{},"ISSN":["2410-387X"],"issn-type":[{"type":"electronic","value":"2410-387X"}],"subject":[],"published":{"date-parts":[[2022,10,1]]}}}