{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T06:04:57Z","timestamp":1780293897716,"version":"3.54.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T00:00:00Z","timestamp":1780099200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T00:00:00Z","timestamp":1780099200000},"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\/501100001695","name":"Japan Science and Technology Corporation","doi-asserted-by":"publisher","award":["JPMJCR22M1"],"award-info":[{"award-number":["JPMJCR22M1"]}],"id":[{"id":"10.13039\/501100001695","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2026,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Secure computation with penalties aims to achieve fairness in secure computation protocols by imposing monetary penalties on adversarial parties. A fundamental problem in constructing protocols that involves monetary entities is how to formalize them in a computational model. Bentov and Kumaresan (CRYPTO 2014) introduced a new computational model with special atomic entities called coins that capture currency and showed a protocol for secure computation with penalties in the model. Their model, secure computation with coins, assumes coins have several properties that are natural in the sense of expressing currency. However, on the other hand, it also requires the unnatural assumption \u201call coins are indistinguishable from each other\" for a technical reason to accomplish the security proof. The motivation of this work is to remove this assumption to make the model a more general. We propose a new model, secure computation with color coins, such that coins have identifiable colors and do not hold the indistinguishability property. Furthermore, our model allows us to set different prices for each color. We show that secure computation with penalties can be realized in our model. To do this, we make some modifications to the ideal functionality of secure computation with penalties to adapt it to our model without losing the essence, i.e., fairness with penalties.<\/jats:p>","DOI":"10.1007\/s00224-026-10280-z","type":"journal-article","created":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T05:59:09Z","timestamp":1780293549000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Formalization of Financial Transactions in Secure Computation: How to Handle Coins with Various Colors"],"prefix":"10.1007","volume":"70","author":[{"given":"Takeshi","family":"Nakai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,30]]},"reference":[{"key":"10280_CR1","doi-asserted-by":"crossref","unstructured":"Alper, H.K., K\u00fcp\u00e7\u00fc, A.: Optimally efficient multi-party fair exchange and fair secure multi-party computation. ACM Trans. Priv. Secur. 25(1), (2021)","DOI":"10.1145\/3477530"},{"key":"10280_CR2","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, pp. 105\u2013121. Springer Berlin Heidelberg (2014)","DOI":"10.1007\/978-3-662-44774-1_8"},{"key":"10280_CR3","doi-asserted-by":"crossref","unstructured":"Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, L.: Secure multiparty computations on bitcoin. In: 2014 IEEE Symposium on Security and Privacy, pp. 443\u2013458 (2014)","DOI":"10.1109\/SP.2014.35"},{"key":"10280_CR4","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, pp. 199\u2013228. Springer Berlin Heidelberg (2015)","DOI":"10.1007\/978-3-662-46494-6_10"},{"key":"10280_CR5","doi-asserted-by":"crossref","unstructured":"Asharov, G., Lindell, Y., Rabin, T.: A full characterization of functions that imply fair coin tossing and ramifications to fairness. In: Theory of Cryptography, pp. 243\u2013262, Berlin, Heidelberg. Springer Berlin Heidelberg (2013)","DOI":"10.1007\/978-3-642-36594-2_14"},{"key":"10280_CR6","doi-asserted-by":"crossref","unstructured":"Asokan, N., Schunter, M., Waidner, M.: Optimistic protocols for fair exchange. In: Proceedings of the 4th ACM Conference on Computer and Communications Security, CCS \u201997, pp. 7\u201317. ACM (1997)","DOI":"10.1145\/266420.266426"},{"key":"10280_CR7","doi-asserted-by":"crossref","unstructured":"Avizheh, S., Safavi-Naini, R.: Fair private set intersection using smart contracts. In: Applied Cryptography and Network Security, pp. 74\u2013104. Springer Nature Switzerland (2024)","DOI":"10.1007\/978-3-031-54776-8_4"},{"key":"10280_CR8","doi-asserted-by":"crossref","unstructured":"Bartoletti, M., Zunino, R.: Constant-deposit multiparty lotteries on bitcoin. In: Financial Cryptography and Data Security, pp. 231\u2013247. Springer International Publishing (2017)","DOI":"10.1007\/978-3-319-70278-0_15"},{"key":"10280_CR9","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, pp. 404\u2013420. Springer-Verlag (2020)","DOI":"10.1007\/978-3-030-51280-4_22"},{"key":"10280_CR10","doi-asserted-by":"crossref","unstructured":"Beaver, D., Goldwasser, S.: Multiparty computation with faulty majority. In: 30th Annual Symposium on Foundations of Computer Science, pp. 468\u2013473 (1989)","DOI":"10.1109\/SFCS.1989.63520"},{"key":"10280_CR11","doi-asserted-by":"crossref","unstructured":"Bentov, I., Kumaresan, R.: How to use bitcoin to design fair protocols. In: Advances in Cryptology \u2013 CRYPTO 2014, pp. 421\u2013439. Springer Berlin Heidelberg (2014)","DOI":"10.1007\/978-3-662-44381-1_24"},{"key":"10280_CR12","doi-asserted-by":"crossref","unstructured":"Bentov, I., Kumaresan, R.: How to use bitcoin to design fair protocols. Cryptology ePrint Archive, Report 2014\/129 (2014)","DOI":"10.1007\/978-3-662-44381-1_24"},{"key":"10280_CR13","doi-asserted-by":"crossref","unstructured":"Bentov, I., Kumaresan, R., Miller, A.: Instantaneous decentralized poker. In: Advances in Cryptology \u2013 ASIACRYPT 2017, pp. 410\u2013440. Springer International Publishing (2017)","DOI":"10.1007\/978-3-319-70697-9_15"},{"key":"10280_CR14","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security. J. ACM 67(5), (2020)","DOI":"10.1145\/3402457"},{"key":"10280_CR15","doi-asserted-by":"crossref","unstructured":"Canetti, R., Rabin, T.: Universal composition with joint state. In Advances in Cryptology - CRYPTO 2003, pp. 265\u2013281, Berlin, Heidelberg. Springer Berlin Heidelberg (2003)","DOI":"10.1007\/978-3-540-45146-4_16"},{"key":"10280_CR16","doi-asserted-by":"crossref","unstructured":"Choudhuri, A.R., Green, M., Jain, A., Kaptchuk, G., Miers, I.: Fairness in an unfair world: Fair multiparty computation from public bulletin boards. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201917, pp. 719\u2013728. ACM (2017)","DOI":"10.1145\/3133956.3134092"},{"key":"10280_CR17","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, pp. 364\u2013369. ACM (1986)","DOI":"10.1145\/12130.12168"},{"key":"10280_CR18","doi-asserted-by":"crossref","unstructured":"David, B., Dowsley, R., Larangeira, M.: Kaleidoscope: An efficient poker protocol with payment distribution and penalty enforcement. In: Financial Cryptography and Data Security, pp. 500\u2013519. Springer Berlin Heidelberg (2018)","DOI":"10.1007\/978-3-662-58387-6_27"},{"key":"10280_CR19","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Eckey, L., Faust, S.: Fairswap: How to fairly exchange digital goods. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201918, pp. 967\u2013984. ACM (2018)","DOI":"10.1145\/3243734.3243857"},{"key":"10280_CR20","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Eckey, L., Faust, S., Malinowski, D.: Perun: Virtual payment hubs over cryptocurrencies. In: 2019 IEEE Symposium on Security and Privacy (SP), pp. 106\u2013123 (2019)","DOI":"10.1109\/SP.2019.00020"},{"key":"10280_CR21","unstructured":"Wood, G., et\u00a0al.: Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper (2019)"},{"key":"10280_CR22","doi-asserted-by":"crossref","unstructured":"Garay, J.A., Katz, J., Kumaresan, R., Zhou, H.-S.: Adaptively secure broadcast, revisited. In: Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC \u201911, pp. 179\u2013186. ACM (2011)","DOI":"10.1145\/1993806.1993832"},{"key":"10280_CR23","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Levin, L.: Fair computation of general functions in presence of immoral majority. In Advances in Cryptology-CRYPTO\u2019 90, pp. 77\u201393. Springer Berlin Heidelberg (1991)","DOI":"10.1007\/3-540-38424-3_6"},{"key":"10280_CR24","doi-asserted-by":"crossref","unstructured":"Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation. J. ACM 58(6), (2011)","DOI":"10.1145\/2049697.2049698"},{"key":"10280_CR25","doi-asserted-by":"crossref","unstructured":"Gordon, S.D., Ishai, Y., Moran, T., Ostrovsky, R., Sahai, A.: On complete primitives for fairness. In: Theory of Cryptography, pp. 91\u2013108. Springer Berlin Heidelberg (2010)","DOI":"10.1007\/978-3-642-11799-2_7"},{"key":"10280_CR26","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer \u2013 efficiently. In: Advances in Cryptology \u2013 CRYPTO 2008, pp. 572\u2013591. Springer Berlin Heidelberg (2008)","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"10280_CR27","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Zhou, H.-S., Zikas, V.: Fair and robust multi-party computation using a global transaction ledger. In: Proceedings of the 35th Annual International Conference on Advances in Cryptology, volume 9666 of EUROCRYPT 2016, pp. 705\u2013734. Springer-Verlag (2016)","DOI":"10.1007\/978-3-662-49896-5_25"},{"key":"10280_CR28","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, pp. 20\u201331. ACM (1988)","DOI":"10.1145\/62212.62215"},{"key":"10280_CR29","doi-asserted-by":"crossref","unstructured":"Kumaresan, R., Bentov, I.: Amortizing secure computation with penalties. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201916, pp. 418\u2013429. ACM (2016)","DOI":"10.1145\/2976749.2978424"},{"key":"10280_CR30","doi-asserted-by":"crossref","unstructured":"Kumaresan, R., Moran, T., Bentov, I.: How to use bitcoin to play decentralized poker. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, CCS \u201915, pp. 195\u2013206. ACM (2015)","DOI":"10.1145\/2810103.2813712"},{"key":"10280_CR31","doi-asserted-by":"crossref","unstructured":"Kumaresan, R., Vaikuntanathan, V., Vasudevan, P.N.: Improvements to secure computation with penalties. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201916, pp. 406\u2013417. ACM (2016)","DOI":"10.1145\/2976749.2978421"},{"key":"10280_CR32","doi-asserted-by":"crossref","unstructured":"Lindell, Y.: Legally-enforceable fairness in secure two-party computation. In: Topics in Cryptology \u2013 CT-RSA 2008, pp. 121\u2013137. Springer Berlin Heidelberg (2008)","DOI":"10.1007\/978-3-540-79263-5_8"},{"key":"10280_CR33","volume-title":"Secure protocols with invisible trusted parties","author":"S Micali","year":"1998","unstructured":"Micali, S.: Secure protocols with invisible trusted parties. Weizmann Inst. of Science, In Workshop for Multi-Party Secure Protocols (1998)"},{"key":"10280_CR34","doi-asserted-by":"crossref","unstructured":"Miller, A., Bentov, I.: Zero-collateral lotteries in bitcoin and ethereum. In: 2017 IEEE European Symposium on Security and Privacy Workshops, pp. 4\u201313 (2017)","DOI":"10.1109\/EuroSPW.2017.44"},{"key":"10280_CR35","doi-asserted-by":"crossref","unstructured":"Nakai, T.: Secure computation with penalties, revisited: How to handle coins with various colors. In: Topics in Cryptology \u2013 CT-RSA 2025, pp. 351\u2013374. Springer Nature Switzerland (2025)","DOI":"10.1007\/978-3-031-88661-4_15"},{"key":"10280_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.113874","volume":"959","author":"T Nakai","year":"2023","unstructured":"Nakai, T., Shinagawa, K.: Constant-round linear-broadcast secure computation with penalties. Theoret. Comput. Sci. 959, 113874 (2023)","journal-title":"Theoret. Comput. Sci."},{"key":"10280_CR37","doi-asserted-by":"publisher","first-page":"3609","DOI":"10.1007\/s10207-024-00898-w","volume":"23","author":"T Nakai","year":"2024","unstructured":"Nakai, T., Shinagawa, K.: Secure multi-party computation with legally-enforceable fairness. Int. J. Inf. Secur. 23, 3609\u20133623 (2024)","journal-title":"Int. J. Inf. Secur."},{"key":"10280_CR38","unstructured":"Nakamoto, S.: Bitcoin: A peer-to-peer electronic cash system. Decentralized business review (2008)"},{"key":"10280_CR39","doi-asserted-by":"crossref","unstructured":"Uchizono, S., Nakai, T., Watanabe, Y., Iwamoto, M.: Constant-deposit multiparty lotteries on bitcoin for arbitrary number of players and winners. In: Information Security and Cryptology \u2013 ICISC 2023, pp. 133\u2013156, Singapore (2024). Springer Nature Singapore","DOI":"10.1007\/978-981-97-1238-0_8"},{"key":"10280_CR40","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-026-10280-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-026-10280-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-026-10280-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T05:59:17Z","timestamp":1780293557000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-026-10280-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,30]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["10280"],"URL":"https:\/\/doi.org\/10.1007\/s00224-026-10280-z","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,30]]},"assertion":[{"value":"9 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"37"}}