{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T09:35:02Z","timestamp":1769852102232,"version":"3.49.0"},"publisher-location":"Cham","reference-count":23,"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_10","type":"book-chapter","created":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T05:22:02Z","timestamp":1633929722000},"page":"149-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Physical ZKP for Connected Spanning Subgraph: Applications to Bridges Puzzle and Other Problems"],"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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1149-7046","authenticated-orcid":false,"given":"Toshiya","family":"Itoh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,11]]},"reference":[{"issue":"9","key":"10_CR1","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":"10_CR2","unstructured":"Bultel, X., Dreier, J., Dumas, J.-G., Lafourcade, P.: Physical zero-knowledge proofs for Akari, Takuzu, Kakuro and KenKen. In: Proceedings of the 8th International Conference on Fun with Algorithms (FUN), pp. 8:1\u20138:20 (2016)"},{"key":"10_CR3","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., 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"},{"key":"10_CR4","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":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-030-26176-4_14","volume-title":"Computing and Combinatorics","author":"J-G Dumas","year":"2019","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"},{"key":"10_CR6","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co, San Francisco (1979)"},{"issue":"3","key":"10_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":"10_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":"2","key":"10_CR9","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)","journal-title":"Theory Comput. Syst."},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Hashimoto, Y., Shinagawa, K., Nuida, K., Inamura, M., Hanaoka, G.: Secure grouping protocol using a deck of cards. IEICE Trans. Fund. Electron. Commun. Comput. Sci. 101.A(9), 1512\u20131524 (2018)","DOI":"10.1587\/transfun.E101.A.1512"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Ibaraki, T., Manabe, Y.: A more efficient card-based protocol for generating a random permutation without fixed points. In: Proceedings of the 3rd International Conference on Mathematics and Computers in Sciences and Industry (MCSI), pp. 252\u2013257 (2016)","DOI":"10.1109\/MCSI.2016.054"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-030-34339-2_8","volume-title":"Information Security Practice and Experience","author":"P Lafourcade","year":"2019","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"},{"key":"10_CR13","unstructured":"Miyahara, D., et al.: Card-based ZKP protocols for Takuzu and Juosan. In: Proceedings of the 10th International Conference on Fun with Algorithms (FUN), pp. 20:1\u201320:21 (2020)"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Miyahara, D., Sasaki, T., Mizuki, T., Sone, H.: Card-based physical zero-knowledge proof for Kakuro. IEICE Trans. Fund. Electron. Commun. Comput. Sci. E102.A(9), 1072\u20131078 (2019)","DOI":"10.1587\/transfun.E102.A.1072"},{"key":"10_CR15","unstructured":"Nikoli: Hashiwokakero. https:\/\/www.nikoli.co.jp\/en\/puzzles\/hashiwokakero.html"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Robert, L., Miyahara, D., Lafourcade, P., Mizuki, T.: Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori. In: Proceedings of the 17th Conference on Computability in Europe (CiE), pp. 373\u2013384 (2021)","DOI":"10.1007\/978-3-030-80049-9_37"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-030-64348-5_19","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"L Robert","year":"2020","unstructured":"Robert, L., Miyahara, D., Lafourcade, P., Mizuki, T.: Physical zero-knowledge proof for Suguru puzzle. In: Devismes, S., Mittal, N. (eds.) SSS 2020. LNCS, vol. 12514, pp. 235\u2013247. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64348-5_19"},{"issue":"1","key":"10_CR18","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":"10_CR19","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":"10_CR20","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. Theoret. Comput. Sci. 839, 135\u2013142 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"10_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":"10_CR22","doi-asserted-by":"crossref","unstructured":"Shinagawa, K., et al.: Card-based protocols using regular polygon cards. IEICE Trans. Fund. Electron. Commun. Comput. Sci. E100.A(9), 1900\u20131909 (2017)","DOI":"10.1587\/transfun.E100.A.1900"},{"issue":"4","key":"10_CR23","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s10207-019-00463-w","volume":"19","author":"I Ueda","year":"2019","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 (2019). https:\/\/doi.org\/10.1007\/s10207-019-00463-w","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-030-87993-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T05:42:59Z","timestamp":1633930979000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87993-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030879921","9783030879938"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87993-8_10","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"}}]}}