{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T10:42:19Z","timestamp":1779360139747,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":33,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819628445","type":"print"},{"value":"9789819628452","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-2845-2_20","type":"book-chapter","created":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T16:00:22Z","timestamp":1740067222000},"page":"312-325","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["NP-Completeness and\u00a0Physical Zero-Knowledge Proofs for\u00a0Zeiger"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2820-1301","authenticated-orcid":false,"given":"Suthee","family":"Ruangwises","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,21]]},"reference":[{"issue":"3","key":"20_CR1","first-page":"239","volume":"23","author":"A Adcock","year":"2015","unstructured":"Adcock, A., et al.: Zig-Zag numberlink is NP-complete. J. Inf. Process. 23(3), 239\u2013245 (2015)","journal-title":"J. Inf. Process."},{"issue":"9","key":"20_CR2","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1016\/j.ipl.2009.07.017","volume":"109","author":"D Andersson","year":"2009","unstructured":"Andersson, D.: Hashiwokakero is NP-complete. Inf. Process. Lett. 109(9), 1145\u20131146 (2009)","journal-title":"Inf. Process. Lett."},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-540-72914-3_5","volume-title":"Fun with Algorithms","author":"D Andersson","year":"2007","unstructured":"Andersson, D.: HIROIMONO is NP-complete. In: Crescenzi, P., Prencipe, G., Pucci, G. (eds.) FUN 2007. LNCS, vol. 4475, pp. 30\u201339. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72914-3_5"},{"key":"20_CR4","unstructured":"App Store: Number Pointers. https:\/\/apps.apple.com\/us\/app\/number-pointers\/id1065321061"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-030-03232-6_8","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"X Bultel","year":"2018","unstructured":"Bultel, X., Dreier, J., Dumas, J.-G., Lafourcade, P., Miyahara, D., Mizuki, T., Nagao, A., Sasaki, T., Shinagawa, K., Sone, H.: 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"},{"issue":"3","key":"20_CR6","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s00354-024-00268-z","volume":"42","author":"A Doi","year":"2024","unstructured":"Doi, A., et al.: Card-based protocols for private set intersection and union. N. Gener. Comput. 42(3), 359\u2013380 (2024)","journal-title":"N. Gener. Comput."},{"issue":"3","key":"20_CR7","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. J. ACM 38(3), 691\u2013729 (1991)","journal-title":"J. ACM"},{"issue":"1","key":"20_CR8","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"20_CR9","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s00354-024-00267-0","volume":"42","author":"K Hatsugai","year":"2024","unstructured":"Hatsugai, K., Ruangwises, S., Asano, K., Abe, Y.: NP-completeness and physical zero-knowledge proofs for sumplete, a puzzle generated by ChatGPT. N. Gener. Comput. 42(3), 429\u2013448 (2024)","journal-title":"N. Gener. Comput."},{"key":"20_CR10","unstructured":"Holzer, M., Klein, A., Kutrib, M.: On the NP-completeness of the nurikabe pencil puzzle and variants thereof. In: Proceedings of the 3rd International Conference on Fun with Algorithms (FUN), pp. 77\u201389 (2004)"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Holzer, M., Ruepp, O.: The troubles of interior design-a complexity analysis of the game heyawake. In: Proceedings of the 4th International Conference on Fun with Algorithms (FUN), pp. 198\u2013212 (2007)","DOI":"10.1007\/978-3-540-72914-3_18"},{"key":"20_CR12","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":"20_CR13","unstructured":"Iwamoto, C., Haruishi, M.,, Ibusuki, T.: Herugolf and Makaro are NP-complete. In: Proceedings of the 9th International Conference on Fun with Algorithms (FUN), pp. 24:1\u201324:11 (2018)"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Iwamoto, C., Ide, T.: Five cells and tilepaint are NP-complete. IEICE Trans. Inf. Syst. 105.D(3), 508\u2013516 (2022)","DOI":"10.1587\/transinf.2021FCP0001"},{"key":"20_CR15","unstructured":"Janko, A., Janko, O.: Zeiger (Logikr\u00e4tsel). https:\/\/www.janko.at\/Raetsel\/Zeiger\/index.htm"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.tcs.2021.07.019","volume":"888","author":"P Lafourcade","year":"2021","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\u2019\u2019 condition. Theor. Comput. Sci. 888, 41\u201355 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Miyahara, D., Sasaki, T., Mizuki, T., Sone, H.: Card-based physical zero-knowledge proof for kakuro. IEICE Trans. Fundamentals E102.A(9), 1072\u20131078 (2019)","DOI":"10.1587\/transfun.E102.A.1072"},{"issue":"1","key":"20_CR18","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00354-022-00155-5","volume":"40","author":"L Robert","year":"2022","unstructured":"Robert, L., Miyahara, D., Lafourcade, P., Mizuki, T.: Card-based ZKP for connectivity: applications to nurikabe, hitori, and heyawake. N. Gener. Comput. 40(1), 149\u2013171 (2022)","journal-title":"N. Gener. Comput."},{"issue":"5","key":"20_CR19","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/s10878-023-01050-5","volume":"45","author":"S Ruangwises","year":"2023","unstructured":"Ruangwises, S.: An improved physical ZKP for nonogram and nonogram color. J. Comb. Optim. 45(5), 122 (2023)","journal-title":"J. Comb. Optim."},{"key":"20_CR20","unstructured":"Ruangwises, S.: Nondango is NP-complete. In: Proceedings of the 40th European Workshop on Computational Geometry (EuroCG), pp. 1:1\u20131:10 (2024)"},{"issue":"4","key":"20_CR21","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10878-024-01170-6","volume":"47","author":"S Ruangwises","year":"2024","unstructured":"Ruangwises, S.: Verifying the first nonzero term: physical ZKPs for ABC end view, goishi hiroi, and toichika. J. Comb. Optim. 47(4), 69 (2024)","journal-title":"J. Comb. Optim."},{"key":"20_CR22","unstructured":"Ruangwises, S., Itoh, T.: How to physically verify a rectangle in a grid: a physical ZKP for Shikaku. In: Proceedings of the 11th International Conference on Fun with Algorithms (FUN), pp. 24:1\u201324:12 (2022)"},{"issue":"1","key":"20_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00354-020-00114-y","volume":"39","author":"S Ruangwises","year":"2021","unstructured":"Ruangwises, S., Itoh, T.: Physical zero-knowledge proof for numberlink puzzle and $$k$$ vertex-disjoint paths problem. N. Gener. Comput. 39(1), 3\u201317 (2021)","journal-title":"N. Gener. Comput."},{"key":"20_CR24","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2021.09.034","volume":"895","author":"S Ruangwises","year":"2021","unstructured":"Ruangwises, S., Itoh, T.: Physical zero-knowledge proof for ripple effect. Theor. Comput. Sci. 895, 115\u2013123 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR25","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. Theor. Comput. Sci. 887, 99\u2013110 (2021)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"20_CR26","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s00354-024-00266-1","volume":"42","author":"S Ruangwises","year":"2024","unstructured":"Ruangwises, S., Iwamoto, M.: Printing protocol: physical ZKPs for decomposition puzzles. N. Gener. Comput. 42(3), 331\u2013343 (2024)","journal-title":"N. Gener. Comput."},{"key":"20_CR27","doi-asserted-by":"crossref","unstructured":"Ruangwises, S., Ono, T., Abe, Y., Hatsugai, K., Iwamoto, M.: Card-based overwriting protocol for equality function and applications. In: Proceedings of the 21st International Conference on Unconventional Computation and Natural Computation (UCNC), pp. 18\u201327 (2024)","DOI":"10.1007\/978-3-031-63742-1_2"},{"key":"20_CR28","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)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR29","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing (STOC), pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"},{"key":"20_CR30","doi-asserted-by":"crossref","unstructured":"Shinagawa, K., et al.: Card-based protocols using regular polygon cards. IEICE Trans. Fund. E100.A(9), 1900\u20131909 (2017)","DOI":"10.1587\/transfun.E100.A.1900"},{"key":"20_CR31","first-page":"119","volume":"216","author":"Y Takenaga","year":"2013","unstructured":"Takenaga, Y., Aoyagi, S., Iwata, S., Kasai, T.: Shikaku and ripple effect are NP-complete. Congr. Numer. 216, 119\u2013127 (2013)","journal-title":"Congr. Numer."},{"key":"20_CR32","unstructured":"Ueda, N., Nagao, T.: NP-completeness Results for NONOGRAM via Parsimonious Reductions. Technical Report TR96-0008, Department of Computer Science, Tokyo Institute of Technology (1996)"},{"key":"20_CR33","unstructured":"Yato, T., Seta, T.: Complexity and completeness of finding another solution and its application to puzzles. IEICE Trans. Fund. 86.A(5), 1052\u20131060 (2003)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-2845-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T16:00:29Z","timestamp":1740067229000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-2845-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819628445","9789819628452"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-2845-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"21 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"27 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/walcom2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}