{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T19:34:28Z","timestamp":1767987268834,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T00:00:00Z","timestamp":1724889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T00:00:00Z","timestamp":1724889600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP23K16880"],"award-info":[{"award-number":["JP23K16880"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP21K17702"],"award-info":[{"award-number":["JP21K17702"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","award":["JPMJCR22M1"],"award-info":[{"award-number":["JPMJCR22M1"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","award":["JPMJCR22M1"],"award-info":[{"award-number":["JPMJCR22M1"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2024,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Fairness is a security notion of secure computation and cannot always be achieved if an adversary corrupts a majority of parties in standard settings. Lindell (CT-RSA 2008) showed that imposing a monetary penalty on an adversary can circumvent the impossibility. He formalized such a security notion as \u201clegally enforceable fairness\" for the <jats:italic>two-party<\/jats:italic> setting based on the ideal trusted bank functionality and showed a protocol achieving the requirements. Based on the same framework, we introduce secure <jats:italic>multi-party<\/jats:italic> computation with legally enforceable fairness that is applicable for an arbitrary number of parties. Further, we propose two protocols that realize our introduced functionality. The first one achieves <jats:italic>O<\/jats:italic>(<jats:italic>n<\/jats:italic>) rounds and <jats:inline-formula><jats:alternatives><jats:tex-math>$$O(n \\alpha )$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>O<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mi>n<\/mml:mi>\n                    <mml:mi>\u03b1<\/mml:mi>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> fees, where <jats:italic>n<\/jats:italic> is the number of parties, and <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\alpha $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03b1<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> is a parameter for the penalty amount. The fee refers to the balance amount in the bank required at the beginning of the protocol, which evaluates the difficulty of participating in the protocol in a financial sense. The second one achieves <jats:italic>O<\/jats:italic>(1) rounds and <jats:inline-formula><jats:alternatives><jats:tex-math>$$O(n^2 \\alpha )$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>O<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:msup>\n                      <mml:mi>n<\/mml:mi>\n                      <mml:mn>2<\/mml:mn>\n                    <\/mml:msup>\n                    <mml:mi>\u03b1<\/mml:mi>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> fees.<\/jats:p>","DOI":"10.1007\/s10207-024-00898-w","type":"journal-article","created":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T18:02:49Z","timestamp":1724954569000},"page":"3609-3623","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Secure multi-party computation with legally-enforceable fairness"],"prefix":"10.1007","volume":"23","author":[{"given":"Takeshi","family":"Nakai","sequence":"first","affiliation":[]},{"given":"Kazumasa","family":"Shinagawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,29]]},"reference":[{"key":"898_CR1","doi-asserted-by":"crossref","unstructured":"Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, \u0141.: Fair two-party computations via bitcoin deposits. In: Financial Cryptography and Data Security. 105\u2013121. Springer, Berlin Heidelberg (2014)","DOI":"10.1007\/978-3-662-44774-1_8"},{"key":"898_CR2","doi-asserted-by":"crossref","unstructured":"Asharov, G., Beimel, A., Makriyannis, N., Omri, E.: Complete characterization of fairness in secure two-party computation of boolean functions. In: Theory of Cryptography. 199\u2013228. Springer, Berlin Heidelberg (2015)","DOI":"10.1007\/978-3-662-46494-6_10"},{"key":"898_CR3","doi-asserted-by":"crossref","unstructured":"Asokan, N.,\u00a0Schunter, M., Waidner M.: Optimistic protocols for fair exchange. In Proceedings of the 4th ACM Conference on Computer and Communications Security, CCS \u201997, 7-17. Association for Computing Machinery, (1997)","DOI":"10.1145\/266420.266426"},{"key":"898_CR4","doi-asserted-by":"crossref","unstructured":"Bartoletti, M., Zunino, R.: Constant-deposit multiparty lotteries on bitcoin. In Financial Cryptography and Data Security, 231\u2013247. Springer International Publishing, (2017)","DOI":"10.1007\/978-3-319-70278-0_15"},{"key":"898_CR5","doi-asserted-by":"crossref","unstructured":"Baum, C., David, B., Dowsley, R.: Insured mpc: Efficient secure computation with financial penalties. In Financial Cryptography and Data Security: 24th International Conference, FC 2020, 404-420. Springer-Verlag, (2020)","DOI":"10.1007\/978-3-030-51280-4_22"},{"key":"898_CR6","doi-asserted-by":"crossref","unstructured":"Beaver, D., Goldwasser, S.: Multiparty computation with faulty majority. In 30th Annual Symposium on Foundations of Computer Science, 468\u2013473, (1989)","DOI":"10.1109\/SFCS.1989.63520"},{"key":"898_CR7","doi-asserted-by":"crossref","unstructured":"Bentov, I.,\u00a0Kumaresan, R.: How to use bitcoin to design fair protocols. In Advances in Cryptology \u2013 CRYPTO 2014, 421\u2013439. Springer Berlin Heidelberg, (2014)","DOI":"10.1007\/978-3-662-44381-1_24"},{"key":"898_CR8","doi-asserted-by":"crossref","unstructured":"Bentov, I.,\u00a0Kumaresan, R.,\u00a0Miller, A.: Instantaneous decentralized poker. In Advances in Cryptology \u2013 ASIACRYPT 2017, 410\u2013440. Springer International Publishing, (2017)","DOI":"10.1007\/978-3-319-70697-9_15"},{"key":"898_CR9","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable signature, certification, and authentication. In Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004., 219\u2013233 (2004)","DOI":"10.1109\/CSFW.2004.1310743"},{"key":"898_CR10","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty. In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, STOC \u201986, 364-369. Association for Computing Machinery, (1986)","DOI":"10.1145\/12130.12168"},{"key":"898_CR11","doi-asserted-by":"crossref","unstructured":"David, B.,\u00a0Dowsley, R.,\u00a0Larangeira, M.: Kaleidoscope: An efficient poker protocol with payment distribution and penalty enforcement. In Financial Cryptography and Data Security, 500\u2013519. Springer Berlin Heidelberg, (2018)","DOI":"10.1007\/978-3-662-58387-6_27"},{"key":"898_CR12","doi-asserted-by":"crossref","unstructured":"Faust, S.,\u00a0Hazay, C.,\u00a0Kretzler, D.,\u00a0Schlosser, B.: Financially backed covert security. In Public-Key Cryptography - PKC 2022 - 25th IACR International Conference on Practice and Theory of Public-Key Cryptography, Virtual Event, Proceedings, Part II, of Lecture Notes in Computer Science, 13178 99\u2013129. Springer, (2022)","DOI":"10.1007\/978-3-030-97131-1_4"},{"key":"898_CR13","doi-asserted-by":"publisher","first-page":"3391","DOI":"10.1109\/TIFS.2022.3198852","volume":"17","author":"D Friolo","year":"2022","unstructured":"Friolo, D., Massacci, F., Ngo, C.N., Venturi, D.: Cryptographic and financial fairness. IEEE Trans. Inform. Foren. Secur. 17, 3391\u20133406 (2022)","journal-title":"IEEE Trans. Inform. Foren. Secur."},{"key":"898_CR14","doi-asserted-by":"crossref","unstructured":"Goldreich, O.,\u00a0Micali, S.,\u00a0Wigderson, A.: How to play any mental game. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC \u201987, 218-229. Association for Computing Machinery, (1987)","DOI":"10.1145\/28395.28420"},{"key":"898_CR15","doi-asserted-by":"crossref","unstructured":"Goldwasser, S.,\u00a0Levin, L.: Fair computation of general functions in presence of immoral majority. In Advances in Cryptology-CRYPTO\u2019 90, 77\u201393. Springer Berlin Heidelberg, (1991)","DOI":"10.1007\/3-540-38424-3_6"},{"issue":"6","key":"898_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2049697.2049698","volume":"58","author":"SD Gordon","year":"2011","unstructured":"Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation. J. ACM 58(6), 1\u201337 (2011)","journal-title":"J. ACM"},{"key":"898_CR17","doi-asserted-by":"crossref","unstructured":"Ishai, Y.,\u00a0Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer \u2013 efficiently. In Advances in Cryptology \u2013 CRYPTO 2008, 572\u2013591. Springer Berlin Heidelberg, (2008)","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"898_CR18","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Zhou, H.-S.,\u00a0Zikas,V.: Fair and robust multi-party computation using a global transaction ledger. In Proceedings, Part II, of the 35th Annual International Conference on Advances in Cryptology \u2014 EUROCRYPT 2016 - 9666, 705-734. Springer-Verlag, (2016)","DOI":"10.1007\/978-3-662-49896-5_25"},{"key":"898_CR19","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding crytpography on oblivious transfer. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC \u201988, 20-31. Association for Computing Machinery, (1988)","DOI":"10.1145\/62212.62215"},{"key":"898_CR20","doi-asserted-by":"crossref","unstructured":"Kumaresan, R.,\u00a0Bentov, I.: Amortizing secure computation with penalties. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201916, 418-429. Association for Computing Machinery, (2016)","DOI":"10.1145\/2976749.2978424"},{"key":"898_CR21","doi-asserted-by":"crossref","unstructured":"Kumaresan, R.\u00a0Moran, T.,\u00a0Bentov, I.: How to use bitcoin to play decentralized poker. In Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, CCS \u201915, 195-206. Association for Computing Machinery, (2015)","DOI":"10.1145\/2810103.2813712"},{"key":"898_CR22","doi-asserted-by":"crossref","unstructured":"Kumaresan, R.,\u00a0Vaikuntanathan, V., Vasudevan, P.\u00a0N.: Improvements to secure computation with penalties. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201916, 406-417. Association for Computing Machinery, (2016)","DOI":"10.1145\/2976749.2978421"},{"key":"898_CR23","doi-asserted-by":"crossref","unstructured":"Lindell, A.\u00a0Y.: Legally-enforceable fairness in secure two-party computation. In Topics in Cryptology \u2013 CT-RSA 2008, 121\u2013137. Springer Berlin Heidelberg, (2008)","DOI":"10.1007\/978-3-540-79263-5_8"},{"key":"898_CR24","unstructured":"Micali, S.: Secure protocols with invisible trusted parties. Weizmann Inst. of Science, In Workshop for Multi-Party Secure Protocols (1998)"},{"key":"898_CR25","unstructured":"Nakai, T.,\u00a0Shinagawa, K.: Secure Computation with Non-Equivalent Penalties in Constant Rounds. In 3rd International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2021), volume\u00a097 of Open Access Series in Informatics (OASIcs), 5:1\u20135:16. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, (2022)"},{"key":"898_CR26","doi-asserted-by":"crossref","unstructured":"Nakai, T., Shinagawa, K.: Constant-round linear-broadcast secure computation with penalties. Theor. Comput. Sci. 959, 113874 (2023)","DOI":"10.1016\/j.tcs.2023.113874"},{"key":"898_CR27","doi-asserted-by":"crossref","unstructured":"Nakai, T.,\u00a0Shinagawa, K.: Secure multi-party computation with legally-enforceable fairness. In Information and Communications Security, 161\u2013178. Springer Nature Singapore, (2023)","DOI":"10.1007\/978-981-99-7356-9_10"},{"key":"898_CR28","unstructured":"Nakamoto, S.: Bitcoin: A peer-to-peer electronic cash system. Cryptography Mailing list at https:\/\/metzdowd.com, 03 (2009)"},{"key":"898_CR29","doi-asserted-by":"crossref","unstructured":"Uchizono, S.,\u00a0Nakai, T.,\u00a0Watanabe, Y.,\u00a0Iwamoto, M.: Constant-deposit multiparty lotteries on bitcoin for arbitrary number of players and winners. In Information Security and Cryptology \u2013 ICISC 2023, 133\u2013156. Singapore, Springer Nature Singapore (2024)","DOI":"10.1007\/978-981-97-1238-0_8"},{"key":"898_CR30","doi-asserted-by":"crossref","unstructured":"Yao, A.\u00a0C.: Protocols for secure computations. In Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 160\u2013164, (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"898_CR31","doi-asserted-by":"crossref","unstructured":"Zhu, R. Ding,C., Huang, Y.: Efficient publicly verifiable 2pc over a blockchain with applications to financially-secure computations. In Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201919, 633-650. Association for Computing Machinery, (2019)","DOI":"10.1145\/3319535.3363215"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-024-00898-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10207-024-00898-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-024-00898-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T01:08:27Z","timestamp":1728695307000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10207-024-00898-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,29]]},"references-count":31,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["898"],"URL":"https:\/\/doi.org\/10.1007\/s10207-024-00898-w","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,29]]},"assertion":[{"value":"29 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}}]}}