{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:17:14Z","timestamp":1772893034048,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031203497","type":"print"},{"value":"9783031203503","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-20350-3_5","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"43-54","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Physical ZKP for\u00a0Makaro Using a\u00a0Standard Deck of\u00a0Cards"],"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":[[2023,1,1]]},"reference":[{"key":"5_CR1","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":"5_CR2","doi-asserted-by":"crossref","unstructured":"Bultel, X., et al.: Physical zero-knowledge proof for Makaro. In: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), pp. 111\u2013125 (2018)","DOI":"10.1007\/978-3-030-03232-6_8"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Dumas, J.-G., Lafourcade, P., Miyahara, D., Mizuki, T., Sasaki, T., Sone, H.: Interactive physical zero-knowledge proof for Norinori. In: Proceedings of the 25th International Computing and Combinatorics Conference (COCOON), pp. 166\u2013177 (2019)","DOI":"10.1007\/978-3-030-26176-4_14"},{"issue":"1","key":"5_CR4","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":"5_CR5","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":"5_CR6","doi-asserted-by":"crossref","unstructured":"Ishikawa, R., Chida, E., Mizuki, T.: Efficient card-based protocols for generating a hidden random permutation without fixed points. In: Proceedings of the 14th International Conference on Unconventional Computation and Natural Computation (UCNC), pp. 215\u2013226 (2015)","DOI":"10.1007\/978-3-319-21819-9_16"},{"key":"5_CR7","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)"},{"issue":"1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00354-020-00120-0","volume":"39","author":"A Koch","year":"2021","unstructured":"Koch, A., Schrempp, M., Kirsten, M.: Card-based cryptography meets formal verification. N. Gener. Comput. 39(1), 115\u2013158 (2021)","journal-title":"N. Gener. Comput."},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Koyama, H., Miyahara, D., Mizuki, T., Sone, H.: A secure three-input AND protocol with a standard deck of minimal cards. In: Proceedings of the 16th International Computer Science Symposium in Russia (CSR), pp. 242\u2013256 (2021)","DOI":"10.1007\/978-3-030-79416-3_14"},{"key":"5_CR10","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. Theoret. Comput. Sci. 888, 41\u201355 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.tcs.2019.11.005","volume":"803","author":"D Miyahara","year":"2020","unstructured":"Miyahara, D., Hayashi, Y., Mizuki, T., Sone, H.: Practical card-based implementations of Yao\u2019s millionaire protocol. Theoret. Comput. Sci. 803, 207\u2013221 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR12","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":"5_CR13","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. E102.A(9), 1072\u20131078 (2019)","DOI":"10.1587\/transfun.E102.A.1072"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Mizuki, T.: Efficient and secure multiparty computations using a standard deck of playing cards. In: Proceedings of the 15th International Conference on Cryptology and Network Security (CANS), pp. 484\u2013499 (2016)","DOI":"10.1007\/978-3-319-48965-0_29"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Niemi, V., Renvall, A.: Solitaire zero-knowledge. Fundamenta Informaticae 38(1,2), 181\u2013188 (1999)","DOI":"10.3233\/FI-1999-381214"},{"key":"5_CR16","unstructured":"Nikoli: Makaro. https:\/\/www.nikoli.co.jp\/en\/puzzles\/makaro\/"},{"issue":"1","key":"5_CR17","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."},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Robert, L., Miyahara, D., Lafourcade, P., Libralesso, L., Mizuki, T.: Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle. Inf. Comput. 285(B), 104858 (2022)","DOI":"10.1016\/j.ic.2021.104858"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Ruangwises, S.: An improved physical ZKP for nonogram. In: Proceedings of the 15th Annual International Conference on Combinatorial Optimization and Applications (COCOA), pp. 262\u2013272 (2021)","DOI":"10.1007\/978-3-030-92681-6_22"},{"issue":"1","key":"5_CR20","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00354-021-00146-y","volume":"40","author":"S Ruangwises","year":"2022","unstructured":"Ruangwises, S.: Two standard decks of playing cards are sufficient for a ZKP for sudoku. N. Gener. Comput. 40(1), 49\u201365 (2022)","journal-title":"N. Gener. Comput."},{"key":"5_CR21","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":"5_CR22","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":"5_CR23","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. Theoret. Comput. Sci. 895, 115\u2013123 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Ruangwises, S., Itoh, T.: Physical ZKP for connected spanning subgraph: applications to bridges puzzle and other problems. In: Proceedings of the 19th International Conference on Unconventional Computation and Natural Computation (UCNC), pp. 149\u2013163 (2021)","DOI":"10.1007\/978-3-030-87993-8_10"},{"key":"5_CR25","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":"5_CR26","doi-asserted-by":"crossref","unstructured":"Shinagawa, K., Mizuki, T.: Secure computation of any boolean function based on any deck of cards. In: Proceedings of the 13th International Frontiers of Algorithmics Workshop (FAW), pp. 63\u201375 (2019)","DOI":"10.1007\/978-3-030-18126-0_6"},{"key":"5_CR27","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)","DOI":"10.1587\/transfun.E100.A.1900"},{"issue":"4","key":"5_CR28","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","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20350-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:21:24Z","timestamp":1672550484000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20350-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031203497","9783031203503"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20350-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lxy.tjut.edu.cn\/TAMC2022.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}