{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:17:17Z","timestamp":1772893037420,"version":"3.50.1"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030879921","type":"print"},{"value":"9783030879938","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-87993-8_4","type":"book-chapter","created":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T05:22:02Z","timestamp":1633929722000},"page":"51-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Zero-Knowledge Proof Protocol for\u00a0Cryptarithmetic Using Dihedral Cards"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4326-1019","authenticated-orcid":false,"given":"Raimu","family":"Isuzugawa","sequence":"first","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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8698-1043","authenticated-orcid":false,"given":"Takaaki","family":"Mizuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,11]]},"reference":[{"key":"4_CR1","unstructured":"Bultel, X., Dreier, J., Dumas, J.G., Lafourcade, P.: Physical zero-knowledge proofs for Akari, Takuzu, Kakuro and KenKen. In: Demaine, E.D., Grandoni, F. (eds.) Fun with Algorithms. Leibniz International Proceedings in Informatics (LIPIcs), vol. 49, pp. 8:1\u20138:20. Schloss Dagstuhl, Dagstuhl (2016). https:\/\/doi.org\/10.4230\/LIPIcs.FUN.2016.8"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Bultel, X., et al.: Physical zero-knowledge proof for Makaro. In: Izumi, T., Kuznetsov, P. (eds.) SSS 2018. LNCS, vol. 11201, pp. 111\u2013125. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03232-6_8","DOI":"10.1007\/978-3-030-03232-6_8"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-13122-6_12","volume-title":"Fun with Algorithms","author":"Y-F Chien","year":"2010","unstructured":"Chien, Y.-F., Hon, W.-K.: Cryptographic and physical zero-knowledge proof: From sudoku to Nonogram. In: Boldi, P., Gargano, L. (eds.) FUN 2010. LNCS, vol. 6099, pp. 102\u2013112. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13122-6_12"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Dumas, J.-G., Lafourcade, P., Miyahara, D., Mizuki, T., Sasaki, T., Sone, H.: Interactive physical zero-knowledge proof for Norinori. In: Du, D.-Z., Duan, Z., Tian, C. (eds.) COCOON 2019. LNCS, vol. 11653, pp. 166\u2013177. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26176-4_14","DOI":"10.1007\/978-3-030-26176-4_14"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Epstein, D.: On the NP-completeness of cryptarithms. ACM SIGACT News 18(3), 38\u201340 (1987). https:\/\/doi.org\/10.1145\/24658.24662","DOI":"10.1145\/24658.24662"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186\u2013208 (1989). https:\/\/doi.org\/10.1137\/0218012","DOI":"10.1137\/0218012"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-540-72914-3_16","volume-title":"Fun with Algorithms","author":"R Gradwohl","year":"2007","unstructured":"Gradwohl, R., Naor, M., Pinkas, B., Rothblum, G.N.: Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles. In: Crescenzi, P., Prencipe, G., Pucci, G. (eds.) FUN 2007. LNCS, vol. 4475, pp. 166\u2013182. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72914-3_16"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Gradwohl, R., Naor, M., Pinkas, B., Rothblum, G.N.: Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles. Theor. Comput. Syst. 44(2), 245\u2013268 (2009). https:\/\/doi.org\/10.1007\/s00224-008-9119-9","DOI":"10.1007\/s00224-008-9119-9"},{"key":"4_CR9","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"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Lafourcade, P., Miyahara, D., Mizuki, T., Robert, L., Sasaki, T., Sone, H.: How to construct physical zero-knowledge proofs for puzzles with a \u201csingle loop\" condition. Theor. Comput. Sci. (2021, in press). https:\/\/doi.org\/10.1016\/j.tcs.2021.07.019","DOI":"10.1016\/j.tcs.2021.07.019"},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Lafourcade, P., Miyahara, D., Mizuki, T., Sasaki, T., Sone, H.: A physical ZKP for Slitherlink: How to perform physical topology-preserving computation. In: Heng, S.-H., Lopez, J. (eds.) ISPEC 2019. LNCS, vol. 11879, pp. 135\u2013151. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34339-2_8","DOI":"10.1007\/978-3-030-34339-2_8"},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"Manabe, Y., Ono, H.: Card-based cryptographic protocols for three-input functions using private operations. In: Flocchini, P., Moura, L. (eds.) IWOCA 2021. LNCS, vol. 12757, pp. 469\u2013484. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79987-8_33","DOI":"10.1007\/978-3-030-79987-8_33"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Minhaz, A., Singh, A.V.: Solution of a classical cryptarithmetic problem by using parallel genetic algorithm. In: Reliability, Infocom Technologies and Optimization, pp. 1\u20135. IEEE (2014). https:\/\/doi.org\/10.1109\/ICRITO.2014.7014715","DOI":"10.1109\/ICRITO.2014.7014715"},{"key":"4_CR14","unstructured":"Miyahara, D., et al.: Card-based ZKP protocols for Takuzu and Juosan. In: Farach-Colton, M., Prencipe, G., Uehara, R. (eds.) Fun with Algorithms. Leibniz International Proceedings in Informatics (LIPIcs), vol. 157, pp. 20:1\u201320:21. Schloss Dagstuhl, Dagstuhl (2020). https:\/\/doi.org\/10.4230\/LIPIcs.FUN.2021.20"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Miyahara, D., Sasaki, T., Mizuki, T., Sone, H.: Card-based physical zero-knowledge proof for Kakuro. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102(9), 1072\u20131078 (2019). https:\/\/doi.org\/10.1587\/transfun.E102.A.1072","DOI":"10.1587\/transfun.E102.A.1072"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"Miyahara, D., Ueda, I., Hayashi, Y., Mizuki, T., Sone, H.: Analyzing execution time of card-based protocols. In: Stepney, S., Verlan, S. (eds.) UCNC 2018. LNCS, vol. 10867, pp. 145\u2013158. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-92435-9_11","DOI":"10.1007\/978-3-319-92435-9_11"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-642-39074-6_16","volume-title":"Unconventional Computation and Natural Computation","author":"T Mizuki","year":"2013","unstructured":"Mizuki, T., Asiedu, I.K., Sone, H.: Voting with a logarithmic number of cards. In: Mauri, G., Dennunzio, A., Manzoni, L., Porreca, A.E. (eds.) UCNC 2013. LNCS, vol. 7956, pp. 162\u2013173. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39074-6_16"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Nakai, T., Misawa, Y., Tokushige, Y., Iwamoto, M., Ohta, K.: How to solve millionaires\u2019 problem with two kinds of cards. New Gener. Comput. 39(1), 73\u201396 (2021). https:\/\/doi.org\/10.1007\/s00354-020-00118-8","DOI":"10.1007\/s00354-020-00118-8"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-319-94812-6_24","volume-title":"Implementation and Application of Automata","author":"Y Nozaki","year":"2018","unstructured":"Nozaki, Y., Hendrian, D., Yoshinaka, R., Shinohara, A.: Enumeration of cryptarithms using deterministic finite automata. In: C\u00e2mpeanu, C. (ed.) CIAA 2018. LNCS, vol. 10977, pp. 286\u2013298. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94812-6_24"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Ono, H., Manabe, Y.: Card-based cryptographic logical computations using private operations. New Gener. Comput. 39(1), 19\u201340 (2021). https:\/\/doi.org\/10.1007\/s00354-020-00113-z","DOI":"10.1007\/s00354-020-00113-z"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Robert, L., Miyahara, D., Lafourcade, P., Mizuki, T.: Interactive physical ZKP for connectivity: Applications to Nurikabe and Hitori. In: De Mol, L., Weiermann, A., Manea, F., Fern\u00e1ndez-Duque, D. (eds.) Connecting with Computability. LNCS, vol. 12813, pp. 373\u2013384. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-80049-9_37","DOI":"10.1007\/978-3-030-80049-9_37"},{"key":"4_CR22","unstructured":"Ruangwises, S.: An improved physical ZKP for Nonogram (2021). https:\/\/arxiv.org\/abs\/2106.14020"},{"key":"4_CR23","unstructured":"Ruangwises, S.: Two standard decks of playing cards are sufficient for a ZKP for Sudoku (2021). https:\/\/arxiv.org\/abs\/2106.13646"},{"key":"4_CR24","unstructured":"Ruangwises, S., Itoh, T.: Physical zero-knowledge proof for Numberlink. In: Farach-Colton, M., Prencipe, G., Uehara, R. (eds.) Fun with Algorithms. Leibniz International Proceedings in Informatics (LIPIcs), vol. 157, pp. 22:1\u201322:11. Schloss Dagstuhl, Dagstuhl (2020). https:\/\/doi.org\/10.4230\/LIPIcs.FUN.2021.22"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Ruangwises, S., Itoh, T.: Physical zero-knowledge proof for Numberlink puzzle and k vertex-disjoint paths problem. New Gener. Comput. 39(1), 3\u201317 (2021). https:\/\/doi.org\/10.1007\/s00354-020-00114-y","DOI":"10.1007\/s00354-020-00114-y"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-030-68211-8_24","volume-title":"WALCOM: Algorithms and Computation","author":"S Ruangwises","year":"2021","unstructured":"Ruangwises, S., Itoh, T.: Physical zero-knowledge proof for Ripple Effect. In: Uehara, R., Hong, S.-H., Nandy, S.C. (eds.) WALCOM 2021. LNCS, vol. 12635, pp. 296\u2013307. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-68211-8_24"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Ruangwises, S., Itoh, T.: Physical ZKP for connected spanning subgraph: applications to Bridges Puzzle and other problems. In: Unconventional Computation and Natural Computation. LNCS, Springer, Cham (2021, to appear)","DOI":"10.1007\/978-3-030-87993-8_10"},{"key":"4_CR28","doi-asserted-by":"crossref","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","DOI":"10.1016\/j.tcs.2020.05.036"},{"key":"4_CR29","unstructured":"Sasaki, T., Mizuki, T., Sone, H.: Card-based zero-knowledge proof for Sudoku. In: Ito, H., Leonardi, S., Pagli, L., Prencipe, G. (eds.) Fun with Algorithms. Leibniz International Proceedings in Informatics (LIPIcs), vol. 100, pp. 29:1\u201329:10. Schloss Dagstuhl, Dagstuhl (2018). https:\/\/doi.org\/10.4230\/LIPIcs.FUN.2018.29"},{"key":"4_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-030-14812-6_35","volume-title":"Theory and Applications of Models of Computation","author":"K Shinagawa","year":"2019","unstructured":"Shinagawa, K.: Card-based cryptography with invisible ink. In: Gopal, T.V., Watada, J. (eds.) TAMC 2019. LNCS, vol. 11436, pp. 566\u2013577. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-14812-6_35"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Shinagawa, K.: Card-based cryptography with dihedral symmetry. New Gener. Comput. 39(1), 41\u201371 (2021). https:\/\/doi.org\/10.1007\/s00354-020-00117-9","DOI":"10.1007\/s00354-020-00117-9"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Shinagawa, K., et al.: Card-based protocols using regular polygon cards. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E100.A(9), 1900\u20131909 (2017). https:\/\/doi.org\/10.1587\/transfun.E100.A.1900","DOI":"10.1587\/transfun.E100.A.1900"},{"key":"4_CR33","unstructured":"Tamura, N.: Cryptarithmetic puzzle solver. https:\/\/tamura70.gitlab.io\/web-puzzle\/cryptarithm\/. Accessed 21 Mar 2021"},{"key":"4_CR34","unstructured":"Torsten, S.: Alphametics and cryptarithms. https:\/\/www.math.uni-bielefeld.de\/~sillke\/PUZZLES\/ALPHAMETIC\/. Accessed 21 Mar 2021"},{"key":"4_CR35","unstructured":"Truman, C.: Alphametic puzzles. http:\/\/www.tkcs-collins.com\/truman\/alphamet\/alphamet.shtml, Accessed 21 Mar 2021"},{"key":"4_CR36","doi-asserted-by":"crossref","unstructured":"Yasunaga, K.: Practical card-based protocol for three-input majority. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E103.A(11), 1296\u20131298 (2020). https:\/\/doi.org\/10.1587\/transfun.2020EAL2025","DOI":"10.1587\/transfun.2020EAL2025"}],"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-030-87993-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T18:05:49Z","timestamp":1673460349000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87993-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030879921","9783030879938"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87993-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 October 2021","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":"Espoo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Finland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"uc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ucnc2021.cs.aalto.fi\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}