{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T00:08:38Z","timestamp":1778458118575,"version":"3.51.4"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032200259","type":"print"},{"value":"9783032200266","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-20026-6_2","type":"book-chapter","created":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T23:27:05Z","timestamp":1778455625000},"page":"23-39","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Counterfeit Coin Problem Can be Extended to\u00a0Secure Multiparty Computation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-7641-1839","authenticated-orcid":false,"given":"Shohei","family":"Kaneko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0219-5289","authenticated-orcid":false,"given":"Yang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4414-815X","authenticated-orcid":false,"given":"Kazuo","family":"Sakiyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5818-8937","authenticated-orcid":false,"given":"Daiki","family":"Miyahara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,1]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Abe, Y., Iwamoto, M., Ohta, K.: Efficient private PEZ protocols for symmetric functions. In: Hofheinz, D., Rosen, A. (eds.) Theory of Cryptography. LNCS, vol. 11891, pp. 372\u2013392. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_15","DOI":"10.1007\/978-3-030-36030-6_15"},{"issue":"1","key":"2_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0304-3975(03)00210-X","volume":"306","author":"J Balogh","year":"2003","unstructured":"Balogh, J., Csirik, J.A., Ishai, Y., Kushilevitz, E.: Private computation using a PEZ dispenser. Theor. Comput. Sci. 306(1), 69\u201384 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(03)00210-X","journal-title":"Theor. Comput. Sci."},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn. Wiley-Interscience, Hoboken (2006). https:\/\/doi.org\/10.1002\/047174882X","DOI":"10.1002\/047174882X"},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Cr\u00e9peau, C., Kilian, J.: Discreet solitary games. In: Stinson, D.R. (ed.) Advances in Cryptology\u2014CRYPTO\u2019 93. LNCS, vol.\u00a0773, pp. 319\u2013330. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_27","DOI":"10.1007\/3-540-48329-2_27"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Den\u00a0Boer, B.: More efficient match-making and satisfiability the five card trick. In: Quisquater, J.J., Vandewalle, J. (eds.) Advances in Cryptology\u2014EUROCRYPT \u201989. LNCS, vol.\u00a0434, pp. 208\u2013217. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-46885-4_23","DOI":"10.1007\/3-540-46885-4_23"},{"issue":"291","key":"2_CR6","doi-asserted-by":"publisher","first-page":"231","DOI":"10.2307\/3611225","volume":"30","author":"FJ Dyson","year":"1946","unstructured":"Dyson, F.J.: The problem of the pennies. Math. Gaz. 30(291), 231\u2013234 (1946). https:\/\/doi.org\/10.2307\/3611225","journal-title":"Math. Gaz."},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"397","DOI":"10.2307\/2304649","volume":"52","author":"ED Schell","year":"1945","unstructured":"Schell, E.D.: Problem e651-weighed and found wanting. Amer. Math. Monthly 52, 397 (1945). https:\/\/doi.org\/10.2307\/2304649","journal-title":"Amer. Math. Monthly"},{"issue":"2","key":"2_CR8","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s00224-008-9119-9","volume":"44","author":"R Gradwohl","year":"2009","unstructured":"Gradwohl, R., Naor, M., Pinkas, B., Rothblum, G.N.: Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles. Theory Comput. Syst. 44(2), 245\u2013268 (2009). https:\/\/doi.org\/10.1007\/s00224-008-9119-9","journal-title":"Theory Comput. Syst."},{"key":"2_CR9","doi-asserted-by":"publisher","unstructured":"Hanaoka, G.: Towards user-friendly cryptography. In: Phan, R.C.W., Yung, M. (eds.) Paradigms in Cryptology\u2013Mycrypt 2016. Malicious and Exploratory Cryptology. LNCS, vol. 10311, pp. 481\u2013484. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61273-7_24","DOI":"10.1007\/978-3-319-61273-7_24"},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Kaneko, S., Lafourcade, P., Mallordy, L.B., Miyahara, D., Puys, M., Sakiyama, K.: Balance-based ZKP protocols for pencil-and-paper puzzles. In: Mouha, N., Nikiforakis, N. (eds.) Information Security. LNCS, vol. 15257, pp. 211\u2013231. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-75757-0_11","DOI":"10.1007\/978-3-031-75757-0_11"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Kaneko, S., Lafourcade, P., Mallordy, L., Miyahara, D., Puys, M., Sakiyama, K.: Secure voting protocol using balance scale. In: Adi, K., Bourdeau, S., Durand, C., Tong, V.V.T., Dulipovici, A., Kermarrec, Y., Garc\u00eda-Alfaro, J. (eds.) Foundations and Practice of Security. LNCS, vol. 15532, pp. 365\u2013376. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-87499-4_24","DOI":"10.1007\/978-3-031-87499-4_24"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Kastner, J., et al.: The minimum number of cards in practical card-based protocols. In: Takagi, T., Peyrin, T. (eds.) Advances in Cryptology\u2014ASIACRYPT 2017. LNCS, vol. 10626, pp. 126\u2013155. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_5","DOI":"10.1007\/978-3-319-70700-6_5"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Koch, A., Schrempp, M., Kirsten, M.: Card-based cryptography meets formal verification. In: Galbraith, S.D., Moriai, S. (eds.) Advances in Cryptology\u2013ASIACRYPT 2019. LNCS, vol. 11921, pp. 488\u2013517. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_18","DOI":"10.1007\/978-3-030-34578-5_18"},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Koch, A., Walzer, S., H\u00e4rtel, K.: Card-based cryptographic protocols using a minimal number of cards. In: Iwata, T., Cheon, J.H. (eds.) Advances in Cryptology\u2014ASIACRYPT 2015. LNCS, vol.\u00a09452, pp. 783\u2013807. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_32","DOI":"10.1007\/978-3-662-48797-6_32"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1007\/s10207-022-00585-8","volume":"21","author":"Y Komano","year":"2022","unstructured":"Komano, Y., Mizuki, T.: Coin-based secure computations. Int. J. Inf. Secur. 21, 833\u2013846 (2022). https:\/\/doi.org\/10.1007\/s10207-022-00585-8","journal-title":"Int. J. Inf. Secur."},{"key":"2_CR16","unstructured":"Marcedone, A., Wen, Z., Shi, E.: Secure dating with four or fewer cards. Cryptology ePrint Archive, Report 2015\/1031 (2015). https:\/\/eprint.iacr.org\/2015\/1031"},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Miyahara, D., Komano, Y., Mizuki, T., Sone, H.: Cooking cryptographers: secure multiparty computation based on balls and bags. In: IEEE Computer Security Foundations Symposium. pp. 1\u201316. IEEE (2021). https:\/\/doi.org\/10.1109\/CSF51468.2021.00034","DOI":"10.1109\/CSF51468.2021.00034"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s10207-020-00525-4","volume":"20","author":"D Miyahara","year":"2021","unstructured":"Miyahara, D., Ueda, I., Hayashi, Y., Mizuki, T., Sone, H.: Evaluating card-based protocols in terms of execution time. Int. J. Inf. Secur. 20, 729\u2013740 (2021). https:\/\/doi.org\/10.1007\/s10207-020-00525-4","journal-title":"Int. J. Inf. Secur."},{"key":"2_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2022.104910","volume":"285","author":"T Mizuki","year":"2022","unstructured":"Mizuki, T., Komano, Y.: Information leakage due to operative errors in card-based protocols. Inf. Comput. 285, 104910 (2022). https:\/\/doi.org\/10.1016\/j.ic.2022.104910","journal-title":"Inf. Comput."},{"key":"2_CR20","doi-asserted-by":"publisher","unstructured":"Mizuki, T., Kumamoto, M., Sone, H.: The five-card trick can be done with four cards. In: Wang, X., Sako, K. (eds.) Advances in Cryptology\u2014ASIACRYPT 2012. LNCS, vol.\u00a07658, pp. 598\u2013606. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_36","DOI":"10.1007\/978-3-642-34961-4_36"},{"issue":"1","key":"2_CR21","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10207-013-0219-4","volume":"13","author":"T Mizuki","year":"2014","unstructured":"Mizuki, T., Shizuya, H.: A formalization of card-based cryptographic protocols via abstract machine. Int. J. Inf. Secur. 13(1), 15\u201323 (2014). https:\/\/doi.org\/10.1007\/s10207-013-0219-4","journal-title":"Int. J. Inf. Secur."},{"key":"2_CR22","doi-asserted-by":"publisher","unstructured":"Mizuki, T., Sone, H.: Six-card secure AND and four-card secure XOR. In: Deng, X., Hopcroft, J.E., Xue, J. (eds.) Frontiers in Algorithmics. LNCS, vol.\u00a05598, pp. 358\u2013369. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02270-8_36","DOI":"10.1007\/978-3-642-02270-8_36"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Murata, S., Miyahara, D., Mizuki, T., Sone, H.: Public-PEZ cryptography. In: Susilo, W., Deng, R.H., Guo, F., Li, Y., Intan, R. (eds.) Information Security. LNCS, vol. 12472, pp. 59\u201374. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62974-8_4","DOI":"10.1007\/978-3-030-62974-8_4"},{"key":"2_CR24","unstructured":"Pass, R., Shelat, A.: A course in cryptography (2010). www.cs.cornell.edu\/~rafael\/"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Ruangwises, S.: Balance-based cryptography: physically computing any Boolean function. In: Unconventional Computation and Natural Computation. LNCS. Springer, Heidelberg (2025)","DOI":"10.1007\/978-3-032-15641-9_5"},{"key":"2_CR26","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.tcs.2020.05.036","volume":"839","author":"T Sasaki","year":"2020","unstructured":"Sasaki, T., Miyahara, D., Mizuki, T., Sone, H.: Efficient card-based zero-knowledge proof for Sudoku. Theor. Comput. Sci. 839, 135\u2013142 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2020.05.036","journal-title":"Theor. Comput. Sci."},{"key":"2_CR27","doi-asserted-by":"publisher","unstructured":"Shinagawa, K., Nuida, K.: Card-based protocols imply PSM protocols. In: Beyersdorff, O., Pilipczuk, M., Pimentel, E., Th\u00e0ng, N.K. (eds.) Theoretical Aspects of Computer Science. LIPIcs, vol.\u00a0327, pp. 72:1\u201372:18. Schloss Dagstuhl, Dagstuhl (2025). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2025.72","DOI":"10.4230\/LIPIcs.STACS.2025.72"},{"issue":"1\u20132","key":"2_CR28","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/S0304-3975(00)00409-6","volume":"259","author":"A Stiglic","year":"2001","unstructured":"Stiglic, A.: Computations with a deck of cards. Theor. Comput. Sci. 259(1\u20132), 671\u2013678 (2001). https:\/\/doi.org\/10.1016\/S0304-3975(00)00409-6","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"2_CR29","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s10207-019-00463-w","volume":"19","author":"I Ueda","year":"2020","unstructured":"Ueda, I., Miyahara, D., Nishimura, A., Hayashi, Y., Mizuki, T., Sone, H.: Secure implementations of a random bisection cut. Int. J. Inf. Secur. 19(4), 445\u2013452 (2020). https:\/\/doi.org\/10.1007\/s10207-019-00463-w","journal-title":"Int. J. Inf. Secur."}],"container-title":["Lecture Notes in Computer Science","Foundations and Practice of Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-20026-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T23:27:06Z","timestamp":1778455626000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-20026-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032200259","9783032200266"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-20026-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"FPS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Foundations and Practice of Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brest","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fps2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/hub.imt-atlantique.fr\/fps2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}