{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T11:41:18Z","timestamp":1778154078518,"version":"3.51.4"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031637414","type":"print"},{"value":"9783031637421","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-63742-1_2","type":"book-chapter","created":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T20:11:01Z","timestamp":1718655061000},"page":"18-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Card-Based Overwriting Protocol for\u00a0Equality Function and\u00a0Applications"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2820-1301","authenticated-orcid":false,"given":"Suthee","family":"Ruangwises","sequence":"first","affiliation":[]},{"given":"Tomoki","family":"Ono","sequence":"additional","affiliation":[]},{"given":"Yoshiki","family":"Abe","sequence":"additional","affiliation":[]},{"given":"Kyosuke","family":"Hatsugai","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1092-8489","authenticated-orcid":false,"given":"Mitsugu","family":"Iwamoto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,18]]},"reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s00354-020-00110-2","volume":"39","author":"Y Abe","year":"2021","unstructured":"Abe, Y., Hayashi, Y., Mizuki, T., Sone, H.: Five-Card AND computations in committed format using only uniform cyclic shuffles. N. Gener. Comput. 39(1), 97\u2013114 (2021)","journal-title":"N. Gener. Comput."},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/3-540-48329-2_27","volume-title":"Advances in Cryptology \u2014 CRYPTO 1993","author":"C Cr\u00e9peau","year":"1994","unstructured":"Cr\u00e9peau, C., Kilian, J.: Discreet solitary games. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 319\u2013330. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_27"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/3-540-46885-4_23","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1989","author":"B den Boer","year":"1990","unstructured":"den Boer, B.: More efficient match-making and satisfiability The Five Card Trick. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 208\u2013217. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-46885-4_23"},{"issue":"1","key":"2_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00165-013-0274-7","volume":"26","author":"J Heather","year":"2014","unstructured":"Heather, J., Schneider, S., Teague, V.: Cryptographic protocols with everyday objects. Formal Aspects Comput. 26(1), 37\u201362 (2014)","journal-title":"Formal Aspects Comput."},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-319-21819-9_16","volume-title":"Unconventional Computation and Natural Computation","author":"R Ishikawa","year":"2015","unstructured":"Ishikawa, R., Chida, E., Mizuki, T.: Efficient card-based protocols for generating a hidden random permutation without fixed points. In: Calude, C.S., Dinneen, M.J. (eds.) UCNC 2015. LNCS, vol. 9252, pp. 215\u2013226. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21819-9_16"},{"issue":"2","key":"2_CR6","first-page":"115","volume":"1","author":"A Koch","year":"2021","unstructured":"Koch, A.: The landscape of optimal card-based protocols. Math. Cryptol. 1(2), 115\u2013131 (2021)","journal-title":"Math. Cryptol."},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1007\/978-3-662-48797-6_32","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"A Koch","year":"2015","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.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 783\u2013807. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_32"},{"issue":"4","key":"2_CR8","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(4), 833\u2013846 (2022)","journal-title":"Int. J. Inf. Secur."},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Mizuki, T., Asiedu, I.K., Sone, H.: Voting with a logarithmic number of cards. In: Proceedings of the 12th International Conference on Unconventional Computation and Natural Computation (UCNC), pp. 162\u2013173 (2013)","DOI":"10.1007\/978-3-642-39074-6_16"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Mizuki, T., Kugimoto, Y., Sone, H.: Secure multiparty computations using a dial lock. In: Proceedings of the 4th Annual Conference on Theory and Applications of Models of Computation (TAMC), pp. 499\u2013510 (2007)","DOI":"10.1007\/978-3-540-72504-6_45"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/978-3-642-34961-4_36","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"T Mizuki","year":"2012","unstructured":"Mizuki, T., Kumamoto, M., Sone, H.: The five-card trick can be done with four cards. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 598\u2013606. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_36"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-642-02270-8_36","volume-title":"Frontiers in Algorithmics","author":"T Mizuki","year":"2009","unstructured":"Mizuki, T., Sone, H.: Six-card secure AND and four-card secure XOR. In: Deng, X., Hopcroft, J.E., Xue, J. (eds.) FAW 2009. LNCS, vol. 5598, pp. 358\u2013369. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02270-8_36"},{"key":"2_CR13","first-page":"279","volume":"36","author":"T Mizuki","year":"2006","unstructured":"Mizuki, T., Uchiike, F., Sone, H.: Securely computing XOR with 10 cards. Australas. J. Combin. 36, 279\u2013293 (2006)","journal-title":"Australas. J. Combin."},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0304-3975(97)00107-2","volume":"191","author":"V Niemi","year":"1998","unstructured":"Niemi, V., Renvall, A.: Secure multiparty computations without computers. Theoret. Comput. Sci. 191, 173\u2013183 (1998)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-319-17142-5_11","volume-title":"Theory and Applications of Models of Computation","author":"T Nishida","year":"2015","unstructured":"Nishida, T., Hayashi, Y., Mizuki, T., Sone, H.: Card-based protocols for any boolean function. In: Jain, R., Jain, S., Stephan, F. (eds.) TAMC 2015. LNCS, vol. 9076, pp. 110\u2013121. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-17142-5_11"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-642-45008-2_16","volume-title":"Theory and Practice of Natural Computing","author":"T Nishida","year":"2013","unstructured":"Nishida, T., Mizuki, T., Sone, H.: Securely computing the three-input majority function with eight cards. In: Dediu, A.-H., Mart\u00edn-Vide, C., Truthe, B., Vega-Rodr\u00edguez, M.A. (eds.) TPNC 2013. LNCS, vol. 8273, pp. 193\u2013204. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45008-2_16"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Ruangwises, S.: The landscape of computing symmetric $$n$$-variable functions with $$2n$$ cards. In: Proceedings of the 20th International Colloquium on Theoretical Aspects of Computing (ICTAC), pp. 74\u201382 (2023)","DOI":"10.1007\/978-3-031-47963-2_6"},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Ruangwises, S.: Using five cards to encode each integer in $$\\mathbb{Z}$$\/6$$\\mathbb{Z}$$. In: Ryan, P.Y., Toma, C. (eds.) Proceedings of the 14th International Conference on Security for Information Technology and Communications (SecITC), pp. 165\u2013177. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17510-7_12","DOI":"10.1007\/978-3-031-17510-7_12"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-030-19955-5_30","volume-title":"Computer Science \u2013 Theory and Applications","author":"S Ruangwises","year":"2019","unstructured":"Ruangwises, S., Itoh, T.: AND protocols using only uniform shuffles. In: van Bevern, R., Kucherov, G. (eds.) CSR 2019. LNCS, vol. 11532, pp. 349\u2013358. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19955-5_30"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.tcs.2021.07.007","volume":"887","author":"S Ruangwises","year":"2021","unstructured":"Ruangwises, S., Itoh, T.: Securely computing the $$n$$-variable equality function with $$2n$$ cards. Theoret. Comput. Sci. 887, 99\u2013110 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR21","unstructured":"Shinagawa, K., Mizuki, T.: Card-based protocols using triangle cards. In: Proceedings of the 9th International Conference on Fun with Algorithms (FUN), pp. 31:1\u201331:13 (2018)"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-030-12146-4_8","volume-title":"Information Security and Cryptology \u2013 ICISC 2018","author":"K Shinagawa","year":"2019","unstructured":"Shinagawa, K., Mizuki, T.: The six-card trick: secure computation of three-input equality. In: Lee, K. (ed.) ICISC 2018. LNCS, vol. 11396, pp. 123\u2013131. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12146-4_8"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Shinagawa, K., et al.: Card-based protocols using regular polygon cards. IEICE Trans. Fundamentals 100.A(9), 1900\u20131909 (2017)","DOI":"10.1587\/transfun.E100.A.1900"},{"key":"2_CR24","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. Theoret. Comput. Sci. 259, 671\u2013678 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/978-3-030-92518-5_24","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2021","author":"K Toyoda","year":"2021","unstructured":"Toyoda, K., Miyahara, D., Mizuki, T.: Another use of\u00a0the\u00a0five-card trick: card-minimal secure three-input majority function evaluation. In: Adhikari, A., K\u00fcsters, R., Preneel, B. (eds.) INDOCRYPT 2021. LNCS, vol. 13143, pp. 536\u2013555. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92518-5_24"},{"issue":"4","key":"2_CR26","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)","journal-title":"Int. J. Inf. Secur."}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation and Natural Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63742-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T20:11:54Z","timestamp":1718655114000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63742-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031637414","9783031637421"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63742-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"18 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"UCNC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Unconventional Computation and Natural Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pohang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"uc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/ucnc-2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}